An analysis of the SIGMOD 2014 Programming Contest: Complex queries on the LDBC social network graph
M\'arton Elekes, J\'anos Benjamin Antal, G\'abor Sz\'arnyas
TL;DR
This paper analyzes the SIGMOD 2014 Programming Contest's complex graph queries on the LDBC social network dataset, highlighting challenges, lessons learned, and the contest's influence on subsequent research.
Contribution
It provides a detailed analysis of contest queries, graphical illustrations, and insights to aid future solutions and research inspired by these queries.
Findings
Documented challenges and caveats of contest queries
Provided graphical illustrations for better understanding
Highlighted the influence on subsequent research and algorithm design
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Algorithms and Data Compression · Complexity and Algorithms in Graphs