Connecting graph and relational query languages

Practical query languages for graph and relational databases are based on similar concepts: In the former, base relations are extracted from graphs, and in the latter, they are given as input. In both, these base relations are manipulated via Relational Algebra and its variants. We formalize these insights and utilize them to reason about the expressive power of real-life languages. This is joint work with Amélie Gheerbrant, Leonid Libkin and Liat Peterfreund.