{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:35:52Z","timestamp":1722940552175},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icde.2013.6544886","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T19:02:52Z","timestamp":1372273372000},"source":"Crossref","is-referenced-by-count":41,"title":["Top-k string similarity search with edit-distance constraints"],"prefix":"10.1109","author":[{"family":"Dong Deng","sequence":"first","affiliation":[]},{"family":"Guoliang Li","sequence":"additional","affiliation":[]},{"family":"Jianhua Feng","sequence":"additional","affiliation":[]},{"family":"Wen-Syan Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.111"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767865"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920992"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348333"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0218-x"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"20","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7527","article-title":"Fast algorithms for top-k approximate string matching","author":"yang","year":"2010","journal-title":"AAAI"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"1","first-page":"918","article-title":"Efficient exact set-similarity joins","author":"arasu","year":"2006","journal-title":"VLDB"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807204"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559891"},{"key":"5","first-page":"491","article-title":"Approximate string joins in a database (almost) for free","author":"gravano","year":"2001","journal-title":"VLDB"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"9","first-page":"351","article-title":"Efficient index structures for string databases","author":"kahveci","year":"2001","journal-title":"VLDB"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526760"}],"event":{"name":"2013 29th IEEE International Conference on Data Engineering (ICDE 2013)","location":"Brisbane, QLD","start":{"date-parts":[[2013,4,8]]},"end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 IEEE 29th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530811\/6544790\/06544886.pdf?arnumber=6544886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T02:08:04Z","timestamp":1715566084000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icde.2013.6544886","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}