{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:34:06Z","timestamp":1790681646123,"version":"4.1.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030590642","type":"print"},{"value":"9783030590659","type":"electronic"}],"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-59065-9_12","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:22:15Z","timestamp":1599722535000},"page":"141-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries"],"prefix":"10.1007","author":[{"given":"Abir","family":"Farouzi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ladjel","family":"Bellatreche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Ordonez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mimoun","family":"Malki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,11]]},"reference":[{"issue":"4","key":"12_CR1","first-page":"277","volume":"6","author":"FN Afrati","year":"2013","unstructured":"Afrati, F.N., Sarma, A.D., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a MapReduce computation. PVLDB 6(4), 277\u2013288 (2013)","journal-title":"PVLDB"},{"key":"12_CR2","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-99133-7_7","volume-title":"Database and Expert Systems Applications","author":"ST Al-Amin","year":"2018","unstructured":"Al-Amin, S.T., Ordonez, C., Bellatreche, L.: Big data analytics: exploring graphs with optimized SQL queries. In: Elloumi, M., et al. (eds.) DEXA 2018. CCIS, vol. 903, pp. 88\u2013100. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99133-7_7"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Al Hasan, M., Dave, V.S.: Triangle counting in large networks: a review. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 8(2), e1226 (2018)","DOI":"10.1002\/widm.1226"},{"key":"12_CR4","unstructured":"Arifuzzaman, S., Khan, M., Marathe, M.: A space-efficient parallel algorithm for counting exact triangles in massive networks. In: HPCC, pp. 527\u2013534 (2015)"},{"issue":"6","key":"12_CR5","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1080\/15427951.2015.1037030","volume":"11","author":"JW Berry","year":"2015","unstructured":"Berry, J.W., Fostvedt, L.A., Nordman, D.J., Phillips, C.A., Seshadhri, C., Wilson, A.G.: Why do simple algorithms for triangle enumeration work in the real world? Internet Math. 11(6), 555\u2013571 (2015)","journal-title":"Internet Math."},{"issue":"3\u20134","key":"12_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10619-017-7200-6","volume":"35","author":"W Cabrera","year":"2017","unstructured":"Cabrera, W., Ordonez, C.: Scalable parallel graph algorithms with matrix-vector multiplication evaluated with queries. DAPD J. 35(3\u20134), 335\u2013362 (2017). \nhttps:\/\/doi.org\/10.1007\/s10619-017-7200-6","journal-title":"DAPD J."},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2382577.2382581","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. ACM Trans. Knowl. Discov. Data 6(4), 17 (2012)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Cui, Y., Xiao, D., Cline, D.B., Loguinov, D.: Improving I\/O complexity of triangle enumeration. In: IEEE ICDM, pp. 61\u201370 (2017)","DOI":"10.1109\/ICDM.2017.15"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Das, S., Santra, A., Bodra, J., Chakravarthy, S.: Query processing on large graphs: approaches to scalability and response time trade offs. Data Knowl. Eng. 126, 101736 (2020). \nhttps:\/\/doi.org\/10.1016\/j.datak.2019.101736","DOI":"10.1016\/j.datak.2019.101736"},{"key":"12_CR10","unstructured":"Fan, J., Raj, A.G.S., Patel, J.M.: The case against specialized graph analytics engines. In: CIDR (2015)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.W.: Massive graph triangulation. In: ACM SIGMOD, pp. 325\u2013336 (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Klauck, H., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed computation of large-scale graph problems. In: ACM-SIAM SODA, pp. 391\u2013410 (2015)","DOI":"10.1137\/1.9781611973730.28"},{"issue":"1\u20133","key":"12_CR14","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: ACM SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2013","unstructured":"Ngo, H.Q., R\u00e9, C., Rudra, A.: Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec. 42(4), 5\u201316 (2013)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TKDE.2009.83","volume":"22","author":"C Ordonez","year":"2010","unstructured":"Ordonez, C.: Optimization of linear recursive queries in SQL. IEEE Trans. Knowl. Data Eng. 22(2), 264\u2013277 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.is.2016.04.006","volume":"63","author":"C Ordonez","year":"2017","unstructured":"Ordonez, C., Cabrera, W., Gurram, A.: Comparing columnar, row and array DBMSs to process recursive queries on graphs. Inf. Syst. 63, 66\u201379 (2017)","journal-title":"Inf. Syst."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: On the distributed complexity of large-scale graph computations. In: SPAA, pp. 405\u2013414 (2018)","DOI":"10.1145\/3210377.3210409"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Park, H.M., Chung, C.W.: An efficient MapReduce algorithm for counting triangles in a very large graph. In: ACM CIKM, pp. 539\u2013548 (2013)","DOI":"10.1145\/2505515.2505563"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Schank, T.: Algorithmic aspects of triangle-based network analysis (2007)","DOI":"10.1155\/2007\/52861"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Shun, J., Tangwongsan, K.: Multicore triangle computations without tuning. In: ICDE, pp. 149\u2013160 (2015)","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Sun, W., Fokoue, A., Srinivas, K., Kementsietsidis, A., Hu, G., Xie, G.: SQLGraph: an efficient relational-based property graph store. In: ACM SIGMOD, pp. 1887\u20131901 (2015)","DOI":"10.1145\/2723372.2723732"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW, pp. 607\u2013614 (2011)","DOI":"10.1145\/1963405.1963491"},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"58","DOI":"10.14778\/1921071.1921073","volume":"4","author":"N Wang","year":"2010","unstructured":"Wang, N., Zhang, J., Tan, K.L., Tung, A.K.H.: On triangulation-based dense neighborhood graph discovery. Proc. VLDB Endow. 4(2), 58\u201368 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"26294","DOI":"10.1109\/ACCESS.2019.2901025","volume":"7","author":"Y Zhang","year":"2019","unstructured":"Zhang, Y., Jiang, H., Wang, F., Hua, Y., Feng, D., Xu, X.: LiteTE: lightweight, communication-efficient distributed-memory triangle enumerating. IEEE Access 7, 26294\u201326306 (2019)","journal-title":"IEEE Access"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Zhao, K., Yu, J.X.: All-in-one: graph processing in RDBMSs revisited. In: SIGMOD, pp. 1165\u20131180 (2017)","DOI":"10.1145\/3035918.3035943"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10619-017-7193-1","volume":"35","author":"Y Zhu","year":"2017","unstructured":"Zhu, Y., Zhang, H., Qin, L., Cheng, H.: Efficient MapReduce algorithms for triangle listing in billion-scale graphs. Distrib. Parallel Databases 35(2), 149\u2013176 (2017). \nhttps:\/\/doi.org\/10.1007\/s10619-017-7193-1","journal-title":"Distrib. Parallel Databases"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59065-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:26:48Z","timestamp":1599722808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59065-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590642","9783030590659"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59065-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DaWaK","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics and Knowledge Discovery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dawak2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dawak2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","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":"15","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":"14","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":"19% - 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-5","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":"2-3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}