{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:30:48Z","timestamp":1757539848012,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"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, CCF-1844234"],"award-info":[{"award-number":["CCF-1525024, IIS-1633215, CCF-1844234"]}],"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":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330853","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1093-1103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["MinJoin"],"prefix":"10.1145","author":[{"given":"Haoyu","family":"Zhang","sequence":"first","affiliation":[{"name":"Indiana University Bloomington, Bloomginton, IN, USA"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomginton, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_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_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"volume-title":"Fast similarity search in large dictionaries","author":"Bocek Thomas","key":"e_1_3_2_1_3_1"},{"volume-title":"M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB . 426--435.","year":"1997","author":"Ciaccia Paolo","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_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. In 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. In VLDB. 491--500."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"volume-title":"The advantages of SMRT sequencing. Genome biology","year":"2013","author":"Roberts Richard J","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80046-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627706"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920992"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.79"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098003"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330853","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330853","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:02Z","timestamp":1750206362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330853"}},"subtitle":["Efficient Edit Similarity Joins via Local Hash Minima"],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":17,"alternative-id":["10.1145\/3292500.3330853","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330853","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}