Approximate Similarity Search in Metric Spaces using Inverted Files

ACM International Conference Proceeding Series

Volumn 2008-June, Issue , 2008, Pages

  Amato, Giuseppe ^a   Savino, Pasquale ^a  

^a ISTI CNR   (Italy)

Author keywords

Access Methods; Approximate Similarity Search

Indexed keywords

TOPOLOGY;

ACCESS METHODS; APPROXIMATE SIMILARITY SEARCH; DISTANCE FUNCTIONS; INVERTED FILES; METRIC SPACES; NEW APPROACHES; REFERENCE OBJECTS; SIMILARITY SEARCH; SIMILARITY SEARCHING;

SET THEORY;

EID: 85133443918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/ICST.INFOSCALE2008.3486     Document Type: Conference Paper

References (21)

1. G. Amato, F. Rabitti, P. Savino, and P. Zezula. Region proximity in metric spaces and its use for approximate similarity search. ACM Trans. Inf. Syst., 21(2):192–227, 2003.
2. S. D. Bay. The uci kdd archive. Irvine, CA: University of California, Department of Information and Computer Science. http://kdd.ics.uci.edu.
3. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is”nearest neighbor” meaningful? In C. Beeri and P. Buneman, editors, Database Theory - ICDT’99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings, volume 1540 of Lecture Notes in Computer Science, pages 217–235. Springer, 1999.
4. P. Ciaccia and M. Patella. Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In ICDE, pages 244–255, 2000.
5. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, VLDB’97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece, pages 426–435. Morgan Kaufmann, 1997.
6. P. Diaconis. Group Representations in Probability and Statistics, volume 11 of IMS Lecture Notes - Monograph Series. Institute of Mathematical Statistics, Hawyard Ca, 1988.
7. Ö. Egecioglu and H. Ferhatosmanoglu. Dimensionality reduction and similarity computation by inner product approximations. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM 2000), McLean, Virginia, USA, November 6-11, 2000, pages 219–226. ACM Press, 2000.
8. C. Faloutsos and K.-I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In M. J. Carey and D. A. Schneider, editors, Proceedings of the 18th ACM International Conference on Management of Data (SIGMOD 1995), San Jose, California, USA, May 22-25, 1995, pages 163–174. ACM Press, 1995.
9. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proceedings of the 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, Germany, pages 503–511. IEEE Computer Society, 2001.
10. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, Boston, MA, pages 47–57, 1984.
11. H. V. Jagadish, A. O. Mendelzon, and T. Milo. Similarity-based queries. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California, pages 36–45. ACM Press, 1995.
12. Ü. Y. Ogras and H. Ferhatosmanoglu. Dimensionality reduction using magnitude and shape approximations. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM 2003), New Orleans, Louisiana, USA, November 3-8, 2003, pages 99–107. ACM Press, 2003.
13. S. Pramanik, S. Alexander, and J. Li. An efficient searching algorithm for approximate nearest neighbor queries in high dimensions. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems (ICMCS 1999), Florence, Italy, June 7-11, 1999, volume 1. IEEE Computer Society, 1999.
14. S. Pramanik, J. Li, J. Ruan, and S. K. Bhattacharjee. Efficient search scheme for very large image databases. In G. B. Beretta and R. Schettini, editors, Proceedings of the International Society for Optical Engineering (SPIE) on Internet Imaging, San Jose, California, USA, January 26, 2000, volume 3964, pages 79–90. The International Society for Optical Engineering, December 1999.
15. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill Book Company, 1983.
16. X. Wang, J. T.-L. Wang, K.-I. Lin, D. Shasha, B. A. Shapiro, and K. Zhang. An index structure for data mining and clustering. In Knowledge and Information Systems, volume 2, pages 161–184. Springer, 2000.
17. R. Weber and K. Böhm. Trading quality for time with nearest neighbor search. In C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, editors, Proceedings of the 7th International Conference on Extending Database Technology (EDBT 2000), Konstanz, Germany, March 27-31, 2000, volume 1777 of Lecture Notes in Computer Science. Springer, 2000.
18. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB’98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, pages 194–205. Morgan Kaufmann, 1998.
19. I. H. Witten, A. Moffat, and T. C. Bell. Bell: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 1999.
20. P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity Search - The Metric Space Approach, volume 32 of Advances in Database Systems. Springer, 2006.
21. P. Zezula, P. Savino, G. Amato, and F. Rabitti. Approximate similarity retrieval with m-trees. VLDB J., 7(4):275–293, 1998.