Skip to main content

Rewriting Queries for XML Integration Systems

  • Conference paper
Database and Expert Systems Applications (DEXA 2006)

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

Included in the following conference series:

Abstract

A data integration system typically creates a target XML schema to represent an application domain and source schemas are mapped to the target schema. A user poses a query over the target schema, and the system rewrites the query into a set of queries over the data sources. Existing algorithms generate a set of static rules based on the target schema and mappings, and rewrite the target query using these rules. We design a flexible and dynamic approach that rewrites XML queries directly based on the mappings between the target and source schemas. Theoretical analysis and experiments on both synthetic and real-world datasets indicate that the proposed approach is efficient and scalable.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Calvanese, D., Giacomo, G., Lenzerini, M.: Rewriting of regular expressions and regular path queries. Computer and System Sciences 64 (2002)

    Google Scholar 

  2. Chaudhuri, S.: An overview of query optimization in relational systems. In: ACM SIGMOD (1998)

    Google Scholar 

  3. Florescu, D., Raschid, L., Valduriez, P.: Using heterogeneous equivalences for query rewriting in multidatabase systems. In: COOPIS (1995)

    Google Scholar 

  4. Manolescu, I., Florescu, D., Kossmann, D.: Answering xml queries over heterogeneous data sources. In: VLDB (2001)

    Google Scholar 

  5. McCann, R., AlShebli, B., Le, Q., Nguyen, H., Vu, L., Doan, A.: Mapping maintenance for data integration systems. In: VLDB (2005)

    Google Scholar 

  6. Papakonstantinou, Y., Vassalos, V.: Query rewriting for semistructured data. In: ACM SIGMOD (1999)

    Google Scholar 

  7. Pirahesh, H., Hellerstein, J.M., Hasan, W.: Extensible/rule based query rewrite optimization in starburst. In: ACM SIGMOD (1992)

    Google Scholar 

  8. Pottinger, R., Levy, A.: A scalable algorithm for answering queries using views. In: VLDB (2000)

    Google Scholar 

  9. Velegrakis, Y., Miller, R.J., Popa, L.: Mapping adaptation under evolving schemas. In: VLDB (2003)

    Google Scholar 

  10. Yu, C., Popa, L.: Constraint-based xml query rewriting. In: ACM SIGMOD (2004)

    Google Scholar 

  11. Yu, C., Popa, L.: Semantic adaptation of schema mappings when schemas evolve. In: VLDB (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, L., Lee, M.L., Hsu, W. (2006). Rewriting Queries for XML Integration Systems. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_14

Download citation

  • DOI: https://doi.org/10.1007/11827405_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37872-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics