{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:09:02Z","timestamp":1767841742913,"version":"3.49.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1109\/icde.2010.5447866","type":"proceedings-article","created":{"date-parts":[[2010,12,8]],"date-time":"2010-12-08T17:25:00Z","timestamp":1291829100000},"page":"721-732","source":"Crossref","is-referenced-by-count":8,"title":["Efficient processing of substring match queries with inverted q-gram indexes"],"prefix":"10.1109","author":[{"given":"Younghoon","family":"Kim","sequence":"first","affiliation":[]},{"given":"Kyoung-Gu","family":"Woo","sequence":"additional","affiliation":[]},{"given":"Hyoungmin","family":"Park","sequence":"additional","affiliation":[]},{"given":"Kyuseok","family":"Shim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref32","article-title":"Times online","year":"0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687577"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115857"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/170791.170891"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458138"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.6028\/NIST.SP.500-236.spanish-gmu","article-title":"Improving accuracy and runtime performance for trec-4","author":"grossman","year":"1995","journal-title":"Proceedings of the fourth text retrieval conference"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497512"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031212"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376655"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304001"},{"key":"ref28","article-title":"Ed-join:an efficient algorithm for similarity joins with edit distance constraints","author":"yang","year":"2008","journal-title":"VLDB"},{"key":"ref4","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":"VLDB"},{"key":"ref27","first-page":"491","article-title":"Approximate string joins in a database (almost) for free","author":"gravano","year":"2001","journal-title":"VLDB"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291057"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335225"},{"key":"ref29","author":"silberschatz","year":"2002","journal-title":"Database System Concepts"},{"key":"ref5","first-page":"290","article-title":"Searching large lexicons for partially specified terms using compressed inverted files","author":"zobel","year":"1993","journal-title":"VLDB"},{"key":"ref8","article-title":"Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem","author":"chaudhuri","year":"2004","journal-title":"ICDE"},{"key":"ref7","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proceedings of Compression and Complexity of Sequences"},{"key":"ref2","author":"baeza-yates","year":"1999","journal-title":"Modern Information Retrieval"},{"key":"ref9","article-title":"Size-estimation Framework with Applications to Transitive Closure and Reachability","author":"cohen","year":"2003","journal-title":"Journal of Computer and System Sciences"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1145\/235968.233341","article-title":"Estimating Alphanumeric Selectivity in the Presence of Wildcards","author":"krishnan","year":"1996","journal-title":"SIGMOD"},{"key":"ref22","article-title":"Extending q-grams to estimate selectivity of string matching with edit distance","author":"lee","year":"2007","journal-title":"VLDB"},{"key":"ref21","article-title":"Selectivity estimation for fuzzy string predicates in large data sets","author":"jin","year":"2005","journal-title":"VLDB"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"ref23","first-page":"918","article-title":"Efficient exact set-similarity joins","author":"arasu","year":"2006","journal-title":"VLDB"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"}],"event":{"name":"2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)","location":"Long Beach, CA, USA","start":{"date-parts":[[2010,3,1]]},"end":{"date-parts":[[2010,3,6]]}},"container-title":["2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5443872\/5447611\/05447866.pdf?arnumber=5447866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T15:46:20Z","timestamp":1740757580000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5447866\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/icde.2010.5447866","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}