Pith. sign in

REVIEW

The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space

Not yet reviewed by Pith; the record is open.

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 2307.04350 v3 pith:KGB77EJ5 submitted 2023-07-10 cs.DB

classification cs.DB
keywords datagraphldbcmanagementquerybenchmarkcasescompetition
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph data management is instrumental for several use cases such as recommendation, root cause analysis, financial fraud detection, and enterprise knowledge representation. Efficiently supporting these use cases yields a number of unique requirements, including the need for a concise query language and graph-aware query optimization techniques. The goal of the Linked Data Benchmark Council (LDBC) is to design a set of standard benchmarks that capture representative categories of graph data management problems, making the performance of systems comparable and facilitating competition among vendors. LDBC also conducts research on graph schemas and graph query languages. This paper introduces the LDBC organization and its work over the last decade.

Discussion (0). Continue with ORCID to comment.

Pith tools