Indexes are used to improve query performance. As a result, good indexes are designed around queries that users find important in their application. This talk presents 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 trees, or any other data structure used to store the data on disk. They are derived from these simple properties:
Zardosht has been a senior member of Tokutek’s TokuDB engineering team since 2008. Leveraging Fractal Tree Indexing, TokuDB is a high performance storage engine for MySQL that is designed for write-intensive workloads.
Prior to Tokutek, Zardosht worked as a software design engineer at Microsoft on remote terminal services. Zardosht holds B.S. and M.S. degrees in Computer Science from the Massachusetts Institute of Technology. While at MIT, he pursued research on cache-oblivious dynamic search trees under Bradley Kuszmaul at the Computer Science and Artificial Intelligence Laboratory.
For information on exhibition and sponsorship opportunities at the conference, contact Yvonne Romaine at firstname.lastname@example.org
For media partnerships, contact mediapartners@ oreilly.com
For media-related inquiries, contact Maureen Jennings at email@example.com
To stay abreast of conference news and to receive email notification when registration opens, please sign up for the O'Reilly MySQL Conference Bulletin (login required).
View a complete list of O'Reilly MySQL Conference Contacts