Skip to main content
SpringerLink
Log in
Book cover

International Conference on Web Reasoning and Rule Systems

RR 2013: Web Reasoning and Rule Systems pp 4–18Cite as

Reasoning About Pattern-Based XML Queries

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7994))

Abstract

We survey results about static analysis of pattern-based queries over XML documents. These queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of atomic formulae. As in the relational case, they can be viewed as both queries and incomplete documents, and thus static analysis problems can also be viewed as finding certain answers of queries over such documents. We look at satisfiability of patterns under schemas, containment of queries for various features of XML used in queries, finding certain answers, and applications of pattern-based queries in reasoning about schema mappings for data exchange.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.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. Abiteboul, S., Cautis, B., Milo, T.: Reasoning about XML update constraints. In: PODS 2007, pp. 195–204 (2007)

    Google Scholar 

  2. Abiteboul, S., Segoufin, L., Vianu, V.: Representing and querying XML with incomplete information. ACM TODS 31(1), 208–254 (2006)

    Article  Google Scholar 

  3. Amano, S., Libkin, L., Murlak, F.: XML schema mappings. In: PODS 2009, pp. 33–42 (2009)

    Google Scholar 

  4. Amer-Yahia, S., Cho, S., Lakshmanan, L., Srivastava, D.: Tree pattern query minimization. VLDB J. 11(4), 315–331 (2002)

    Article  MATH  Google Scholar 

  5. Arenas, M., Barceló, P., Libkin, L., Murlak, F.: Relational and XML Data Exchange. Morgan & Claypool (2010)

    Google Scholar 

  6. Arenas, M., Fan, W., Libkin, L.: On the complexity of verifying consistency of XML specifications. SIAM J. Comput. 38(3), 841–880 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Arenas, M., Libkin, L.: XML data exchange: consistency and query answering. J. ACM 55(2) (2008)

    Google Scholar 

  8. Barceló, P., Libkin, L., Poggi, A., Sirangelo, C.: XML with incomplete information. J. ACM 58(1) (2010)

    Google Scholar 

  9. Björklund, H., Martens, W., Schwentick, T.: Optimizing conjunctive queries over trees using schema information. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 132–143. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Björklund, H., Martens, W., Schwentick, T.: Conjunctive query containment over trees. JCSS 77(3), 450–472 (2011)

    MATH  Google Scholar 

  11. Bojanczyk, M., Kolodziejczyk, L., Murlak, F.: Solutions in XML data exchange. In: ICDT 2011, pp. 102–113 (2011)

    Google Scholar 

  12. Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Regular XPath: constraints, query containment and view-based answering for XML documents. In: LID 2008 (2008)

    Google Scholar 

  13. Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational data bases. In: STOC 1977, pp. 77–90 (1977)

    Google Scholar 

  14. David, C., Gheerbrant, A., Libkin, L., Martens, W.: Containment of pattern-based queries over data trees. In: ICDT 2013, pp. 201–212 (2013)

    Google Scholar 

  15. David, C., Libkin, L., Murlak, F.: Certain answers for XML queries. In: PODS 2010, pp. 191–202 (2010)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  17. Figueira, D.: Satisfiability of downward XPath with data equality tests. In: PODS 2009, pp. 197–206 (2009)

    Google Scholar 

  18. Genevés, P., Layaida, N.: A system for the static analysis of XPath. ACM TOIS 24, 475–502 (2006)

    Article  Google Scholar 

  19. Gheerbrant, A., Libkin, L., Tan, T.: On the complexity of query answering over incomplete XML documents. In: ICDT 2012, pp. 169–181 (2012)

    Google Scholar 

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

    MathSciNet  Google Scholar 

  21. Imieliński, T., Lipski, W.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)

    Article  MATH  Google Scholar 

  22. Lenzerini, M.: Data integration: a theoretical perspective. In: PODS 2002, pp. 233–246 (2002)

    Google Scholar 

  23. Libkin, L.: Incomplete information and certain answers in general data models. In: PODS 2011, pp. 59–70 (2011)

    Google Scholar 

  24. Libkin, L., Sirangelo, C.: Reasoning about XML with temporal logics and automata. J. Applied Logic 8(2), 210–232 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  25. Martens, W., Neven, F., Schwentick, T.: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3), 15–22 (2007)

    Article  Google Scholar 

  26. Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2–45 (2004)

    Article  MathSciNet  Google Scholar 

  27. Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. LMCS 2(3) (2006)

    Google Scholar 

  28. Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and difference operators. J. ACM 27(4), 633–655 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  29. Schwentick, T.: XPath query containment. SIGMOD Record 33(1), 101–109 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, University of Edinburgh, UK

    Amélie Gheerbrant & Leonid Libkin

  2. LSV, ENS-Cachan INRIA & CNRS, France

    Cristina Sirangelo

Authors
  1. Amélie Gheerbrant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leonid Libkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristina Sirangelo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Calabria, Via P. Bucci, cubo 30b, 87036, Rende, Italy

    Wolfgang Faber

  2. Department of Computer, Control, and Management Engineering Antonio Ruberti, Sapienza University of Rome, Via Ariosto, 25, 00185, Roma, Italy

    Domenico Lembo

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gheerbrant, A., Libkin, L., Sirangelo, C. (2013). Reasoning About Pattern-Based XML Queries. In: Faber, W., Lembo, D. (eds) Web Reasoning and Rule Systems. RR 2013. Lecture Notes in Computer Science, vol 7994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39666-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39666-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39665-6

  • Online ISBN: 978-3-642-39666-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation