In short, indexes are used to improve query performance. As a result, good indexes are designed around queries that users find important in their application. The presentation covers three simple and effective rules on how to construct indexes around queries that result in good performance.
The rules are explained using a simple model that does NOT rely on understanding B-trees, Fractal Tree™ indexing, or any other data structure used to store the data on disk. They are derived from these simple properties:
- Point queries are slow
- Range queries are fast
As always, comments, questions and thoughts are welcome!