{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:54:03Z","timestamp":1758268443966,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Academy of Finland","award":["310321"],"award-info":[{"award-number":["310321"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3360319","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"2975-2976","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Synergy of Database Techniques and Machine Learning Models for String Similarity Search and Join"],"prefix":"10.1145","author":[{"given":"Jiaheng","family":"Lu","sequence":"first","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"given":"Chunbin","family":"Lin","sequence":"additional","affiliation":[{"name":"Amazon AWS, San Francisco, CA, USA"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_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_1_2_1","unstructured":"Alexander Behm Shengyue Ji Chen Li and Jiaheng Lu. 2009. Space-Constrained Gram-Based Indexing for Efficient Approximate String Search. In ICDE. 604--615.  Alexander Behm Shengyue Ji Chen Li and Jiaheng Lu. 2009. Space-Constrained Gram-Based Indexing for Efficient Approximate String Search. In ICDE. 604--615."},{"key":"e_1_3_2_1_3_1","first-page":"278","article-title":"Smurf","volume":"12","author":"Adel Ardalan Paul Suganthan G. C.","year":"2018","unstructured":"Paul Suganthan G. C. , Adel Ardalan , AnHai Doan , and Aditya Akella . 2018 . Smurf : Self-Service String Matching Using Random Forests. PVLDB , Vol. 12 , 3 (2018), 278 -- 291 . Paul Suganthan G. C., Adel Ardalan, AnHai Doan, and Aditya Akella. 2018. Smurf: Self-Service String Matching Using Random Forests. PVLDB , Vol. 12, 3 (2018), 278--291.","journal-title":"Self-Service String Matching Using Random Forests. PVLDB"},{"key":"e_1_3_2_1_4_1","first-page":"1454","article-title":"Distributed Representations of Tuples for Entity Resolution","volume":"11","author":"Ebraheem Muhammad","year":"2018","unstructured":"Muhammad Ebraheem , Saravanan Thirumuruganathan , Shafiq R. Joty , Mourad Ouzzani , and Nan Tang . 2018 . Distributed Representations of Tuples for Entity Resolution . PVLDB , Vol. 11 , 11 (2018), 1454 -- 1467 . Muhammad Ebraheem, Saravanan Thirumuruganathan, Shafiq R. Joty, Mourad Ouzzani, and Nan Tang. 2018. Distributed Representations of Tuples for Entity Resolution. PVLDB , Vol. 11, 11 (2018), 1454--1467.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1207\/s15516709cog1402_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687623"},{"key":"e_1_3_2_1_7_1","unstructured":"Chen Li Jiaheng Lu and Yiming Lu. 2008. Efficient Merging and Filtering Algorithms for Approximate String Searches. In ICDE. 257--266.  Chen Li Jiaheng Lu and Yiming Lu. 2008. Efficient Merging and Filtering Algorithms for Approximate String Searches. In ICDE. 257--266."},{"key":"e_1_3_2_1_8_1","unstructured":"Jiaheng Lu Chunbin Lin Wei Wang Chen Li and Haiyong Wang. 2013. String similarity measures and joins with synonyms. In ACM SIGMOD. 373--384.  Jiaheng Lu Chunbin Lin Wei Wang Chen Li and Haiyong Wang. 2013. String similarity measures and joins with synonyms. In ACM SIGMOD. 373--384."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818177"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SLT.2012.6424228"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Sidharth Mudgal Han Li Theodoros Rekatsinas AnHai Doan Youngchoon Park Ganesh Krishnan Rohit Deep Esteban Arcaute and Vijay Raghavendra. 2018. Deep Learning for Entity Matching: A Design Space Exploration. In SIGMOD. 19--34.  Sidharth Mudgal Han Li Theodoros Rekatsinas AnHai Doan Youngchoon Park Ganesh Krishnan Rohit Deep Esteban Arcaute and Vijay Raghavendra. 2018. Deep Learning for Entity Matching: A Design Space Exploration. In SIGMOD. 19--34.","DOI":"10.1145\/3183713.3196926"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Pengfei Xu and Jiaheng Lu. 2017. Top-k String Auto-Completion with Synonyms. In DASFAA. 202--218.  Pengfei Xu and Jiaheng Lu. 2017. Top-k String Auto-Completion with Synonyms. In DASFAA. 202--218.","DOI":"10.1007\/978-3-319-55699-4_13"},{"key":"e_1_3_2_1_15_1","unstructured":"Pengfei Xu and Jiaheng Lu. 2018. Efficient Taxonomic Similarity Joins with Adaptive Overlap Constraint. In ACM CIKM. 1563--1566.  Pengfei Xu and Jiaheng Lu. 2018. Efficient Taxonomic Similarity Joins with Adaptive Overlap Constraint. In ACM CIKM. 1563--1566."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342268"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"CIKM '19"},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3360319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3360319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:11Z","timestamp":1750202591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3360319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":16,"alternative-id":["10.1145\/3357384.3360319","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3360319","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}