{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:34:50Z","timestamp":1790681690805,"version":"4.1.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10619-023-07437-x","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T14:02:10Z","timestamp":1689256930000},"page":"103-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Balanced parallel triangle enumeration with an adaptive algorithm"],"prefix":"10.1007","volume":"42","author":[{"given":"Abir","family":"Farouzi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiantian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ladjel","family":"Bellatreche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mimoun","family":"Malki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Ordonez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"issue":"2","key":"7437_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1086\/653658","volume":"116","author":"A Wimmer","year":"2010","unstructured":"Wimmer, A., Lewis, K.: Beyond and below racial homophily: Erg models of a friendship network documented on facebook. Am. J. Sociol. 116(2), 583\u2013642 (2010). https:\/\/doi.org\/10.1086\/653658","journal-title":"Am. J. Sociol."},{"key":"7437_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and ap- plications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social network analysis: methods and ap- plications. Cambridge University Press, Cambridge (1994). https:\/\/doi.org\/10.1017\/CBO9780511815478"},{"issue":"1\u20132","key":"7437_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/15427951.2012.625260","volume":"8","author":"MN Kolountzakis","year":"2012","unstructured":"Kolountzakis, M.N., Miller, G.L., Peng, R., Tsourakakis, C.E.: Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Math. 8(1\u20132), 161\u2013185 (2012). https:\/\/doi.org\/10.1080\/15427951.2012.625260","journal-title":"Internet Math."},{"issue":"9","key":"7437_CR4","doi-asserted-by":"publisher","first-page":"5825","DOI":"10.1073\/pnas.032093399","volume":"99","author":"J-P Eckmann","year":"2002","unstructured":"Eckmann, J.-P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc. Natl. Acad. Sci. 99(9), 5825\u20135829 (2002). https:\/\/doi.org\/10.1073\/pnas.032093399","journal-title":"Proc. Natl. Acad. Sci."},{"key":"7437_CR5","doi-asserted-by":"publisher","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of the 14th ACM SIGKDD pp. 16-24, (2008). https:\/\/doi.org\/10.1145\/1401890.1401898","DOI":"10.1145\/1401890.1401898"},{"issue":"2","key":"7437_CR6","first-page":"1","volume":"8","author":"HT Welser","year":"2007","unstructured":"Welser, H.T., Gleave, E., Fisher, D., Smith, M.: Visualizing the signatures of social roles in online discussion groups. J. Soc. Struct. 8(2), 1\u201332 (2007)","journal-title":"J. Soc. Struct."},{"issue":"2","key":"7437_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1021819901281","volume":"20","author":"BJ Mirza","year":"2003","unstructured":"Mirza, B.J., Keller, B.J., Ramakrishnan, N.: Studying recommendation algorithms by graph analysis. J. Intell. Inf. Syst. 20(2), 131\u2013160 (2003). https:\/\/doi.org\/10.1023\/A:1021819901281","journal-title":"J. Intell. Inf. Syst."},{"issue":"2","key":"7437_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/248210.248223","volume":"16","author":"I Fudos","year":"1997","unstructured":"Fudos, I., Hoffmann, C.M.: A graph-constructive approach to solving systems of geometric constraints. ACM Trans. Graph. 16(2), 179\u2013216 (1997). https:\/\/doi.org\/10.1145\/248210.248223","journal-title":"ACM Trans. Graph."},{"issue":"6","key":"7437_CR9","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."},{"key":"7437_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-CSS-ICESS.2015.301","author":"S Arifuzzaman","year":"2015","unstructured":"Arifuzzaman, S., Khan, M., Marathe, M.: A space-efficient parallel algorithm for counting exact triangles in massive networks. Hpcc (2015). https:\/\/doi.org\/10.1109\/HPCC-CSS-ICESS.2015.301","journal-title":"Hpcc"},{"key":"7437_CR11","doi-asserted-by":"publisher","unstructured":"Teixeira, C.H.C., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: A system for distributed graph mining. In: Proceedings of the 25th Symposium on Operating Systems Principles pp. 425-440 (2015). New York: Association for Computing Machinery. Retrieved from https:\/\/doi.org\/10.1145\/2815400.2815410","DOI":"10.1145\/2815400.2815410"},{"key":"7437_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2015.12.006","volume":"336","author":"MK Rasel","year":"2016","unstructured":"Rasel, M.K., Han, Y., Kim, J., Park, K., Tu, N.A., Lee, Y.-K.: Itri: index-based triangle listing in massive graphs. Inf. Sci. 336, 1\u201320 (2016)","journal-title":"Inf. Sci."},{"key":"7437_CR13","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939757","author":"H-M Park","year":"2016","unstructured":"Park, H.-M., Myaeng, S.-H., Kang, U.: PTE: enumerating trillion triangles on distributed systems. ACM SIGKDD (2016). https:\/\/doi.org\/10.1145\/2939672.2939757","journal-title":"ACM SIGKDD"},{"issue":"2","key":"7437_CR14","first-page":"149","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. DAPD J. 35(2), 149\u2013176 (2017)","journal-title":"DAPD J."},{"key":"7437_CR15","doi-asserted-by":"crossref","unstructured":"Klauck, H., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed computation of large-scale graph problems. In: Proceedings of the 26th ACM-SIAM SODA, pp. 391-410 (2015)","DOI":"10.1137\/1.9781611973730.28"},{"issue":"2","key":"7437_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1226","volume":"8","author":"M Al Hasan","year":"2018","unstructured":"Al Hasan, M., Dave, V.S.: Triangle counting in large networks: a review. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 8(2), e1226 (2018)","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"issue":"4","key":"7437_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a mapreduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009). https:\/\/doi.org\/10.1109\/MCSE.2009.120","journal-title":"Comput. Sci. Eng."},{"issue":"12","key":"7437_CR18","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.14778\/2824032.2824129","volume":"8","author":"K Xirogiannopoulos","year":"2015","unstructured":"Xirogiannopoulos, K., Khurana, U., Deshpande, A.: Graphgen: exploring interesting graphs in relational data. Proc. VLDB Endow. 8(12), 2032\u20132035 (2015). https:\/\/doi.org\/10.14778\/2824032.2824129","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"7437_CR19","first-page":"25","volume":"74","author":"S Bordoloi","year":"2013","unstructured":"Bordoloi, S., Kalita, B.: Article: designing graph database models from existing relational databases. Intern. J. Comput. Appl. 74(1), 25\u201331 (2013)","journal-title":"Intern. J. Comput. Appl."},{"key":"7437_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484426","author":"R De Virgilio","year":"2013","unstructured":"De Virgilio, R., Maccioni, A., Torlone, R.: Converting relational to graph databases. GRADES 2013 co-located with SIGMOD\/PODS (2013). https:\/\/doi.org\/10.1145\/2484425.2484426","journal-title":"GRADES 2013 co-located with SIGMOD\/PODS"},{"key":"7437_CR21","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"7437_CR22","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: The koblenz network collection. http:\/\/konect.uni-koblenz.de. Association for Computing Machinery (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"7437_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54","author":"T Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. Exp. Effic. Algorithms (2005). https:\/\/doi.org\/10.1007\/11427186_54","journal-title":"Exp. Effic. Algorithms"},{"issue":"4","key":"7437_CR24","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). https:\/\/doi.org\/10.1137\/0207033","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7437_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10844-019-00579-4","volume":"55","author":"R Ayed","year":"2020","unstructured":"Ayed, R., Hacid, M., Haque, R., Jemai, A.: An updated dashboard of complete search FSM implementations in centralized graph transaction databases. J. Intell. Inf. Syst. 55(1), 149\u2013182 (2020). https:\/\/doi.org\/10.1007\/s10844-019-00579-4","journal-title":"J. Intell. Inf. Syst."},{"key":"7437_CR26","doi-asserted-by":"crossref","unstructured":"Yu, M., Qin, L., Zhang, Y., Zhang, W., Lin, X.:. Aot: Pushing the efficiency boundary of main-memory triangle listing. In: Nah, Y., Cui, B., Lee, S.-W., Yu, J.X., Moon, Y.-S., Whang, S.E. (Eds.), Database systems for advanced applications (pp. 516-533). Cham: Springer International Publishing (2020)","DOI":"10.1007\/978-3-030-59416-9_31"},{"key":"7437_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00119","author":"M Yu","year":"2021","unstructured":"Yu, M., Qin, L., Zhang, Y., Zhang, W., Lin, X.: Dptl+: efficient parallel triangle listing on batch-dynamic graphs. IEEE ICDE (2021). https:\/\/doi.org\/10.1109\/ICDE51399.2021.00119","journal-title":"IEEE ICDE"},{"issue":"4","key":"7437_CR28","doi-asserted-by":"publisher","first-page":"277","DOI":"10.14778\/2535570.2488334","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). https:\/\/doi.org\/10.14778\/2535570.2488334","journal-title":"PVLDB"},{"key":"7437_CR29","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505563","author":"H-M Park","year":"2013","unstructured":"Park, H.-M., Chung, C.-W.: An efficient MapReduce algorithm for counting triangles in a very large graph. ACM CIKM (2013). https:\/\/doi.org\/10.1145\/2505515.2505563","journal-title":"ACM CIKM"},{"issue":"2","key":"7437_CR30","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. DAPD 35(2), 149\u2013176 (2017). https:\/\/doi.org\/10.1007\/s10619-017-7193-1","journal-title":"DAPD"},{"issue":"12","key":"7437_CR31","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.11772\/j.issn.1001-9081.2017.12.3397","volume":"37","author":"W Zhuo","year":"2017","unstructured":"Zhuo, W., Pan, B., Bo, S.: Parallel algorithm for triangle enumeration. J. Compu. Appl. 37(12), 3397\u20133400 (2017). https:\/\/doi.org\/10.11772\/j.issn.1001-9081.2017.12.3397","journal-title":"J. Compu. Appl."},{"key":"7437_CR32","doi-asserted-by":"publisher","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: Proceedings of the 2010 Acm Sigmod Interna-tional Conference on Management of Data (p. 135-146) (2010). New York, : Association for Computing Machinery. Retrieved from https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"7437_CR33","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427","volume-title":"Graphx a: resilient distributed graph system on spark. First international work- shop on graph data management experiences and systems","author":"RS Xin","year":"2013","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: Graphx a: resilient distributed graph system on spark. First international work- shop on graph data management experiences and systems. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2484425.2484427"},{"key":"7437_CR34","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Graphlab: A new framework for parallel machine learning. In: Gr\u00fcnwald, P., Spirtes, P. (Eds.), UAI 2010, Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, Catalina Island, vol. 8-11, pp. 340-349. AUAI Press (2010)"},{"key":"7437_CR35","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: Thekkath, C., Vahdat, A. (Eds.), 10th USENIX symposium on op- erating systems design and implementation, OSDI 2012, hollywood, ca, usa, october 8-10, 2012 (pp. 17-30) (2012). USENIX Association. Retrieved from https:\/\/www.usenix.org\/conference\/osdi12\/technicalsessions\/ presentation\/gonzalez"},{"key":"7437_CR36","doi-asserted-by":"publisher","unstructured":"Yan, D., Bu, Y., Tian, Y., Deshpande, A., Cheng, J.: Big graph analytics systems. In: Proceedings of the 2016 International Conference on Management of Data pp. 2241-2243) (2016). New York: Association for Computing Machinery. Retrieved from https:\/\/doi.org\/10.1145\/2882903.2912566","DOI":"10.1145\/2882903.2912566"},{"issue":"2","key":"7437_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00778-015-0405-2","volume":"25","author":"A Quamar","year":"2016","unstructured":"Quamar, A., Deshpande, A., Lin, J.: Nscale: neighborhoodcentric large-scale graph analytics in the cloud. VLDB J. 25(2), 125\u2013150 (2016). https:\/\/doi.org\/10.1007\/s00778-015-0405-2","journal-title":"VLDB J."},{"key":"7437_CR38","doi-asserted-by":"publisher","unstructured":"Chen, H., Liu, M., Zhao, Y., Yan, X., Yan, D., Cheng, J.: G-miner: an efficient task-oriented graph mining system. In: Oliveira, R., Felber, P., Hu, Y.C. (Eds.), Proceedings of the 13th eurosys conference, pp. 1-12. ACM, (2018). https:\/\/doi.org\/10.1145\/3190508.3190545","DOI":"10.1145\/3190508.3190545"},{"key":"7437_CR39","doi-asserted-by":"publisher","unstructured":"dos Santos Dias, V.V., Teixeira, C.H.C., Guedes, D.O., Jr., W.M., Parthasarathy, S.: Fractal: A general-purpose graph pattern mining system. SIGMOD (pp. 1357-1374). ACM, (2019). https:\/\/doi.org\/10.1145\/3299869.3319875","DOI":"10.1145\/3299869.3319875"},{"issue":"11","key":"7437_CR40","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.14778\/3407790.3407840","volume":"13","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Yu, J.X., Zhang, Y., Zhao, K., Cheng, H.: Distributed subgraph counting: a general approach. Proc. VLDB Endow. 13(11), 2493\u20132507 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"7437_CR41","doi-asserted-by":"publisher","unstructured":"Yan, D., Guo, G., Rahman Chowdhury, M.M., Tamer \u00d6zsu, M., Ku, W.-S., Lui, J.C.S.: G-thinker: A distributed framework for mining subgraphs in a big graph. In: 2020 ieee 36th International Conference on Data Engineering (icde), p. 1369-1380 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00122","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"7437_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59065-9_12","author":"A Farouzi","year":"2020","unstructured":"Farouzi, A., Bellatreche, L., Ordonez, C., Pandurangan, G., Malki, M.: A scalable randomized algorithm for triangle enumeration on graph based on SQL queries. Dawak Conf. (2020). https:\/\/doi.org\/10.1007\/978-3-030-59065-9_12","journal-title":"Dawak Conf."},{"issue":"1","key":"7437_CR43","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3209689","volume":"5","author":"G Pandurangan","year":"2018","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: Fast distributed algorithms for connectivity and MST in large graphs. ACM Trans. Parallel Comput. 5(1), 4:1-4:22 (2018). https:\/\/doi.org\/10.1145\/3209689","journal-title":"ACM Trans. Parallel Comput."},{"key":"7437_CR44","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210409","author":"G Pandurangan","year":"2018","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: On the distributed complexity of large-scale graph computations. SPAA (2018). https:\/\/doi.org\/10.1145\/3210377.3210409","journal-title":"SPAA"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-023-07437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-023-07437-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-023-07437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,28]],"date-time":"2024-01-28T07:03:14Z","timestamp":1706425394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-023-07437-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["7437"],"URL":"https:\/\/doi.org\/10.1007\/s10619-023-07437-x","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,13]]},"assertion":[{"value":"25 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}