An analysis of the SIGMOD 2014 Programming Contest: Complex queries on the LDBC social network graph

10/23/2020
by   Márton Elekes, et al.
0

This report contains an analysis of the queries defined in the SIGMOD 2014 Programming Contest. We first describe the data set, then present the queries, providing graphical illustrations for them and pointing out their caveats. Our intention is to document our lessons learnt and simplify the work of those who will attempt to create a solution to this contest. We also demonstrate the influence of this contest by listing followup works which used these queries as inspiration to design better algorithms or to define interesting graph queries.

READ FULL TEXT
research
01/07/2020

The LDBC Social Network Benchmark

The Linked Data Benchmark Council's Social Network Benchmark (LDBC SNB) ...
research
04/20/2020

Taming the Expressiveness and Programmability of Graph Analytical Queries

Graph database has enjoyed a boom in the last decade, and graph queries ...
research
09/13/2022

FEDEX: An Explainability Framework for Data Exploration Steps

When exploring a new dataset, Data Scientists often apply analysis queri...
research
05/11/2019

GraphSE^2: An Encrypted Graph Database for Privacy-Preserving Social Search

In this paper, we propose GraphSE^2, an encrypted graph database for onl...
research
07/10/2023

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

The LDBC Social Network Benchmark's Interactive workload captures an OLT...
research
07/17/2019

In-Depth Benchmarking of Graph Database Systems with the Linked Data Benchmark Council (LDBC) Social Network Benchmark (SNB)

In this study, we present the first results of a complete implementation...
research
10/23/2018

A Social Network Analysis of Articles on Social Network Analysis

A collection of articles on the statistical modelling and inference of s...

Please sign up or login with your details

Forgot password? Click here to reset