File organization and processing
File organization and processing
Information Systems
An analysis of B-trees and their variants
Information Systems
File organizations and access methods for CLV disks
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
A quasi-distributed architecture for database management systems
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A dynamic storage allocation algorithm suitable for file structures
Information Systems
B+ trees, bounded disorder and adaptive hashing
Information Systems
Bit-Tree: a data structure for fast file processing
Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Computing Surveys (CSUR)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
| Hi-index | 0.02 |
New technology and new applications often demand new data structures or modifications to existing ones. The CD-ROM is a relatively new technology that provides a very inexpensive storage medium. But it also has the disadvantage of being a read-only medium. This paper introduces the B3-tree, a modification of the popular B-tree. The B3-tree is intended to capture the advantages of the B+-tree with the cost benefits associated with using a CD-ROM. The 3 indicates that the B3-tree uses the three levels of memory hierarchy: primary memory, read-write secondary storage, and the CD-ROM. After describing the workings of the B3-tree, we give test results to illustrate its effectiveness under many conditions.