Worst-Case Efficient Range Search Indexing
Summary: Survey of worst-case optimal external-memory orthogonal range indexing: covers B-tree variants for 1D, external priority search trees, range trees (B-tree I/Os but superlinear space) and linear-space kdB-/O-trees. Discusses indexability lower bounds proving optimal query/space trade-offs, extensions to higher dimensions, and R-tree variants for rectangle objects. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Lars Arge
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 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018397217 |
| 1,182 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS | 0.00013455963 |
| 3,650 | The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree | 2004 | SIGMOD | 6.8783391e-05 |
Previous
Page 1 / 1
Next