{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:52:45Z","timestamp":1759683165737,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National High Technology Research and Development Program of China","award":["2017YFC08038"],"award-info":[{"award-number":["2017YFC08038"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572373 61472290 60903035"],"award-info":[{"award-number":["61572373 61472290 60903035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1305430"],"award-info":[{"award-number":["1305430"]}],"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":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196936","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"873-888","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["ZigZag"],"prefix":"10.1145","author":[{"given":"Wenhai","family":"Li","sequence":"first","affiliation":[{"name":"Wuhan University, Wuhan, China"}]},{"given":"Lingfeng","family":"Deng","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}]},{"given":"Yang","family":"Li","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/ICDE.2012.66"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/2588555.2610514"},{"key":"e_1_3_2_1_3_1","first-page":"918","volume-title":"VLDB","author":"Arasu A.","year":"2006","unstructured":"A. Arasu , V. Ganti , and R. Kaushik . Efficient exact set-similarity joins . In VLDB , pages 918 -- 929 , 2006 . A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918--929, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/2809786"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1242572.1242591"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/ICDE.2009.32"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ICDE.2011.5767856"},{"key":"e_1_3_2_1_8_1","volume-title":"UCI Flamingo Package 3.0","author":"Behm A.","year":"2010","unstructured":"A. Behm , R. Vernica , S. Ji , J. Lu , L. Jin , Y. Lu , and C. Li . UCI Flamingo Package 3.0 , 2010 . A. Behm, R. Vernica, S. Ji, J. Lu, L. Jin, Y. Lu, and C. Li. UCI Flamingo Package 3.0, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.14778\/2428536.2428537"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1247480.1247521"},{"key":"e_1_3_2_1_11_1","first-page":"426","volume-title":"VLDB","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In VLDB , pages 426 -- 435 . Citeseer , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426--435. Citeseer, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/2588555.2593675"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/ICDE.2014.6816663"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.14778\/2856318.2856330"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/s00778-013-0319-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/s00778-011-0252-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1871985.1871999"},{"key":"e_1_3_2_1_18_1","first-page":"491","volume-title":"VLDB","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (almost) for free . In VLDB , pages 491 -- 500 , 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491--500, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/ICDE.2008.4497435"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1559845.1559891"},{"issue":"1","key":"e_1_3_2_1_21_1","first-page":"25","article-title":"Weighted set-based string similarity","volume":"33","author":"Hadjieleftheriou M.","year":"2010","unstructured":"M. Hadjieleftheriou and D. Srivastava . Weighted set-based string similarity . IEEE Data Eng. Bull. , 33 ( 1 ): 25 -- 36 , 2010 . M. Hadjieleftheriou and D. Srivastava. Weighted set-based string similarity. IEEE Data Eng. Bull., 33(1):25--36, 2010.","journal-title":"IEEE Data Eng. Bull."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/2996913.2996923"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.14778\/2732296.2732299"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1016\/j.phanu.2015.02.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/ICDE.2012.87"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/3007186"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/2600428.2609487"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1557019.1557077"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_30_1","first-page":"303","volume-title":"VLDB","author":"Li C.","year":"2007","unstructured":"C. Li , B. Wang , and X. Yang . VGRAM: improving performance of approximate queries on string collections using variable-length grams . In VLDB , pages 303 -- 314 , 2007 . C. Li, B. Wang, and X. Yang. VGRAM: improving performance of approximate queries on string collections using variable-length grams. In VLDB, pages 303--314, 2007."},{"key":"e_1_3_2_1_31_1","first-page":"89","volume-title":"Grundlagen von Datenbanken","author":"Mann W.","year":"2014","unstructured":"W. Mann and N. Augsten . Pel: Position-enhanced length filter for set similarity joins . In Grundlagen von Datenbanken , pages 89 -- 94 , 2014 . W. Mann and N. Augsten. Pel: Position-enhanced length filter for set similarity joins. In Grundlagen von Datenbanken, pages 89--94, 2014."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.14778\/2947618.2947620"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.14778\/2212351.2212353"},{"key":"e_1_3_2_1_34_1","volume-title":"A practical q-gram index for text retrieval allowing errors. CLEI Electronic Journal, 1:http:\/\/www.clei.cl","author":"Navarro G.","year":"1998","unstructured":"G. Navarro and R. Baeza-yates . A practical q-gram index for text retrieval allowing errors. CLEI Electronic Journal, 1:http:\/\/www.clei.cl ., 1998 . G. Navarro and R. Baeza-yates. A practical q-gram index for text retrieval allowing errors. CLEI Electronic Journal, 1:http:\/\/www.clei.cl., 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/2766462.2767715"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/2484028.2484070"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/2766462.2767762"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/1989323.1989431"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1016\/j.is.2010.07.003"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1145\/1007568.1007652"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/2588555.2593676"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/2213836.2213935"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/1807167.1807222"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/2213836.2213847"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1145\/2535628"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1109\/TKDE.2012.79"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.14778\/3099622.3099624"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1145\/2487575.2487625"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.14778\/1453856.1453957"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1145\/1367497.1367516"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1145\/1376616.1376655"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1007\/s11704-015-5900-5"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS '18","name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA"},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196936","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196936","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:28Z","timestamp":1750208908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196936"}},"subtitle":["Supporting Similarity Queries on Vector Space Models"],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":52,"alternative-id":["10.1145\/3183713.3196936","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196936","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}