{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:05Z","timestamp":1775638805312,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,2,24]],"date-time":"2011-02-24T00:00:00Z","timestamp":1298505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s00778-011-0218-x","type":"journal-article","created":{"date-parts":[[2011,2,23]],"date-time":"2011-02-23T15:50:06Z","timestamp":1298476206000},"page":"617-640","source":"Crossref","is-referenced-by-count":48,"title":["Efficient fuzzy full-text type-ahead search"],"prefix":"10.1007","volume":"20","author":[{"given":"Guoliang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengyue","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,24]]},"reference":[{"issue":"1","key":"218_CR1","first-page":"945","volume":"1","author":"S. Agrawal","year":"2008","unstructured":"Agrawal S., Chakrabarti K., Chaudhuri S., Ganti V.: Scalable ad-hoc entity extraction from text collections. PVLDB 1(1), 945\u2013957 (2008)","journal-title":"PVLDB"},{"key":"218_CR2","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In:VLDB, pp. 918\u2013929 (2006)"},{"key":"218_CR3","doi-asserted-by":"crossref","unstructured":"Bao, Z., Ling, T.W., Chen, B., Lu, J.:Effective XML keyword search with relevance oriented ranking. In: ICDE, pp. 517\u2013528 (2009)","DOI":"10.1109\/ICDE.2009.16"},{"key":"218_CR4","doi-asserted-by":"crossref","unstructured":"Bast, H., Chitea, A., Suchanek, F.M., Weber, I.:Ester: efficient search on text, entities, and relations. In: SIGIR, pp. 671\u2013678 (2007)","DOI":"10.1145\/1277741.1277856"},{"key":"218_CR5","doi-asserted-by":"crossref","unstructured":"Bast, H., Mortensen, C.W., Weber, I.:Output-sensitive autocompletion search. In: SPIRE, pp. 150\u2013162 (2006)","DOI":"10.1007\/11880561_13"},{"key":"218_CR6","doi-asserted-by":"crossref","unstructured":"Bast, H., Weber, I.: Type less, find more: fast autocompletion search with a succinct index. In: SIGIR, pp. 364\u2013371 (2006)","DOI":"10.1145\/1148170.1148234"},{"key":"218_CR7","unstructured":"Bast, H., Weber I.: The completesearch engine: interactive, efficient, and towards IR & DB integration. In: CIDR, pp. 88\u201395 (2007)"},{"key":"218_CR8","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.:Scaling up all pairs similarity search. In: WWW, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"218_CR9","doi-asserted-by":"crossref","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In: ICDE, pp. 431\u2013440 (2002)","DOI":"10.1109\/ICDE.2002.994756"},{"key":"218_CR10","doi-asserted-by":"crossref","unstructured":"Celikik, M., Bast, H.: Fast error-tolerant search on very large texts. In: SAC, pp. 1724\u20131731 (2009)","DOI":"10.1145\/1529282.1529669"},{"key":"218_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Chaudhuri, S., Ganti, V., Xin, D.: An efficient filter for approximate membership checking. In: SIGMOD Conference, pp. 805\u2013818 (2008)","DOI":"10.1145\/1376616.1376697"},{"key":"218_CR12","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganjam, K., Ganti, V., Motwani, R.: Robust and efficient fuzzy match for online data cleaning. In: SIGMOD Conference, pp. 313\u2013324 (2003)","DOI":"10.1145\/872757.872796"},{"key":"218_CR13","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE, pp. 5\u201316 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"218_CR14","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Motwani, R.: Robust identification of fuzzy duplicates. In: ICDE, pp. 865\u2013876 (2005)","DOI":"10.1109\/ICDE.2005.125"},{"key":"218_CR15","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Kaushik, R.: Extending autocompletion to tolerate errors. In: SIGMOD Conference, pp. 707\u2013718 (2009)","DOI":"10.1145\/1559845.1559919"},{"key":"218_CR16","doi-asserted-by":"crossref","unstructured":"Cohen, S., Mamou, J., Kanza, Y., Sagiv, Y.: Xsearch: a semantic search engine for XML. In: VLDB, pp. 45\u201356 (2003)","DOI":"10.1016\/B978-012722442-8\/50013-6"},{"key":"218_CR17","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp. 836\u2013845 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"218_CR18","doi-asserted-by":"crossref","unstructured":"Grabski, K., Scheffer, T.: Sentence completion. In: SIGIR, pp. 433\u2013439 (2004)","DOI":"10.1145\/1008992.1009066"},{"key":"218_CR19","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate string joins in a database (almost) for free. In: VLDB, pp. 491\u2013500 (2001)"},{"key":"218_CR20","doi-asserted-by":"crossref","unstructured":"Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: Xrank: ranked keyword search over XML documents. In: SIGMOD Conference, pp. 16\u201327 (2003)","DOI":"10.1145\/872760.872762"},{"key":"218_CR21","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Chandel, A., Koudas, N., Srivastava, D.: Fast indexes and algorithms for set similarity selection queries. In: ICDE, pp. 267\u2013276 (2008)","DOI":"10.1109\/ICDE.2008.4497435"},{"key":"218_CR22","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Koudas, N., Srivastava, D.: Incremental maintenance of length normalized indexes for approximate string matching. In: SIGMOD Conference, pp. 429\u2013440 (2009)","DOI":"10.1145\/1559845.1559891"},{"key":"218_CR23","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Yu, X., Koudas, N., Srivastava, D.: Hashed samples: selectivity estimators for set similarity selection queries. In: VLDB (2008)","DOI":"10.1109\/ICDE.2008.4497435"},{"key":"218_CR24","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: VLDB, pp. 850\u2013861 (2003)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"218_CR25","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: Discover: keyword search in relational databases. In: VLDB, pp. 670\u2013681 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"218_CR26","doi-asserted-by":"crossref","unstructured":"Ji, S., Li, G., Li, C., Feng, J.: Efficient interactive fuzzy keyword search. In: WWW, pp. 371\u2013380 (2009)","DOI":"10.1145\/1526709.1526760"},{"issue":"5","key":"218_CR27","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1007\/s00778-007-0061-2","volume":"17","author":"L. Jin","year":"2008","unstructured":"Jin L., Li C., Vernica R.: Sepia: estimating selectivities of approximate string predicates in large databases. VLDB J. 17(5), 1213\u20131229 (2008)","journal-title":"VLDB J."},{"key":"218_CR28","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505\u2013516 (2005)"},{"key":"218_CR29","unstructured":"Kim, M.-S., Whang, K.-Y., Lee, J.-G., Lee, M.-J.: n-gram\/2l: a space and time efficient two-level n-gram inverted index structure. In: VLDB, pp. 325\u2013336 (2005)"},{"key":"218_CR30","unstructured":"Knuth D., The Art of Computer Programming, Sorting and Searching, third edition, Addison-Wesley (1998)"},{"key":"218_CR31","doi-asserted-by":"crossref","unstructured":"Kong, L., Gilleron, R., Lemay, A.: Retrieving meaningful relaxed tightest fragments for XML keyword search. In: EDBT, pp. 815\u2013826 (2009)","DOI":"10.1145\/1516360.1516454"},{"key":"218_CR32","unstructured":"Koudas, N., Li, C., Tung, A.K.H., Vernica, R.: Relaxing join and selection queries. In: VLDB, pp. 199\u2013210 (2006)"},{"issue":"4","key":"218_CR33","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"Kukich K.: Techniques for automatically correcting words in text. ACM Comput. Surv. 24(4), 377\u2013439 (1992)","journal-title":"ACM Comput. Surv."},{"key":"218_CR34","unstructured":"Lee, H., Ng, R.T., Shim, K.: Extending q-grams to estimate selectivity of string matching with low edit distance. In: VLDB, pp. 195\u2013206 (2007)"},{"issue":"1","key":"218_CR35","first-page":"658","volume":"2","author":"H. Lee","year":"2009","unstructured":"Lee H., Ng R.T., Shim K.: Power-law based estimation of set similarity join size. PVLDB 2(1), 658\u2013669 (2009)","journal-title":"PVLDB"},{"key":"218_CR36","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE, pp. 257\u2013266 (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"218_CR37","unstructured":"Li, C., Wang, B., Yang, X.: VGRAM: improving performance of approximate queries on string collections using variable-length grams. In: VLDB, pp. 303\u2013314 (2007)"},{"key":"218_CR38","doi-asserted-by":"crossref","unstructured":"Li, G., Feng, J., Wang, J., Zhou, L. Effective keyword search for valuable LCAs over XML documents. In: CIKM, pp. 31\u201340 (2007)","DOI":"10.1145\/1321440.1321447"},{"key":"218_CR39","doi-asserted-by":"crossref","unstructured":"Li, G., Feng, J., Wang, J., Zhou, L.: KEMB: a keyword-based XML message broker. In: TKDE (2011)","DOI":"10.1109\/TKDE.2010.159"},{"issue":"1","key":"218_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00778-010-0188-4","volume":"20","author":"G. Li","year":"2011","unstructured":"Li G., Feng J., Zhou X., Wang J.: Providing built-in keyword search capabilities in RDBMS. VLDB J. 20(1), 1\u201319 (2011)","journal-title":"VLDB J."},{"key":"218_CR41","doi-asserted-by":"crossref","unstructured":"Li, G., Feng, J., Zhou, L.: Interactive search in XML data. In: WWW, pp. 1063\u20131064 (2009)","DOI":"10.1145\/1526709.1526857"},{"key":"218_CR42","doi-asserted-by":"crossref","unstructured":"Li, G., Ji, S., Li, C., Feng, J.: Efficient type-ahead search on relational data: a tastier approach. In: SIGMOD Conference, pp. 695\u2013706. (2009)","DOI":"10.1145\/1559845.1559918"},{"key":"218_CR43","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD Conference, pp. 903\u2013914 (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"218_CR44","doi-asserted-by":"crossref","unstructured":"Li, G., Zhou, X., Feng, J., Wang, J.: Progressive keyword search in relational databases. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.196"},{"key":"218_CR45","unstructured":"Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB, pp. 361\u2013370 (2001)"},{"key":"218_CR46","doi-asserted-by":"crossref","unstructured":"Li, Y., Yu, C., Jagadish, H.V.: Schema-free xquery. In: VLDB, pp. 72\u201383. (2004)","DOI":"10.1016\/B978-012088469-8.50010-3"},{"key":"218_CR47","doi-asserted-by":"crossref","unstructured":"Liu, Z., Chen, Y.: Identifying meaningful return information for XML keyword search. In: SIGMOD Conference, pp. 329\u2013340 (2007)","DOI":"10.1145\/1247480.1247518"},{"issue":"1","key":"218_CR48","first-page":"921","volume":"1","author":"Z. Liu","year":"2008","unstructured":"Liu Z., Chen Y.: Reasoning and identifying relevant matches for XML keyword search. PVLDB 1(1), 921\u2013932 (2008)","journal-title":"PVLDB"},{"issue":"1\u20132","key":"218_CR49","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0004-3702(98)00062-9","volume":"103","author":"H. Motoda","year":"1998","unstructured":"Motoda H., Yoshida K.: Machine learning techniques to make computers easier to use. Artif. Intell. 103(1\u20132), 295\u2013321 (1998)","journal-title":"Artif. Intell."},{"key":"218_CR50","unstructured":"Nandi, A., Jagadish, H.V.: Effective phrase prediction. In: VLDB, pp. 219\u2013230. (2007)"},{"issue":"1","key":"218_CR51","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00778-010-0190-x","volume":"20","author":"L. Qin","year":"2011","unstructured":"Qin L., Yu J., Chang L.: Scalable keyword search on large data streams. VLDB J. 20(1), 35\u201357 (2011)","journal-title":"VLDB J."},{"key":"218_CR52","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: SIGMOD Conference, pp. 743\u2013754 (2004)","DOI":"10.1145\/1007568.1007652"},{"issue":"2","key":"218_CR53","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s00778-008-0126-x","volume":"18","author":"F. Shao","year":"2009","unstructured":"Shao F., Guo L., Botev C., Bhaskar A., Chettiar M., Yang F., Shanmugasundaram J.: Efficient keyword search over virtual XML views. VLDB J. 18(2), 543\u2013570 (2009)","journal-title":"VLDB J."},{"issue":"1","key":"218_CR54","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00778-007-0075-9","volume":"17","author":"A. Simitsis","year":"2008","unstructured":"Simitsis A., Koutrika G., Ioannidis Y.E.: Pr\u00e9cis: from unstructured keywords as queries to structured databases as answers. VLDB J. 17(1), 117\u2013149 (2008)","journal-title":"VLDB J."},{"key":"218_CR55","doi-asserted-by":"crossref","unstructured":"Sun, C., Chan, C.Y., Goenka, A.K.: Multiway sLCA-based keyword search in XML data. In: WWW, pp. 1043\u20131052 (2007)","DOI":"10.1145\/1242572.1242713"},{"issue":"1","key":"218_CR56","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00778-007-0072-z","volume":"17","author":"M. Theobald","year":"2008","unstructured":"Theobald M., Bast H., Majumdar D., Schenkel R., Weikum G.: Topx: efficient and versatile top-k query processing for semistructured data. VLDB J. 17(1), 81\u2013115 (2008)","journal-title":"VLDB J."},{"key":"218_CR57","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Automatic URL completion and prediction using fuzzy type-ahead search. In: SIGIR, pp. 634\u2013635 (2009)","DOI":"10.1145\/1571941.1572052"},{"key":"218_CR58","doi-asserted-by":"crossref","unstructured":"Wang, W., Xiao, C., Lin, X., Zhang, C.: Efficient approximate entity extraction with edit distance constraints. In: SIGMOD Conference, pp. 759\u2013770 (2009)","DOI":"10.1145\/1559845.1559925"},{"issue":"4","key":"218_CR59","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/1028099.1028102","volume":"22","author":"H.E. Williams","year":"2004","unstructured":"Williams H.E., Zobel J., Bahle D.: Fast phrase querying with combined indexes. ACM Trans. Inf. Syst. 22(4), 573\u2013594 (2004)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"1","key":"218_CR60","first-page":"933","volume":"1","author":"C. Xiao","year":"2008","unstructured":"Xiao C., Wang W., Lin X.: Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB 1(1), 933\u2013944 (2008)","journal-title":"PVLDB"},{"key":"218_CR61","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Shang, H.: Top-k set similarity joins. In: ICDE, pp. 916\u2013927 (2009)","DOI":"10.1109\/ICDE.2009.111"},{"key":"218_CR62","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"218_CR63","doi-asserted-by":"crossref","unstructured":"Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest LCAs in XML databases. In: SIGMOD Conference, pp. 537\u2013538 (2005)","DOI":"10.1145\/1066157.1066217"},{"key":"218_CR64","doi-asserted-by":"crossref","unstructured":"Xu, Y., Papakonstantinou, Y.: Efficient LCA based keyword search in XML data. In: EDBT, pp. 535\u2013546 (2008)","DOI":"10.1145\/1353343.1353408"},{"key":"218_CR65","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, B., Li, C.: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In: SIGMOD Conference (2008)","DOI":"10.1145\/1376616.1376655"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0218-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-011-0218-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0218-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T23:04:11Z","timestamp":1740956651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-011-0218-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,24]]},"references-count":65,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1007\/s00778-011-0218-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,24]]}}}