Implementation of B-Trees Using Dynamic Address Computation

Simple item page
dc.contributor.authorHartson, H. Rexen
dc.contributor.authorWest, Raymond T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:40Zen
dc.date.available2013-06-19T14:36:40Zen
dc.date.issued1990en
dc.description.abstractThe 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000219/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000219/01/TR-90-37.pdfen
dc.identifier.trnumberTR-90-37en
dc.identifier.urihttp://hdl.handle.net/10919/19626en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleImplementation of B-Trees Using Dynamic Address Computationen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-90-37.pdf
Size:
2.9 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports