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).
The full version of this paper is available at http://staff.science.uva.nl/~bcate
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)
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)
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)
Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (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 (2005)
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)
Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Proceedings DBPL 2005, pp. 122–137 (2005)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB 2002, 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 2006, 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: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 21–36. Springer, Heidelberg (2004)
Kay, M.: XPath 2.0 Programmer’s Reference. Wrox (2004)
Marx, M.: Conditional XPath. ACM Transactions on Database Systems (TODS) 30(4), 929–959 (2005)
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)
Rogers, J.: A Descriptive Approach to Language Theoretic Complexity. CSLI Press (1998)
Tarski, A.: On the calculus of relations. Journal of Symbolic Logic 6, 73–89 (1941)
Tarski, A., Givant, S.: A Formalization of Set Theory without Variables, vol. 41. AMS Colloquium publications, Providence, Rhode Island (1987)
Venema, Y.: Many–Dimensional Modal Logic. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ten Cate, B., Marx, M. (2006). Axiomatizing the Logical Core of XPath 2.0. In: Schwentick, T., Suciu, D. (eds) Database Theory – ICDT 2007. ICDT 2007. Lecture Notes in Computer Science, vol 4353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11965893_10
Download citation
DOI: https://doi.org/10.1007/11965893_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69269-0
Online ISBN: 978-3-540-69270-6
eBook Packages: Computer ScienceComputer Science (R0)