Axiomatizing the Logical Core of XPath 2.0

  • Balder ten Cate
  • Maarten Marx
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4353)


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).


Binary Relation Relation Algebra Path Expression Logical Core XPath Query 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  2. 2.
    Berghammer, R., Schmidt, G., Winter, M.: RelView and Rath - two systems for dealing with relations. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 1–16. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings LICS 2006, pp. 7–16 (2006)Google Scholar
  4. 4.
    Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)MATHGoogle Scholar
  5. 5.
    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 (2005)Google Scholar
  6. 6.
    Doets, H.C.: Completeness and Definability: Applications of the Ehrenfeucht Game in Intensional and Second-Order Logic. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam (1987)Google Scholar
  7. 7.
    Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Proceedings DBPL 2005, pp. 122–137 (2005)Google Scholar
  8. 8.
    Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB 2002, pp. 95–106 (2002)Google Scholar
  9. 9.
    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 2006, pp. 318–327 (2006)Google Scholar
  10. 10.
    Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras, Part II. North-Holland, Amsterdam (1985)MATHGoogle Scholar
  11. 11.
    Hidders, J.: Satisfiability of XPath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 21–36. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Kay, M.: XPath 2.0 Programmer’s Reference. Wrox (2004)Google Scholar
  13. 13.
    Marx, M.: Conditional XPath. ACM Transactions on Database Systems (TODS) 30(4), 929–959 (2005)CrossRefGoogle Scholar
  14. 14.
    Reinhardt, K.: The complexity of translating logic to finite automata. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 231–238. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  15. 15.
    Rogers, J.: A Descriptive Approach to Language Theoretic Complexity. CSLI Press (1998)Google Scholar
  16. 16.
    Tarski, A.: On the calculus of relations. Journal of Symbolic Logic 6, 73–89 (1941)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Tarski, A., Givant, S.: A Formalization of Set Theory without Variables, vol. 41. AMS Colloquium publications, Providence, Rhode Island (1987)Google Scholar
  18. 18.
    Venema, Y.: Many–Dimensional Modal Logic. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Balder ten Cate
    • 1
  • Maarten Marx
    • 1
  1. 1.ISLA – Informatics InstituteUniversiteit van Amsterdam 

Personalised recommendations