Performance Comparison Of Index Structures For Multi-Key Retrieval

Summary: Empirical comparison of four software index structures for multi-key retrieval: inverted file, grid file, and two MD‑B‑tree variants. MD‑B‑tree and grid file outperform inverted file across workloads, showing practical gains for multidimensional access. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2246
Venue: SIGMOD
Year: 1984
Pagerank: -
Overall Rank: 14,282 | 0.65%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Hans-Peter Kriegel

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
838	The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems	1990	VLDB	0.00016088938

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,207	Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree	2007	CIDR	4.3733038e-05
6,474	Indexing Multiple Sets	1994	VLDB	5.0500524e-05
2,136	A Generic Approach to Bulk Loading Multidimensional Index Structures	1997	VLDB	9.4721139e-05
1,517	Incremental Updates of Inverted Lists for Text Document Retrieval	1994	SIGMOD	0.00011578859
8,474	Adaptive Index Structures	2002	VLDB	4.5029015e-05
12,747	Fast High-Dimensional Data Search in Incomplete Databases	1998	VLDB	4.1945683e-05
6,480	Efficient Search of Multidimensional B-Trees	1995	VLDB	5.0475112e-05
14,348	Multi-Table Search For B-Tree Files	1979	SIGMOD	-
5	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.0018397217
13,018	MULTIKEY RETRIEVAL from K-d TREES and QUAD-TREES	1985	SIGMOD	4.1945683e-05