Reproduce “Foundations of Modern Query Languages for Graph Databases” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Renzo Angles, Marcelo Arenas, Pablo Barcelo, Aidan Hogan, Juan Reutter, Domagoj Vrgoc
Researchers from the Center for Semantic Web Research provide a foundational survey of modern graph query languages like SPARQL, Cypher, and Gremlin, systematically analyzing their core features, varying semantics, and computational complexity to bridge the gap between theoretical principles and practical system implementations.
Key insights
- Modern graph query languages are fundamentally composed of graph pattern matching and arbitrary-length path navigation capabilities.
- The specific choice of semantics for query evaluation (e.g., homomorphism-based vs. isomorphism-based, or set vs. bag for results) profoundly impacts a language's expressive power and computational complexity.
- Practical languages such as SPARQL, Cypher, and Gremlin implement similar core features using distinct semantic choices, which leads to varied expressivity and performance characteristics.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.