Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2008: Mathematical Foundations of Computer Science 2008 pp 278–289Cite as

Complexity of Data Tree Patterns over XML Documents

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5162))

Abstract

We consider Boolean combinations of data tree patterns as a specification and query language for XML documents. Data tree patterns are tree patterns plus variable (in)equalities which express joins between attribute values. Data tree patterns are a simple and natural formalism for expressing properties of XML documents. We consider first the model checking problem (query evaluation), we show that it is DP-complete in general and already NP-complete when we consider a single pattern. We then consider the satisfiability problem in the presence of a DTD. We show that it is in general undecidable and we identify several decidable fragments.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: ICDE, pp. 141–153. IEEE, Los Alamitos (2002)

    Google Scholar 

  2. Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with data values: typechecking revisited. J. Comput. Syst. Sci. 66(4), 688–727 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. SIGMOD Rec. 30(2), 497–508 (2001)

    Article  Google Scholar 

  4. Arenas, M., Libkin, L.: XML data exchange: consistency and query answering. In: PODS, pp. 13–24 (2005)

    Google Scholar 

  5. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. In: PODS, pp. 25–36 (2005)

    Google Scholar 

  6. Benedikt, M., Koch, C.: XPath Leashed. ACM Computing Surveys (to appear)

    Google Scholar 

  7. Benzaken, V., Castagna, G., Miachon, C.: CQL: a pattern-based query language for XML. In: BDA, pp. 469–490 (2004)

    Google Scholar 

  8. Björklund, H., Martens, W., Schwentick, T.: Conjunctive Query Containment over Trees. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797, pp. 66–80. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Björklund, H., Martens, W., Schwentick, T.: Optimizing Conjunctive Queries over Trees using Schema Information. In: MFCS (to appear, 2008)

    Google Scholar 

  10. Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10–19 (2006)

    Google Scholar 

  11. Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-Variable Logic on Words with Data. In: LICS, pp. 7–16. IEEE, Los Alamitos (2006)

    Google Scholar 

  12. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD Conference, pp. 310–321. ACM, New York (2002)

    Google Scholar 

  13. Demri, S., Lazic, R.: LTL with the Freeze Quantifier and Register Automata. In: LICS, pp. 17–26. IEEE, Los Alamitos (2006)

    Google Scholar 

  14. Deutsch, A., Tannen, V.: Containment and integrity constraints for xpath. In: KRDB CEUR Workshop Proceedings. CEUR-WS.org, vol. 45 (2001)

    Google Scholar 

  15. Fan, W., Libkin, L.: On XML integrity constraints in the presence of DTDs. J. ACM 49(3), 368–406 (2002)

    Article  MathSciNet  Google Scholar 

  16. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2), 444–491 (2005)

    Article  MathSciNet  Google Scholar 

  17. Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. J. ACM 53(2), 238–272 (2006)

    Article  MathSciNet  Google Scholar 

  18. Jurdzinski, M., Lazic, R.: Alternation-free modal mu-calculus for data trees. In: LICS, pp. 131–140. IEEE, Los Alamitos (2007)

    Google Scholar 

  19. Lakshmanan, L.V.S., Ramesh, G., Wang, H., Zhao, Z.J.: On Testing Satisfiability of Tree Pattern Queries. In: VLDB, pp. 120–131 (2004)

    Google Scholar 

  20. Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 134–145. Springer, Heidelberg (1998)

    Google Scholar 

  21. Papadimitriou, C.H., Yannakakis, M.: The Complexity of Facets (and Some Facets of Complexity). J. Comput. Syst. Sci. 28(2), 244–259 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wu, Y., Patel, J.M., Jagadish, H.V.: Structural Join Order Selection for XML Query Optimization. In: ICDE, pp. 443–454. IEEE, Los Alamitos (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, University Paris 7 and CNRS, France

    Claire David

Authors
  1. Claire David
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward Ochmański Jerzy Tyszkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

David, C. (2008). Complexity of Data Tree Patterns over XML Documents. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85238-4_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85237-7

  • Online ISBN: 978-3-540-85238-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation