Returning random rows in a random order from a relational database is a very hard problem. In this article we will see an antipattern, we will discuss why this problem is so hard, and we’ll examine some imperfect solutions.
One of the trickiest problems in SQL is to query rows in tranches. This is typically needed in a website search, or in a dynamic catalogue where products appear as you scroll down. You want the DBMS to only return …
In July, London Open Source Databases group will see a meetup with Peter Zaitsev and one with Monty Widenius.
There are many non-obvious ways to return values from MySQL stored procedures, and each of them solves particular problems.
How to find useless indexes and get rid of them to improve your database performance.