DBScholar

Back to papers

Experiments With B-Tree Reorganization

Summary: Explicit B-tree reorganization to defer root splits is proposed, challenging the view that dynamic balancing suffices. A tunable storage-utilization reorganization algorithm is evaluated with simulations, demonstrating economic feasibility under targeted workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2197
Venue
SIGMOD
Year
1980
Pagerank
5.093636e-05
Overall Rank
13,274 | 8.93%
DOI
10.1145/582250.582281

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{gudes_sigmod80,
        title = {{EXPERIMENTS WITH B-TREE REORGANIZATION}},
        author = {Gudes, Ehud and Tsur, Shalom},
        series = {{SIGMOD} '80},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582250.582281},
        url = {https://dl.acm.org/doi/10.1145/582250.582281},
        year = {1980}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
6,246 Compact B-Trees 1979 SIGMOD 5.9425753e-05
Previous Page 1 / 1 Next

Semantically Similar Papers