{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:35:58Z","timestamp":1773329758505,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T00:00:00Z","timestamp":1352160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11042-012-1271-1","type":"journal-article","created":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T16:49:55Z","timestamp":1352134195000},"page":"1333-1362","source":"Crossref","is-referenced-by-count":56,"title":["MI-File: using inverted files for scalable approximate similarity search"],"prefix":"10.1007","volume":"71","author":[{"given":"Giuseppe","family":"Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"Savino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,6]]},"reference":[{"key":"1271_CR1","doi-asserted-by":"crossref","unstructured":"Amato G, Savino P (2008) Approximate similarity search in metric spaces using inverted files. In: InfoScale \u201908: proceedings of the 3rd international conference on scalable information systems, ICST, pp\u00a01\u201310","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"issue":"2","key":"1271_CR2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/763693.763696","volume":"21","author":"G Amato","year":"2003","unstructured":"Amato G, Rabitti F, Savino P, Zezula P (2003) Region proximity in metric spaces and its use for approximate similarity search. ACM Trans Inf Syst 21(2):192\u2013227","journal-title":"ACM Trans Inf Syst"},{"issue":"1","key":"1271_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communication of the ACM 51(1):117\u2013122. doi: 10.1145\/1327452.1327494","journal-title":"Communication of the ACM"},{"key":"1271_CR4","doi-asserted-by":"crossref","unstructured":"Bawa M, Condie T, Ganesan P (2005) Lsh forest: self-tuning indexes for similarity search. In: WWW (International World Wide Web Conference), ACM Press, pp 651\u2013660. doi: 10.1145\/1060745.1060840","DOI":"10.1145\/1060745.1060840"},{"key":"1271_CR5","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? In: Beeri C, Buneman P (eds) Database theory\u2014ICDT \u201999. Proceedings of the 7th international conference, Jerusalem, Israel, 10\u201312 Jan 1999. Ser. Lecture notes in computer science, vol\u00a01540. Springer, pp\u00a0217\u2013235"},{"key":"1271_CR6","unstructured":"Bolettieri P, Esuli A, Falchi F, Lucchese C, Perego R, Rabitti F (2009) Enabling content-based image retrieval in very large digital libraries. In: Second workshop on very large digital libraries, pp\u00a043\u201350"},{"key":"1271_CR7","doi-asserted-by":"crossref","unstructured":"Bozkaya T, \u00d6zsoyoglu, ZM (1997) Distance-based indexing for high-dimensional metric spaces. In: SIGMOD conference, pp\u00a0357\u2013368","DOI":"10.1145\/253260.253345"},{"key":"1271_CR8","unstructured":"Brin S (1995) Near neighbor search in large metric spaces. In: VLDB, pp\u00a0574\u2013584"},{"key":"1271_CR9","doi-asserted-by":"crossref","unstructured":"Ciaccia P, Patella M (2000) Pac nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces. In: ICDE, pp\u00a0244\u2013255","DOI":"10.1109\/ICDE.2000.839417"},{"key":"1271_CR10","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Jarke M, Carey MJ, Dittrich KR, Lochovsky FH, Loucopoulos P, Jeusfeld MA (eds) VLDB\u201997. Proceedings of 23rd international conference on very large data bases, Athens, Greece, 25\u201329 Aug 1997. Morgan Kaufmann, pp\u00a0426\u2013435"},{"key":"1271_CR11","volume-title":"Lecture notes\u2014monograph series, vol\u00a011","author":"P Diaconis","year":"1988","unstructured":"Diaconis P (1988) Group representations in probability and statistics. In: Ser. IMS Lecture notes\u2014monograph series, vol\u00a011. Institute of Mathematical Statistics, Hawyard, CA"},{"key":"1271_CR12","unstructured":"Egecioglu \u00d6, Ferhatosmanoglu H (2000) 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, 6\u201311 Nov 2000. ACM Press, pp\u00a0219\u2013226"},{"issue":"5","key":"1271_CR13","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/j.ipm.2010.11.011","volume":"48","author":"A Esuli","year":"2012","unstructured":"Esuli A (2012) Use of permutation prefixes for efficient and scalable approximate similarity search. Inf Process Manag 48(5):889\u2013902","journal-title":"Inf Process Manag"},{"key":"1271_CR14","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Lin K-I (1995) FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Carey MJ, Schneider DA (eds) Proceedings of the 18th ACM international conference on management of data (SIGMOD 1995), San Jose, California, USA, 22\u201325 May 1995. ACM Press, pp\u00a0163\u2013174","DOI":"10.1145\/223784.223812"},{"key":"1271_CR15","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H, Tuncel E, Agrawal D, Abbadi AE (2001) Approximate nearest neighbor searching in multimedia databases. In: Proceedings of the 17th international conference on data engineering, Heidelberg, Germany, 2\u20136 April 2001. IEEE Computer Society, pp 503\u2013511","DOI":"10.1109\/ICDE.2001.914864"},{"key":"1271_CR16","unstructured":"Flickr (2012). http:\/\/www.flickr.com\/ . Accessed 26 Nov 2012"},{"key":"1271_CR17","series-title":"Ser. Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-15464-5_8","volume-title":"Research and advanced technology for digital libraries","author":"C Gennaro","year":"2010","unstructured":"Gennaro C, Amato G, Bolettieri P, Savino P (2010) An approach to content-based image retrieval based on the lucene search engine library. In: Lalmas M, Jose J, Rauber A, Sebastiani F, Frommholz I (eds) Research and advanced technology for digital libraries. Ser. Lecture notes in computer science, vol\u00a06273. Springer, Berlin, pp 55\u201366"},{"issue":"9","key":"1271_CR18","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Ch\u00e1vez","year":"2008","unstructured":"Ch\u00e1vez E, Figueroa K, Navarro G (2008) Effective proximity retrieval by ordering permutations. IEEE Trans Pattern Anal Mach Intell 30(9):1647\u20131658","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"1271_CR19","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces. ACM Trans Database Syst 28(4):517\u2013580","journal-title":"ACM Trans Database Syst"},{"key":"1271_CR20","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. 30th symposium on theory of computing, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"1271_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60(2):91\u2013110","journal-title":"Int J Comput Vis"},{"key":"1271_CR22","unstructured":"Mpeg-7 (2004) ISO\/IEC JTC1\/SC29\/WG11N6828. http:\/\/www.chiariglione.org\/mpeg\/standards\/mpeg-7\/mpeg-7.htm . Accessed 26 Nov 2012"},{"key":"1271_CR23","unstructured":"Ogras \u00dcY, Ferhatosmanoglu H (2003) 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, 3\u20138 Nov 2003. ACM Press, pp\u00a099\u2013107"},{"issue":"1","key":"1271_CR24","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.jda.2008.09.014","volume":"7","author":"M Patella","year":"2009","unstructured":"Patella M, Ciaccia P (2009) Approximate similarity search: a multi-faceted problem. J Discrete Algorithms 7(1):36\u201348","journal-title":"J Discrete Algorithms"},{"key":"1271_CR25","unstructured":"Salton G, McGill MJ (1983) Introduction to modern information retrieval. McGraw-Hill"},{"key":"1271_CR26","unstructured":"SAPIR: Search In Audio Visual Content Using Peer-to-peer IR (2009) Project Web Site. http:\/\/sysrun.haifa.il.ibm.com\/sapir\/ . Accessed 26 Nov 2012"},{"key":"1271_CR27","unstructured":"Seward HH (1954) Information sorting in the application of electronic digital computers to business operations. Master Thesis, MIT"},{"issue":"5","key":"1271_CR28","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/359581.359599","volume":"20","author":"MB Shapiro","year":"1977","unstructured":"Shapiro MB (1977) The choice of reference points in best-match file searching. Commun ACM 20(5):339\u2013343","journal-title":"Commun ACM"},{"key":"1271_CR29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jda.2008.09.011","volume":"7","author":"M Skala","year":"2009","unstructured":"Skala M (2009) Counting distance permutations. J Discrete Algorithms 7:49\u201361. [Online]. Available: http:\/\/portal.acm.org\/citation.cfm?id=1501025.1501131","journal-title":"J Discrete Algorithms"},{"issue":"4","key":"1271_CR30","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40(4):175\u2013179","journal-title":"Inf Process Lett"},{"key":"1271_CR31","doi-asserted-by":"crossref","unstructured":"Wang X, Wang JT-L, Lin K-I, Shasha D, Shapiro BA, Zhang K (2000) An index structure for data mining and clustering. In: Knowledge and information systems, vol\u00a02. Springer, pp 161\u2013184","DOI":"10.1007\/s101150050009"},{"key":"1271_CR32","doi-asserted-by":"crossref","unstructured":"Weber R, B\u00f6hm K (2000) Trading quality for time with nearest neighbor search. In: Proceedings of the 7th International Conference on Extending Database Technology, pp 21\u201335","DOI":"10.1007\/3-540-46439-5_2"},{"key":"1271_CR33","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Gupta A, Shmueli O, Widom J (eds) VLDB\u201998. Proceedings of 24rd international conference on very large data bases, New York City, New York, USA, 24\u201327 Aug 1998. Morgan Kaufmann, pp 194\u2013205"},{"key":"1271_CR34","unstructured":"Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: NIPS, pp 1753\u20131760"},{"key":"1271_CR35","unstructured":"Witten IH, Moffat A, Bell TC (1999) Bell: managing gigabytes: compressing and indexing documents and images, 2nd edn. Morgan Kaufmann"},{"key":"1271_CR36","unstructured":"Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA, pp 311\u2013321"},{"key":"1271_CR37","doi-asserted-by":"crossref","unstructured":"Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search\u2014the metric space approach. In: Ser. advances in database systems, vol\u00a032. Springer","DOI":"10.1007\/0-387-29151-2"},{"issue":"4","key":"1271_CR38","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s007780050069","volume":"7","author":"P Zezula","year":"1998","unstructured":"Zezula P, Savino P, Amato G, Rabitti F (1998) Approximate similarity retrieval with m-trees. VLDB J 7(4):275\u2013293","journal-title":"VLDB J"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-012-1271-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-012-1271-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-012-1271-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T07:49:04Z","timestamp":1562312944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-012-1271-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,6]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1271"],"URL":"https:\/\/doi.org\/10.1007\/s11042-012-1271-1","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,6]]}}}