{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T15:10:13Z","timestamp":1741446613869,"version":"3.38.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T00:00:00Z","timestamp":1313107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s11280-011-0137-1","type":"journal-article","created":{"date-parts":[[2011,8,11]],"date-time":"2011-08-11T08:35:38Z","timestamp":1313051738000},"page":"573-597","source":"Crossref","is-referenced-by-count":1,"title":["Efficient top-K approximate searches against a relation with multiple attributes"],"prefix":"10.1007","volume":"14","author":[{"given":"Wei","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinchuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,12]]},"reference":[{"key":"137_CR1","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: Proc. VLDB, pp. 918\u2013929 (2006)"},{"issue":"2","key":"137_CR2","first-page":"13","volume":"29","author":"O Benjelloun","year":"2006","unstructured":"Benjelloun, O., Garcia-Molina, H., Kawai, H., Larson, T.E., Menestrina, D., Su, Q., Thavisomboon, S., Widom, J.: Generic entity resolution in the SERF project. IEEE Data Eng. Bull. 29(2), 13\u201320 (2006)","journal-title":"IEEE Data Eng. Bull."},{"key":"137_CR3","doi-asserted-by":"crossref","unstructured":"Cao, P., Wang, Z.: Efficient top-K query calculation in distributed networks. In: Proc. PODC, pp. 206\u2013215 (2007)","DOI":"10.1145\/1011767.1011798"},{"key":"137_CR4","doi-asserted-by":"crossref","unstructured":"Chandel, A., Hassanzadeh, O., Koudas, N., Sadoghi, M., Srivastava, D.: Benchmarking declarative approximate selection predicates. In: SIGMOD, pp. 353\u2013364 (2007)","DOI":"10.1145\/1247480.1247521"},{"key":"137_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: Proc. ICDE, p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"137_CR6","unstructured":"Chaudhuri, S., Chen, B.-C., Ganti, V., Kaushik, R.: Example-driven design of efficient record matching queries. In: Proc. VLDB, pp.327\u2013338 (2007)"},{"key":"137_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, W.W.: Integration of heterogeneous databases without common domains using queries based on textual similarity. In: SIGMOD, pp. 201\u2013212 (1998)","DOI":"10.1145\/276305.276323"},{"key":"137_CR8","first-page":"802","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press\/McGraw-Hill, Cambridge\/New York, pp. 802\u2013803 (2001)","edition":"2"},{"issue":"1","key":"137_CR9","first-page":"216","volume":"58","author":"R Fagin","year":"1996","unstructured":"Fagin, R.: Combining fuzzy information from multiple. J. Comput. Syst. Sci. 58(1), 216\u2013226 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"137_CR10","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proc. PODS, pp. 102\u2013113 (2001)","DOI":"10.1145\/375551.375567"},{"key":"137_CR11","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P. Faloutsos, C.: On power-law relationships of the Internet topology. In: Proc. SIGCOMM, pp. 251\u2013262 (1999)","DOI":"10.1145\/316194.316229"},{"key":"137_CR12","unstructured":"Galhardas, H., Florescu, D., Shasha, D., Simon, E., Saita, C.-A.: Declarative data cleaning: language, model, and algorithms. In: Proc. VLDB, pp. 371\u2013380 (2001)"},{"key":"137_CR13","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: Proc. VLDB, pp. 491\u2013500 (2001)"},{"key":"137_CR14","doi-asserted-by":"crossref","unstructured":"Gravano, L., Ipeirotis, P.G., Koudas, N., Srivastava, D.: Text joins in an RDBMS for web data integration. In: Proc. WWW, pp. 90\u2013101 (2003)","DOI":"10.1145\/775165.775166"},{"key":"137_CR15","doi-asserted-by":"crossref","unstructured":"Guha, S., Koudas, N., Marathe, A., Srivastava, D.: Merging the results of approximate match operations. In: Proc. VLDB, pp. 636\u2013647 (2004)","DOI":"10.1016\/B978-012088469-8\/50057-7"},{"key":"137_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"137_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009761603038","volume":"2","author":"MA Hern\u00e1ndez","year":"1998","unstructured":"Hern\u00e1ndez, M.A., Stolfo, S.J.: Real-world data is dirty: data cleansing and the merge\/purge problem. Data Mining and Knowledge Discovery 2(1), 9\u201337 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"137_CR18","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: Survey of top-k query processing techniques in relational database systems. In: ACM Computing Surveys (2008)","DOI":"10.1145\/1391729.1391730"},{"key":"137_CR19","doi-asserted-by":"crossref","unstructured":"Ji, S., Li, G., Li, C., Feng, J.: Efficient interactive fuzzy keyword search. In: Proc. WWW, pp. 371\u2013380 (2009)","DOI":"10.1145\/1526709.1526760"},{"key":"137_CR20","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramakrishnan, R.: On the integration of structure indexes and inverted lists. In: Proc. SIGMOD, pp. 779\u2013790 (2004)","DOI":"10.1145\/1007568.1007656"},{"key":"137_CR21","doi-asserted-by":"crossref","unstructured":"Koudas, N., Marathe, A., Srivastava, D.: Flexible string matching against large databases in practice. In: Proc. VLDB, pp. 1078\u20131086 (2004)","DOI":"10.1016\/B978-012088469-8\/50094-2"},{"key":"137_CR22","doi-asserted-by":"crossref","unstructured":"Koudas, N., Sarawagi, S., Srivastava, D.: Record linkage: similarity measures and algorithms. In: Proc. SIGMOD, pp. 802\u2013803 (2006)","DOI":"10.1145\/1142473.1142599"},{"key":"137_CR23","unstructured":"Li, C., Wang, B., Yang, K.: VGRAM: improving performance of approximate queries on string collections using variable-length grams. In: Proc. VLDB, pp. 303\u2013314 (2007)"},{"key":"137_CR24","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: Proc. ICDE, pp. 257\u2013266 (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"137_CR25","doi-asserted-by":"crossref","unstructured":"Lu, W., Rong, C., Chen, J., Du, X., Fung, G., Zhou, X.: Efficient common item extraction from multiple sorted lists. In: Proc. Apweb (2010)","DOI":"10.1109\/APWeb.2010.16"},{"issue":"2","key":"137_CR26","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s11280-011-0109-5","volume":"14","author":"W Lu","year":"2011","unstructured":"Lu, W., Fung, G.P., Du, X., Zhou, X., Chen, L., Deng, K.: Approximate entity extraction in temporal databases. World Wide Web J. 14(2), 157\u2013186 (2011)","journal-title":"World Wide Web J."},{"key":"137_CR27","doi-asserted-by":"crossref","unstructured":"Luo, Y., Lin, X., Wang, W., Zhou, X.: SPARK: Top-K keyword query in relational databases. In: Proc. SIGMOD, pp. 115\u2013126 (2007)","DOI":"10.1145\/1247480.1247495"},{"issue":"1","key":"137_CR28","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"137_CR29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"3","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 3, 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"137_CR30","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: SIGMOD, pp. 743\u2013754 (2004)","DOI":"10.1145\/1007568.1007652"},{"key":"137_CR31","doi-asserted-by":"crossref","unstructured":"Wang, W., Xiao, C., Lin, X., Zhang, C.: Efficient approximate entity extraction with edit distance constraints. In: Proc. SIGMOD, pp. 759\u2013770 (2009)","DOI":"10.1145\/1559845.1559925"},{"key":"137_CR32","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"IH Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, New York (1999)","edition":"2"},{"issue":"1","key":"137_CR33","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":"137_CR34","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: Proc. WWW, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"137_CR35","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, K., Shang, H.: Top-k set similarity joins. In: Proc. ICDE, pp. 916\u2013927 (2009)","DOI":"10.1109\/ICDE.2009.111"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-011-0137-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-011-0137-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-011-0137-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T14:29:02Z","timestamp":1741444142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-011-0137-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,12]]},"references-count":35,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s11280-011-0137-1","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2011,8,12]]}}}