Binary B-trees for virtual memory
Rudolf Bayer · 1971
A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys can be done in time proportional to log N where N is the cardinality of the data-set. Binary B-trees are a modification of B-trees described previously by Bayer and McCreight. They avoid the storage overhead encountered with B-trees and are suitable for processing in a one-level store.
Cited by 93 works. doi:10.1145/1734714.1734731 Open-access PDF
Authors
References
- The Art of Computer Programming
- The Art of Computer Programming
- Information retrieval
- Use of tree structures for processing files
- Use of tree structures for processing files
- The Balanced Tree and Its Utilization in Information Retrieval
- Organization and maintenance of large ordered indices
- File structures using hashing functions
- A balanced tree storage and retrieval algorithm
- ORGANIZATION AND MAINTENANCE OF LARGE ORDERED INDICES