A new Point Access Method based on wavelet trees

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

Volumn 5833 LNCS, Issue , 2009, Pages 297-306

  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

Point access methods; Spatial index; Wavelet tree

Indexed keywords

ACCESS METHODS; INDEX STRUCTURE; MAIN MEMORY; NEW INDICES; SEARCH EFFICIENCY; SECONDARY MEMORIES; SPATIAL INDICES; SPATIAL OBJECTS; TWO-DIMENSION; WAVELET TREE;

IMAGE COMPRESSION;

INFORMATION RETRIEVAL;

EID: 78649937832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04947-7_36     Document Type: Conference Paper

References (16)

1. Gaede, V., Günther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170-231 (1998).
2. 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).
3. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. of ACM-SIAM SODA 2003, pp. 841-850 (2003).
4. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD 1984, pp. 47-57. ACM Press, New York (1984).
5. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer-Verlag New York, Inc., Heidelberg (2005).
6. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509-517 (1975).
7. 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).
8. 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).
9. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996).
10. 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).
11. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. of 9th ALENEX (2007).
12. Hadjieleftheriou, M.: Spatial index library, http://research.att.com/ ~marioh/spatialindex/(retrieved March 2009).
13. 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).
14. 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).
15. Tagliasacchi, A.: Kd-tree for matlab, http://www.mathworks.com/ matlabcentral/fileexchange/21512 (retrieved March 2009).
16. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACMComput. Surv. 39(1) (2007).