Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Ubiquitous B-Tree

Ubiquitous B-Tree The Ubiquitous B-Tree DOUGLAS COMER Computer Sctence Department, Purdue Untverstty, West Lafayette, Indiana 47907 B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and nnplemented using B-trees This paper reviews B-trees and shows why they have been so successful It discusses the major variations of the B-tree, especially the B+-tree, contrasting the relatwe merits and costs of each implementatmn. It illustrates a general purpose access method whmh uses a B-tree. Keywords and Phrases: B-tree, B*-tree, B+-tree, file organization, index CR Categorws: 3.73 3.74 4.33 4 34 INTRODUCTION The secondary storage facilities available on large computer systems allow users to store, update, and recall data from large collections of information called files. A computer must retrieve an item and place it in main memory before it can be processed. In order to make good use of the computer resources, one must organize files intelligently, making the retrieval process efficient. The choice of a good file organization depends on the kinds of retrieval to be performed. There are two broad classes of retrieval commands which can be illustrated by the following examples: Sequential: "From http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Computing Surveys (CSUR) Association for Computing Machinery

Ubiquitous B-Tree

Comer, Douglas
ACM Computing Surveys (CSUR) , Volume 11 (2) – Jun 1, 1979
Download PDF
17 pages

Loading next page...
 
/lp/association-for-computing-machinery/ubiquitous-b-tree-lFN8YStlQz

References (33)

Publisher
Association for Computing Machinery
Copyright
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Subject
Trees
ISSN
0360-0300
DOI
10.1145/356770.356776
Publisher site
See Article on Publisher Site

Abstract

The Ubiquitous B-Tree DOUGLAS COMER Computer Sctence Department, Purdue Untverstty, West Lafayette, Indiana 47907 B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and nnplemented using B-trees This paper reviews B-trees and shows why they have been so successful It discusses the major variations of the B-tree, especially the B+-tree, contrasting the relatwe merits and costs of each implementatmn. It illustrates a general purpose access method whmh uses a B-tree. Keywords and Phrases: B-tree, B*-tree, B+-tree, file organization, index CR Categorws: 3.73 3.74 4.33 4 34 INTRODUCTION The secondary storage facilities available on large computer systems allow users to store, update, and recall data from large collections of information called files. A computer must retrieve an item and place it in main memory before it can be processed. In order to make good use of the computer resources, one must organize files intelligently, making the retrieval process efficient. The choice of a good file organization depends on the kinds of retrieval to be performed. There are two broad classes of retrieval commands which can be illustrated by the following examples: Sequential: "From

Journal

ACM Computing Surveys (CSUR) – Association for Computing Machinery

Published: Jun 1, 1979

There are no references for this article.