{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:06Z","timestamp":1742913606893,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319399577"},{"type":"electronic","value":"9783319399584"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39958-4_40","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T13:22:56Z","timestamp":1464700976000},"page":"506-518","source":"Crossref","is-referenced-by-count":0,"title":["GFSF: A Novel Similarity Join Method Based on Frequency Vector"],"prefix":"10.1007","author":[{"given":"Ziyu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daowen","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongxuan","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: Detectives: Detecting coalition hit inflation attacks in advertising networks streams. In: Proceedings of 16th International Conference on World Wide Web, pp. 241\u2013250. ACM Press, New York (2007)","DOI":"10.1145\/1242572.1242606"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Ji, S., Li, G., Li, C., et al.: Efficient interactive fuzzy keyword search. In: Proceedings of the 18th International Conference on World Wide Web, pp. 371\u2013380. ACM Press, New York (2009)","DOI":"10.1145\/1526709.1526760"},{"issue":"2","key":"40_CR3","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00778-008-0119-9","volume":"18","author":"X Dong","year":"2009","unstructured":"Dong, X., Halevy, A., Yu, C.: Data integration with uncertainty. Int. J. Very Large Data Bases 18(2), 469\u2013500 (2009)","journal-title":"Int. J. Very Large Data Bases"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: Proceedings of the 22nd International Conference on Data Engineering, p. 5. IEEE Press (2006)","DOI":"10.1109\/ICDE.2006.9"},{"issue":"1","key":"40_CR5","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"},{"issue":"1","key":"40_CR6","first-page":"1219","volume":"3","author":"J Wang","year":"2010","unstructured":"Wang, J., Li, G., Feng, J.: Trie-Join: efficient trie-based string similarity joins with edit-distance constraints. PVLDB 3(1), 1219\u20131230 (2010)","journal-title":"PVLDB"},{"issue":"3","key":"40_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.14778\/2078331.2078340","volume":"5","author":"G Li","year":"2011","unstructured":"Li, G., Deng, D., Wang, J., et al.: Pass-Join: a partition-based method for similarity joins. Proc. VLDB Endow. 5(3), 253\u2013264 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Sarwagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: Proceedings of ACM SIGMOD International Conference on Management of data, pp. 743\u2013754. ACM Press, New York (2004)","DOI":"10.1145\/1007568.1007652"},{"issue":"3","key":"40_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/2000824.2000825","volume":"36","author":"C Xiao","year":"2011","unstructured":"Xiao, C., Wang, W., Lin, X., et al.: Efficient similarity joins for near-duplicate detection. ACM Trans. Database Syst. 36(3), 15 (2011)","journal-title":"ACM Trans. Database Syst."},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 495\u2013506. ACM Press, New York (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proceedings of the 16th International WWW Conference, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Fe, J.: Fast-join: an efficient method for fuzzy token matching based string similarity join. In: Proceedings of the 27th IEEE International Conference on Data Engineering, pp. 458\u2013469. IEEE Press (2011)","DOI":"10.1109\/ICDE.2011.5767865"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganjam, K., Ganti, V., et al.: Robust, efficient fuzzy match for online data cleaning. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 313\u2013324. ACM Press, New York (2003)","DOI":"10.1145\/872757.872796"},{"key":"40_CR14","unstructured":"Gravano, L., Ipeirotis, P., Jagadish, H., et al.: Approximate string joins in a database (almost) for free. In: Proceedings of the International Conference on Very Large Databases, pp. 491\u2013500 (2001)"},{"issue":"8","key":"40_CR15","first-page":"704","volume":"5","author":"A Metwally","year":"2012","unstructured":"Metwally, A., Faloutsos, C.: V-SMART-Join: A scalable MapReduce framework for all-pair similarity joins of multisets and vectors. PVLDB 5(8), 704\u2013715 (2012)","journal-title":"PVLDB"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Hao, S., Wang, J., Feng, J.: MassJoin: A MapReduce-based method for scalable string similarity joins. In: ICDE 2014, pp. 340\u2013351 (2014)","DOI":"10.1109\/ICDE.2014.6816663"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Huang, J., Zhang, R., Buyya, R., Chen, J.: MELODY-JOIN: Efficient Earth Mover\u2019s Distance similarity joins using MapReduce. In: ICDE 2014, pp. 808\u2013819 (2014)","DOI":"10.1109\/ICDE.2014.6816702"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, Y., Li, X., Jensen, C.S., Chen, G.: Effcient metric indexing for similarity search. In: Proceedings of IEEE 31st International Conference on Data Engineering, pp. 591\u2013602, April 2015","DOI":"10.1109\/ICDE.2015.7113317"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Maehara, T., Kusumoto, M., Kawarabayashi, K.: Scalable SimRank join algorithm. In: 2015 IEEE 31st International Conference on Data Engineering (ICDE), pp. 603\u2013614 (2015)","DOI":"10.1109\/ICDE.2015.7113318"}],"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-39958-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T22:35:51Z","timestamp":1567982151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39958-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319399577","9783319399584"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39958-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}