Abstract
This paper is about the W3C standard node-addressing language for XML documents, called XPath. XPath is still under development. Version 2.0 appeared in 2001 while the theoretical foundations of Version 1.0 (dating from 1998) are still being widely studied. The paper aims at bringing XPath to a “stable fixed point” in its development: a version which is expressively complete, still manageable computationally, with a user-friendly syntax and a natural semantics. We focus on an important axis relation which is not expressible in XPath 1.0 and is very useful in practice: the conditional axis. With it we can express paths specified by for instance “do a child step, while test is true at the resulting node”. We study the effect of adding conditional axis relations to XPath on its expressive power and the complexity of the query evaluation and query equivalence problems. We define an XPath dialect \(\mathcal{X}\)CPath which is expressively complete, has a linear time query evaluation algorithm and for which query equivalence given a DTD can be decided in exponential time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the web. Morgan Kaufman, San Francisco (2000)
Alechina, N., Demri, S., de Rijke, M.: A modal perspective on path constraints. Journal of Logic and Computation 13, 1–18 (2003)
Alechina, N., Immerman, N.: Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of the IGPL 8(3), 325–337 (2000)
Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 79–95. Springer, Heidelberg (2002)
Berwick, R., Weinberg, A.: The Grammatical Basis of Natural Languages. MIT Press, Cambridge (1984)
Blackburn, P., Gaiffe, B., Marx, M.: Variable free reasoning on finite trees. In: Proceedings of Mathematics of Language (MOL–8), Bloomington (2003)
Calvanese, D., De Giacomo, G., Lenzerini, M.: Representing and reasoning on XML documents: A description logic approach. J. of Logic and Computation 9(3), 295–318 (1999)
Clarke, E.M., Schlingloff, B.-H.: Model checking. Elsevier Science Publishers, Amsterdam (to appear)
Deutsch, A., Tannen, V.: Containment of regular path expressions under integrity constraints. In: Knowledge Representation Meets Databases (2001)
Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 405–451 (1970)
Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)
Fisher, M., Ladner, R.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194–211 (1979)
Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic. Mathematical Foundations and Computational Aspects, vol. 1. Oxford Science Publications (1994)
Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Proc. 7th ACM Symposium on Principles of Programming Languages, pp. 163–173 (1980)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: Proc. of the 28th International Conference on Very Large Data Bases (VLDB 2002) (2002)
Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: PODS 2003, pp. 179–190 (2003)
Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: Proc. LICS, Copenhagen (2002)
Harel, D.: Dynamic logic. In: Gabbay, D.M., Guenther, F. (eds.) Handbook of Philosophical Logic, vol. 2, pp. 497–604. Reidel, Dordrecht (1984)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
Johnson, D.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 67–161. Elsevier, Amsterdam (1990)
Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles (1968)
Kozen, D.: Results on the propositional mu-calculus. Th. Comp. Science 27 (1983)
Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems 19(3), 427–443 (1997)
Marx, M.: XCPath, the expressively complete XPath fragment. Manuscript (July 2003)
Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: Proc. PODS 2002, pp. 65–76 (2002)
Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 312–326. Springer, Heidelberg (2002)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Pratt, V.: Models of program logics. In: Proceedings FoCS, pp. 115–122 (1979)
Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)
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, Stanford (1998)
Thomas, W.: Logical aspects in the study of tree languages. In: Courcelle, B. (ed.) Ninth Colloquium on Trees in Algebra and Programming, pp. 31–50. CUP, Cambridge (1984)
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences 32, 183–221 (1986)
Wadler, P.: Two semantics for XPath. Technical report, Bell Labs (2000)
Weyer, M.: Decidability of S1S and S2S. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 207–230. Springer, Heidelberg (2002)
Wood, P.: On the equivalence of XML patterns. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1152–1166. Springer, Heidelberg (2000)
W3C. Extensible markup language (XML) 1.0, http://www.w3.org/TR/REC-xml
W3C. XML path language (XPath 1.0), http://www.w3.org/TR/xpath.html
W3C. XML path language (XPpath 2.0), http://www.w3.org/TR/xpath20/
W3C. XML schema part 1: Structures, http://www.w3.org/TR/xmlschema-1
W3C. Xquery 1.0: A query language for XML, http://www.w3.org/TR//xquery/
W3C. XSL transformations language XSLT 2.0, http://www.w3.org/TR/xslt20/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marx, M. (2004). XPath with Conditional Axis Relations. In: Bertino, E., et al. Advances in Database Technology - EDBT 2004. EDBT 2004. Lecture Notes in Computer Science, vol 2992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24741-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24741-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21200-3
Online ISBN: 978-3-540-24741-8
eBook Packages: Springer Book Archive