The many facets of approximate similarity search

Proceedings - First International Workshop on Similarity Search and Applications, SISAP 2008

Volumn , Issue , 2008, Pages 10-21

  Patella, Marco ^a   Ciaccia, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE QUERIES; SIMILARITY QUERIES;

APPROXIMATION THEORY; INFORMATION DISSEMINATION; QUERY PROCESSING; SCHEDULING;

ONLINE SEARCHING;

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

References (32)

1. G. Amato, F. Rabitti, P. Savino, and P. Zezula. Region proximity in metric spaces and its use for approximate similarity search. ACM Transactions on Information Systems, 21(2):192-227, 2003.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45(6):891-923, Nov. 1998.
3. I. Bartolini, P. Ciaccia, and F. Waas. FeedbackBypass: A new approach to interactive similarity query processing. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB 2001), pages 201-210, Rome, Italy, Sept. 2001. Morgan Kaufmann.
4. K. P. Bennett, U. M. Fayyad, and D. Geiger. Density-based indexing for approximate nearest-neighbor queries. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 1999), pages 233-243, San Diego, CA, Aug. 1999. ACM Press.
5. S. Berchtold, C. Böhm, D. A. Keim, and H.-P. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'97), pages 78-86, Tucson, AZ, May 1997. ACM Press.
6. S.-A. Berrani, L. Amsaleg, and P. Gros. Approximate searches: k-neighbors + precision. In Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, pages 24-31, New Orleans, LA, Nov. 2003. ACM Press.
7. R. Bueno, A. J. M. Traina, and C. Traina, Jr. Genetic algorithms for approximate similarity queries. Data and Knowledge Engineering, 62(3):459-482, Sept. 2007. MS, RCEP, NG, IA.
8. B. Bustos and G. Navarro. Probabilistic proximity searching algorithms based on compact partitions. Journal of Discrete Algorithms, 2(1):115-134, 2004.
9. V. Castelli, A. Thomasian, and C-S. Li. CSVD: Clustering and singular value decomposition for approximate similarity search in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 15(3):671-685, 2003.
10. E. Chavez and G. Navarro. A probabilistic spell for the curse of dimensionality. In Proceedings of the 3rd International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001), volume 2153 of Lecture Notes in Com-puter Science, pages 147-160, Washington, DC, Jan. 2001. Springer.
11. E. Chavez and G. Navarro. Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Information Processing Letters, 85(1):39-46, Jan. 2003.
12. P. Ciaccia and M. Patella. PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In Proceedings of the 16th International Conference on Data Engineering (ICDE 2000), pages 244-255, San Diego, CA, Mar. 2000. IEEE Computer Society.
13. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB'97), pages 426-435, Athens, Greece, Aug. 1997. Morgan Kaufmann.
14. P. Ciaccia, M. Patella, and P. Zezula. A cost model for similarity queries in metric spaces. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'98), pages 59-68, Seattle, WA, June 1998. ACM Press.
15. C. Faloutsos and K.-I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 163-174, San Jose, CA, June 1995. ACM Press.
16. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proceedings of the 17th International Conference on Data Engineering (ICDE 2001), pages 503-511, Heidelberg, Germany, Apr. 2001. IEEE Computer Society.
17. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Proceedings of 25th International Conference on Very Large Data Bases (VLDB'99), pages 518-529, Edinburgh, Scotland, UK, Sept. 1999. Morgan Kaufmann.
18. J. Goldstein and R. Ramakrishnan. Contrast plots and P-Sphere trees: Space vs. time in nearest neighbor searches. In Proceedings of 26th International Conference on Very Large Data Bases (VLDB 2000), pages 429-440, Cairo, Egypt, Sept. 2000. Morgan Kaufmann.
19. A. Hinneburg, C. C. Aggarwal, and D. A. Keim. What is the nearest neighbor in high dimensional spaces? In Proceedings of 26th International Conference on Very Large Data Bases (VLDB 2000), pages 506-515, Cairo, Egypt, Sept. 2000. Morgan Kaufmann.
20. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems, 28(4):517-580, Dec. 2003.
21. N. Katayama and S. Satoh. Distinctiveness-sensitive nearest neighbor search for efficient similarity retrieval of multimedia information. In Proceedings of the 17th International Conference on Data Engineering (ICDE 2001), pages 493-502, Heidelberg, Germany, Apr. 2001. IEEE Computer Society.
22. C. Li, E. Y. Chang, H. Garcia-Molina, and G. Wiederhold. Clustering for approximate similarity search in highdimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 14(4):792-808, 2002.
23. M. V. Mannino, P. Chu, and T. Sager. Statistical profile estimation in database systems. ACM Computing Surveys, 20(3):191-221, Sept. 1988.
24. S. Pramanik, J. Li, and J. Ruan. Performance analysis of AB-tree. In Proceedings of the 2000 IEEE International Conference on Multimedia and Expo (ICME), volume III, pages 1701-1704, New York, NY, Aug. 2000. IEEE Computer Society.
25. S. Santini and R. Jain. Beyond query by example. In Proceedings of the 6th ACM International Conference on Multimedia '98, pages 345-350, Bristol, UK, Sept. 1998. ACM Press.
26. T. Seidl and H.-P. Kriegel. Efficient user-adaptable similarity search in large multimedia databases. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB'97), pages 506-515, Athens, Greece, Aug. 1997. Morgan Kaufmann.
27. E. Tuncel, H. Ferhatosmanoglu, and K. Rose. VQ-index: an index structure for similarity searching in multimedia databases. In Proceedings of the 10th ACM International Conference on Multimedia 2002, pages 543-552, Juan les Pins, France, Dec. 2002. ACM Press.
28. S. Volmer. Fast approximate nearest-neighbor queries in metric feature spaces by buoy indexing. In Proceedings of the 5th International Conference on Recent Advances in Visual Information Systems (VISUAL 2002), volume 2314 of Lecture Notes in Computer Science, pages 36-49, Hsin Chu, Taiwan, Mar. 2002. Springer.
29. J. T.-L. Wang, X. Wang, D. Shasha, and K. Zhang. MetricMap: an embedding technique for processing distancebased queries in metric spaces. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 35(5):973-987, 2005.
30. R. Weber and K. Böhm. Trading quality for time with nearest-neighbor search. In Proceedings of the 7th International Conference on Extending Database Technology (EDBT 2000), volume 1777 of Lecture Notes in Computer Science, pages 21-35, Konstanz, Germany, Mar. 2000. Springer.
31. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB'98), pages 194-205, New York City, NY, Aug. 1998. Morgan Kaufmann.
32. P. Zezula, P. Savino, G. Amato, and F. Rabitti. Approximate similarity retrieval with M-trees. The VLDB Journal, 7(4):275-293, 1998.