Show simple item record

dc.contributor.authorWest, Raymond Troy, Jr.en_US

The B-tree is a one of the more popular methods in use today for indexes and inverted files in database management systems. The traditional implementation of a Bâ tree uses many pointers (more than one per key), which can directly affect the performance of the B-tree. A general method of file organization and access (called Dymanic 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. An implementation of Dynamic Address Computation and a B-tree management package is described. Analytical performance measures are derived in an attempt to understand the performance characteristics of the B-tree. It is shown that the additional costs associated with Dynamic Address Computation result in an implementation that is competitive with traditional implementations only for small applications. For very large B-trees, additional work is required to make the performance acceptable. Some examples of possible modifications are discussed.

dc.publisherVirginia Techen_US
dc.rightsIn Copyrighten
dc.subjectDatabase managementen_US
dc.subject.lccLD5655.V855 1985.W477en_US
dc.titleOn the performance of B-trees using dynamic address computationen_US
dc.contributor.departmentComputer Scienceen_US
dc.description.degreeMaster of Scienceen_US of Scienceen_US Polytechnic Institute and State Universityen_US Scienceen_US
dc.contributor.committeechairHartson, H. Rexen_US
dc.contributor.committeememberKafura, Dennis G.en_US
dc.contributor.committeememberFoutz, Roberten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record