D. Comer. ACM Comput. Surv., 11 (2):
121-137(1979)
Abstract
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.
%0 Journal Article
%1 journals/csur/Comer79
%A Comer, Douglas
%D 1979
%J ACM Comput. Surv.
%K b-tree
%N 2
%P 121-137
%T The Ubiquitous B-Tree.
%U http://dblp.uni-trier.de/db/journals/csur/csur11.html#Comer79
%V 11
%X 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.
@article{journals/csur/Comer79,
abstract = {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. },
added-at = {2007-07-12T09:18:33.000+0200},
author = {Comer, Douglas},
biburl = {https://www.bibsonomy.org/bibtex/240b4155106c4292a4d35bf2736cba8f9/wolfey},
cdrom = {CSURs1/csur11/P121.pdf},
cite = {journals/acta/Yao78},
date = {2003-11-19},
description = {dblp},
ee = {db/journals/csur/Comer79.html},
interhash = {87e7ec64ee3babacbc08d10d739bddd7},
intrahash = {40b4155106c4292a4d35bf2736cba8f9},
journal = {ACM Comput. Surv.},
keywords = {b-tree},
number = 2,
pages = {121-137},
timestamp = {2007-07-12T09:18:34.000+0200},
title = {The Ubiquitous B-Tree.},
url = {http://dblp.uni-trier.de/db/journals/csur/csur11.html#Comer79},
volume = 11,
year = 1979
}