{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:39Z","timestamp":1725795879026},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080093"},{"type":"electronic","value":"9783319080109"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08010-9_16","type":"book-chapter","created":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T18:17:50Z","timestamp":1403115470000},"page":"138-149","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Entity Resolution Based on Similarity Join for Large-Scale Data Clustering"],"prefix":"10.1007","author":[{"given":"Tiezheng","family":"Nie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-chien","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Benjelloun, O., Garcia-Molina, H., Menestrina, D., Su, Q., Whang, S.E., Widom, J.: Swoosh: a generic approach to entity resolution. VLDB J., 255\u2013276 (2009)","DOI":"10.1007\/s00778-008-0098-x"},{"key":"16_CR2","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient Exact Set-Similarity Joins. In: VLDB, pp. 918\u2013929 (2006)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-45227-0_48","volume-title":"Database and Expert Systems Applications","author":"V. Dohnal","year":"2003","unstructured":"Dohnal, V., Gennaro, C., Zezula, P.: Similarity Join in Metric Spaces Using eD-Index. In: Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol.\u00a02736, pp. 484\u2013493. Springer, Heidelberg (2003)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A Primitive Operator for Similarity Joins in Data Cleaning. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic Clustering of the Web. Computer Networks, 1157\u20131166 (1997)","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cho, J., Shivakumar, N., Garcia-Molina, H.: Finding Replicated Web Collections. In: SIGMOD Conference, pp. 355\u2013366 (2000)","DOI":"10.1145\/335191.335429"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Spertus, E., Sahami, M., Buyukkokten, O.: Evaluating similarity measures: a large-scale study in the orkut social network. In: KDD, pp. 678\u2013684 (2005)","DOI":"10.1145\/1081870.1081956"},{"key":"16_CR8","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering Large Dense Subgraphs in Massive Graphs. In: VLDB, pp. 721\u2013732 (2005)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"On, B., Elmacioglu, E., Lee, D., Kang, J., Pei, J.: Improving Grouped-Entity Resolution Using Quasi-Cliques. In: ICDM, pp. 1008\u20131015 (2006)","DOI":"10.1109\/ICDM.2006.85"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Xin, D.: Mining Document Collections to Facilitate Accurate Approximate Entity Matching. In: PVLDB, pp. 395\u2013406 (2009)","DOI":"10.14778\/1687627.1687673"},{"issue":"7","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1366102.1366104","volume":"33","author":"E.H. Jacox","year":"2008","unstructured":"Jacox, E.H., Samet, H.: Metric space similarity joins. ACM Trans. Database Syst.\u00a033(7), 1\u201338 (2008)","journal-title":"ACM Trans. Database Syst."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Lee, H., Ng, R.T., Shim, K.: Similarity Join Size Estimation using Locality Sensitive Hashing. In: PVLDB, pp. 338\u2013349 (2011)","DOI":"10.14778\/1978665.1978666"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X., Wang, G.: Efficient similarity joins for near-duplicate detection. ACM Trans. Database Syst., 15 (2011)","DOI":"10.1145\/2000824.2000825"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-03973-7_8","volume-title":"Advances in Databases and Information Systems","author":"L.A. Ribeiro","year":"2009","unstructured":"Ribeiro, L.A., H\u00e4rder, T.: Efficient set similarity joins using min-prefixes. In: Grundspenkis, J., Morzy, T., Vossen, G. (eds.) ADBIS 2009. LNCS, vol.\u00a05739, pp. 88\u2013102. Springer, Heidelberg (2009)"},{"key":"16_CR15","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":"16_CR16","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering?: an adaptive framework for similarity join and search. In: SIGMOD Conference, pp. 85\u201396 (2012)","DOI":"10.1145\/2213836.2213847"},{"key":"16_CR17","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. In: OSDI, pp. 137\u2013150 (2004)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD Conference, pp. 495\u2013506 (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Silva, Y.N., Reed, J.M.: Exploiting MapReduce-based similarity joins. In: SIGMOD Conference, pp. 693\u2013696 (2012)","DOI":"10.1145\/2213836.2213935"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Sarma, A.D., Menestrina, D., Parameswaran, A.G., Ullman, J.D.: Fuzzy Joins Using MapReduce. In: ICDE, pp. 498\u2013509 (2012)","DOI":"10.1109\/ICDE.2012.66"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD Conference, pp. 495\u2013506 (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Wang, C., Wang, J., Lin, X., Wang, W., Wang, H., Li, H., Tian, W., Xu, J., Li, R.: MapDupReducer: detecting near duplicates over massive datasets. In: SIGMOD Conference, pp. 1119\u20131122 (2010)","DOI":"10.1145\/1807167.1807296"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08010-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:15:33Z","timestamp":1558912533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08010-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080093","9783319080109"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08010-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}