{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:05Z","timestamp":1775638805809,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376655","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"353-364","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":70,"title":["Cost-based variable-length-gram selection for string collections to support approximate queries efficiently"],"prefix":"10.1145","author":[{"given":"Xiaochun","family":"Yang","sequence":"first","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"918","volume-title":"VLDB","author":"Arasu A.","year":"2006","unstructured":"A. Arasu , V. Ganti , and R. Kaushik . Exact set-similarity joins . In VLDB , pages 918 -- 929 , 2006 . A. Arasu, V. Ganti, and R. Kaushik. Exact set-similarity joins. In VLDB, pages 918--929, 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1564535.1564541"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_3_2_1_5_1","first-page":"227","volume-title":"ICDE","author":"Chaudhuri S.","year":"2004","unstructured":"S. Chaudhuri , V. Ganti , and L. Gravano . Selectivity estimation for string predicates: Overcoming the underestimation problem . In ICDE , pages 227 -- 238 , 2004 . S. Chaudhuri, V. Ganti, and L. Gravano. Selectivity estimation for string predicates: Overcoming the underestimation problem. In ICDE, pages 227--238, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.66"},{"key":"e_1_3_2_1_8_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_9_1","volume-title":"ICDE","author":"Hadjieleftheriou M.","year":"2008","unstructured":"M. Hadjieleftheriou , A. Chandel , N. Koudas , and D. Srivastava . Set similarity selection queries at interactive speeds . In ICDE , 2008 . M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Set similarity selection queries at interactive speeds. In ICDE, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031212"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304001"},{"key":"e_1_3_2_1_12_1","first-page":"397","volume-title":"VLDB","author":"Jin L.","year":"2005","unstructured":"L. Jin and C. Li . Selectivity estimation for fuzzy string predicates in large data sets . In VLDB , pages 397 -- 408 , 2005 . L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In VLDB, pages 397--408, 2005."},{"key":"e_1_3_2_1_13_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_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233341"},{"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.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_18_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_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242529"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260787"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376655","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:00Z","timestamp":1750255080000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":22,"alternative-id":["10.1145\/1376616.1376655","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376655","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}