The LDBC Social Network Benchmark: Business Intelligence Workload
Gábor Szárnyas, Jack Waudby, Benjamin A. Steer, Dávid Szakállas, Altan Birler, Mingxi Wu, Yuchen Zhang, Peter Boncz
Abstract
The Social Network Benchmark's Business Intelligence workload (SNB BI) is a comprehensive graph OLAP benchmark targeting analytical data systems capable of supporting graph workloads. This paper marks the finalization of almost a decade of research in academia and industry via the Linked Data Benchmark Council (LDBC). SNB BI advances the state-of-the art in synthetic and scalable analytical database benchmarks in many aspects. Its base is a sophisticated data generator, implemented on a scalable distributed infrastructure, that produces a social graph with small-world phenomena, whose value properties follow skewed and correlated distributions and where values correlate with structure. This is a temporal graph where all nodes and edges follow lifespan-based rules with temporal skew enabling realistic and consistent temporal inserts and (recursive) deletes. The query workload exploiting this skew and correlation is based on LDBC's "choke point"-driven design methodology and will entice technical and scientific improvements in future (graph) database systems. SNB BI includes the first adoption of "parameter curation" in an analytical benchmark, a technique that ensures stable runtimes of query variants across different parameter values. Two performance metrics characterize peak single-query performance (power) and sustained concurrent query throughput. To demonstrate the portability of the benchmark, we present experimental results on a relational and a graph DBMS. Note that these do not constitute an official LDBC Benchmark Result - only audited results can use this trademarked term.
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 1e0745c6-c527-49f6-a71d-cf908c652f77Cited by top-tier papers15
- Robust Join Processing with Diamond Hardened JoinsAltan Birler, Alfons Kemper, Thomas NeumannVLDB 2024 · 23 citations
- CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated InfrastructureQiaolin Yu, Chang Guo, Jay Zhuang, Viraj Thakkar et al.SIGMOD 2024 · 18 citations
- Mammoths Are Slow: The Overlooked Transactions of Graph DataAudrey Cheng, Jack Waudby, Hugo Firth, Natacha Crooks et al.VLDB 2024 · 9 citations
- Yannakakis+: Practical Acyclic Query Evaluation with Theoretical GuaranteesQichen Wang, Bingnan Chen, Binyang Dai, Ke Yi et al.SIGMOD 2025 · 7 citations
- Reservoir Sampling over JoinsBinyang Dai, Xiao Hu, Ke YiSIGMOD 2024 · 6 citations
Builds on3
- Elle: Inferring Isolation Anomalies from Experimental ObservationsPeter Alvaro, Kyle KingsburyVLDB 2021 · 88 citations
- Adopting Worst-Case Optimal Joins in Relational Database SystemsMichael J. Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper et al.VLDB 2020 · 79 citations
- Columnar Storage and List-based Processing for Graph Database Management SystemsPranjal Gupta, Amine Mhedhbi, Semih SalihogluVLDB 2021 · 31 citations
Related papers
- The LDBC Financial Benchmark: Transaction WorkloadShipeng Qi, Bing Tong, Jiatao Hu, Heng Lin et al.VLDB 2025 · 2 citations
- TAOBench: An End-to-End Benchmark for Social Networking WorkloadsAudrey Cheng, Xiao Shi, Aaron N. Kabcenell, Shilpa Lawande et al.VLDB 2022 · 20 citations
- Indexing Labeled Property Multidigraphs in Entropy Space, with ApplicationsHongwei Huo, Yongze Yu, Zongtao He, Jeffrey Scott VitterICDE 2025
- HyBench: A New Benchmark for HTAP DatabasesChao Zhang, Guoliang Li, Tao LvVLDB 2024 · 28 citations
- TS-Benchmark: A Benchmark for Time Series DatabasesYuanzhe Hao, Xiongpai Qin, Yueguo Chen, Yaru Li et al.ICDE 2021 · 44 citations
