Skip to main content
SpringerLink
Log in

Satisfiability of XPath Expressions

  • Conference paper
Database Programming Languages (DBPL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2921))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD Conference (2001)

    Google Scholar 

  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)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  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. 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. 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. Garey, M.R., Johnson, D.S.: Computers and Intractability – A guide to NP-completeness. W. H. Freeman and Company, San Francisco (1979)

    MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  11. Kwong, A., Gertz, M.: Schema-based optimization of xpath expressions. Technical report, University of California at Davis (2002)

    Google Scholar 

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

    Chapter  Google Scholar 

  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. Wadler, P.: Two semantics for XPath (1999), http://www.cs.bell-labs.com/who/wadler/topics/xml.html

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

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computer Science, University of Antwerp, Middelheimlaan 1, BE-2020, Antwerp, Belgium

    Jan Hidders

Authors
  1. Jan Hidders
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Angewandte Wissenschaften, Institut für Informatik, Georges-Köhler-Allee, Albert-Ludwigs-Universität Freiburg, Gebäude 51, 79110, Freiburg, Germany

    Georg Lausen

  2. Department of Computer Science and Engineering, University of Washington,  

    Dan Suciu

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hidders, J. (2004). Satisfiability of XPath Expressions. In: Lausen, G., Suciu, D. (eds) Database Programming Languages. DBPL 2003. Lecture Notes in Computer Science, vol 2921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24607-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24607-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20896-9

  • Online ISBN: 978-3-540-24607-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation