{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:46:33Z","timestamp":1743032793443,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642155758"},{"type":"electronic","value":"9783642155765"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15576-5_23","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T15:16:15Z","timestamp":1284563775000},"page":"289-304","source":"Crossref","is-referenced-by-count":2,"title":["Exact and Efficient Proximity Graph Computation"],"prefix":"10.1007","author":[{"given":"Michail","family":"Kazimianec","sequence":"first","affiliation":[]},{"given":"Nikolaus","family":"Augsten","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Mazeika, A., B\u00f6hlen, M.H.: Cleansing databases of misspelled proper nouns. In: CleanDB (2006)","key":"23_CR1"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/ICDE.2008.4497434","volume-title":"ICDE 2008: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering","author":"C. Li","year":"2008","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE 2008: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pp. 257\u2013266. IEEE Computer Society, Los Alamitos (2008)"},{"key":"23_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"C.D. Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge Univ. Press, Cambridge (2008)"},{"issue":"4","key":"23_CR4","first-page":"28","volume":"24","author":"L. Gravano","year":"2001","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Pietarinen, L., Srivastava, D.: Using q-grams in a dbms for approximate string processing. IEEE Data Eng. Bull.\u00a024(4), 28\u201334 (2001)","journal-title":"IEEE Data Eng. Bull."},{"unstructured":"Li, C., Wang, B., Yang, X.: Vgram: Improving performance of approximate queries on string collections using variable-length grams. In: VLDB (2007)","key":"23_CR5"},{"key":"23_CR6","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady\u00a010, 707 (1966)","journal-title":"Soviet Physics Doklady"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms\u00a010(2), 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0001-8708(76)90202-4","volume":"20","author":"M.S. Waterman","year":"1976","unstructured":"Waterman, M.S., Smith, T.F., Beyer, W.A.: Some biological sequence metrics. Advances in Mathematics\u00a020(3), 367\u2013387 (1976)","journal-title":"Advances in Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., Fienberg, S.: Adaptive name matching in information integration. In: IEEE Intelligent Systems (2003)","key":"23_CR9","DOI":"10.1109\/MIS.2003.1234765"},{"issue":"1","key":"23_CR10","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 Comput. Surv.\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Motwani, R.: Robust identification of fuzzy duplicates. In: International Conference on Data Engineering, pp. 865\u2013876 (2005)","key":"23_CR11","DOI":"10.1109\/ICDE.2005.125"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1367497.1367516","volume-title":"WWW 2008: Proceeding of the 17th International Conference on World Wide Web","author":"C. Xiao","year":"2008","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW 2008: Proceeding of the 17th International Conference on World Wide Web, pp. 131\u2013140. ACM, New York (2008)"},{"key":"23_CR13","first-page":"491","volume-title":"VLDB 2001: Proceedings of the 27th International Conference on Very Large Data Bases","author":"L. Gravano","year":"2001","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: VLDB 2001: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 491\u2013500. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"23_CR14","first-page":"814","volume-title":"ICDE","author":"N. Augsten","year":"2008","unstructured":"Augsten, N., B\u00f6hlen, M.H., Dyreson, C.E., Gamper, J.: Approximate joins for data-centric XML. In: ICDE, pp. 814\u2013823. IEEE, Los Alamitos (2008)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15576-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:19:43Z","timestamp":1740518383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-15576-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155758","9783642155765"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15576-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}