Webinar: Understanding Indexing

Posted On July 23, 2012 | By Zardosht Kasheff | 1 comments

Three rules on making indexes around queries to provide good performance

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.


Time: 2PM EDT / 11AM PDT

This webinar 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.

About the Presenter

Zardosht Kasheff has been a senior member of Tokutek’s TokuDB engineering team since 2008. 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.

 

One Comment

Leave a Reply

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