{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T18:10:34Z","timestamp":1790705434156,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540408062","type":"print"},{"value":"9783540452270","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45227-0_48","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T19:57:53Z","timestamp":1277236673000},"page":"484-493","source":"Crossref","is-referenced-by-count":39,"title":["Similarity Join in Metric Spaces Using eD-Index"],"prefix":"10.1007","author":[{"given":"Vlastislav","family":"Dohnal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"48_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Chavez","year":"2001","unstructured":"Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.: Searching in Metric Spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: D-Index: Distance Searching Index for Metric Data Sets. In: ACM Multimedia Tools and Applications 21(1) (September 2003) (to appear)","DOI":"10.1023\/A:1025026030880"},{"key":"48_CR3","unstructured":"Dohnal, V., Gennaro, C., Zezula, P.: A Metric Index for Approximate Text Management. In: Proceedings of IASTED International Conference on Information Systems and Databases (ISDB 2002), Tokyo, Japan, pp. 37\u201342 (2002)"},{"key":"48_CR4","unstructured":"Galhardas, H., Florescu, D., Shasha, D., Simon, E., Saita, C.A.: Declarative Data Cleaning: Language, Model, and Algorithms. In: Proceedings of the 27th VLDB Conference, Rome, Italy, pp. 371\u2013380 (2001)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Gennaro, C., Savino, P., Zezula, P.: Similarity Search in Metric Databases through Hashing. In: Proceedings of ACM Multimedia 2001 Workshops, Ottawa, Canada, pp. 1\u20135 (October 2001)","DOI":"10.1145\/500933.500935"},{"key":"48_CR6","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate String Joins in a Database (Almost) for Free. In: Proceedings of the 27th VLDB Conference, Rome, Italy, pp. 491\u2013500 (2001)"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML Joins. In: Proceedings of ACM SIGMOD 2002, Madison,Wisconsin, June 3\u20136 (2002)","DOI":"10.1145\/564724.564725"},{"issue":"4","key":"48_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Surveys\u00a024(4), 377\u2013439 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"48_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"48_CR10","unstructured":"Yianilos, P.N.: 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","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45227-0_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:07:59Z","timestamp":1558278479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45227-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408062","9783540452270"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45227-0_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}