- Philippe BonnetAffiliated withUniversity of Copenhagen
- , Dennis ShashaAffiliated withNew York University
Index Tuning is concerned with when and how to construct an index.
When relational models were first introduced, customers complained that vendors had introduced them to slowed down customer applications in order to make the customers buy more hardware. Vendors and researchers responded to the performance challenge by incorporating existing data structures (notably B-trees and hash structures) and improving many new ones (notably bit vectors and multi-dimensional indexes). The decision of which data structures to create was left to the user. This entry concerns that decision.
An index is a data structure plus a method of arranging the data tuples in the table (or other kind of collection object) being indexed. The syntax for constructing indexes is discussed elsewhere. This entry presents the tuning considerations.
Two data structures are most often used in practice for indexes: B+-trees and Hash structure ...
Reference Work Entry Metrics
- Index Tuning
- Reference Work Title
- Encyclopedia of Database Systems
- pp 1433-1435
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. College of Computing, Georgia Institute of Technology
- 2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo
- Author Affiliations
- 1. University of Copenhagen, Copenhagen, Denmark
- 2. New York University, New York, NY, USA
To view the rest of this content please follow the download PDF link above.