{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:53:31Z","timestamp":1760597611158},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/tkde.2014.2309131","type":"journal-article","created":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T19:02:43Z","timestamp":1393614163000},"page":"2983-2996","source":"Crossref","is-referenced-by-count":22,"title":["Efficiently Supporting Edit Distance Based String Similarity Search Using B<formula formulatype=\"inline\"><tex Notation=\"TeX\"> $^+$<\/tex><mathgraphic graphicformat=\"GIF\" fileref=\"lu-ieq1-2309131.gif\"\/><\/formula>-Trees"],"prefix":"10.1109","volume":"26","author":[{"given":"Wei","family":"Lu","sequence":"first","affiliation":[]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[]},{"given":"Marios","family":"Hadjieleftheriou","sequence":"additional","affiliation":[]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336674"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767856"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526760"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559919"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"},{"key":"ref14","first-page":"421","article-title":"Indexing the Distance: An Efficient Method to KNN Processing","author":"yu","year":"2001","journal-title":"Proc Int?l Conf Very Large Data Bases (VLDB)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00240-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"ref18","first-page":"918","article-title":"Efficient Exact Set-Similarity Joins","author":"arasu","year":"2006","journal-title":"Proc Int?l Conf Very Large Data Bases (VLDB)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-6846-3"},{"key":"ref4","first-page":"303","article-title":"VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams","author":"li","year":"2007","journal-title":"Proc Int?l Conf Very Large Data Bases (VLDB)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"ref3","first-page":"491","article-title":"Approximate String Joins in a Database (Almost) for Free","author":"gravano","year":"2001","journal-title":"Proc 20th Int l Conf Very Large Data Bases (VLDB)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1557670.1557677"},{"key":"ref29","first-page":"137","article-title":"MapReduce: Simplified Data Processing on Large Clusters","author":"dean","year":"2004","journal-title":"Proc Sixth Conf Symp Operating Systems Design & Implementation (OSDI)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"key":"ref2","first-page":"327","article-title":"Example-Driven Design of Efficient Record Matching Queries","author":"chaudhuri","year":"2007","journal-title":"Proc Int?l Conf Very Large Data Bases (VLDB)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.32"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247521"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0218-x"},{"key":"ref21","first-page":"325","article-title":"N-Gram\/2L: A Space and Time Efficient Two-Level N-Gram Inverted Index Structure","author":"kim","year":"2005","journal-title":"Proc Int?l Conf Very Large Data Bases (VLDB)"},{"key":"ref24","first-page":"137","article-title":"Efficient Record Linkage in Large Data Sets","author":"jin","year":"2003","journal-title":"Proc Eighth Int Conf Database Systems for Advanced Applications (DASFAA'03)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544886"},{"key":"ref26","first-page":"906","article-title":"Reference-Based Indexing of Sequence Databases","author":"venkateswaran","year":"2006","journal-title":"Proc Int?l Conf Very Large Data Bases (VLDB)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0061-2"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/6945935\/06750698.pdf?arnumber=6750698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:06:21Z","timestamp":1642003581000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6750698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":30,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2309131","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}