Skip to main content

Reformulation of XML Queries and Constraints

  • Conference paper
  • First Online:

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

Abstract

We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies (materialized views, indexes and caches) to enhance performance. The correspondence between published and proprietary schemas is specified by views in both directions, and the same algorithm performs rewriting-with-views, composition-with-views, or the combined effect of both, unifying the Global-As-View and Local-As-View approaches to data integration. We prove a completeness theorem which guarantees that under certain conditions, our algorithm will find a minimal reformulation if one exists. Moreover, we identify conditions when this algorithm achieves optimal complexity bounds. We solve the reformulation problem for constraints by exploiting a reduction to the problem of query reformulation.

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. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. A. Aho, Y. Sagiv, and J. Ullman. Efficient optimization of a class of relational expressions. In TODS, 4(4), 1979.

    Google Scholar 

  3. C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. JACM, 31(4):718–741, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Buneman, S. Davidson, W. Fan, C, Hara, and W.-C. Tan. Keys for xml. In WWW10, May 2001.

    Google Scholar 

  5. A. Cali, G. De Giacomo, and M. Lenzerini. Models of information integration: Turning local-as-view into global-as-view. In FMII, 2001.

    Google Scholar 

  6. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Rewriting of regular expressions and regular path queries. In PODS, 1999.

    Google Scholar 

  7. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Vardi. View-based query processing for regular path queries with inverse. In PODS, 2000.

    Google Scholar 

  8. M. Carey, J. Kiernan, J. Shanmugasundaram, E. Shekita, and S. Subramanian. XPERANTO: Middleware For Publishing Object-Relational Data as XML Documents. In VLDB, Sep 2000.

    Google Scholar 

  9. A. Deutsch, M. F. Fernandez, and D. Suciu. Storing Semistructured Data with STORED. In SIGMOD, 1999.

    Google Scholar 

  10. A. Deutsch, L. Popa, and V. Tannen. Physical Data Independence, Constraints and Optimization with Universal Plans. In VLDB, 1999.

    Google Scholar 

  11. A. Deutsch. XML Query Reformulation Over Mixed and Redundant Storage. PhD thesis, University of Pennsylvania, 2002. Available from http://db.cis.upenn.edu/cgi-bin/Person.perl?adeutsch

  12. A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.

    Google Scholar 

  13. A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints (extended version). Available from http://db.cis.upenn.edu/cgi-bin/Person.perl?adeutsch

  14. A. Deutsch and V. Tannen. Optimization Properties for Classes of Conjunctive Regular Path Queries. In DBPL, 2001.

    Google Scholar 

  15. M. Fernandez, A. Morishima, and D. Suciu. Efficient Evaluation of XML Middleware Queries. In SIGMOD, 2001.

    Google Scholar 

  16. M. Fernandez, W. Tan, and D. Suciu. SilkRoute: Trading between Relations and XML. In WWW9, 2000.

    Google Scholar 

  17. M. Friedman, A. Levy, and T. Millstein. Navigational plans for data integration. In AAAI/IAAI, 1999.

    Google Scholar 

  18. J. Goldstein and P. A. Larson. Optimizing queries using materialized views. In SIGMOD, 2001.

    Google Scholar 

  19. J. Gryz. Query folding with inclusion dependencies. In ICDE, 1998.

    Google Scholar 

  20. A. Halevy. Logic-based techniques in data integration. In Logic Based Arti.cial Intelligence, 2000.

    Google Scholar 

  21. R. Hull and M. Yoshikawa. ILOG: Declarative creation and manipulation of object identifiers. In VLDB, 1990.

    Google Scholar 

  22. M. Lenzerini. Data integration: A theoretical perspective. In PODS, 2002.

    Google Scholar 

  23. A. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, 1995.

    Google Scholar 

  24. A. Levy, A. Rajaraman, and J. Ordille. Querying heterogeneous information sources using source descriptions. In VLDB, 1996.

    Google Scholar 

  25. I. Manolescu, D. Florescu, and D. Kossman. Answering XML Queries on Heterogeneous Data Sources. In VLDB, 2001.

    Google Scholar 

  26. Y. Papakonstantinou and V. Vassalos. Query Rewriting for Semistructured Data, In SIGMOD, 1999.

    Google Scholar 

  27. L. Popa. Object/Relational Query Optimization with Chase and Backchase. PhD thesis, Univ. of Pennsylvania, 2000.

    Google Scholar 

  28. R. Pottinger and A. Halevy. Minicon: A scalable algorithm for answering queries using views. In VLDB Journal, 10(2–3), 2001.

    Google Scholar 

  29. P. Seshadri, H. Pirahesh, and T. Y. C. Leung. Complex query decorrelation. In ICDE, 1996.

    Google Scholar 

  30. J. Shanmugasundaram, J. Kiernan, E. J. Shekita, C. Fan, and J. Funderburk. Querying XML Views of Relational Data. In VLDB, 2001.

    Google Scholar 

  31. O. Tsatalos, M. Solomon, and Y. Ioannidis. The gmap: A versatile tool for physical data independence. VLDB, 1994.

    Google Scholar 

  32. W3C. XML Schema Part 0: Primer. Working Draft 25 February 2000. Available from http://www.w3.org/TR/xmlschema-0.

  33. W3C. XQuery: A query Language for XML. W3C Working Draft 15 February 2001. Available from http://www.w3.org/TR/xquery.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deutsch, A., Tannen, V. (2003). Reformulation of XML Queries and Constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds) Database Theory — ICDT 2003. ICDT 2003. Lecture Notes in Computer Science, vol 2572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36285-1_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-36285-1_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00323-6

  • Online ISBN: 978-3-540-36285-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics