Abstract
| Original language | English |
|---|---|
| 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 |
| Publisher | Springer |
| Pages | 124-143 |
| ISBN (Print) | 978-3-642-28471-7 |
| DOIs | |
| Publication status | Published - 2012 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Volume | 7153 |
| ISSN (Print) | 0302-9743 |
Fingerprint
Cite this
}
The impact of transitive closure on the Boolean expressiveness of navigational query languages on graphs. / Fletcher, G.H.L.; Gyssens, M.; Leinders, D.; Van den Bussche, J.; Van Gucht, D.; Vansummeren, S.; Wu, Y.
Foundations of Information and Knowledge Systems (7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012. Proceedings). ed. / T. Lukasiewicz; A. Sali. Berlin : Springer, 2012. p. 124-143 (Lecture Notes in Computer Science; Vol. 7153).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
TY - GEN
T1 - The impact of transitive closure on the Boolean expressiveness of navigational query languages on graphs
AU - Fletcher, G.H.L.
AU - Gyssens, M.
AU - Leinders, D.
AU - Van den Bussche, J.
AU - Van Gucht, D.
AU - Vansummeren, S.
AU - Wu, Y.
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
U2 - 10.1007/978-3-642-28472-4_8
DO - 10.1007/978-3-642-28472-4_8
M3 - Conference contribution
SN - 978-3-642-28471-7
T3 - Lecture Notes in Computer Science
SP - 124
EP - 143
BT - Foundations of Information and Knowledge Systems (7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012. Proceedings)
A2 - Lukasiewicz, T.
A2 - Sali, A.
PB - Springer
CY - Berlin
ER -