{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:48:19Z","timestamp":1742921299631,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260743"},{"type":"electronic","value":"9783030260750"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26075-0_14","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T19:05:48Z","timestamp":1563995148000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["FreshJoin: An Efficient and Adaptive Algorithm for Set Containment Join"],"prefix":"10.1007","author":[{"given":"Jizhou","family":"Luo","sequence":"first","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shengfei","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zening","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, W., Yang, S., Zhang, Y., Lin, X.: TT-join: efficient set containment join. In: Proceedings of ICDE 2017, pp. 509\u2013520 (2017)","DOI":"10.1109\/ICDE.2017.107"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Kunkel, A., Rheinl\u00e4nder, A., Schiefer, C., Helmer, S., Bouros, P., Leser, U.: Piejoin: towards parallel set containment joins. In: Baumann, P., Manolescu-Goujot, I., Trani, L. (eds.) SSDBM 2016, pp. 11\u201322 (2016)","DOI":"10.1145\/2949689.2949694"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Luo, Y., Fletcher, G., Hidders, J., De Bra, P.: Efficient and scalable trie-based algorithms for computing set containment relations. In: Gehrke, J., Lehner, W., Shim, K., et al. (eds.) ICDE 2015, pp. 303\u2013314 (2015)","DOI":"10.1109\/ICDE.2015.7113293"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2014.10.004","volume":"49","author":"P Bouros","year":"2015","unstructured":"Bouros, P., Mamoulis, N., Ge, S., Terrovitis, M.: Set containment join revisited. Knowl. Inf. Syst. 49, 1\u201328 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/11408079_69","volume-title":"Database Systems for Advanced Applications","author":"R Jampani","year":"2005","unstructured":"Jampani, R., Pudi, V.: Using prefix-trees for efficiently computing set joins. In: Zhou, L., Ooi, B.C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 761\u2013772. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11408079_69"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Mamoulis, N.: Efficient processing of joins on set-valued attributes. In: Halevy, A., Ives, Z., Doan, A. (eds.) SIGMOD 2003, pp. 157\u2013168 (2003)","DOI":"10.1145\/872757.872778"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/762471.762474","volume":"28","author":"S Melnik","year":"2003","unstructured":"Melnik, S., Molina, H.: Adaptive algorithms for set containment joins. ACM Trans. Database Syst. 28(1), 56\u201399 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3-540-45876-X_28","volume-title":"Advances in Database Technology \u2014 EDBT 2002","author":"S Melnik","year":"2002","unstructured":"Melnik, S., Garcia-Molina, H.: Divide-and-conquer algorithm for computing set containment joins. In: Jensen, C.S., et al. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 427\u2013444. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45876-X_28"},{"key":"14_CR9","unstructured":"Ramasamy, K., Patel, J., Naughton, J., Kaushik, R.: Set containment joins: the good, the bad and the ugly. In: Abbadi, A., Brodie, M., Chakravarthy, S., et al. (eds.) VLDB 2000, pp. 386\u2013395 (2000)"},{"key":"14_CR10","unstructured":"Helmer, S., Moerkotte, G.: Evaluation of main memory join algorithms for joins with set comparison predicates. In: Jarke, M., Carey, J., Dittrich, R., et al. (eds.) VLDB 1997, pp. 386\u2013395 (1997)"},{"issue":"12","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.14778\/2994509.2994534","volume":"9","author":"E Zhu","year":"2016","unstructured":"Zhu, E., Nargesian, F., Pu, K., Miller, R.: LSH ensemble: internet scale domain search. Proc. VLDB Endow. 9(12), 1185\u20131196 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"14_CR12","doi-asserted-by":"publisher","first-page":"636","DOI":"10.14778\/2947618.2947620","volume":"9","author":"W Mann","year":"2016","unstructured":"Mann, W., Augsten, N., Bouros, P.: An empirical evaluation of set similarity join techniques. Proc. VLDB Endow. 9(9), 636\u2013647 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Luo, J., Gao, H., Li, J., et al.: Techique report on Freshjoin an adaptive algorithm for set containment join. \nhttps:\/\/doi.org\/10.13140\/RG.2.2.32373.63207","DOI":"10.13140\/RG.2.2.32373.63207"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26075-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T07:04:34Z","timestamp":1574060674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26075-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260743","9783030260750"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26075-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}