Skip to main content

On Equivalence and Rewriting of XPath Queries Using Views under DTD Constraints

  • Conference paper

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

Abstract

It has long been recognized that query rewriting techniques are important tools for query optimization and semantic caching and are at the heart of data integration systems. In particular, the problem of rewriting queries using view definitions has received a lot of attention in these contexts. At the same time, the XPath language has become very popular for processing XML data, and there is much recent progress in semantic XPath optimization problems, such as XPath containment, and, more recently, XPath rewriting using views. In this paper we address the open problems of finding equivalent query rewritings using views for XPath queries and views that include the child, predicate and wildcard features (i.e., they are in XP(/, [], *)) under DTD constraints. In the process, we also develop novel containment tests for queries in XP(/,[],*) under DTD constraints.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afrati, F., Chirkova, R., Gergatsoulis, M., Pavlaki, V., Kimelfeld, B., Sagiv, Y.: On rewriting xpath queries using views. In: EDBT, pp. 168–179 (2009)

    Google Scholar 

  2. Aravogliadis, P., Vassalos, V.: Rewriting xpath queries using views under dtd constraints. Technical report, AUEB (2009), http://wim.aueb.gr/papers/xpathrewrite-ext.pdf

  3. Balmin, A., Ozcan, F., Beyer, K., Cochrane, R., Pirahesh, H.: A framework for using materialized XPath views in XML query processing. In: Proc. of the 30th VLDB Conference, pp. 60–71 (2004)

    Google Scholar 

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

    Google Scholar 

  5. Benedikt, M., Koch, C.: Xpath leashed. ACM Comptuting Survey 41(1) (2008)

    Google Scholar 

  6. Berglund, A., Boag, S., Chamberlin, D., et al.: XML Path Language (XPath) 2.0. W3C, http://www.w3.org/TR/XPath20

  7. Boag, S., Chamberlin, D., Fernandez, M.F., et al.: XQuery 1.0: An XML Query Language. W3C, http://www.w3.org/TR/XQuery

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

    Google Scholar 

  9. Cautis, B., Deutsch, A., Onose, N.: Xpath rewriting using multiple views: Achieving completeness and efficiency. In: Proc. WebDB 2008 (2008)

    Google Scholar 

  10. Cautis, B., Deutsch, A., Onose, N., Vassalos, V.: Efficient rewriting of xpath queries using query set specifications. In: Proceedings of the VLDB Endowment, vol. 2, pp. 301–312 (2009)

    Google Scholar 

  11. Deutsch, A., Tannen, V.: Containment and integrity constraints for xpath. In: KRDB Workshop (2001)

    Google Scholar 

  12. Halevy, A.: Answering queries using views: A survey. VLDB J. 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  13. Kimelfeld, B., Sagiv, Y.: Revisiting redundancy and minimization in an xpath fragment. In: EDBT, pp. 61–72 (2008)

    Google Scholar 

  14. Lakshmanan, L., Wang, H., Zhao, Z.: Answering tree pattern queries using views. In: Proc. of the 32th VLDB Conference, pp. 571–582 (2006)

    Google Scholar 

  15. Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. Journal of the ACM 51(1) (2004)

    Google Scholar 

  16. Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Montazerian, M., Wood, P., Mousavi, S.: XPath query satisfiability is in ptime for real-world dtds. In: XSym, pp. 17–30 (2007)

    Google Scholar 

  18. Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. In: Proc. Logical Methods in Computer Science, vol. 2 (2006)

    Google Scholar 

  19. Papakonstantinou, Y., Vassalos, V.: The Enosys Markets Data Integration Platform: Lessons from the trenches. In: CIKM, pp. 538–540 (2001)

    Google Scholar 

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

    Article  Google Scholar 

  21. Tang, N., Yu, J.X., Ozsu, M.T., Choi, B., Wong, K.: Multiple materialized view selection for xpath query rewriting. In: ICDE Proc.of the 2008, pp. 873–882 (2008)

    Google Scholar 

  22. ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. In: Proc. PODS 2007, pp. 73–82 (2007)

    Google Scholar 

  23. Wang, J., Li, J., Yu, J.X.: Answering tree pattern queries using views: a revisit. In: Proc. EDBT (2011)

    Google Scholar 

  24. Wood, P.: Minimizing simple XPath expressions. In: Proc. WebDB 2001, pp. 13–18 (2001)

    Google Scholar 

  25. Wood, P.T.: Containment for xPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 297–311. Springer, Heidelberg (2002)

    Google Scholar 

  26. Xu, W., Ozsoyoglu, Z.M.: Rewriting XPath queries using materialized views. In: VLDB 2001, pp. 121–132 (2005)

    Google Scholar 

  27. Zhou, R., Liu, C., Wang, J., Li, J.: Containment between unions of xpath queries. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 405–420. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aravogliadis, P., Vassalos, V. (2011). On Equivalence and Rewriting of XPath Queries Using Views under DTD Constraints. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23091-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23091-2_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23090-5

  • Online ISBN: 978-3-642-23091-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics