Efficient similarity search by reducing I/O with compressed sketches

2009 2nd International Workshop on Similarity Search and Applications, SISAP 2009

Volumn , Issue , 2009, Pages 30-38

  Müller Molina, Arnoldo José ^a   Shinohara, Takeshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Compression; k nearest neighbor; Similarity search; Sketch

Indexed keywords

BIT-STRINGS; DATABASE OBJECTS; DISTANCE COMPUTATION; EARLY TERMINATION; ENCODINGS; EXPERIMENTAL EVALUATION; HIGH-DIMENSIONAL; INDEXING METHODS; K-NEAREST NEIGHBORS; METRIC SPACES; ORDER OF MAGNITUDE; RUN LENGTH; SEARCH TIME; SIMILARITY SEARCH;

INDEXING (OF INFORMATION); MOTION COMPENSATION; SET THEORY; TOPOLOGY;

HAMMING DISTANCE;

EID: 70450216499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SISAP.2009.22     Document Type: Conference Paper

References (33)

1. M. M. Gonzalez and T. Endo, "Tense and mood decision with similarity search in japanese to spanish machine translation," in IMECS, 2009, pp. 86-91.
2. A. J. Müller-Molina and T. Shinohara, "Fast approximate matching of programs for protecting libre/open source software by using spatial indexes," in SCAM '07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 111-122.
3. H. Samet, Foundations of Multidimensional and Metric Data Structures. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2005.
4. R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in VLDB '98. San Francisco, CA, USA: Morgan Kaufmann Publishers, 1998, pp. 194-205.
5. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi, "Vector approximation based indexing for non-uniform high dimensional data sets," in CIKM '00. New York, NY, USA: ACM, 2000, pp. 202-209.
6. S. Berchtold, C. Böhm, H. V. Jagadish, H. peter Kriegel, and J. S, "Independent quantization: An index compression technique for high-dimensional data spaces," in ICDE. Washington, DC, USA: IEEE Computer Society, 2000, pp. 577-588.
7. E. Chávez and G. Navarro, "A compact space decomposition for effective metric indexing," Pattern Recogn. Lett., vol. 26, no. 9, pp. 1363-1376, 2005.
8. Q. Lv, M. Charikar, and K. Li, "Image similarity search with compact data structures," in CIKM '04. New York, NY, USA: ACM, 2004, pp. 208-217.
9. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Efficient filtering with sketches in the ferret toolkit," in MIR '06. New York, NY, USA: ACM, 2006, pp. 279-288.
10. Z. Wang, W. Dong, W. Josephson, Q. Lv, M. Charikar, and K. Li, "Sizing sketches: a rank-based analysis for similarity search," SIGMETRICS, vol. 35, no. 1, pp. 157-168, 2007.
11. J. Uhlmann, "Satisfying general proximity/similarity queries with metric trees," Inf. proc. letters, vol. 40, no. 4, pp. 175-179, 1991.
12. W. Dong, M. Charikar, and K. Li, "Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces," in SIGIR '08. New York, NY, USA: ACM, 2008, pp. 123-130.
13. E. V. Ruiz, "An algorithm for finding nearest neighbours in (approximately) constant average time," Pattern Recogn. Lett., vol. 4, no. 3, pp. 145-157, 1986.
14. P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search: The Metric Space Approach. Secaucus, NJ, USA: Springer-Verlag, 2005.
15. G. R. Hjaltason and H. Samet, "Index-driven similarity search in metric spaces (survey article)," ACM Trans. Database Syst., vol. 28, no. 4, pp. 517-580, 2003.
16. E. Chavez, G. Navarro, R. Baeza-Yates, and J. L. Marroquin, "Searching in metric spaces," ACM Comput. Surv., vol. 33, no. 3, pp. 273-321, 2001.
17. J. A. Orenstein, "Redundancy in spatial databases," SIGMOD Rec., vol. 18, no. 2, pp. 295-305, 1989.
18. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula, "D-index: Distance searching index for metric data sets," Multimedia Tools Appl., vol. 21, no. 1, pp. 9-33, 2003.
19. E. Chávez, K. Figueroa, and G. Navarro, "Effective proximity retrieval by ordering permutations," IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), vol. 30, no. 9, pp. 1647-1658, 2008.
20. C. Faloutsos and K.-I. Lin, "Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets," in SIGMOD. New York, USA: ACM, 1995, pp. 163-174.
21. T. Shinohara, J. Chen, and H. Ishizaka, "H-map: A dimension reduction mapping for approximate retrieval of multidimensional data," in DS '99. London, UK: Springer-Verlag, 1999, pp. 299-305.
22. T. Shinohara and H. Ishizaka, "On dimension reduction mappings for approximate retrieval of multi-dimensional data," in Progress in Discovery Science. London, UK: Springer-Verlag, 2002, pp. 224-231.
23. G. R. Hjaltason and H. Samet, "Properties of embedding methods for similarity searching in metric spaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 5, pp. 530-549, 2003.
24. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in VLDB '99. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1999, pp. 518-529.
25. C. Faloutsos and S. Christodoulakis, "Signature files: an access method for documents and its analytical performance evaluation," ACM Trans. Inf. Syst., vol. 2, no. 4, pp. 267-288, 1984.
26. A. Davidson, J. Anvik, and M. A. Nascimento, "Parallel traversal of signature trees for fast cbir," in MULTIMEDIA '01. New York, NY, USA: ACM, 2001, pp. 6-9.
27. B. Bustos, G. Navarro, and E. Chávez, "Pivot selection techniques for proximity searching in metric spaces," Pattern Recogn. Lett., vol. 24, no. 14, pp. 2357-2366, 2003.
28. K. Wu, E. J. Otoo, and A. Shoshani, "An efficient compression scheme for bitmap indices," University of California, Berkeley, Tech. Rep., 2004.
29. N. Ziviani, E. S. de Moura, G. Navarro, and R. Baeza-Yates, "Compression: A key for next-generation text retrieval systems," Computer, vol. 33, no. 11, pp. 37-44, 2000.
30. P. Elias, "Universal codeword sets and representations of the integers," IEEE Transactions on Information Theory, vol. 21, no. 2, pp. 194-203, 1975.
31. A. J. Müller-Molina, K. Hirata, and T. Shinohara, "A tree distance function based on multi-sets," in ALSIP'08, PAKDD Workshops, 2008, pp. 90-100.
32. A. J. Müller-Molina and T. Shinohara, "On approximate matching of programs for protecting libre software," in CASCON '06. New York: ACM Press, 2006, pp. 275-289.
33. C. Traina, Jr., A. J. M. Traina, B. Seeger, and C. Faloutsos, "Slim-trees: High performance metric trees minimizing overlap between nodes," in EDBT '00. London, UK: Springer-Verlag, 2000, pp. 51-65.