Encyclopedia of Database Systems

2009 Edition

Tree-based Indexing

  • Yannis Manolopoulos
  • Yannis Theodoridis
  • Vassilis J. Tsotras
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-39940-9_755



Consider a relation R with some numeric attribute A taking values over an (ordered) domain D. A range query retrieves all tuples in R whose attribute A has values in the interval [low, high]. That is, low ≤ R.A ≤ high. To enable fast processing of range selection queries, an access method that maintains order is needed. Such an index has the form of a tree, where each node corresponds to a page. Leaf nodes contain (or index) the actual values of A, while index nodes provide ordered access to the nodes underneath. Examples of tree-based indexing are the B+-tree and the R-tree (for single- and multi-dimensional ranges, respectively).

Key Points

A major performance goal of a database management system is to minimize the number of I/O’s (i.e., blocks or pages transferred) between the disk and main memory. One way to achieve this goal is to minimize the number of I/O’s when answering a query. Consider for example...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Elmasri R.A., and Navathe S.B. Fundamentals of Database Systems (5th edn.). Addisson-Wesley, Reading, MA, 2007.Google Scholar
  2. 2.
    Manolopoulos, Theodoridis Y., Tsotras. Y., and Vassilis. J., Advanced Database Indexing. Kluwer, Dordecht, 1999.Google Scholar
  3. 3.
    Ramakrishnan R. and Gehrke J. Database Management Systems (3rd edn.). McGraw-Hill, NY, 2003.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Yannis Theodoridis
    • 2
  • Vassilis J. Tsotras
    • 3
  1. 1.Aristotle University of ThessalonikiThessalonikiGreece
  2. 2.University of PiraeusPiraeusGreece
  3. 3.University of California-RiversideRiversideUSA