Database Paper Browser

Back to papers

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
2281
Venue
SIGMOD
Year
1985
Pagerank
4.1945683e-05
Overall Rank
13,018 | 9.44%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

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
5 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0018397217
1,709 A Dynamic Clustering Technique For Physical Database Design 1980 SIGMOD 0.00010811082
Previous Page 1 / 1 Next

Semantically Similar Papers