Space-efficient representations of rectangle datasets supporting orthogonal range querying

Information Systems

Volumn 38, Issue 5, 2013, Pages 635-655

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

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF CONCEPCIÓN   (Chile)

Author keywords

Data structure; GIS; Orthogonal range query; Space efficient

Indexed keywords

GEOGRAPHIC DATABASE; GEOGRAPHIC INFORMATION; GEOGRAPHIC OBJECTS; INDEX STRUCTURE; INTERNET USERS; PRIMITIVE OPERATIONS; RANGE QUERY; SPACE-EFFICIENT;

DATA STRUCTURES; GEOMETRY; SEARCH ENGINES;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 84874712861     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2013.01.005     Document Type: Article

References (38)

1. J.L. Bentley Multidimensional binary search trees used for associative searching Communications of the ACM 18 9 1975 509 517
2. B. Chazelle A functional approach to data structures and its use in multidimensional searching SIAM Journal on Computing 17 3 1988 427 462
3. Y. Nekrich Orthogonal range searching in linear and almost-linear space Computational Geometry 42 4 2009 342 351
4. P. Bose, M. He, A. Maheshwari, P. Morin, Succinct orthogonal range search structures on a grid with applications to text indexing, in: Proceedings of the 11th WADS, 2009, pp. 98-109.
5. V. Gaede, and O. Günther Multidimensional access methods ACM Computing Surveys 30 2 1998 170 231 (Pubitemid 128485203)
6. C.B. Jones, and R.S. Purves Geographical information retrieval Journal of Geographical Information Science 22 3 2008 219 228
7. N.R. Brisaboa, M.R. Luaces, G. Navarro, D. Seco, Range queries over a compact representation of minimum bounding rectangles, in: Proceedings of the 29th ER Work, 2009, pp. 33-42.
8. N.R. Brisaboa, M.R. Luaces, G. Navarro, D. Seco, A fun application of compact data structures to indexing geographic data, in: Proceedings of the Fifth FUN, 2010, pp. 77-88.
9. K. Kim, S.K. Cha, and K. Kwon Optimizing multidimensional index trees for main memory access SIGMOD Record 30 2 2001 139 150
10. K.V.R. Kanth, A.K. Singh, Optimal dynamic range searching in non-replicating index structures, in: Proceedings of the Seventh ICDT, 1999, pp. 257-276.
11. G.S. Lueker, A data structure for orthogonal range queries, in: Proceedings of the 19th FOCS, IEEE, 1978, pp. 28-34.
12. R. Grossi, A. Gupta, J. Vitter, High-order entropy-compressed text indexes, in: Proceedings of the 14th SODA, 2003, pp. 841-850.
13. V. Mäkinen, and G. Navarro Rank and select revisited and extended Theoretical Computer Science 387 3 2007 332 347 (Pubitemid 350001348)
14. T. Chan, K. Larsen, M. Patrascu, Orthogonal range searching on the RAM, revisited, in: Proceedings of the 27th SoCG, 2011, pp. 1-10.
15. A. Guttman, R-Trees: a dynamic index structure for spatial searching, in: Proceedings of the SIGMOD, ACM Press, 1984, pp. 47-57. (Pubitemid 15469534)
16. Y. Manolopoulos, A. Nanopoulos, A.N. Papadopoulos, and Y. Theodoridis R-Trees Theory and Applications 2005 Springer-Verlag
17. G. Navarro, Wavelet trees for all, in: Proceedings of the 23rd CPM, 2012, pp. 2-26.
18. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro Compressed representations of sequences and full-text indexes ACM Transactions on Algorithms 3 2 2007 article 20
19. Y.-F. Chien, W.-K. Hon, R. Shah, J.S. Vitter, Geometric Burrows-Wheeler transform: linking range searching and text indexing, in: Proceedings of the 18th DCC, 2008, pp. 252-261.
20. N. Välimäki, V. Mäkinen, Space-efficient algorithms for document retrieval, in: Proceedings of the 18th CPM, vol. 4580 of LNCS, 2007, pp. 205-215.
21. V. Mäkinen, G. Navarro, On self-indexing images - image compression with added value, in: Proceedings of the 18th DCC, 2008, pp. 422-431.
22. F. Claude, G. Navarro, Practical rank/select queries over arbitrary sequences, in: Proceedings of the 15th SPIRE, 2008, pp. 176-187.
23. G. Jacobson, Space-efficient static trees and graphs, in: Proceedings of the 30th FOCS, 1989, pp. 549-554. (Pubitemid 20726002)
24. I. Munro, Tables, in: Proceedings of the 16th FSTTCS, 1996, pp. 37-42.
25. R. González, S. Grabowski, V. Mäkinen, G. Navarro, Practical implementation of rank and select queries, in: Poster Proceedings of the Fourth WEA, CTI Press and Ellinika Grammata, 2005, pp. 27-38.
26. F. Claude, P.K. Nicholson, D. Seco, Space efficient wavelet tree construction, in: Proceedings of the 18th SPIRE, 2011, pp. 185-196.
27. G. Tischler, On wavelet tree construction, in: Proceedings of the 22nd CPM, 2011, pp. 208-218.
28. N.R. Brisaboa, M.R. Luaces, G. Navarro, D. Seco, A new point access method based on wavelet trees, in: Proceedings of the 28th ER Work, 2009, pp. 297-306.
29. H.N. Gabow, J.L. Bentley, R.E. Tarjan, Scaling and related techniques for geometry problems, in: Proceedings of the 16th STOC, ACM, 1984, pp. 135-143.
30. M. de Berg, M.V. Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry - Algorithms and Applications 2000 Springer-Verlag
31. D. Salomon Data Compression The Complete Reference 2004 Springer-Verlag
32. J.M. Schmidt, Interval stabbing problems in small integer ranges, in: Proceedings of the 20th ISAAC, 2009, pp. 163-172.
33. K. Sadakane, G. Navarro, Fully-functional succinct trees, in: Proceedings of the 21st SODA, SIAM, 2010, pp. 134-149.
34. D. Arroyuelo, R. Cánovas, G. Navarro, K. Sadakane, Succinct trees in practice, in: Proceedings of the 12th ALENEX, SIAM, 2010, pp. 84-97.
35. J. Barbay, G. Navarro, Compressed representations of permutations, and applications, in: Proceedings of the 26th STACS, 2009, pp. 111-122.
36. M.L. Fredman On computing the length of longest increasing subsequences Discrete Mathematics 11 1 1975 29 35
37. -tree an efficient and robust access method for points and rectangles SIGMOD Record 19 2 1990 322 331
38. R. González, and G. Navarro Rank/select on dynamic compressed sequences and applications Theoretical Computer Science 410 2008 4414 4422