Implementation of B-Trees Using Dynamic Address Computation

Files
TR-90-37.pdf (2.9 MB)
Downloads: 125
TR Number
TR-90-37
Date
1990
Journal Title
Journal ISSN
Volume Title
Publisher
Department of Computer Science, Virginia Polytechnic Institute & State University
Abstract

The B-tree is probably the most popular method in use today for indexes and inverted files in database management systems. The traditional implementation for a B-tree uses many pointers (more than one per key), and which can directly affect the performance of the B-tree. A general method of file organization and access (called Dynamic Address Computation) has been described by Cook that can be used to implement B-trees using no pointers. A minimal amount of storage (in addition to the keys) is required. This paper gives a detailed description of Direct Address Computation and the resulting system is analyzed, leading to the conclusion that, while the approach results in a simple implementation of B-trees, more work is required to achieve performance for large B-trees.

Description
Keywords
Citation