Ubiquitous B-Tree
- 1 June 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 11 (2), 121-137
- https://doi.org/10.1145/356770.356776
Abstract
B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and implemented using B-trees. This paper reviews B-trees and shows why they have been so successful. It discusses the major variations of the B-tree, especially the W-tree, contrasting the relative merits and costs of each implementation. It illustrates a general purpose access method which uses a B-treeKeywords
This publication has 22 references indexed in Scilit:
- A storage scheme for height-balanced treesInformation Processing Letters, 1978
- B-trees re-examinedCommunications of the ACM, 1978
- Prefix B -treesACM Transactions on Database Systems, 1977
- Concurrency of operations on B-treesActa Informatica, 1977
- On the encipherment of search trees and random access filesACM Transactions on Database Systems, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972
- Binary B-trees for virtual memoryPublished by Association for Computing Machinery (ACM) ,1971
- File Organization: On the Selection of Random Access Index Points for Sequential FilesJournal of the ACM, 1969
- Randomized binary searching with tree structuresCommunications of the ACM, 1964