Range queries over a compact representation of minimum bounding rectangles

Authors:
Nieves R. Brisaboa;Miguel R. Luaces;Gonzalo Navarro;Diego Seco
Affiliations:
Database Laboratory, University of A Coruña, A Coruña, Spain;Database Laboratory, University of A Coruña, A Coruña, Spain;Department of Computer Science, University of Chile, Santiago, Chile;Database Laboratory, University of A Coruña, A Coruña, Spain
Venue:
ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Year:
2010

Citing 11
Cited 1

Multidimensional access methods

ACM Computing Surveys (CSUR)
Optimizing multidimensional index trees for main memory access

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
New data structures for orthogonal range searching

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Data Compression

Data Compression
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)

R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Geographical information retrieval

International Journal of Geographical Information Science
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Rank/select on dynamic compressed sequences and applications

Theoretical Computer Science
A New Point Access Method Based on Wavelet Trees

ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Interval Stabbing Problems in Small Integer Ranges

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Space-efficient representations of rectangle datasets supporting orthogonal range querying

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a compact structure to index semistatic collections of MBRs that solves range queries while keeping a good trade-off between the space needed to store the index and its search efficiency. This is very relevant considering the current sizes and gaps in the memory hierarchy. Our index is based on the wavelet tree, a structure used to represent sequences, permutations, and other discrete functions in stringology. The comparison with the R*-tree and the STR R-tree (the most relevant dynamic and static versions of the R-tree) shows that our proposal needs less space to store the index while keeping competitive search performance, especially when the queries are not too selective.