Abstract
dc:description.abstractMajor developments relating to the B-tree from early 1979 through the fall of 1986 are presented. This updates the well-known article, "The Ubiquitous B-Tree" by Douglas Comer (Computing Surveys, June 1979). After a basic overview of B and B+ trees, recent research is cited as well as descriptions of nine B-tree variants developed since Comer's article. The advantages and disadvantages of each variant over the basic B-tree are emphasized. Also included are a discussion of concurrency control issues in B-trees and a speculation on the future of B-trees.
Degree
thesis:*- Name thesis:degree_name
- Computer Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Computer Science (GCCIS)
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fischbeck, Sally E.
- Contributors dc:contributor
-
- Jeffrey A. Lasky
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.rit.edu/theses/8401