{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:54:49Z","timestamp":1743072889395,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439838"},{"type":"electronic","value":"9783662439845"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43984-5_16","type":"book-chapter","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T12:57:50Z","timestamp":1404997070000},"page":"217-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hash$$^{ed}$$-Join: Approximate String Similarity Join with Hashing"],"prefix":"10.1007","author":[{"given":"Peisen","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Chaofeng","family":"Sha","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,11]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Wang, W., Xiao, C., Lin, X., Zhang, C.: Efficient approximate entity extraction with edit distance constraints. In: SIGMOD, pp. 759\u2013770 (2009)","DOI":"10.1145\/1559845.1559925"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE, p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"},{"issue":"1","key":"16_CR4","first-page":"933","volume":"1","author":"J Wang","year":"2010","unstructured":"Wang, J., Feng, J., Li, G.: Trie-join: efficient trie-based string similarity joins with edit distance constraints. VLDB 1(1), 933\u2013944 (2010)","journal-title":"VLDB"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Siragusa, E., Weese, D., Knut R.: Scalable string similarity search\/join with approximate seeds and multiple backtracking. In: EDBT\/ICDT, pp. 370\u2013374. ACM (2013)","DOI":"10.1145\/2457317.2457386"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. JACM 21(1), 168\u2013173 (1974)","journal-title":"JACM"},{"key":"16_CR7","unstructured":"Gouda, K., Rashad, M.: Prejoin: an efficient trie-based string similarity join algorithm. In: INFOS, pp. DE\u201337. IEEE (2012)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"16_CR9","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"16_CR10","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, pp. 491\u2013500 (2001)"},{"key":"16_CR11","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings of Compression and Complexity of Sequences, pp. 21\u201329 (1997)"},{"key":"16_CR12","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB, pp. 950\u2013961 (2007)"},{"key":"16_CR13","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2013","unstructured":"Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, New York (2013)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"issue":"1","key":"16_CR15","first-page":"933","volume":"1","author":"C Xiao","year":"2008","unstructured":"Xiao, C., Wang, W., Lin, X.: Ed-Join: an efficient algorithm for similarity joins with edit distance constraints. VLDB 1(1), 933\u2013944 (2008)","journal-title":"VLDB"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Lu, H., Yang, B., Jensen, C.S.: Spatio-temporal joins on symbolic indoor tracking data. In: ICDE, pp. 816\u2013827 (2011)","DOI":"10.1109\/ICDE.2011.5767902"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Lu, J., Lin, C., Wang, W., Li, C., Wang, H.: String similarity measures and joins with synonyms. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2465313"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering? an adaptive framework for similarity join and search. In: SIGMOD, pp. 85\u201396 (2012)","DOI":"10.1145\/2213836.2213847"},{"key":"16_CR19","unstructured":"Deng, D., Li, G., Feng, J., Li, W.-S.: Top-k string similarity search with edit-distance constraints. In: ICDE, pp. 925\u2013936. ICDE (2013)"},{"key":"16_CR20","unstructured":"Zhang, Z., Hadjieleftheriou, M., Ooi, B.C., Srivastava, D.: B$$^{ed}$$-tree: an all-purpose index structure for string similarity search based on edit distance. In: SIGMOD, pp. 915\u2013926 (2010)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43984-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T18:22:56Z","timestamp":1676398976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43984-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439838","9783662439845"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43984-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}