Understanding Indexing – SF MySQL Meetup

Understanding Indexing – SF MySQL Meetup


At this week’s SF MySQL Meetup, I will give a talk: “Understanding Indexing: Three rules on making indexes around queries to provide good performance.” The meetup is 7 pm tomorrow (Wednesday, 6/22), and will be held at CBS Interactive (235 2nd St., San Francisco). Thanks to hosts Erin O’Neill and Mike Tougeron for the invitation and location.

Application performance often depends on how fast a query can respond and query performance almost always depends on good indexing. So one of the quickest and least expensive ways to increase application performance is to optimize the indexes. This talk presents three simple and effective rules on how to construct indexes around queries that result in good performance.

This is a general discussion applicable to all databases using indexes and is not specific to any particular MySQL storage engine (e.g., InnoDB, TokuDB, etc.). 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.

The rules are derived from these simple properties:

  • Point queries are slow
  • Range queries are fast

I hope to see you there!


Share this post

Comment (1)

  • Gerald Kruse Reply

    Zardosht; I really enjoyed your talk last night at the SF MySQL Meetup. All though I am new to MySQL I was able to follow along because of your great knowledge of the subject and your ability to explain indexes. Thank you for your insights. Since I am new to MySQL is there any bits of wisdom that you could pass on to me? Are there any books or websites that you recommend that would help me to get up and running at a faster pace? Thank you once again.
    Gerald Kruse

    June 23, 2011 at 10:14 am

Leave a Reply