DBScholar

Back to papers

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
2308
Venue
SIGMOD
Year
1984
Pagerank
-
Overall Rank
14,483 | 0.64%
DOI
10.1145/602259.602284

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{kriegel_sigmod84,
        title = {{PERFORMANCE COMPARISON OF INDEX STRUCTURES FOR MULTI-KEY RETRIEVAL}},
        author = {Kriegel, Hans-Peter},
        series = {{SIGMOD} '84},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/602259.602284},
        url = {https://dl.acm.org/doi/10.1145/602259.602284},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
936 The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems 1990 VLDB 0.00013092484
Previous Page 1 / 1 Next

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
Previous Page 1 / 1 Next

Semantically Similar Papers