G-CORE Article Swipe

View

Related Concepts

Computer science Query language RDF query language Query optimization Core (optical fiber) Graph Graph database Theoretical computer science Graph rewriting Web query classification Sargable Programming language Web search query Information retrieval Search engine Telecommunications

Renzo Angles , Marcelo Arenas , Pablo Barceló , Peter Boncz , George Fletcher , Claudio Gutiérrez , Tobias Lindaaker , Marcus Paradies , Stefan Plantikow , Juan Sequeda , Oskar van Rest , Hannes Voigt ·

YOU? · · 2018 · Open Access · · DOI: https://doi.org/10.1145/3183713.3190654 · OA: W2771362234

We report on a community effort between industry and academia to\nshape the future of graph query languages. We argue that existing\ngraph database management systems should consider supporting\na query language with two key characteristics. First, it should be\ncomposable, meaning, that graphs are the input and the output of\nqueries. Second, the graph query language should treat paths as\nfirst-class citizens. Our result is G-CORE, a powerful graph query\nlanguage design that fulfills these goals, and strikes a careful balance\nbetween path query expressivity and evaluation complexity.