{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:43:49Z","timestamp":1790750629600,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1525024, IIS-1633215"],"award-info":[{"award-number":["CCF-1525024, IIS-1633215"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098003","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"585-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["EmbedJoin"],"prefix":"10.1145","author":[{"given":"Haoyu","family":"Zhang","sequence":"first","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Arvind Arasu Venkatesh Ganti and Raghav Kaushik. 2006. Efficient Exact Set-Similarity Joins. In VLDB. 918--929. Arvind Arasu Venkatesh Ganti and Raghav Kaushik. 2006. Efficient Exact Set-Similarity Joins. In VLDB. 918--929."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Arturs Backurs and Piotr Indyk 2015. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) STOC. 51--58. Arturs Backurs and Piotr Indyk 2015. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) STOC. 51--58.","DOI":"10.1145\/2746539.2746612"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Roberto J. Bayardo Yiming Ma and Ramakrishnan Srikant. 2007. Scaling up all pairs similarity search. In WWW. 131--140. Roberto J. Bayardo Yiming Ma and Ramakrishnan Srikant. 2007. Scaling up all pairs similarity search. In WWW. 131--140.","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Djamal Belazzougui and Qin Zhang 2016. Edit Distance: Sketching Streaming and Document Exchange FOCS. to appear. Djamal Belazzougui and Qin Zhang 2016. Edit Distance: Sketching Streaming and Document Exchange FOCS. to appear.","DOI":"10.1109\/FOCS.2016.15"},{"key":"e_1_3_2_2_5_1","volume-title":"Fast similarity search in large dictionaries","author":"Bocek Thomas","unstructured":"Thomas Bocek , Ela Hunt , Burkhard Stiller , and Fabio Hecht . 2007. Fast similarity search in large dictionaries . University . Thomas Bocek, Ela Hunt, Burkhard Stiller, and Fabio Hecht. 2007. Fast similarity search in large dictionaries. University."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Diptarka Chakraborty Elazar Goldenberg and Michal Kouck\u00fd 2016. Streaming algorithms for embedding and computing edit distance in the low distance regime STOC. 712--725. Diptarka Chakraborty Elazar Goldenberg and Michal Kouck\u00fd 2016. Streaming algorithms for embedding and computing edit distance in the low distance regime STOC. 712--725.","DOI":"10.1145\/2897518.2897577"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri Venkatesh Ganti and Raghav Kaushik. 2006. A Primitive Operator for Similarity Joins in Data Cleaning ICDE. 5. Surajit Chaudhuri Venkatesh Ganti and Raghav Kaushik. 2006. A Primitive Operator for Similarity Joins in Data Cleaning ICDE. 5.","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_2_8_1","volume-title":"M-tree: An Efficient Access Method for Similarity Search in Metric Spaces VLDB. 426--435.","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia , Marco Patella , and Pavel Zezula . 1997 . M-tree: An Efficient Access Method for Similarity Search in Metric Spaces VLDB. 426--435. Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces VLDB. 426--435."},{"key":"e_1_3_2_2_9_1","unstructured":"Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. VLDB. 518--529. Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. VLDB. 518--529."},{"key":"e_1_3_2_2_10_1","unstructured":"Luis Gravano Panagiotis G. Ipeirotis H. V. Jagadish Nick Koudas S. Muthukrishnan and Divesh Srivastava 2001. Approximate String Joins in a Database (Almost) for Free VLDB. 491--500. Luis Gravano Panagiotis G. Ipeirotis H. V. Jagadish Nick Koudas S. Muthukrishnan and Divesh Srivastava 2001. Approximate String Joins in a Database (Almost) for Free VLDB. 491--500."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality STOC. 604--613. Piotr Indyk and Rajeev Motwani 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality STOC. 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/060660126"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794264810"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Chen Li Jiaheng Lu and Yiming Lu 2008. Efficient Merging and Filtering Algorithms for Approximate String Searches ICDE. 257--266. Chen Li Jiaheng Lu and Yiming Lu 2008. Efficient Merging and Filtering Algorithms for Approximate String Searches ICDE. 257--266.","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284322"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Jianbin Qin Wei Wang Yifei Lu Chuan Xiao and Xuemin Lin 2011. Efficient exact edit similarity query processing with the asymmetric signature scheme SIGMOD. 1033--1044. Jianbin Qin Wei Wang Yifei Lu Chuan Xiao and Xuemin Lin 2011. Efficient exact edit similarity query processing with the asymmetric signature scheme SIGMOD. 1033--1044.","DOI":"10.1145\/1989323.1989431"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140440"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80046-2"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627706"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920992"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Jiannan Wang Guoliang Li and Jianhua Feng 2012. Can we beat the prefix filtering?: an adaptive framework for similarity join and search SIGMOD. 85--96. Jiannan Wang Guoliang Li and Jianhua Feng 2012. Can we beat the prefix filtering?: an adaptive framework for similarity join and search SIGMOD. 85--96.","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.79"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Chuan Xiao Wei Wang Xuemin Lin and Jeffrey Xu Yu. 2008natexlabb. Efficient similarity joins for near duplicate detection WWW. 131--140. Chuan Xiao Wei Wang Xuemin Lin and Jeffrey Xu Yu. 2008natexlabb. Efficient similarity joins for near duplicate detection WWW. 131--140.","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Jiaqi Zhai Yin Lou and Johannes Gehrke 2011. ATLAS: a probabilistic algorithm for high dimensional similarity search SIGMOD. 997--1008. Jiaqi Zhai Yin Lou and Johannes Gehrke 2011. ATLAS: a probabilistic algorithm for high dimensional similarity search SIGMOD. 997--1008.","DOI":"10.1145\/1989323.1989428"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098003"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098003","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:37:31Z","timestamp":1750797451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098003"}},"subtitle":["Efficient Edit Similarity Joins via Embeddings"],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":28,"alternative-id":["10.1145\/3097983.3098003","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098003","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}