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 intersection, difference, projection and coprojection, converse, and the diversity relation. The expressive power of the languages thus obtained cannot only be evaluated at the level of path queries (queries returning binary relations), but also at the level of Boolean or yes/no queries (expressed by the nonemptiness of an expression). For the languages considered above, adding transitive closure augments the expressive power not only at the level of path queries but also at the level of Boolean queries, for the latter provided that multiple input relations are allowed. This is no longer true in the context of unlabeled graphs (i.e., in the case where there is only one input relation), however. In this paper, we prove that this is indeed not the case for the basic language to which none, one, or both of projection and the diversity relation are added, a surprising result given the limited expressive power of these languages. In combination with earlier work (Fletcher et al. 2011, 2012), this result yields a complete understanding of the impact of transitive closure on the languages under consideration.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann (1999)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley, Reading, MA (1995)
Aho, A.V., Ullman, J.D.: The universality of data retrieval languages. In: POPL, pp. 110–120. ACM (1979)
Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1–39 (2008)
Baader, F., Calvanese, D., McGuiness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press (2003)
Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT. Lecture Notes in Computer Science, vol. 2572, pp. 79–95. Springer (2003)
Bizer, C., Heath, T., Berners-Lee, T.: Linked data—the story so far. Int. J. Semantic Web Inf. Syst. 5(3), 1–22 (2009)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)
ten Cate, B., Marx, M.: Navigational XPath: calculus and algebra. SIGMOD Rec. 36(2), 19–26 (2007)
Fletcher, G.H.L., Gyssens, M., Leinders, D., Van den Bussche, J., Van Gucht, D., Vansummeren, S., Wu, Y.: The impact of transitive closure on the boolean expressiveness of navigational query languages on graphs. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS. Lecture Notes in Computer Science, vol. 7153, pp. 124–143. Springer (2012)
Fletcher, G.H.L., Gyssens, M., Leinders, D., Van den Bussche, J., Van Gucht, D., Vansummeren, S., Wu, Y.: Relative expressive power of navigational querying on graphs. In: Milo, T. (ed.) ICDT, pp. 197–207. ACM (2011)
Florescu, D., Levy, A., Mendelzon, A.: Database techniques for the World-Wide Web: a survey. SIGMOD Rec. 27(3), 59–74 (1998)
Franklin, M.J., Halevy, A.Y., Maier, D.: From databases to dataspaces: a new abstraction for information management. SIGMOD Rec. 34(4), 27–33 (2005)
Gyssens, M., Paredaens, J., Van Gucht, D., Fletcher, G.H.L.: Structural characterizations of the semantics of XPath as navigation tool on a document. In: Vansummeren, S. (ed.) PODS, pp. 318–327. ACM (2006)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000)
Heath, T., Bizer, C.: Linked data: evolving the web into a global data space. In: Synthesis Lectures on the Semantic Web: Theory and Technology, vol. 1, 1st edn. Morgan & Claypool Publishers (2011)
Maddux, R.D.: Relation Algebras. Elsevier, Amsterdam (2006)
Mamoulis, N.: Efficient processing of joins on set-valued attributes. In: Halevy, A.Y., Ives, Z.G., Doan, A. (eds.) SIGMOD Conference, pp. 157–168. ACM (2003)
Marx, M.: Conditional XPath. ACM Trans. Database Syst. 30(4), 929–959 (2005)
Marx, M., de Rijke, M.: Semantic characterizations of navigational XPath. SIGMOD Rec. 34(2), 41–46 (2005)
Marx, M., Venema, Y.: Multi-Dimensional Modal Logic. Springer (1997)
Pratt, V.R.: Origins of the calculus of binary relations. In: LICS, pp. 248–254. IEEE Computer Society (1992)
RDF primer (2004). http://www.w3.org/TR/rdf-primer
Tarski, A.: On the calculus of relations. J. Symb. Log. 6(3), 73–89 (1941)
Tarski, A., Givant, S.: Formalization of Set Theory without Variables. American Mathematical Society (1987)
Wu, Y., Van Gucht, D., Gyssens, M., Paredaens, J.: A study of a positive fragment of Path queries: Expressiveness, normal form and minimization. Comput. J. 54(7), 1091–1118 (2011)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dirk Leinders carried out most of his work as a Senior Research Assistant of the Research Foundation Flanders (FWO). Yuqing Wu carried out part of her work during a sabbatical visit to Hasselt University with a Senior Visiting Postdoctoral Fellowship of the Research Foundation Flanders (FWO).
Rights and permissions
About this article
Cite this article
Fletcher, G.H.L., Gyssens, M., Leinders, D. et al. The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs. Ann Math Artif Intell 73, 167–203 (2015). https://doi.org/10.1007/s10472-013-9346-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-013-9346-x