Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views

  • Junhu Wang
  • Kewen Wang
  • Jiuyong Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5446)


Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given query Q and view V, it has been shown that a contained rewriting of Q using V can be obtained by finding a useful embedding of Q in V. However, for the same Q and V, there may be many useful embeddings and thus many contained rewritings. Some of the useful embeddings may be redundant in that the rewritings obtained from them are contained in those obtained from other useful embeddings. Redundant useful embeddings are useless and they waste computational resource. Thus it becomes important to identify and remove them. In this paper, we show that the criteria for identifying redundant useful embeddings given in a previous work are neither sufficient nor necessary. We then present some useful observations on the containment relationship of rewritings, and based on which, a heuristic algorithm for removing redundant useful embeddings. We demonstrate the efficiency of our algorithm using examples.


Heuristic Algorithm Tree Pattern Anchor Node Conjunctive Query Distinguished Node 
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.
    Halevy, A.Y.: Answering queries using views: A survey. VLDB J. 10(4), 270–294 (2001)CrossRefzbMATHGoogle Scholar
  2. 2.
    Lakshmanan, L.V.S., Wang, H., Zhao, Z.J.: Answering tree pattern queries using views. In: VLDB (2006)Google Scholar
  3. 3.
    Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1) (2004)Google Scholar
  4. 4.
    Nash, A., Segoufin, L., Vianu, V.: Determinacy and rewriting of conjunctive queries using views: A progress report. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 59–73. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Wang, J., Topor, R.W., Maher, M.J.: Rewriting union queries using views. Constraints 10(3), 219–251 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Wang, J., Yu, J.X., Liu, C.: Independence of containing patterns property and its application in tree pattern query rewriting using views. WWWJ (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Junhu Wang
    • 1
  • Kewen Wang
    • 1
  • Jiuyong Li
    • 2
  1. 1.Griffith UniversityAustralia
  2. 2.University of South AustraliaAdelaideAustralia

Personalised recommendations