Multi-Disk B-trees

Summary: Survey of three multi-disk B-tree designs—distributing records, large multi-disk pages, and distributing pages—to scale I/O and throughput in multi-user settings. Proposes a page-distribution scheme with improved local load balancing; preliminary results show faster response times and higher throughput. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2614
Venue: SIGMOD
Year: 1991
Pagerank: 6.3577476e-05
Overall Rank: 5,120 | 64.88%
DOI: 10.1145/115790.115862

Incoming Non-self Citations Over Time

Authors

1. Bernhard Seeger (University of Waterloo)
2. Per-Ake Larson (University of Waterloo)

BibTeX Citation

@inproceedings{seeger_sigmod91,
        title = {{Multi-Disk B-trees}},
        author = {Seeger, Bernhard and Larson, Per-Ake},
        series = {{SIGMOD} '91},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/115790.115862},
        url = {https://dl.acm.org/doi/10.1145/115790.115862},
        year = {1991}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,341	Parallel R-trees	1992	SIGMOD	8.7233426e-05
3,772	Exploiting Advanced Database Optimization Features for Large-Scale SAP R/3 Installations	2002	VLDB	7.1388374e-05
6,915	CMD: A Multidimensional Declustering Method for Parallel Database Systems	1992	VLDB	5.7404469e-05
9,417	Similarity Query Processing Using Disk Arrays	1998	SIGMOD	5.2740525e-05
10,479	P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token Prediction	2026	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
133	A Case for Redundant Arrays of Inexpensive Disks (RAID)	1988	SIGMOD	0.00030370315
188	Data Placement In Bubba	1988	SIGMOD	0.00026126036
936	The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems	1990	VLDB	0.00013092484
1,918	Optimal File Distribution For Partial Match Retrieval	1988	SIGMOD	9.4857996e-05
3,403	Declustering Using Error Correcting Codes	1989	PODS	7.4414918e-05
3,754	An Adaptive Data Placement Scheme for Parallel Database Computer Systems	1990	VLDB	7.1502658e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,075	Distributing a Search Tree Among a Growing Number of Processors	1994	SIGMOD
2	14,549	Multi-Table Search For B-Tree Files	1979	SIGMOD
3	2,341	Parallel R-trees	1992	SIGMOD
4	13,036	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB
5	4,914	A General Solution of the n-dimensional B-tree Problem	1995	SIGMOD
6	14,493	Towards an Optimal Data-Structure: CB-trees	1984	VLDB
7	13,274	Experiments With B-Tree Reorganization	1980	SIGMOD
8	13,102	Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions (Extended Abstract)	1991	PODS
9	9,810	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD
10	1,731	Write-Optimized B-Trees	2004	VLDB