Covering Indexes: Orders-of-Magnitude Improvements

Posted On May 14, 2009 | By Bradley C. Kuszmaul | 2 comments

The talk I gave at the Percona Performance Conference at the MySQL
Users Conference in April 2009 can be found here.

This talk provides some examples where covering indexes help, and
then describes a performance model that can be used to understand and
predict query performance. It covers clustering indexes (which are a
kind of “universal” covering index), and describes the asymptotic
performance of Fractal Tree indexing (but sorry, it doesn’t yet
explain how Fractal Tree indexes work.) We’re working on writing a
white paper to explain how they work, but we’ve simply been too
busy. The talk concludes with the graph (shown above) that
illustrates iiBench performance on RAID and SSD using TokuDB and

2 thoughts

  1. [...] we added an index to atable to make the inner join run faster. For TokuDB, we added a covering index comprising (id, off, len, name). For MyISAM, we added an index comprising (id, off, len), which [...]

  2. [...] to perform the first query, we would want a covering index of (customerid, price) on the table. To perform the third query, we would want a covering index of [...]

Leave a Reply

Your email address will not be published. Required fields are marked *