{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:47:58Z","timestamp":1774986478728,"version":"3.50.1"},"reference-count":97,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62472225,62102149,U2241211,U20B2046"],"award-info":[{"award-number":["62472225,62102149,U2241211,U20B2046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFF0712100"],"award-info":[{"award-number":["2022YFF0712100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>The rise of graph analytics platforms has led to the development of various benchmarks for evaluating and comparing platform performance. However, existing benchmarks often fall short of fully assessing performance due to limitations in core algorithm selection, data generation processes (and the corresponding synthetic datasets), as well as the neglect of API usability evaluation. To address these shortcomings, we propose a novel graph analytics benchmark. First, we select eight core algorithms by extensively reviewing both academic and industrial settings. Second, we design an efficient and flexible data generator and produce eight new synthetic datasets as the default datasets for our benchmark. Lastly, we introduce a multi-level large language model (LLM)-based framework for API usability evaluation-the first of its kind in graph analytics benchmarks. We conduct comprehensive experimental evaluations on existing platforms (GraphX, PowerGraph, Flash, Grape, Pregel+, Ligra, and G-thinker). The experimental results demonstrate the superiority of our proposed benchmark.<\/jats:p>","DOI":"10.1145\/3725345","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-28","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting Graph Analytics Benchmark"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7961-9131","authenticated-orcid":false,"given":"Lingkai","family":"Meng","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0940-065X","authenticated-orcid":false,"given":"Yu","family":"Shao","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8111-0401","authenticated-orcid":false,"given":"Long","family":"Yuan","sequence":"additional","affiliation":[{"name":"Wuhan University of Technology, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4735-3835","authenticated-orcid":false,"given":"Longbin","family":"Lai","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9797-6944","authenticated-orcid":false,"given":"Peng","family":"Cheng","sequence":"additional","affiliation":[{"name":"Tongji University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-7225","authenticated-orcid":false,"given":"Xue","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5641-2452","authenticated-orcid":false,"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiaotong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4220-2634","authenticated-orcid":false,"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"[n. d.]. Graph-Analytics-Benchmarks. https:\/\/github.com\/alibaba\/GraphScope\/tree\/main\/analytical_engine\/benchmarks\/framework"},{"key":"e_1_2_2_2_1","unstructured":"[n. d.]. Neo4j-APOC. https:\/\/github.com\/neo4j\/apoc"},{"key":"e_1_2_2_3_1","unstructured":"2024. GPT-4o. https:\/\/chatgpt.com\/?model=gpt-4o"},{"key":"e_1_2_2_4_1","volume-title":"WGB: Towards a Universal Graph Benchmark. In Advancing Big Data Benchmarks - Proceedings of the 2013 Workshop Series on Big Data Benchmarking, WBDB.cn, Xi'an, China, July 16--17","author":"Ammar Khaled","year":"2013","unstructured":"Khaled Ammar and M. Tamer \u00d6zsu. 2013. WGB: Towards a Universal Graph Benchmark. In Advancing Big Data Benchmarks - Proceedings of the 2013 Workshop Series on Big Data Benchmarking, WBDB.cn, Xi'an, China, July 16--17, 2013 and WBDB.us, San Jos\u00e9, CA, USA, October 9--10, 2013 Revised Selected Papers, (Lecture Notes in Computer Science, Vol. 8585), Tilmann Rabl, Hans-Arno Jacobsen, Raghunath Nambiar, Meikel Poess, Milind A. Bhandarkar, and Chaitanya K. Baru, (Eds.). Springer, 58-72."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.08.045"},{"key":"e_1_2_2_6_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509-512."},{"key":"e_1_2_2_7_1","volume-title":"The AAAI-04 Workshop on Agent Organizations: Theory and Practice. 1198-1208","author":"Berry Nina","year":"2004","unstructured":"Nina Berry, Teresa Ko, Tim Moy, Julienne Smrcka, Jessica Turnley, and Ben Wu. 2004. Emergent clique formation in terrorist recruitment. In The AAAI-04 Workshop on Agent Organizations: Theory and Practice. 1198-1208."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540600693713"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0333-5"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_2_13_1","unstructured":"Paul Erdos Alfr\u00e9d R\u00e9nyi et al. 1960. On the evolution of random graphs. Publ. math. inst. hung. acad. sci Vol. 5 1 (1960) 17-60."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137801"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3282488"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753677"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753677"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00071"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01671-y"},{"key":"e_1_2_2_22_1","volume-title":"PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, October 8--10, 2012,, Chandu Thekkath and Amin Vahdat, (Eds.). USENIX Association, 17-30."},{"key":"e_1_2_2_23_1","first-page":"599","volume-title":"11th USENIX Symposium on Operating Systems Design and Implementation, OSDI '14","author":"Gonzalez Joseph E.","year":"2014","unstructured":"Joseph E. Gonzalez, Reynold S. Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, and Ion Stoica. 2014. GraphX: Graph Processing in a Distributed Dataflow Framework. In 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI '14, Broomfield, CO, USA, October 6--8, 2014,, Jason Flinn and Hank Levy, (Eds.). USENIX Association, 599-613."},{"key":"e_1_2_2_24_1","unstructured":"Graph500 Executive Committee. 2010. Graph 500 Benchmark. https:\/\/graph500.org\/."},{"key":"e_1_2_2_25_1","volume-title":"HCSE 2012, Toulouse, France, October 29--31, 2012. Proceedings, (Lecture Notes in Computer Science","volume":"180","author":"Grill Thomas","year":"2012","unstructured":"Thomas Grill, Ondrej Pol\u00e1cek, and Manfred Tscheligi. 2012. Methods towards API Usability: A Structural Analysis of Usability Problem Categories. In Human-Centered Software Engineering - 4th International Conference, HCSE 2012, Toulouse, France, October 29--31, 2012. Proceedings, (Lecture Notes in Computer Science, Vol. 7623), Marco Winckler, Peter Forbrig, and Regina Bernhaupt, (Eds.). Springer, 164-180."},{"key":"e_1_2_2_26_1","unstructured":"Aric Hagberg Pieter J Swart and Daniel A Schult. 2008. Exploring network structure dynamics and function using NetworkX. Technical Report. Los Alamos National Laboratory (LANL) Los Alamos NM (United States)."},{"key":"e_1_2_2_27_1","volume-title":"Transitivity in structural models of small groups. Comparative group studies","author":"Holland Paul W","year":"1971","unstructured":"Paul W Holland and Samuel Leinhardt. 1971. Transitivity in structural models of small groups. Comparative group studies, Vol. 2, 2 (1971), 107-124."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq680"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370216.2370430"},{"key":"e_1_2_2_32_1","volume-title":"12th AGILE international conference on geographic information science. Germany: Leibniz Universit\u00e4t Hannover, 1-9.","author":"Kazerani Aisan","year":"2009","unstructured":"Aisan Kazerani and Stephan Winter. 2009. Can betweenness centrality explain traffic flow. In 12th AGILE international conference on geographic information science. Germany: Leibniz Universit\u00e4t Hannover, 1-9."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-012-0076-6"},{"key":"e_1_2_2_34_1","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy E. Blelloch, and Carlos Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC. In 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, October 8--10, 2012,, Chandu Thekkath and Amin Vahdat, (Eds.). USENIX Association, 31-46."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_2_2_36_1","volume-title":"An algorithm for path connections and its applications. IRE transactions on electronic computers, 3","author":"Lee Chin Yang","year":"1961","unstructured":"Chin Yang Lee. 1961. An algorithm for path connections and its applications. IRE transactions on electronic computers, 3 (1961), 346-365."},{"key":"e_1_2_2_37_1","article-title":"Kronecker graphs: an approach to modeling networks","volume":"11","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: an approach to modeling networks. Journal of Machine Learning Research, Vol. 11, 2 (2010).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_2_38_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_2_2_39_1","first-page":"37","article-title":"Betweenness centrality analysis for urban road networks","volume":"35","author":"Qingquan LI","year":"2010","unstructured":"Qingquan LI, Zhe ZENG, Bisheng YANG, et al., 2010. Betweenness centrality analysis for urban road networks. Geomatics and Information Science of Wuhan University, Vol. 35, 1 (2010), 37-41.","journal-title":"Geomatics and Information Science of Wuhan University"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00025"},{"key":"e_1_2_2_41_1","volume-title":"Flash: A Framework for Programming Distributed Graph Processing Algorithms. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). 232-244","author":"Li Xue","year":"2023","unstructured":"Xue Li, Ke Meng, Lu Qin, Longbin Lai, Wenyuan Yu, Zhengping Qian, Xuemin Lin, and Jingren Zhou. 2023b. Flash: A Framework for Programming Distributed Graph Processing Algorithms. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). 232-244."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3176478"},{"key":"e_1_2_2_43_1","volume-title":"GraphLab: A New Parallel Framework for Machine Learning. In Conference on Uncertainty in Artificial Intelligence (UAI).","author":"Low Yucheng","unstructured":"Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. 2010. GraphLab: A New Parallel Framework for Machine Learning. In Conference on Uncertainty in Artificial Intelligence (UAI)."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2007.06.006"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_2_2_50_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology, Vol. 27, 1 (2001), 415-444."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694966"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2017.12.010"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2017.12.010"},{"key":"e_1_2_2_54_1","first-page":"45","article-title":"Introducing the graph 500","volume":"19","author":"Murphy Richard C","year":"2010","unstructured":"Richard C Murphy, Kyle B Wheeler, Brian W Barrett, and James A Ang. 2010. Introducing the graph 500. Cray Users Group (CUG), Vol. 19, 45--74 (2010), 22.","journal-title":"Cray Users Group (CUG)"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49409-8_66"},{"key":"e_1_2_2_56_1","volume-title":"Human-Centered Methods for Improving API Usability. In 1st IEEE\/ACM International Workshop on API Usage and Evolution, WAPI@ICSE 2017","author":"Myers Brad A.","year":"2017","unstructured":"Brad A. Myers. 2017. Human-Centered Methods for Improving API Usability. In 1st IEEE\/ACM International Workshop on API Usage and Evolution, WAPI@ICSE 2017, Buenos Aires, Argentina, May 23, 2017. IEEE Computer Society, 2."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896587"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00063"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-019-9310-5"},{"key":"e_1_2_2_61_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford infolab."},{"key":"e_1_2_2_62_1","first-page":"5","volume-title":"An Empirical Study of API Usability. In 2013 ACM \/ IEEE International Symposium on Empirical Software Engineering and Measurement","author":"Piccioni Marco","year":"2013","unstructured":"Marco Piccioni, Carlo A. Furia, and Bertrand Meyer. 2013a. An Empirical Study of API Usability. In 2013 ACM \/ IEEE International Symposium on Empirical Software Engineering and Measurement, Baltimore, Maryland, USA, October 10--11, 2013. IEEE Computer Society, 5-14."},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ESEM.2013.14"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621942"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593661"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2019.05.001"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_2_2_71_1","volume-title":"Graph clustering. Computer science review","author":"Schaeffer Satu Elisa","year":"2007","unstructured":"Satu Elisa Schaeffer. 2007. Graph clustering. Computer science review, Vol. 1, 1 (2007), 27-64."},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_2_2_73_1","volume-title":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '13","author":"Shun Julian","year":"2013","unstructured":"Julian Shun and Guy E. Blelloch. 2013b. Ligra: a lightweight graph processing framework for shared memory. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '13, Shenzhen, China, February 23--27, 2013,, Alex Nicolau, Xiaowei Shen, Saman P. Amarasinghe, and Richard W. Vuduc, (Eds.). ACM,, 135-146."},{"key":"e_1_2_2_74_1","volume-title":"ISWC 2010","author":"Stutz Philip","year":"2010","unstructured":"Philip Stutz, Abraham Bernstein, and William Cohen. 2010. Signal\/collect: graph algorithms for the (semantic) web. In The Semantic Web-ISWC 2010: 9th International Semantic Web Conference, ISWC 2010, Shanghai, China, November 7--11, 2010, Revised Selected Papers, Part I 9. Springer, 764-780."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/62.2160"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_2_2_77_1","volume-title":"Semantic Perception Mapping and Exploration (SPME)","volume":"1","author":"Trevor AJ","year":"2013","unstructured":"AJ Trevor, Suat Gedikli, Radu B Rusu, and Henrik I Christensen. 2013. Efficient organized point cloud segmentation with connected components. Semantic Perception Mapping and Exploration (SPME), Vol. 1 (2013)."},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.315"},{"key":"e_1_2_2_80_1","volume-title":"An o (log n) parallel connectivityalgorithm. J. algorithms","author":"Vishkin Y Shiloachand U","year":"1982","unstructured":"Y Shiloachand U Vishkin and Y Shiloach. 1982. An o (log n) parallel connectivityalgorithm. J. algorithms, Vol. 3 (1982), 57-67."},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.683775"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2014.6835958"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614320.1614334"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3682006"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPCC.2009.5208679"},{"key":"e_1_2_2_86_1","volume-title":"Collective dynamics of 'small-world'networks. nature","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world'networks. nature, Vol. 393, 6684 (1998), 440-442."},{"key":"e_1_2_2_87_1","first-page":"979","volume-title":"International Archives of Photogrammetry and Remote Sensing","volume":"33","author":"Wiedemann Christian","year":"2000","unstructured":"Christian Wiedemann and Heinrich Ebner. 2000. Automatic completion and evaluation of road networks. International Archives of Photogrammetry and Remote Sensing, Vol. 33, B3\/2; PART 3 (2000), 979-986."},{"key":"e_1_2_2_88_1","volume-title":"Link prediction with node clustering coefficient. Physica A: Statistical Mechanics and its Applications","author":"Wu Zhihao","year":"2016","unstructured":"Zhihao Wu, Youfang Lin, Jing Wang, and Steve Gregory. 2016. Link prediction with node clustering coefficient. Physica A: Statistical Mechanics and its Applications, Vol. 452 (2016), 1-8."},{"key":"e_1_2_2_89_1","volume-title":"Measuring the structure of road networks. Geographical analysis","author":"Xie Feng","year":"2007","unstructured":"Feng Xie and David Levinson. 2007. Measuring the structure of road networks. Geographical analysis, Vol. 39, 3 (2007), 336-356."},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680832433"},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"e_1_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671472"},{"key":"e_1_2_2_96_1","first-page":"2208","article-title":"Signed-PageRank: An efficient influence maximization framework for signed social networks","volume":"33","author":"Yin Xiaoyan","year":"2019","unstructured":"Xiaoyan Yin, Xiao Hu, Yanjiao Chen, Xu Yuan, and Baochun Li. 2019. Signed-PageRank: An efficient influence maximization framework for signed social networks. IEEE Transactions on Knowledge and Data Engineering, Vol. 33, 5 (2019), 2208-2222.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2014.52"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:50:05Z","timestamp":1774983005000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":97,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725345"],"URL":"https:\/\/doi.org\/10.1145\/3725345","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}