The reviewed record of science sign in
Pith

arxiv: 2307.04820 · v2 · pith:BSZ57IPN · submitted 2023-07-10 · cs.DB

The LDBC Social Network Benchmark Interactive workload v2: A transactional graph query benchmark with deep delete operations

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BSZ57IPNrecord.jsonopen to challenge →

classification cs.DB
keywords graphbenchmarkinteractiveworkloadnetworksocialdatadelete
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.