{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:57:52Z","timestamp":1743094672755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030631185"},{"type":"electronic","value":"9783030631192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-63119-2_46","type":"book-chapter","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T21:33:59Z","timestamp":1605821639000},"page":"566-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Approach for Improving Recursive Joins Based on Three-Way Joins in Spark"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6837-6181","authenticated-orcid":false,"given":"Thanh-Ngoan","family":"Trieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1470-5496","authenticated-orcid":false,"given":"Anh-Cang","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4807-2463","authenticated-orcid":false,"given":"Thuong-Cang","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"issue":"9","key":"46_CR1","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/TKDE.2011.47","volume":"23","author":"FN Afrati","year":"2011","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing multiway joins in a map-reduce environment. IEEE Trans. Knowl. Data Eng. 23(9), 1282\u20131298 (2011). https:\/\/doi.org\/10.1109\/TKDE.2011.47","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Borkar, V., Carey, M., Polyzotis, N., Ullman, J.D.: Map-reduce extensions and recursive queries. In: Proceedings of the 14th International Conference on Extending Database Technology, pp. 1\u20138 (2011)","key":"46_CR2","DOI":"10.1145\/1951365.1951367"},{"doi-asserted-by":"publisher","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing joins in a map-reduce environment. In: Proceedings of the 13th International Conference on Extending Database Technology, EDBT 2010, pp. 99\u2013110. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1739041.1739056","key":"46_CR3","DOI":"10.1145\/1739041.1739056"},{"doi-asserted-by":"publisher","unstructured":"Afrati, F.N., Ullman, J.D.: Transitive closure and recursive datalog implemented on clusters. In: Proceedings of the 15th International Conference on Extending Database Technology, EDBT 2012, pp. 132\u2013143. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2247596.2247613","key":"46_CR4","DOI":"10.1145\/2247596.2247613"},{"unstructured":"Agrawal, R., Jagadish, H.V.: Direct algorithms for computing the transitive closure of database relations. In: Proceedings of the 13th International Conference on Very Large Data Bases, VLDB 1987, pp. 255\u2013266. Morgan Kaufmann Publishers Inc., San Francisco (1987)","key":"46_CR5"},{"unstructured":"Ahmad, F.: Puma benchmarks and dataset downloads (2011). https:\/\/engineering.purdue.edu\/~puma\/datasets.htm. Accessed 20 Oct 2019","key":"46_CR6"},{"unstructured":"Apache: Apache hadoop (2002). https:\/\/hadoop.apache.org. Accessed 20 July 2019","key":"46_CR7"},{"unstructured":"Apache: Apache spark (2009). https:\/\/spark.apache.org. Accessed 20 July 2019","key":"46_CR8"},{"key":"46_CR9","series-title":"Topics in Information Systems","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-1-4612-4980-1_17","volume-title":"On Knowledge Base Management Systems","author":"F Bancilhon","year":"1986","unstructured":"Bancilhon, F.: Naive evaluation of recursively defined relations. In: Brodie, M.L., Mylopoulos, J. (eds.) On Knowledge Base Management Systems. TINF, pp. 165\u2013178. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-1-4612-4980-1_17"},{"issue":"2","key":"46_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/16856.16859","volume":"15","author":"F Bancilhon","year":"1986","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies. SIGMOD Rec. 15(2), 16\u201352 (1986). https:\/\/doi.org\/10.1145\/16856.16859","journal-title":"SIGMOD Rec."},{"unstructured":"Bheemavaram, R., Zhang, J., Li, W.N.: A parallel and distributed approach for finding transitive closures of data records: a proposal, January 2006","key":"46_CR11"},{"issue":"7","key":"46_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"46_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.14778\/1920841.1920881","volume":"3","author":"Y Bu","year":"2010","unstructured":"Bu, Y., Howe, B., Balazinska, M., Ernst, M.D.: HaLoop: efficient iterative data processing on large clusters. Proc. VLDB Endow. 3(1\u20132), 285\u2013296 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1002\/(SICI)1098-111X(199610)11:10<807::AID-INT7>3.0.CO;2-2","volume":"11","author":"Y Chen","year":"1996","unstructured":"Chen, Y.: On the bottom - up evaluation of recursive queries. Int. J. Intell. Syst. 11, 807\u2013832 (1996)","journal-title":"Int. J. Intell. Syst."},{"issue":"1","key":"46_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"unstructured":"Gribkoff, E.: Distributed algorithms for the transitive closure (2013)","key":"46_CR16"},{"doi-asserted-by":"publisher","unstructured":"Idreos, S., Liarou, E., Koubarakis, M.: Continuous multi-way joins over distributed hash tables. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, EDBT 2008, pp. 594\u2013605. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1353343.1353415","key":"46_CR17","DOI":"10.1145\/1353343.1353415"},{"unstructured":"Ioannidis, Y.E.: On the computation of the transitive closure of relational operators. In: Proceedings of the 12th International Conference on Very Large Data Bases, VLDB 1986, pp. 403\u2013411. Morgan Kaufmann Publishers Inc., San Francisco (1986)","key":"46_CR18"},{"issue":"24","key":"46_CR19","first-page":"24","volume":"120","author":"TA Jilani","year":"2015","unstructured":"Jilani, T.A., Fatima, U., Baig, M.M., Mahmood, S.: A survey and comparative study of different PageRank algorithms. Int. J. Comput. Appl. 120(24), 24\u201330 (2015)","journal-title":"Int. J. Comput. Appl."},{"doi-asserted-by":"publisher","unstructured":"Kimmett, B., Thomo, A., Venkatesh, S.: Three-way joins on MapReduce: an experimental study. In: IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications, pp. 227\u2013232, July 2014. https:\/\/doi.org\/10.1109\/IISA.2014.6878811","key":"46_CR20","DOI":"10.1109\/IISA.2014.6878811"},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1017\/CBO9781139924801.011","volume-title":"Mining Social-Network Graphs","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining Social-Network Graphs, 2nd edn., pp. 325\u2013383. Cambridge University Press, Cambridge (2014). https:\/\/doi.org\/10.1017\/CBO9781139924801.011","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","key":"46_CR22","DOI":"10.1145\/1807167.1807184"},{"doi-asserted-by":"publisher","unstructured":"Ordonez, C.: Optimizing recursive queries in SQL. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, pp. 834\u2013839. Association for Computing Machinery, New York (2005). https:\/\/doi.org\/10.1145\/1066157.1066260","key":"46_CR23","DOI":"10.1145\/1066157.1066260"},{"unstructured":"Phan, T.C.: Optimization for big joins and recursive query evaluation using intersection and difference filters in MapReduce. Theses, Universit\u00e9 Blaise Pascal - Clermont-Ferrand II, July 2014. https:\/\/tel.archives-ouvertes.fr\/tel-01066612","key":"46_CR24"},{"doi-asserted-by":"publisher","unstructured":"Phan, T.C., d\u2019Orazio, L., Rigaux, P.: Toward intersection filter-based optimization for joins in MapReduce. In: Proceedings of the 2nd International Workshop on Cloud Intelligence, Cloud-I 2013. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2501928.2501932","key":"46_CR25","DOI":"10.1145\/2501928.2501932"},{"key":"46_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-662-49534-6_2","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems XXV","author":"T-C Phan","year":"2016","unstructured":"Phan, T.-C., d\u2019Orazio, L., Rigaux, P.: A theoretical and experimental comparison of filter-based equijoins in MapReduce. In: Hameurlain, A., K\u00fcng, J., Wagner, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems XXV. LNCS, vol. 9620, pp. 33\u201370. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49534-6_2"},{"doi-asserted-by":"publisher","unstructured":"Phan, T.C., Tran, T.T.Q., Phan, A.C.: Optimization of recursive joins on large-scale datasets in spark, pp. 729\u2013742. Vietnam Academy of Science and Technology, Hanoi (2016). https:\/\/doi.org\/10.15625\/vap.2016.00091","key":"46_CR27","DOI":"10.15625\/vap.2016.00091"},{"unstructured":"Save, A.M., Kolkur, S.: Article: hybrid technique for data cleaning. In: IJCA Proceedings on National Conference on Role of Engineers in National Building, NCRENB, pp. 4\u20138, June 2014","key":"46_CR28"},{"issue":"4","key":"46_CR29","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02242140","volume":"30","author":"L Schmitz","year":"1983","unstructured":"Schmitz, L.: An improved transitive closure algorithm. Computing 30(4), 359\u2013371 (1983). https:\/\/doi.org\/10.1007\/BF02242140","journal-title":"Computing"},{"unstructured":"Seufert, S., Anand, A., Bedathur, S., Weikum, G.: High-performance reachability query processing under index size restrictions (2012)","key":"46_CR30"},{"key":"46_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-32925-8_17","volume-title":"Datalog in Academia and Industry","author":"M Shaw","year":"2012","unstructured":"Shaw, M., Koutris, P., Howe, B., Suciu, D.: Optimizing large-scale semi-Na\u00efve datalog evaluation in hadoop. In: Barcel\u00f3, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 165\u2013176. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32925-8_17"},{"issue":"4","key":"46_CR32","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"HS Warren","year":"1975","unstructured":"Warren, H.S.: A modification of Warshall\u2019s algorithm for the transitive closure of binary relations. Commun. ACM 18(4), 218\u2013220 (1975). https:\/\/doi.org\/10.1145\/360715.360746","journal-title":"Commun. ACM"},{"issue":"1","key":"46_CR33","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on Boolean matrices. J. ACM 9(1), 11\u201312 (1962). https:\/\/doi.org\/10.1145\/321105.321107","journal-title":"J. ACM"},{"unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I., et al.: Spark: cluster computing with working sets. In: HotCloud 2010, no. 10, p. 95 (2010)","key":"46_CR34"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63119-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T10:57:15Z","timestamp":1710241035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-63119-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030631185","9783030631192"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63119-2_46","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Da Nang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}