Rewriting Queries for XML Integration Systems

  • Ling Li
  • Mong Li Lee
  • Wynne Hsu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4080)


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.


Query Complexity Query Optimization Target Schema Data Integration System Component Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Calvanese, D., Giacomo, G., Lenzerini, M.: Rewriting of regular expressions and regular path queries. Computer and System Sciences 64 (2002)Google Scholar
  2. 2.
    Chaudhuri, S.: An overview of query optimization in relational systems. In: ACM SIGMOD (1998)Google Scholar
  3. 3.
    Florescu, D., Raschid, L., Valduriez, P.: Using heterogeneous equivalences for query rewriting in multidatabase systems. In: COOPIS (1995)Google Scholar
  4. 4.
    Manolescu, I., Florescu, D., Kossmann, D.: Answering xml queries over heterogeneous data sources. In: VLDB (2001)Google Scholar
  5. 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. 6.
    Papakonstantinou, Y., Vassalos, V.: Query rewriting for semistructured data. In: ACM SIGMOD (1999)Google Scholar
  7. 7.
    Pirahesh, H., Hellerstein, J.M., Hasan, W.: Extensible/rule based query rewrite optimization in starburst. In: ACM SIGMOD (1992)Google Scholar
  8. 8.
    Pottinger, R., Levy, A.: A scalable algorithm for answering queries using views. In: VLDB (2000)Google Scholar
  9. 9.
    Velegrakis, Y., Miller, R.J., Popa, L.: Mapping adaptation under evolving schemas. In: VLDB (2003)Google Scholar
  10. 10.
    Yu, C., Popa, L.: Constraint-based xml query rewriting. In: ACM SIGMOD (2004)Google Scholar
  11. 11.
    Yu, C., Popa, L.: Semantic adaptation of schema mappings when schemas evolve. In: VLDB (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ling Li
    • 1
  • Mong Li Lee
    • 1
  • Wynne Hsu
    • 1
  1. 1.School of ComputingNational University of Singapore 

Personalised recommendations