MULTIKEY RETRIEVAL from K-d TREES and QUAD-TREES

Summary: Multi-key retrieval evaluated across K-d trees, quad-trees, and flat files for five query types on a half-million character medical database. Results show no universal winner; quad-trees outperform on some classes, while K-d trees excel on others. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2343
Venue: SIGMOD
Year: 1985
Pagerank: 5.093636e-05
Overall Rank: 13,217 | 9.32%
DOI: 10.1145/318898.318925

Incoming Non-self Citations Over Time

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

Authors

1. D A Beckley (AT&T)
2. M W Evens (Illinois Institute of Technology)
3. V K Raman (Illinois Institute of Technology)

BibTeX Citation

@inproceedings{beckley_sigmod85,
        title = {{MULTIKEY RETRIEVAL from K-d TREES and QUAD-TREES}},
        author = {Beckley, D A and Evens, M W and Raman, V K},
        series = {{SIGMOD} '85},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/318898.318925},
        url = {https://dl.acm.org/doi/10.1145/318898.318925},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
8	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.00082404462
2,082	A Dynamic Clustering Technique For Physical Database Design	1980	SIGMOD	9.201869e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,417	Similarity Query Processing Using Disk Arrays	1998	SIGMOD
2	2,974	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD
3	187	Algorithmics and Applications of Tree and Graph Searching	2002	PODS
4	8,078	Indexing Mixed Types for Approximate Retrieval	2005	VLDB
5	14,479	An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees	1984	SIGMOD
6	9,365	Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree	2007	CIDR
7	253	A Class of Data Structures for Associative Searching	1984	PODS
8	6,451	Efficient Search of Multidimensional B-Trees	1995	VLDB
9	8	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD
10	14,483	Performance Comparison Of Index Structures For Multi-Key Retrieval	1984	SIGMOD