{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:41Z","timestamp":1750306901389,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"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,3,18]]},"DOI":"10.1145\/2457317.2457388","type":"proceedings-article","created":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T12:25:54Z","timestamp":1364300754000},"page":"384-391","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate string matching by position restricted alignment"],"prefix":"10.1145","author":[{"given":"Manish","family":"Patil","sequence":"first","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanting","family":"Cai","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seung-Jong","family":"Park","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Foltz","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"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 . 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_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007374"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544886"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0252-8"},{"key":"e_1_3_2_1_7_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_8_1","first-page":"841","volume-title":"Proceedings of Symposium on Discrete Algorithms","author":"Grossi R.","year":"2003","unstructured":"R. Grossi , A. Gupta , and J. S. Vitter . High-Order Entropy-Compressed Text Indexes . In Proceedings of Symposium on Discrete Algorithms , pages 841 -- 850 , 2003 . R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. In Proceedings of Symposium on Discrete Algorithms, pages 841--850, 2003."},{"key":"e_1_3_2_1_9_1","first-page":"351","volume-title":"VLDB","author":"Kahveci T.","year":"2001","unstructured":"T. Kahveci and A. K. Singh . Efficient index structures for string databases . In VLDB , pages 351 -- 360 , 2001 . T. Kahveci and A. K. Singh. Efficient index structures for string databases. In VLDB, pages 351--360, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_12_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_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"e_1_3_2_1_14_1","first-page":"657","volume-title":"Proceedings of Symposium on Discrete Algorithms","author":"Muthukrishnan S.","year":"2002","unstructured":"S. Muthukrishnan . Efficient Algorithms for Document Retrieval Problems . In Proceedings of Symposium on Discrete Algorithms , pages 657 -- 666 , 2002 . S. Muthukrishnan. Efficient Algorithms for Document Retrieval Problems. In Proceedings of Symposium on Discrete Algorithms, pages 657--666, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_16_1","first-page":"322","volume-title":"SPIRE","author":"Ohlebusch E.","year":"2010","unstructured":"E. Ohlebusch , J. Fischer , and S. Gog . Cst++ . In SPIRE , pages 322 -- 333 , 2010 . E. Ohlebusch, J. Fischer, and S. Gog. Cst++. In SPIRE, pages 322--333, 2010."},{"key":"e_1_3_2_1_17_1","first-page":"233","volume-title":"Proceedings of Symposium on Discrete Algorithms","author":"Raman R.","year":"2002","unstructured":"R. Raman , V. Raman , and S. S. Rao . Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees and Multisets . In Proceedings of Symposium on Discrete Algorithms , pages 233 -- 242 , 2002 . R. Raman, V. Raman, and S. S. Rao. Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees and Multisets. In Proceedings of Symposium on Discrete Algorithms, pages 233--242, 2002."},{"key":"e_1_3_2_1_18_1","first-page":"351","volume-title":"VLDB","author":"Ramasamy K.","year":"2000","unstructured":"K. Ramasamy , J. M. Patel , J. F. Naughton , and R. Kaushik . Set containment joins: The good, the bad and the ugly . In VLDB , pages 351 -- 362 , 2000 . K. Ramasamy, J. M. Patel, J. F. Naughton, and R. Kaushik. Set containment joins: The good, the bad and the ugly. In VLDB, pages 351--362, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_22_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_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the Joint EDBT\/ICDT 2013 Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457317.2457388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:19:12Z","timestamp":1750234752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":23,"alternative-id":["10.1145\/2457317.2457388","10.1145\/2457317"],"URL":"https:\/\/doi.org\/10.1145\/2457317.2457388","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}