MQTree based query rewriting over multiple XML views

  • Authors:

  • Jun Gao;Tengjiao Wang;Dongqing Yang

  • Affiliations:

  • Department of Computer Science and Technology, Peking University, Beijing, China;Department of Computer Science and Technology, Peking University, Beijing, China;Department of Computer Science and Technology, Peking University, Beijing, China

  • Venue:
  • DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using XML views to answer the XML query is an important query optimization strategy especially in the distributed environment. Although many methods have been proposed to handle the single XML view rewriting, they will lead to the redundant computation cost due to the shared paths among different XML views. This paper handles the query rewriting over multiple views by organizing the multiple XML views into a tree called MQTree, in which the shared sub paths among the multiple views have been merged in a top down fashion. In addition, this paper designs a MQTree based query rewriting method. The candidate query rewriting plans are generated over MQTree directly. In order to reduce the validation cost of the candidate query rewriting plans, the preliminary validation is made at the granularity of the path query {//,/,*} over the MQTree first, which prunes the candidate views further and provides the intermediate results for the plans validation at the granularity of the whole tree. The final experiments show the efficiency and effectiveness of our method.