{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:46Z","timestamp":1750308826763,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSPATIAL Special"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:p>Similarity is a central notion throughout human lives and it will soon become the prevalent strategy for dealing with digital content also in computer systems. But the exponential growth of data makes the scalability and performance issues serious matters of concern. Contemporary decentralized media of mass communication allowing cooperative and collaborative practices enable users autonomously contribute to production of global media, whose elements are in fact related by numerous multi-facet links of similarity. As an example, consider the sites like Flickr, YouTube, or Facebook that host user-contributed heterogeneous content for a variety of events. Accordingly, the core ability of future data processing systems is the similarity management of large and ever growing volumes of data. In a simplified way, the real-life performance can be constrained from two points of view: (1) the query response time, and (2) the query execution throughput, i.e. the number of queries processed per a unit of time. Typically, the query response time should be on-line, say less than one second, but the query execution throughput can even be expected in hundreds or thousands in case of large-scale web applications.<\/jats:p>","DOI":"10.1145\/1862413.1862421","type":"journal-article","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T11:55:58Z","timestamp":1285156558000},"page":"28-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-life performance of metric searching"],"prefix":"10.1145","volume":"2","author":[{"given":"Vlastislav","family":"Dohnal","sequence":"first","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1146847.1146867"},{"key":"e_1_2_1_2_1","first-page":"426","volume-title":"VLDB","author":"Ciaccia P.","year":"1997","unstructured":"}} P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In VLDB , pages 426 -- 435 . Morgan Kaufmann , 1997 . }}P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426--435. Morgan Kaufmann, 1997."},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1145\/1327452.1327492"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1023\/A:1025026030880"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1007\/s10619-009-7047-6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1145\/1010614.1010619"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1145\/1571941.1571970"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1145\/1571941.1572160"},{"key":"e_1_2_1_9_1","volume-title":"Series in Data Management Systems. Morgan Kaufmann","author":"Samet H.","year":"2006","unstructured":"}} H. Samet . Foundations of Multidimensional And Metric Data Structures . Series in Data Management Systems. Morgan Kaufmann , 2006 . }}H. Samet. Foundations of Multidimensional And Metric Data Structures. Series in Data Management Systems. Morgan Kaufmann, 2006."},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1109\/ICDE.2008.4497577"},{"key":"e_1_2_1_11_1","volume-title":"DATESO","volume":"98","author":"Skopal T.","year":"2004","unstructured":"}} T. Skopal . Pivoting M-tree : A metric access method for efficient similarity search . In DATESO , volume 98 . Technical University of Aachen , 2004 . }}T. Skopal. Pivoting M-tree: A metric access method for efficient similarity search. In DATESO, volume 98. Technical University of Aachen, 2004."},{"key":"e_1_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"EDBT","author":"Traina C.","year":"2000","unstructured":"}} C. Traina , Jr., A. J. M. Traina , B. Seeger , and C. Faloutsos . Slim-Trees: High performance metric trees minimizing overlap between nodes . In EDBT , volume 1777 of Lecture Notes in Computer Science , pages 51 -- 65 . Springer , 2000 . }}C. Traina, Jr., A. J. M. Traina, B. Seeger, and C. Faloutsos. Slim-Trees: High performance metric trees minimizing overlap between nodes. In EDBT, volume 1777 of Lecture Notes in Computer Science, pages 51--65. Springer, 2000."},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1145\/1807167.1807222"},{"key":"e_1_2_1_14_1","series-title":"Advances in Database Systems","volume-title":"Similarity Search: The Metric Space Approach","author":"Zezula P.","year":"2005","unstructured":"}} P. Zezula , G. Amato , V. Dohnal , and M. Batko . Similarity Search: The Metric Space Approach , volume 32 of Advances in Database Systems . Springer , 2005 . }}P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity Search: The Metric Space Approach, volume 32 of Advances in Database Systems. Springer, 2005."},{"key":"e_1_2_1_15_1","first-page":"147","volume-title":"RIDE","author":"Zezula P.","year":"1998","unstructured":"}} P. Zezula , P. Savino , F. Rabitti , G. Amato , and P. Ciaccia . Processing M-trees with parallel resources . In RIDE , pages 147 -- 154 . IEEE, 1998 . }}P. Zezula, P. Savino, F. Rabitti, G. Amato, and P. Ciaccia. Processing M-trees with parallel resources. In RIDE, pages 147--154. IEEE, 1998."}],"container-title":["SIGSPATIAL Special"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1862413.1862421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1862413.1862421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:55Z","timestamp":1750278415000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1862413.1862421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.1145\/1862413.1862421"],"URL":"https:\/\/doi.org\/10.1145\/1862413.1862421","relation":{},"ISSN":["1946-7729"],"issn-type":[{"type":"electronic","value":"1946-7729"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"2010-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}