{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:54:52Z","timestamp":1773392092297,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,12]]},"DOI":"10.1145\/1989323.1989379","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"529-540","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Faerie"],"prefix":"10.1145","author":[{"given":"Guoliang","family":"Li","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Dong","family":"Deng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Jianhua","family":"Feng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453856.1453958"},{"key":"e_1_3_2_1_2_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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376697"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.55"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.125"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687673"},{"key":"e_1_3_2_1_10_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."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497435"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559891"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453856.1453883"},{"key":"e_1_3_2_1_14_1","first-page":"325","volume-title":"VLDB","author":"Kim M.-S.","year":"2005","unstructured":"M.-S. Kim , K.-Y. Whang , J.-G. Lee , and M.-J. Lee . n-gram\/2l : A space and time efficient two-level n-gram inverted index structure . In VLDB , pages 325 -- 336 , 2005 . M.-S. Kim, K.-Y. Whang, J.-G. Lee, and M.-J. Lee. n-gram\/2l: A space and time efficient two-level n-gram inverted index structure. In VLDB, pages 325--336, 2005."},{"key":"e_1_3_2_1_15_1","first-page":"199","volume-title":"VLDB","author":"Koudas N.","year":"2006","unstructured":"N. Koudas , C. Li , A. K. H. Tung , and R. Vernica . Relaxing join and selection queries . In VLDB , pages 199 -- 210 , 2006 . N. Koudas, C. Li, A. K. H. Tung, and R. Vernica. Relaxing join and selection queries. In VLDB, pages 199--210, 2006."},{"key":"e_1_3_2_1_16_1","first-page":"195","volume-title":"VLDB","author":"Lee H.","year":"2007","unstructured":"H. Lee , R. T. Ng , and K. Shim . Extending q-grams to estimate selectivity of string matching with low edit distance . In VLDB , pages 195 -- 206 , 2007 . H. Lee, R. T. Ng, and K. Shim. Extending q-grams to estimate selectivity of string matching with low edit distance. In VLDB, pages 195--206, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687702"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_19_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_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1645995"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559925"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453856.1453957"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.111"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","location":"Athens Greece","acronym":"SIGMOD\/PODS '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2011 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989323.1989379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:21Z","timestamp":1750245741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989379"}},"subtitle":["efficient filtering algorithms for approximate dictionary-based entity extraction"],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":25,"alternative-id":["10.1145\/1989323.1989379","10.1145\/1989323"],"URL":"https:\/\/doi.org\/10.1145\/1989323.1989379","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}