Abstract
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex counting conditions and data joins are not supported, as they lead to undecidability). The second aim is to provide a list of equations completely axiomatizing query equivalence in this language (i.e., all other query equivalences can be derived from these).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Backofen, R., Rogers, J., Vijay-Shanker, K.: A first-order axiomatization of the theory of finite trees. J. Logic Lang. Inf. 4(1), 5–39 (1995)
Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. J. Assoc. Comput. Mach. 55(2), (2008)
Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. Theor. Comput. Sci. 336(1), 3–31 (2005)
Berghammer, R., Schmidt, G., Winter, M.: RelView and Rath—two systems for dealing with relations. In: Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 1–16. Springer, Berlin (2003)
Bojanczyk, M., Muscholl, A., Schwentick, Th., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings LICS’06, pp. 7–16 (2006)
Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Berlin (1997)
Dawar, A.: How many first-order variables are needed on finite ordered structures? In: Artemov, S., et al. (eds.) We will Show Them: Essays in Honour of Dov Gabbay, pp. 489–520. College Publications, Woodend Vic. (2005)
Doets, H.C.: Completeness and definability: applications of the ehrenfeucht game in intensional and second-order logic. Ph.D. Thesis, Department of Mathematics and Computer Science, University of Amsterdam (1987)
Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Proceedings DBPL’05, pp. 122–137 (2005)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB’02, pp. 95–106 (2002)
Gyssens, M., Paredaens, J., Van Gucht, D., Fletcher, G.: Structural characterizations of the semantics of XPath as navigation tool on a document. In: Proceedings PODS’06, pp. 318–327 (2006)
Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras, Part II. North-Holland, Amsterdam (1985)
Hidders, J.: Satisfiability of XPath expressions. In: Proceedings DBPL. LNCS, vol. 2921, pp. 21–36. Springer, Berlin (2003)
Hirsch, R., Hodkinson, I.: Relation algebras by games. In: Studies in Logic and the Foundations of Mathematics, vol. 147. North-Holland, Amsterdam (2002)
Kay, M.: XPath 2.0 Programmer’s Reference. Wrox (2004)
Lyndon, R.C.: The representation of relation algebras. Ann. Math. 51, 707–729 (1950)
Lyndon, R.C.: The representation of relation algebras, Part II. Ann. Math. 63, 294–307 (1956)
Marx, M.: Conditional XPath. ACM Trans. Database Syst. (TODS) 30(4), 929–959 (2005)
Tarski, A.: On the calculus of relations. J. Symb. Log. 6, 73–89 (1941)
Tarski, A., Givant, S.: A Formalization of Set Theory without Variables. AMS Colloquium Publications, vol. 41. Rhode Island, Providence (1987)
ten Cate, B., Litak, T., Marx, M.: Complete axiomatizations for XPath fragments. In: Proceedings LID (Logic in Databases) Rome, Italy, 19–20 May 2008
ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. In: Proceedings PODS’07 (2007)
Venema, Y.: Many-dimensional modal logic. Ph.D. Thesis, Institute for Logic, Language and Computation, University of Amsterdam (1992)
Venema, Y.: Completeness by completeness: since and until. In: de Rijke, M. (ed.) Diamonds and Defaults, pp. 349–358. Kluwer Academic, Dordrecht (1993)
Venema, Y.: Derivation rules as anti-axioms in modal logic. J. Symb. Log. 58(3), 1003–1034 (1993)
Venema, Y.: Completeness through flatness. In: Gabbay, D., Ohlbach, H.J. (eds.) Temporal Logic, First International Conference ICTL’94, pp. 149–164 (1994)
Venema, Y.: Cylindrical modal logic. J. Symb. Log. 60(2), 591–623 (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper was published in the proceedings of ICDT 2007.
We would like to thank Jan Hidders for pointing us to the interesting question of stronger forms of completeness (cf. Sect. 4.3). We would also like to thank the anonymous reviewers for their extensive comments, which have greatly improved the quality of the paper.
The first author is supported by NWO grant 639.021.508.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
ten Cate, B., Marx, M. Axiomatizing the Logical Core of XPath 2.0. Theory Comput Syst 44, 561–589 (2009). https://doi.org/10.1007/s00224-008-9151-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-008-9151-9