A fun application of compact data structures to indexing geographic data

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

Volumn 6099 LNCS, Issue , 2010, Pages 77-88

  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

Geographic data; MBR; Range query; Wavelet tree

Indexed keywords

CLASSICAL APPROACH; COMPACT DATA STRUCTURE; GEOGRAPHIC DATA; GEOGRAPHIC RANGES; INDEXING STRUCTURES; LOGARITHMIC TIME; MBR; MEMORY HIERARCHY; MINIMUM BOUNDING RECTANGLE; RANGE QUERY; SPATIAL ACCESS METHODS; TREE-BASED STRUCTURES; WAVELET TREE;

ALGORITHMS; DECISION TREES; IMAGE COMPRESSION; INDEXING (OF INFORMATION); PLANT EXTRACTS;

DATA STRUCTURES;

EID: 79956295703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13122-6_10     Document Type: Conference Paper

References (15)

1. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. 26th STACS 2009, pp. 111-122 (2009)
2. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Record 19(2), 322-331 (1990)
3. Brisaboa, N.R., Luaces, M.R., Navarro, G., Seco, D.: A new point access method based on wavelet trees. In: Proc. SeCoGIS 2009. ER 2009 Workshops, pp. 297-306 (2009)
4. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing 17(3), 427-462 (1988)
5. Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics 11(1), 29-35 (1975)
6. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th STOC, pp. 135-143 (1984)
7. Gaede, V., Gnther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170-231 (1998) (Pubitemid 128485203)
8. González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of ank and select queries. In: Proc. 4th WEA (Poster), pp. 27-38 (2005)
9. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th ACM-SIAM SODA, pp. 841-850 (2003)
10. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. SIGMOD, pp. 47-57. ACM Press, New York (1984) (Pubitemid 15469534)
11. Hadjieleftheriou, M.: Spatial index library, http://research.att.com/ ~marioh/spatialindex/ (retrieved March 2009)
12. Leutenegger, S., Lopez, M., Edgington, J.: STR: A simple and efficient algorithm for R-tree packing. In: Proc. 13th ICDE, pp. 497-506 (1997)
13. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Heidelberg (2005)
14. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1) (2007)
15. Salomon, D.: Data Compression: The Complete Reference. Springer, Heidelberg (2004)