Pith. sign in

REVIEW 1 cited by

The LDBC Social Network Benchmark

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Renzo Angles , János Benjamin Antal , Alex Averbuch , Altan Birler , Peter Boncz , Márton Búr , Orri Erling , Andrey Gubichev
show 16 more authors
Vlad Haprian Moritz Kaufmann Josep Lluís Larriba Pey Norbert Martínez József Marton Marcus Paradies Minh-Duc Pham Arnau Prat-Pérez David Püroja Mirko Spasić Benjamin A. Steer Dávid Szakállas Gábor Szárnyas Jack Waudby Mingxi Wu Yuchen Zhang
This is my paper
classification cs.DBcs.PFcs.SI
keywords dataldbcbenchmarknetworkqueriessocialdetailedfunctionalities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The KG-ER Conceptual Schema Language

    cs.DB 2025-08 conditional novelty 6.0 of 10

    KG-ER is a formally defined conceptual schema language for knowledge graphs, with entity, relationship, attribute, tree-pattern key, and hierarchy constraints, targeting representation-independent design across relati...

Pith tools