Advertisement

Satisfiability of XPath Expressions

  • Jan Hidders
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2921)

Abstract

In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem. Finally, we establish a link between XPath expressions and partial tree descriptions which are studied in computational linguistics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD Conference (2001)Google Scholar
  2. 2.
    Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 79–95. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Berglund, A., Boag, S., Chamberlin, D., Fernández, M.F., Kay, M., Robie, J., Siméon, J.: XML path language (XPath) 2.0. W3C Working Draft (2002), http://www.w3.org/TR/xpath20/
  4. 4.
    Bodirsky, M., Kutz, M.: Pure dominance constraints. In: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002 (2002)Google Scholar
  5. 5.
    Cornell, T.: On determining the consistency of partial descriptions of trees. In: Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, pp. 163–170. Morgan Kaufmann, San Francisco (1994)CrossRefGoogle Scholar
  6. 6.
    Deutsch, A., Tannen, V.: Containment and integrity constraints for XPath fragments. In: Proceedings of the 8th International Workshop on Knowledge Representation Meets Databases, KRDB 2001 (2001)Google Scholar
  7. 7.
    Draper, D., Fankhauser, P., Fernández, M.F., Malhotra, A., Rose, K., Rys, M., Siméon, J., Wadler, P.: XQuery 1.0 and XPath 2.0 formal semantics (2002), http://www.w3.org/TR/xquery-semantics/
  8. 8.
    Fernández, M.F., Malhotra, A., Marsh, J., Nagy, M., Walsh, N.: XQuery 1.0 and XPath 2.0 data model. W3C Working Draft (2002), http://www.w3.org/TR/xpath-datamodel/
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability – A guide to NP-completeness. W. H. Freeman and Company, San Francisco (1979)zbMATHGoogle Scholar
  10. 10.
    Koller, A., Niehren, J., Treinen, R.: Dominance constraints: Algorithms and complexity. In: Moortgat, M. (ed.) LACL 1998. LNCS (LNAI), vol. 2014, pp. 106–125. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Kwong, A., Gertz, M.: Schema-based optimization of xpath expressions. Technical report, University of California at Davis (2002)Google Scholar
  12. 12.
    Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: Symposium on Principles of Database Systems, pp. 65–76 (2002)Google Scholar
  13. 13.
    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. 315–329. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Rogers, J., Vijay-Shanker, K.: Reasoning with descriptions of trees. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pp. 72–80 (1992)Google Scholar
  15. 15.
    Wadler, P.: Two semantics for XPath (1999), http://www.cs.bell-labs.com/who/wadler/topics/xml.html
  16. 16.
    Wood, P.T.: Minimising simple XPath expressions. In: Proceedings of the Fourth International Workshop on the Web and Databases (WebDB 2001), Santa Barbara, California, May 2001, pp. 13–18 (2001)Google Scholar
  17. 17.
    Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 300–314. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jan Hidders
    • 1
  1. 1.Dept. of Mathematics and Computer ScienceUniversity of AntwerpAntwerpBelgium

Personalised recommendations