The reviewed record of science sign in
Pith

arxiv: 2001.02299 · v11 · pith:FA76L4ZI · submitted 2020-01-07 · cs.DB · cs.PF· cs.SI

The LDBC Social Network Benchmark

Renzo Angles , J\'anos Benjamin Antal , Alex Averbuch , Altan Birler , Peter Boncz , M\'arton B\'ur , Orri Erling , Andrey Gubichev
show 16 more authors
Vlad Haprian Moritz Kaufmann Josep Llu\'is Larriba Pey Norbert Mart\'inez J\'ozsef Marton Marcus Paradies Minh-Duc Pham Arnau Prat-P\'erez David P\"uroja Mirko Spasi\'c Benjamin A. Steer D\'avid Szak\'allas G\'abor Sz\'arnyas Jack Waudby Mingxi Wu Yuchen Zhang
This is my paper

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

classification cs.DB cs.PFcs.SI
keywords dataldbcbenchmarknetworkqueriessocialdetailedfunctionalities
0
0 comments X
read the original abstract

The Linked Data Benchmark Council's Social Network Benchmark (LDBC SNB) is an effort intended to test various functionalities of systems used for graph-like data management. For this, LDBC SNB uses the recognizable scenario of operating a social network, characterized by its graph-shaped data. LDBC SNB consists of two workloads that focus on different functionalities: the Interactive workload (interactive transactional queries) and the Business Intelligence workload (analytical queries). This document contains the definition of both workloads. This includes a detailed explanation of the data used in the LDBC SNB, a detailed description for all queries, and instructions on how to generate the data and run the benchmark with the provided software.

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.