The B+-tree is a disk-based, paginated, dynamically updateable, balanced, and treelike 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 block of information between memory and...
- 1.Bayer R. The universal B-tree for multidimensional indexing: general concepts. In: Proceedings of the International Conference on Worldwide Computing and Its Applications; 1997. p. 198–209.Google Scholar
- 4.Knuth D. The art of computer programming. Sorting and searching, vol. 3. Reading: Addison Wesley; 1973.Google Scholar
- 5.Robinson JT. K-D-B tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1981. p. 10–8.Google Scholar
- 7.Theodoridis Y. The R-tree-portal. 2003. http://www.rtreeportal.org