Revisiting Graph Analytics Benchmark
Lingkai Meng, Yu Shao, Long Yuan, Longbin Lai, Peng Cheng, Xue Li, Wenyuan Yu, Wenjie Zhang, Xuemin Lin, Jingren Zhou
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 8996a77f-2ce5-4dc5-b3ab-3c845baf5afbCited by top-tier papers2
- Triangle Counting in Hypergraph Streams: A Complete and Practical ApproachLingkai Meng, Long Yuan, Xuemin Lin, Wenjie Zhang et al.SIGMOD 2026 · 4 citations
- Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single MachineChengying Huan, Zhengyi Yang, Haoshen Yang, Shaonan Ma et al.SIGMOD 2026
Builds on4
- Peregrine: a pattern-aware graph mining systemKasra Jamshidi, Rakesh Mahadasa, Keval VoraEuroSys 2020 · 107 citations
- G-thinker: A Distributed Framework for Mining Subgraphs in a Big GraphDa Yan, Guimu Guo, Md Mashiur Rahman Chowdhury, M. Tamer Özsu et al.ICDE 2020 · 48 citations
- Flash: A Framework for Programming Distributed Graph Processing AlgorithmsXue Li, Ke Meng, Lu Qin, Longbin Lai et al.ICDE 2023 · 5 citations
- Efficient Betweenness Centrality Computation over Large Heterogeneous Information NetworksXinrui Wang, Yiran Wang, Xuemin Lin, Jeffrey Xu Yu et al.VLDB 2024 · 4 citations
Related papers
- How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern ComprehensionXinnan Dai, Haohao Qu, Yifei Shen, Bohang Zhang et al.ICLR 2025 · 1 citation
- GRAB: A Challenging Graph Analysis Benchmark for Large Multimodal ModelsJonathan Roberts, Kai Han, Samuel AlbanieICCV 2025
- ARBench: Algorithmic Reasoner or API Alchemist? Evaluating LLMs Beyond API CallsRenbiao Liu, Chao-Zeng Ma, Anqi Li, Hui Sun et al.AAAI 2026
- QuanBench: Benchmarking Quantum Code Generation with Large Language ModelsXiaoyu Guo, Minggu Wang, Jianjun ZhaoASE 2025 · 5 citations
- GQLBench: A Large-Scale Cross-Domain, Cross-Dialect Benchmark for NL2GQLYanning Su, Yuhang Zhou, Yang Fang, Sen Liu et al.ACL 2026
