A New Point Access Method Based on Wavelet Trees

Authors:
Nieves R. Brisaboa;Miguel R. Luaces;Gonzalo Navarro;Diego Seco
Affiliations:
Database Laboratory, University of A Coruña, A Coruña, Spain 15071;Database Laboratory, University of A Coruña, A Coruña, Spain 15071;Center for Web Research, Department of Computer Science, University of Chile, Blanco Encalada, Santiago, Chile 2120;Database Laboratory, University of A Coruña, A Coruña, Spain 15071
Venue:
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Year:
2009

Citing 12
Cited 5

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multidimensional access methods

ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching

Communications of the ACM
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
High-order entropy-compressed text indexes

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Tables

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)

R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Compressed full-text indexes

ACM Computing Surveys (CSUR)
A New Approach for Document Indexing UsingWavelet Trees

DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
On Self-Indexing Images - Image Compression with Added Value

DCC '08 Proceedings of the Data Compression Conference
Practical Rank/Select Queries over Arbitrary Sequences

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

A fun application of compact data structures to indexing geographic data

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Range queries over a compact representation of minimum bounding rectangles

ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Monge properties of sequence alignment

Theoretical Computer Science
The SMO-index: a succinct moving object structure for timestamp and interval queries

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Space-efficient representations of rectangle datasets supporting orthogonal range querying

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The development of index structures that allow efficient retrieval of spatial objects has been a topic of interest in the last decades. Most of these structures have been designed for secondary memory. However, in the last years the price of memory has decreased drastically. Nowadays it is feasible to place complete spatial indexes in main memory. In this paper we focus in a subcategory of spatial indexes named Point Access Methods. These indexes are designed to solve the problem of indexing points. We present a new index structure designed for two dimensions and main memory that keeps a good trade-off between the space needed to store the index and its search efficiency. Our structure is based on a wavelet tree , which was originally designed to represent sequences, but has been successfully used as an index in areas like information retrieval or image compression.