{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:07Z","timestamp":1775638807439,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"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":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465324","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"385-396","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Efficient top-k algorithms for approximate substring matching"],"prefix":"10.1145","author":[{"given":"Younghoon","family":"Kim","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}]},{"given":"Kyuseok","family":"Shim","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536444"},{"key":"e_1_3_2_1_2_1","volume-title":"Modern Information Retrieval - the concepts and technology behind search","author":"Baeza-Yates R. A.","year":"2011","unstructured":"R. A. Baeza-Yates and B. A. Ribeiro-Neto . Modern Information Retrieval - the concepts and technology behind search , Second edition. Pearson Education Ltd ., Harlow, England, 2011 . R. A. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval - the concepts and technology behind search, Second edition. Pearson Education Ltd., Harlow, England, 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.32"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of Compression and Complexity of SEQUENCES","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . On the resemblance and containment of documents . In Proceedings of Compression and Complexity of SEQUENCES , 1997 . A. Z. Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of SEQUENCES, 1997."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559919"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335225"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007374"},{"key":"e_1_3_2_1_9_1","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 , 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, 2001."},{"key":"e_1_3_2_1_10_1","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 , 2005 . L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In VLDB, 2005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316782"},{"key":"e_1_3_2_1_12_1","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 , 2007 . H. Lee, R. T. Ng, and K. Shim. Extending q-grams to estimate selectivity of string matching with low edit distance. In VLDB, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516455"},{"key":"e_1_3_2_1_14_1","volume-title":"Soviet Phys. Dokl.","author":"Levenshtein V. I.","year":"1985","unstructured":"V. I. Levenshtein . Binary codes capable of correcting deletions, insertions and reversals . Soviet Phys. Dokl. , 1985 . V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl., 1985."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_16_1","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 , 2007 . C. Li, B. Wang, and X. Yang. VGRAM: Improving performance of approximate queries on string collections using variable-length grams. In VLDB, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989379"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MMCS.1999.779244"},{"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","author":"Navarro G.","year":"2005","unstructured":"G. Navarro , E. Sutinen , and J. Tarhio . Indexing text with approximate q-grams. J. Discrete Algorithms , 2005 . G. Navarro, E. Sutinen, and J. Tarhio. Indexing text with approximate q-grams. J. Discrete Algorithms, 2005.","journal-title":"Indexing text with approximate q-grams. J. Discrete Algorithms"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284322"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135834"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90016-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557670.1557677"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559925"},{"key":"e_1_3_2_1_28_1","volume-title":"AAAI","author":"Yang Z.","year":"2010","unstructured":"Z. Yang , J. Yu , and M. Kitsuregawa . Fast algorithms for top-k approximate string matching . In AAAI , 2010 . Z. Yang, J. Yu, and M. Kitsuregawa. Fast algorithms for top-k approximate string matching. In AAAI, 2010."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:06Z","timestamp":1750235946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":28,"alternative-id":["10.1145\/2463676.2465324","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465324","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}