Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/13190

Title: The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs
Authors: Fletcher, George H. L.
Gyssens, Marc
Leinders, Dirk
Van den Bussche, Jan
Van Gucht, Dirk
Vansummeren, Stijn
Wu, Yuqing
Issue Date: 2012
Publisher: Springer
Citation: Lukasiewicz, Thomas; Sali, Attila (Ed.). Foundations of Information and Knowledge Systems, 7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012. Proceedings., Springer,p. 125-144
Series/Report no.: 7153
Abstract: 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 [10], these results yield a complete understanding of the impact of transitive closure on the languages under consideration.
URI: http://hdl.handle.net/1942/13190
ISBN: 9783642284717
ISSN: 0302-9743
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Complete article (preprint)406.47 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.