Database Paper Browser

Back to papers

Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree

Summary: Challenges R*-tree dominance for low-to-medium dimensional point indexing, showing Quadtree’s regular, disjoint decomposition dramatically reduces MBR overlap and yields structural/search advantages. Analytical models and extensive experiments show quadtrees (despite being unbalanced) improve buffer-pool utilization and outperform R*-trees and the Pyramid technique on point workloads, motivating their reconsideration. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
86
Venue
CIDR
Year
2007
Pagerank
4.3733038e-05
Overall Rank
9,207 | 35.95%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,772 K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization 2007 VLDB 4.6554316e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers