2023/07/10 by David Püroja, Püroja, David, Jack Waudby +5
Computer Science · #Advanced Database Systems and Queries #Benchmark (surveying) #Benchmarking #Computer science #Database #Database transaction #Databases (cs.DB) #Distributed computing #FOS: Computer and information sciences #Graph #Graph Theory and Algorithms #Graph database #H.2.4 #Online transaction processing #Operating system #Peer-to-Peer Network Technologies #Theoretical computer science #Transaction data #Workload
paper · pdf · doi:10.48550/arxiv.2307.04820
openalex publication_date 2023/07/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The LDBC Social Network Benchmark's Interactive workload captures an OLTP scenario operating on a correlated social network graph. It consists of complex graph queries executed concurrently with a stream of updates operation. Since its initial release in 2015, the Interactive workload has become the de facto industry standard for benchmarking transactional graph data management systems. As graph systems have matured and the community's understanding of graph processing features has evolved, we initiated the renewal of this benchmark. This paper describes the draft Interactive v2 workload with several new features: delete operations, a cheapest path-finding query, support for larger data sets, and a novel temporal parameter curation algorithm that ensures stable runtimes for path queries.