Relative expressive power of navigational querying on graphs using transitive closure
Logic Journal of the IGPL, pp. 759-788, 2015.
Databasesrelational algebraquery languages
Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set difference; projec...More
Full Text (Upload PDF)
PPT (Upload PPT)