{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:44:34Z","timestamp":1771699474973,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/icde.2008.4497434","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T15:04:39Z","timestamp":1209481479000},"page":"257-266","source":"Crossref","is-referenced-by-count":192,"title":["Efficient Merging and Filtering Algorithms for Approximate String Searches"],"prefix":"10.1109","author":[{"given":"Chen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiming","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"802","article-title":"record linkage: similarity measures and algorithms","author":"koudas","year":"2005","journal-title":"SIGMOD Tutorial"},{"key":"14","first-page":"325","article-title":"n-gram\/2l: a space and time efficient two-level n-grara inverted index structure","author":"kim","year":"2005","journal-title":"VLDB"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"12","article-title":"set containment joins: the good, the bad and the ugly","author":"ramasamy","year":"2000","journal-title":"VLDB"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"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.2006.9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"6","first-page":"327","article-title":"on using q-grams locations in approximate string matching","author":"sutinen","year":"1995","journal-title":"ESA"},{"key":"5","article-title":"vgram: improving performance of approximate queries on string collections using variable-length grams","author":"li","year":"2007","journal-title":"Very Large Data Bases"},{"key":"4","first-page":"491","article-title":"approximate string joins in a database (almost) for free","author":"gravano","year":"2001","journal-title":"VLDB"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"8","first-page":"8","article-title":"binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"levenshtein","year":"1965","journal-title":"Profi Inf Transmission"}],"event":{"name":"2008 IEEE 24th International Conference on Data Engineering (ICDE 2008)","location":"Cancun, Mexico","start":{"date-parts":[[2008,4,7]]},"end":{"date-parts":[[2008,4,12]]}},"container-title":["2008 IEEE 24th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4492792\/4497384\/04497434.pdf?arnumber=4497434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T11:33:27Z","timestamp":1489664007000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4497434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icde.2008.4497434","relation":{},"subject":[],"published":{"date-parts":[[2008,4]]}}}