Relative expressive power of navigational querying on graphs using transitive closure

DOI10.1093/jigpal/jzv028zbMath1407.68134OpenAlexW891387922MaRDI QIDQ4644599

Dimitri Surinx, Yuqing Wu, Jan Van den Bussche, Dirk Leinders, George H. L. Fletcher, Stijn Vansummeren, Dirk Van Gucht, Marc Gyssens

Publication date: 8 January 2019

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/19b4b379f1ba8800b365dcc507fdff3fd1765705

zbMATH Keywords

relational algebraquery languagesdatabases

Mathematics Subject Classification ID

Applications of graph theory (05C90) Database theory (68P15)

Related Items (3)

Evaluation and Enumeration Problems for Regular Path Queries ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ A framework for comparing query languages in their ability to express Boolean queries

This page was built for publication: Relative expressive power of navigational querying on graphs using transitive closure