Abstract

Major 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.

Library of Congress Subject Headings

Trees (Graph theory)--Data processing; Data structures (Computer science)

Publication Date

1-1-1987

Document Type

Thesis

Student Type

Graduate

Degree Name

Computer Science (MS)

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Jeffrey A. Lasky

Advisor/Committee Member

Henry A. Etlinger

Advisor/Committee Member

Peter Anderson

Comments

Physical copy available from RIT's Wallace Library at QA166.2 .F574 1987

Campus

RIT – Main Campus

Download

Share

COinS