InfoQ Homepage Presentations Understanding Indexing Without Needing to Understand Data Structures
Understanding Indexing Without Needing to Understand Data Structures
Summary
Zardosht Kasheff suggest using 3 rules for indexing SQL databases: Retrieve less data, Avoid point queries, and Avoid sorting.
Bio
Zardosht Kasheff 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 MIT.
About the conference
Strange Loop is a multi-disciplinary conference that aims to bring together the developers and thinkers building tomorrow's technology in fields such as emerging languages, alternative databases, concurrency, distributed systems, mobile development, and the web. Strange Loop was created in 2009 by software developer Alex Miller and is now run by a team of St. Louis-based friends and developers under Strange Loop LLC, a for-profit but not particularly profitable venture.
Community comments
A database indexing is the core of applications ad tabase level
by Shamal Jayakody,
A database indexing is the core of applications ad tabase level
by Shamal Jayakody,
Your message is awaiting moderation. Thank you for participating in the discussion.
It is important to understand a pragmatic approach as outlined in this presentation. A database index is a data structure that improves the speed of data acquiring operations on a database table at the expense of slower writes and augmented storage space. Indices can be created using one or more columns of a database table, providing the basis for both rapid random lookups and efficient access of ordered records.