Recent Advances in Worst-Case Efficient Range Search Indexing

Authors:
Lars Arge
Affiliations:
MADALGO, Dept. of Computer Science, Aarhus University, Aarhus, Denmark
Venue:
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Year:
2009

Citing 14
Cited 0

Multidimensional access methods

ACM Computing Surveys (CSUR)
On two-dimensional indexability and optimal range search indexing

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Box-trees and R-trees with near-optimal query time

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
On a model of indexability and its bounds for range queries

Journal of the ACM (JACM)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure

IEEE Transactions on Knowledge and Data Engineering
Optimal Dynamic Range Searching in Non-replicating Index Structures

ICDT '99 Proceedings of the 7th International Conference on Database Theory
An asymptotically optimal multiversion B-tree

The VLDB Journal — The International Journal on Very Large Data Bases
External memory data structures

Handbook of massive data sets
Optimal External Memory Interval Management

SIAM Journal on Computing
The Priority R-tree: a practically efficient and worst-case optimal R-tree

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Range search indexing is the problem of storing a set of data points on disk such that the points in a axis-parallel (hyper-) query rectangle can be found efficiently (with as few disk accesses - or I/Os - as possible). The problem is arguably one of the most fundamental problems in spatial databases. Many indexes have been proposed for the problem and its variants.The R-tree for example can be used to solve the more general version of the problem where the data is rectangles.