Experiments with B-tree reorganization

Ehud Gudes, Shalom Tsur

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

B-trees are a commonly used data structure for indexed access to files and databases. Among the desirable properties of B-trees is the fact that they are dynamically rebalanced after each insertion and deletion operation and therefore need not be reorganized as other static access structures e.g., ISAM. Despite the fact that B-trees are dynamically balanced we demonstrate that operational conditions exist under which it pays off to explicitly reorganize B-trees. The rationale being that by explicit reorganization we defer the event of root splitting and hence reduce the cost of subsequent retrieval requests which are the dominant operations. We present a reorganization algorithm that allows control over storage utilization and discuss the circumstances under which it should be applied. We present simulation results that support our contention that reorganization is indeed economically feasible and we conclude with some suggestions for further work in this area.

Original languageEnglish
Title of host publicationProceedings of the 1980 ACM SIGMOD International Conference on Management of Data, SIGMOD 1980
PublisherAssociation for Computing Machinery
Pages200-206
Number of pages7
ISBN (Print)0897910184
DOIs
StatePublished - 14 May 1980
Externally publishedYes
Event1980 ACM SIGMOD International Conference on Management of Data, SIGMOD 1980 - Santa Monica, United States
Duration: 14 May 198016 May 1980

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078

Conference

Conference1980 ACM SIGMOD International Conference on Management of Data, SIGMOD 1980
Country/TerritoryUnited States
CitySanta Monica
Period14/05/8016/05/80

Fingerprint

Dive into the research topics of 'Experiments with B-tree reorganization'. Together they form a unique fingerprint.

Cite this