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.
This work has been partially supported by “Ministerio de Educación y Ciencia” (PGE y FEDER) ref. TIN2006-15071-C03-03, by “Xunta de Galicia” ref. 2006/4 and ref. 08SIN009CT, and by Fondecyt Grant 1-080019, Chile.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gaede, V., Günther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170–231 (1998)
Brisaboa, N.R., Cillero, Y., Fariña, A., Ladra, S., Pedreira, O.: A new approach for document indexing using wavelet trees. In: Proc. of DEXA 2007, pp. 69–73 (2007)
Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. of ACM-SIAM SODA 2003, pp. 841–850 (2003)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD 1984, pp. 47–57. ACM Press, New York (1984)
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer-Verlag New York, Inc., Heidelberg (2005)
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)
Mäkinen, V., Navarro, G.: On self-indexing images - image compression with added value. In: Proc. of DCC 2008, pp. 422–431. IEEE Computer Society, Los Alamitos (2008)
Claude, F., Navarro, G.: Practical rank/select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176–187. Springer, Heidelberg (2008)
Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37–42. Springer, Heidelberg (1996)
González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Proc. of 4th WEA (Poster), pp. 27–38 (2005)
Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. of 9th ALENEX (2007)
Hadjieleftheriou, M.: Spatial index library, http://research.att.com/~marioh/spatialindex/ (retrieved March 2009)
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec. 19(2), 322–331 (1990)
Leutenegger, S., Lopez, M., Edgington, J.: Str: A simple and efficient algorithm for r-tree packing. In: Proc. of ICDE 1997, pp. 497–506 (1997)
Tagliasacchi, A.: Kd-tree for matlab, http://www.mathworks.com/matlabcentral/fileexchange/21512 (retrieved March 2009)
Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1) (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brisaboa, N.R., Luaces, M.R., Navarro, G., Seco, D. (2009). A New Point Access Method Based on Wavelet Trees. In: Heuser, C.A., Pernul, G. (eds) Advances in Conceptual Modeling - Challenging Perspectives. ER 2009. Lecture Notes in Computer Science, vol 5833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04947-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-04947-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04946-0
Online ISBN: 978-3-642-04947-7
eBook Packages: Computer ScienceComputer Science (R0)