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

2020/10/23 by Márton Elekes, Elekes, Márton, János Benjamin Antal +3
Computer Science · #Algorithms and Data Compression #Graph Theory and Algorithms #Peer-to-Peer Network Technologies #cs.DB

paper · pdf · doi:10.48550/arxiv.2010.12243

arxiv created 2022/03/24 · arxiv updated 2022/03/28

Abstract

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.

Citations

• Depth-First Search and Linear Graph Algorithms

Related

• The LDBC Social Network Benchmark
• Applications of Graph Theory [Scanning the Issue]
• Scalable Graph Algorithms
• The LDBC Social Network Benchmark Interactive workload v2: A transactional graph query benchmark with deep delete operations
• Fast, Warped Graph Embedding: Unifying Framework and One-Click Algorithm