On the performance of B-trees using dynamic address computation
dc.contributor.author | West, Raymond Troy, Jr. | en |
dc.contributor.committeechair | Hartson, H. Rex | en |
dc.contributor.committeemember | Kafura, Dennis G. | en |
dc.contributor.committeemember | Foutz, Robert | en |
dc.contributor.department | Computer Science | en |
dc.date.accessioned | 2014-03-14T21:31:35Z | en |
dc.date.adate | 2013-03-12 | en |
dc.date.available | 2014-03-14T21:31:35Z | en |
dc.date.issued | 1985-11-05 | en |
dc.date.rdate | 2013-03-12 | en |
dc.date.sdate | 2013-03-12 | en |
dc.description.abstract | 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 Dynanic 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. | en |
dc.description.degree | Master of Science | en |
dc.format.extent | v, 258 leaves | en |
dc.format.medium | BTD | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.other | etd-03122013-040251 | en |
dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-03122013-040251/ | en |
dc.identifier.uri | http://hdl.handle.net/10919/41574 | en |
dc.publisher | Virginia Tech | en |
dc.relation.haspart | LD5655.V855_1985.W477.pdf | en |
dc.relation.isformatof | OCLC# 13354832 | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.lcc | LD5655.V855 1985.W477 | en |
dc.subject.lcsh | Data structures (Computer science) | en |
dc.subject.lcsh | Database management | en |
dc.subject.lcsh | Trees (Graph theory) | en |
dc.title | On the performance of B-trees using dynamic address computation | en |
dc.type | Thesis | en |
dc.type.dcmitype | Text | en |
thesis.degree.discipline | Computer Science | en |
thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
thesis.degree.level | masters | en |
thesis.degree.name | Master of Science | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- LD5655.V855_1985.W477.pdf
- Size:
- 6.47 MB
- Format:
- Adobe Portable Document Format
- Description: