Range queries over a compact representation of minimum bounding rectangles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6413 LNCS, Issue , 2010, Pages 33-42

  Brisaboa, Nieves R ^a   Luaces, Miguel R ^a   Navarro, Gonzalo ^b   Seco, Diego ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

compact structures; MBR; range query; wavelet tree

Indexed keywords

COMPACT REPRESENTATION; COMPACT STRUCTURES; MBR; MEMORY HIERARCHY; MINIMUM BOUNDING RECTANGLE; OTHER DISCRETE; RANGE QUERY; SEARCH EFFICIENCY; SEARCH PERFORMANCE; STRINGOLOGY; WAVELET TREE;

DECISION TREES;

EID: 78649914154     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16385-2_5     Document Type: Conference Paper

References (14)

1. 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)
2. 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)
3. 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)
4. 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)
5. Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170-231 (1998)
6. Global Spatial Data Infrastructure Association, http://www.gsdi.org/
7. González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings Volume of 4thWorkshop on Efficient and Experimental Algorithms, pp. 27-38. CTI Press and Ellinika Grammata (2005)
8. González, R., Navarro, G.: Rank/select on dynamic compressed sequences and applications. Theoretical Computer Science 410, 4414-4422 (2008)
9. Jones, C.B., Purves, R.S.: Geographical information retrieval. International Journal of Geographical Information Science 22(3), 219-228 (2008)
10. Kim, K., Cha, S.K., Kwon, K.: Optimizing multidimensional index trees for main memory access. SIGMOD Record 30(2), 139-150 (2001) (Pubitemid 33604440)
11. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Heidelberg (2005)
12. Salomon, D.: Data Compression: The Complete Reference. Springer, Heidelberg (2004)
13. Samet, H.: Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)
14. 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)