Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions (Extended Abstract)

Summary: Quantifies space utilization of multi-bucket leaves (L primary buckets + overflow) under hash-based inserts and splits. Introduces partial expansions—moving primary buckets between leaves—to raise disk utilization and quantify impacts on search/insert/update/delete for common index structures. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 934
Venue: PODS
Year: 1991
Pagerank: 4.1905499e-05
Overall Rank: 12,917 | 10.23%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Gabriel Matsliach

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
4,311	Analysis of Bounded Disorder file organization	1988	PODS	6.2824978e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,224	A High Performance, Universal, Key Associative Access Method	1983	SIGMOD	6.340632e-05
5,372	A Mapping Function for the Directory of a Multidimensional Extendible Hashing	1984	VLDB	5.5424242e-05
6,697	Optimal Splitters for Temporal and Multi-version Databases	2013	SIGMOD	4.9538866e-05
1,807	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD	0.0001047644
12,950	Clustered Multiattribute Hash Files	1989	PODS	4.1905499e-05
2,966	Distributed File Organization with Scalable Cost/Performance	1994	SIGMOD	7.8026762e-05
1,708	A Single-File Version Of Linear Hashing With Partial Expansions	1982	VLDB	0.00010802316
4,279	Balanced Multidimensional Extendible Hash Tree	1986	PODS	6.2850695e-05
1,903	Extendible Hashing for Concurrent Operations and Distributed Data	1983	PODS	0.00010149071
5,217	Multi-Disk B-trees	1991	SIGMOD	5.621547e-05