- Donghui ZhangAffiliated withNortheastern University
- , Kenneth Paul BaclawskiAffiliated withNortheastern University
- , Vassilis J. TsotrasAffiliated withUniversity of California-Riverside
The B+-tree is a disk-based, paginated, dynamically updateable, balanced, and tree-like index structure. It supports the exact match query as well as insertion/deletion operations in O(logpn) I/Os, where n is the number of records in the tree and p is the page capacity in number of records. It also supports the range searches in O(logpn + t ∕p) I/Os, where t is the number of records in the query result.
The binary search tree is a well-known data structure. When the data volume is so large that the tree does not fit in main memory, a disk-based search tree is necessary. The most commonly used disk-based search trees are the B-tree and its variations. Originally invented by Bayer and McCreight , the B-tree may be regarded as an extension of the balanced binary tree, since a B-tree is always balanced (i.e., all leaf nodes are on the same level). Since each disk access retrieves or updates an entire bloc ...
Reference Work Entry Metrics
- Reference Work Title
- Encyclopedia of Database Systems
- pp 197-200
- 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. Northeastern University, Boston, MA, USA
- 2. University of California-Riverside, Riverside, CA, USA
To view the rest of this content please follow the download PDF link above.