Revisiting Graph Analytics Benchmark
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.
Authors
- Wenyuan Yu (ORCID: https://orcid.org/0009-0006-5641-2452)
- Yu Shao
- Peng Cheng (ORCID: https://orcid.org/0000-0002-9797-6944)
- Jingren Zhou (ORCID: https://orcid.org/0000-0002-4220-2634)
- Long Yuan (ORCID: https://orcid.org/0000-0001-8111-0401)
- Lingkai Meng (ORCID: https://orcid.org/0009-0002-7961-9131)
- Xuemin Lin (ORCID: https://orcid.org/0000-0003-2396-7225)
- Wenjie Zhang (ORCID: https://orcid.org/0000-0001-6572-2600)
- Xue Li (ORCID: https://orcid.org/0000-0001-5713-7225)
- Longbin Lai (ORCID: https://orcid.org/0009-0009-4735-3835)
Institutions
- Tongji University (CN)
- Shanghai Jiao Tong University (CN)
- Wuhan University of Technology (CN)
- UNSW Sydney (AU)
- Alibaba Group (China) (CN)
- East China Normal University (CN)
Publication Details
- Journal
- Proceedings of the ACM on Management of Data
- Published
- 2025-06-17
- DOI
- https://doi.org/10.1145/3725345
- Citations
- 2
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 2.55
Funders
- National Natural Science Foundation of China
- National Key Research and Development Program of China