Abstract
In this paper we present a compact structure to index semi-static 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.
This work has been partially supported by “Ministerio de Educación y Ciencia” (PGE y FEDER) ref. TIN2009-14560-C03-02, by “Xunta de Galicia” ref. 08SIN009CT, and by Fondecyt Grant 1-080019, Chile.
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
Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: 41st Symp. on Foundations of Computer Science, pp. 198–207 (2000)
Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F.K.H.A., Gavrilova, M.L., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98–109 (2009)
Brisaboa, N.R., Luaces, M.R., Navarro, G., Seco, D.: A new point access method based on wavelet trees. In: Heuser, C.A., Pernul, G. (eds.) ER 2009 Workshops. LNCS, vol. 5833, pp. 297–306. Springer, Heidelberg (2009)
Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 135–143. ACM Press, New York (1984)
Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998)
Global Spatial Data Infrastructure Association, http://www.gsdi.org/
González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms, pp. 27–38. CTI Press and Ellinika Grammata (2005)
González, R., Navarro, G.: Rank/select on dynamic compressed sequences and applications. Theoretical Computer Science 410, 4414–4422 (2008)
Jones, C.B., Purves, R.S.: Geographical information retrieval. International Journal of Geographical Information Science 22(3), 219–228 (2008)
Kim, K., Cha, S.K., Kwon, K.: Optimizing multidimensional index trees for main memory access. SIGMOD Record 30(2), 139–150 (2001)
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Heidelberg (2005)
Salomon, D.: Data Compression: The Complete Reference. Springer, Heidelberg (2004)
Samet, H.: Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)
Schmidt, J.M.: Interval stabbing problems in small integer ranges. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 163–172. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brisaboa, N.R., Luaces, M.R., Navarro, G., Seco, D. (2010). Range Queries over a Compact Representation of Minimum Bounding Rectangles. In: Trujillo, J., et al. Advances in Conceptual Modeling – Applications and Challenges. ER 2010. Lecture Notes in Computer Science, vol 6413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16385-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-16385-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16384-5
Online ISBN: 978-3-642-16385-2
eBook Packages: Computer ScienceComputer Science (R0)