{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T14:40:06Z","timestamp":1743950406765,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321528"},{"type":"electronic","value":"9783642321535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32153-5_6","type":"book-chapter","created":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T13:30:43Z","timestamp":1344000643000},"page":"70-84","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Similarity Search in Metric Spaces with Cluster Reduction"],"prefix":"10.1007","author":[{"given":"Luis G.","family":"Ares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nieves R.","family":"Brisaboa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Ord\u00f3\u00f1ez Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Pedreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033, 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity search. The metric space approach. Advances in Database Systems, vol.\u00a032. Springer (2006)","key":"6_CR2","DOI":"10.1007\/0-387-29151-2"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2006","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions on Database Systems\u00a028(4), 517\u2013580 (2006)","journal-title":"ACM Transactions on Database Systems"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I. Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering\u00a09, 631\u2013634 (1983)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Procs. of Conf. on Very Large Databases (VLDB 1995), pp. 574\u2013584. Morgan Kaufmann Publishers (1995)","key":"6_CR6"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0306-4379(87)90041-X","volume":"12","author":"F. Dehne","year":"1987","unstructured":"Dehne, F., Noltemeier, H.: Voronoi trees and clustering problems. Information Systems\u00a012(2), 171\u2013175 (1987)","journal-title":"Information Systems"},{"doi-asserted-by":"crossref","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. In: Procs. of String Processing and Information Retrieval (SPIRE 1999), pp. 141\u2013148. IEEE CS Press (1999)","key":"6_CR8","DOI":"10.1109\/SPIRE.1999.796589"},{"doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Procs. of Conf. on Very Large Databases (VLDB 1997), pp. 426\u2013435. ACM Press (1997)","key":"6_CR9","DOI":"10.1145\/275487.275495"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. Traina Jr.","year":"2000","unstructured":"Traina Jr., C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-Trees: High Performance Metric Trees Minimizing Overlap between Nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 51\u201365. Springer, Heidelberg (2000)"},{"issue":"9","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters\u00a026(9), 1363\u20131376 (2005)","journal-title":"Pattern Recognition Letters"},{"doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: Proc. of the ACM Conf. on Management of Data (SIGMOD 1997), pp. 357\u2013368. ACM Press (1997)","key":"6_CR12","DOI":"10.1145\/253262.253345"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D. Novak","year":"2009","unstructured":"Novak, D., Batko, M., Zezula, P.: Metric index: An efficient and scalable solution for precise and approximate similarity search. Information Systems\u00a036(4), 721\u2013733 (2009)","journal-title":"Information Systems"},{"doi-asserted-by":"crossref","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1sel, V.: Pm-tree: Pivoting metric tree for similarity search in multimedia databases. In: Procs. of Advances in Database Systems (ADBIS 2004), Local Procs., pp. 803\u2013815 (2004)","key":"6_CR14","DOI":"10.1007\/11408079_73"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32153-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T14:04:10Z","timestamp":1743948250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32153-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321528","9783642321535"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32153-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}