Several established and novel applications motivate us to study the expressive power of navigational query languages on graphs, which represent binary relations. Our basic language has only the operators union and composition, together with the identity relation. Richer languages can be obtained by adding other features such as other set operators, projection and coprojection, converse, and the diversity relation. In this paper, we show that, when evaluated at the level of boolean queries with an unlabeled input graph (i.e., a single relation), adding transitive closure to the languages with coprojection adds expressive power, while this is not the case for the basic language to which none, one, or both of projection and the diversity relation are added. In combination with earlier work, these results yield a complete understanding of the impact of transitive closure on the languages under consideration.
|Title of host publication||Foundations of Information and Knowledge Systems (7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012. Proceedings)|
|Editors||T. Lukasiewicz, A. Sali|
|Place of Publication||Berlin|
|Publication status||Published - 2012|
|Name||Lecture Notes in Computer Science|