{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:16:58Z","timestamp":1757618218715,"version":"3.44.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"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":["Computing"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00607-025-01510-2","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:30:43Z","timestamp":1750231843000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scaling down to scale up: benchmarking single-machine graph processing frameworks in a hardware-constrained environment"],"prefix":"10.1007","volume":"107","author":[{"given":"Mariem","family":"Loukil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lilia","family":"Sfaxi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riadh","family":"Robbana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"1510_CR1","doi-asserted-by":"crossref","unstructured":"Leung CK, Singh SP (2021) A mathematical model for friend discovery from dynamic social graphs. In: Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp 569\u2013576","DOI":"10.1145\/3487351.3489473"},{"key":"1510_CR2","doi-asserted-by":"crossref","unstructured":"Gupta RK, D. PS (2023) Temporal variability analysis of domain names using graph techniques on big data. In: 2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT), pp 1\u20136","DOI":"10.1109\/ICCCNT56998.2023.10307338"},{"key":"1510_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3389\/fbioe.2020.00034","volume":"8","author":"M Koutrouli","year":"2020","unstructured":"Koutrouli M, Karatzas E, Paez-Espino D et al (2020) A guide to conquer the biological network era using graph theory. Front Bioeng Biotechnol 8:34","journal-title":"Front Bioeng Biotechnol"},{"issue":"4","key":"1510_CR4","first-page":"590","volume":"47","author":"G Boeing","year":"2020","unstructured":"Boeing G (2020) A multi-scale analysis of 27,000 urban street networks: every us city, town, urbanized area, and zillow neighborhood. Environ Plan B: Urban Anal City Sci 47(4):590\u2013608","journal-title":"Environ Plan B: Urban Anal City Sci"},{"issue":"3","key":"1510_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/21M1414024","volume":"65","author":"C Bick","year":"2023","unstructured":"Bick C, Gross E, Harrington HA et al (2023) What are higher-order networks? SIAM Rev 65(3):686\u2013731","journal-title":"SIAM Rev"},{"key":"1510_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy M, Viard T, Magnien C (2018) Stream graphs and link streams for the modeling of interactions over time. Soc Netw Anal Min 8:1\u201329","journal-title":"Soc Netw Anal Min"},{"key":"1510_CR7","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, et\u00a0al (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"1510_CR8","unstructured":"Low Y, Gonzalez JE, Kyrola A, et\u00a0al (2014) Graphlab: a new framework for parallel machine learning. arXiv preprint arXiv:1408.2041"},{"key":"1510_CR9","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.future.2013.08.007","volume":"32","author":"T Kajdanowicz","year":"2014","unstructured":"Kajdanowicz T, Kazienko P, Indyk W (2014) Parallel processing of large graphs. Futur Gener Comput Syst 32:324\u2013337","journal-title":"Futur Gener Comput Syst"},{"key":"1510_CR10","unstructured":"Gonzalez JE, Xin RS, Dave A, et\u00a0al (2014) Graphx: graph processing in a distributed dataflow framework. In: 11th USENIX symposium on operating systems design and implementation (OSDI 14), pp 599\u2013613"},{"key":"1510_CR11","unstructured":"Zhu X, Chen W, Zheng W, et\u00a0al (2016) Gemini: a computation-centric distributed graph processing system. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pp 301\u2013316"},{"issue":"2","key":"1510_CR12","first-page":"2019","volume":"35","author":"X Wang","year":"2021","unstructured":"Wang X, Wen D, Qin L et al (2021) Scaleg: A distributed disk-based system for vertex-centric graph processing. IEEE Trans Knowl Data Eng 35(2):2019\u20132033","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"1510_CR13","first-page":"1","volume":"5","author":"R Chen","year":"2019","unstructured":"Chen R, Shi J, Chen Y et al (2019) Powerlyra: differentiated graph computation and partitioning on skewed graphs. ACM Trans Parallel Comput (TOPC) 5(3):1\u201339","journal-title":"ACM Trans Parallel Comput (TOPC)"},{"key":"1510_CR14","unstructured":"Zheng D, Mhembere D, Burns R, et\u00a0al (2015) Flashgraph: Processing billion-node graphs on an array of commodity ssds. In: 13th USENIX Conference on File and Storage Technologies (FAST 15), pp 45\u201358"},{"key":"1510_CR15","doi-asserted-by":"crossref","unstructured":"Chi Y, Dai G, Wang Y, et\u00a0al (2016) Nxgraph: An efficient graph processing system on a single machine. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), IEEE, pp 409\u2013420","DOI":"10.1109\/ICDE.2016.7498258"},{"key":"1510_CR16","unstructured":"Elyasi N, Choi C, Sivasubramaniam A (2019) Large-scale graph processing on emerging storage devices. In: 17th USENIX Conference on File and Storage Technologies (FAST 19), pp 309\u2013316"},{"key":"1510_CR17","doi-asserted-by":"crossref","unstructured":"Maass S, Min C, Kashyap S, et\u00a0al (2017) Mosaic: processing a trillion-edge graph on a single machine. In: Proceedings of the Twelfth European Conference on Computer Systems, pp 527\u2013543","DOI":"10.1145\/3064176.3064191"},{"issue":"2","key":"1510_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune RR, Weninger T, Madey G (2015) Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput Surv (CSUR) 48(2):1\u201339","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1510_CR19","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/s10586-015-0472-6","volume":"18","author":"O Batarfi","year":"2015","unstructured":"Batarfi O, Shawi RE, Fayoumi AG et al (2015) Large scale graph processing systems: survey and an experimental evaluation. Clust Comput 18:1189\u20131213","journal-title":"Clust Comput"},{"key":"1510_CR20","doi-asserted-by":"crossref","unstructured":"Song L, Zhuo Y, Qian X, et\u00a0al (2018) Graphr: Accelerating graph processing using reram. In: 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA), IEEE, pp 531\u2013543","DOI":"10.1109\/HPCA.2018.00052"},{"issue":"1","key":"1510_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3380942","volume":"7","author":"K Lakhotia","year":"2020","unstructured":"Lakhotia K, Kannan R, Pati S et al (2020) Gpop: a scalable cache-and memory-efficient framework for graph processing over parts. ACM Trans Parallel Comput (TOPC) 7(1):1\u201324","journal-title":"ACM Trans Parallel Comput (TOPC)"},{"issue":"1","key":"1510_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434393","volume":"8","author":"L Dhulipala","year":"2021","unstructured":"Dhulipala L, Blelloch GE, Shun J (2021) Theoretically efficient parallel graph algorithms can be fast and scalable. ACM Trans Parallel Comput (TOPC) 8(1):1\u201370","journal-title":"ACM Trans Parallel Comput (TOPC)"},{"issue":"6","key":"1510_CR23","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1038\/s43588-023-00461-y","volume":"3","author":"L Lannelongue","year":"2023","unstructured":"Lannelongue L, Aronson HEG, Bateman A et al (2023) Greener principles for environmentally sustainable computational science. Nat Comput Sci 3(6):514\u2013521","journal-title":"Nat Comput Sci"},{"key":"1510_CR24","unstructured":"Kyrola A, Blelloch G, Guestrin C (2012) Graphchi: Large-scale graph computation on just a pc. In: 10th USENIX symposium on operating systems design and implementation (OSDI 12), pp 31\u201346"},{"key":"1510_CR25","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W (2013) X-stream: Edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp 472\u2013488","DOI":"10.1145\/2517349.2522740"},{"key":"1510_CR26","doi-asserted-by":"crossref","unstructured":"Shun J, Blelloch GE (2013) Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming, pp 135\u2013146","DOI":"10.1145\/2442516.2442530"},{"key":"1510_CR27","doi-asserted-by":"crossref","unstructured":"Lin Z, Kahng M, Sabrin KM, et\u00a0al (2014) Mmap: Fast billion-scale graph computation on a pc via memory mapping. In: 2014 IEEE International Conference on Big Data (Big Data), IEEE, pp 159\u2013164","DOI":"10.1109\/BigData.2014.7004226"},{"key":"1510_CR28","unstructured":"Zhu X, Han W, Chen W (2015) Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: 2015 USENIX Annual Technical Conference (USENIX ATC 15), pp 375\u2013386"},{"key":"1510_CR29","doi-asserted-by":"crossref","unstructured":"Guo Y, Biczak M, Varbanescu AL, et\u00a0al (2014) How well do graph-processing platforms perform? an empirical performance evaluation and analysis. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, IEEE, pp 395\u2013404","DOI":"10.1109\/IPDPS.2014.49"},{"key":"1510_CR30","doi-asserted-by":"crossref","unstructured":"Elser B, Montresor A (2013) An evaluation study of bigdata frameworks for graph processing. In: 2013 IEEE International Conference on Big Data, IEEE, pp 60\u201367","DOI":"10.1109\/BigData.2013.6691555"},{"issue":"13","key":"1510_CR31","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.14778\/3007263.3007270","volume":"9","author":"A Iosup","year":"2016","unstructured":"Iosup A, Hegeman T, Ngai WL et al (2016) Ldbc graphalytics: a benchmark for large-scale graph analysis on parallel and distributed platforms. Proc VLDB Endow 9(13):1317\u20131328","journal-title":"Proc VLDB Endow"},{"key":"1510_CR32","unstructured":"Beamer S, Asanovic K, Patterson DA (2015) The GAP benchmark suite. CoRR abs\/1508.03619"},{"key":"1510_CR33","doi-asserted-by":"publisher","DOI":"10.1145\/3398682.3399168","volume-title":"The graph based benchmark suite (gbbs)","author":"L Dhulipala","year":"2020","unstructured":"Dhulipala L, Shi J, Tseng T et al (2020) The graph based benchmark suite (gbbs). Association for Computing Machinery, New York, NY, USAGRADES-NDA\u201920"},{"key":"1510_CR34","doi-asserted-by":"crossref","unstructured":"Loukil M, Sfaxi L, Robbana R (2024) How to create graphs in hardware-constrained environments? choosing the best creation approach via machine learning-based predictive models. International Journal of Data Science and Analytics pp 1\u201320","DOI":"10.1007\/s41060-023-00495-5"},{"key":"1510_CR35","doi-asserted-by":"crossref","unstructured":"v.\u00a0Kistowski J, Arnold JA, Huppler K, et\u00a0al (2015) How to build a benchmark. In: Proceedings of the 6th ACM\/SPEC international conference on performance engineering, pp 333\u2013336","DOI":"10.1145\/2668930.2688819"},{"key":"1510_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41705-5","volume-title":"Systems Benchmarking","author":"S Kounev","year":"2020","unstructured":"Kounev S, Lange KD, Von Kistowski J (2020) Systems Benchmarking, vol 1. Springer"},{"key":"1510_CR37","volume-title":"Forced ranking: making performance management work","author":"RC Grote","year":"2005","unstructured":"Grote RC (2005) Forced ranking: making performance management work. Harvard Business School Press Boston, MA"},{"key":"1510_CR38","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"1510_CR39","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, pp 1\u20138","DOI":"10.1145\/2350190.2350193"},{"issue":"1","key":"1510_CR40","first-page":"29","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A et al (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Int Math 6(1):29\u2013123","journal-title":"Int Math"},{"key":"1510_CR41","doi-asserted-by":"crossref","unstructured":"Backstrom L, Huttenlocher D, Kleinberg J, et\u00a0al (2006) Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 44\u201354","DOI":"10.1145\/1150402.1150412"},{"key":"1510_CR42","doi-asserted-by":"crossref","unstructured":"Lehmberg O, Meusel R, Bizer C (2014) Graph structure in the web: aggregated by pay-level domain. In: Proceedings of the 2014 ACM conference on Web science, pp 119\u2013128","DOI":"10.1145\/2615569.2615674"},{"key":"1510_CR43","doi-asserted-by":"crossref","unstructured":"Meusel R, Vigna S, Lehmberg O, et\u00a0al (2014) Graph structure in the web\u2014revisited: a trick of the heavy tail. In: Proceedings of the 23rd international conference on World Wide Web, pp 427\u2013432","DOI":"10.1145\/2567948.2576928"},{"key":"1510_CR44","doi-asserted-by":"crossref","unstructured":"Meusel R, Vigna S, Lehmberg O, et\u00a0al (2015) The graph structure in the web\u2013analyzed on different aggregation levels. The Journal of Web Science 1","DOI":"10.1561\/106.00000003"},{"key":"1510_CR45","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Santini M, et\u00a0al (2011) Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th international conference on World Wide Web, pp 587\u2013596","DOI":"10.1145\/1963405.1963488"},{"key":"1510_CR46","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, et\u00a0al (2010) What is twitter, a social network or a news media? In: Proceedings of the 19th international conference on World wide web, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"1510_CR47","volume-title":"The Pagerank citation ranking: bringing order to the web","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R et al (1999) The Pagerank citation ranking: bringing order to the web. Tech. rep, Stanford InfoLab"},{"issue":"1","key":"1510_CR48","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach Y, Vishkin U (1982) An o(logn) parallel connectivity algorithm. J Algorithms 3(1):57\u201367","journal-title":"J Algorithms"},{"key":"1510_CR49","doi-asserted-by":"crossref","unstructured":"Beamer S, Asanovic K, Patterson D (2012) Direction-optimizing breadth-first search. In: SC\u201912: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, IEEE, pp 1\u201310","DOI":"10.1109\/SC.2012.50"},{"key":"1510_CR50","doi-asserted-by":"crossref","unstructured":"Kim J, Han WS, Lee S, et\u00a0al (2014) Opt: A new framework for overlapped and parallel triangulation in large-scale graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp 637\u2013648","DOI":"10.1145\/2588555.2588563"},{"issue":"3","key":"1510_CR51","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson DS, Yannakakis M, Papadimitriou CH (1988) On generating all maximal independent sets. Inf Process Lett 27(3):119\u2013123","journal-title":"Inf Process Lett"},{"issue":"2","key":"1510_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1921632.1921634","volume":"5","author":"U Kang","year":"2011","unstructured":"Kang U, Tsourakakis CE, Appel AP et al (2011) Hadi: mining radii of large graphs. ACM Trans Knowl Discov Data (TKDD) 5(2):1\u201324","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"2","key":"1510_CR53","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177","journal-title":"J Math Sociol"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-025-01510-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-025-01510-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-025-01510-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T20:32:51Z","timestamp":1757190771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-025-01510-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,18]]},"references-count":53,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1510"],"URL":"https:\/\/doi.org\/10.1007\/s00607-025-01510-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2025,6,18]]},"assertion":[{"value":"6 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2025","order":3,"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"}}],"article-number":"152"}}