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.1945683e-05
Overall Rank: 12,907 | 10.21%
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,318	Analysis of Bounded Disorder file organization	1988	PODS	6.2885419e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
503	Storage Mappings For Multidimensional Linear Dynamic Hashing	1983	PODS	0.00021520176
5,363	A Mapping Function for the Directory of a Multidimensional Extendible Hashing	1984	VLDB	5.5471634e-05
6,694	Optimal Splitters for Temporal and Multi-version Databases	2013	SIGMOD	4.9586454e-05
1,809	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD	0.00010483957
12,940	Clustered Multiattribute Hash Files	1989	PODS	4.1945683e-05
2,963	Distributed File Organization with Scalable Cost/Performance	1994	SIGMOD	7.8097631e-05
1,708	A Single-File Version Of Linear Hashing With Partial Expansions	1982	VLDB	0.00010815668
4,286	Balanced Multidimensional Extendible Hash Tree	1986	PODS	6.2898839e-05
1,901	Extendible Hashing for Concurrent Operations and Distributed Data	1983	PODS	0.00010159096
5,098	Multi-Disk B-trees	1991	SIGMOD	5.7007294e-05