{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:50:55Z","timestamp":1759683055928},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540012740"},{"type":"electronic","value":"9783540366188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36618-0_32","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:49:02Z","timestamp":1184586542000},"page":"452-467","source":"Crossref","is-referenced-by-count":11,"title":["Similarity Join in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Vlastislav","family":"Dohnal","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"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Chavez","year":"2001","unstructured":"E. Chavez, G. Navarro, R. Baeza-Yates, and J. Marroquin: Searching in Metric Spaces. ACM Computing Surveys, 33(3):273\u2013321, 2001.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T. Bozkaya","year":"1999","unstructured":"T. Bozkaya and Ozsoyoglu. Indexing Large Metric Spaces for Similarity Search Queries. ACM TODS, 24(3):361\u2013404, 1999.","journal-title":"ACM TODS"},{"key":"32_CR3","unstructured":"P. Ciaccia, M. Patella, and P. Zezula: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proceedings of the 23rd VLDB Conference, pp. 426\u2013435, 1997."},{"key":"32_CR4","unstructured":"V. Dohnal, C. Gennaro, P. Savino, P. Zezula: D-Index: Distance Searching Index for Metric Data Sets. To appear in Multimedia Tools and Applications, Kluwer, 2002."},{"key":"32_CR5","unstructured":"H. Galhardas, D. Florescu, D. Shasha, E. Simon, and C. A. Saita: Declarative Data Cleaning: Language, Model, and Algorithms. Proceedings of the 27th VLDB Conference, Rome, Italy, 2001, pp. 371\u2013380."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"C. Gennaro, P. Savino, and P. Zezula: Similarity Search in Metric Databases through Hashing. Proceedings of ACM Multimedia 2001 Workshops, October 2001, Ottawa, Canada, pp. 1\u20135.","DOI":"10.1145\/500933.500935"},{"key":"32_CR7","unstructured":"L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava: Approximate String Joins in a Database (Almost) for Free. Proceedings of the 27th VLDB Conference, Rome, Italy, 2001, pp. 491\u2013500."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu: Approximate XML Joins. Proceedings of ACM SIGMOD 2002, Madison, Wisconsin, June 3\u20136, 2002","DOI":"10.1145\/564691.564725"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"K. Kukich: Techniques for automatically correcting words in text. ACM Computing Surveys, 1992, 24(4):377\u2013439.","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"G. Navarro: A guided tour to approximate string matching. ACM Computing Surveys, 2001, 33(1): 31\u201388.","journal-title":"ACM Computing Surveys"},{"key":"32_CR11","unstructured":"P. N. Yianilos. Excluded Middle Vantage Point Forests for Nearest Neighbor Search. Tech. rep., NEC Research Institute, 1999, Presented at Sixth DIMACS Implementation Challenge: Nearest Neighbor Searches workshop, January 15, 1999."}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36618-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T13:37:34Z","timestamp":1550410654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36618-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540012740","9783540366188"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36618-0_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}