A relational model for XML structural joins and their size estimations

  • Authors:

  • Cheng Luo;Zhewei Jiang;Wen-Chi Hou;Feng Yan;Qiang Zhu

  • Affiliations:

  • Southern Illinois University Carbondale, Department of Computer Science, 62901, Carbondale, IL, USA;Southern Illinois University Carbondale, Department of Computer Science, 62901, Carbondale, IL, USA;Southern Illinois University Carbondale, Department of Computer Science, 62901, Carbondale, IL, USA;Southern Illinois University Carbondale, Department of Computer Science, 62901, Carbondale, IL, USA;University of Michigan-Dearborn, Department of Computer and Information Science, 48128, Dearborn, MI, USA

  • Venue:
  • Knowledge and Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structural join size accurately and quickly is crucial to the success of XML query plan selection and the query optimization. XML structural joins are essentially complex θ-joins, which render well-known estimation techniques for relational equijoins, such as discrete cosine transform, wavelet transform, and sketch, not applicable. In this paper, we model structural joins from a relational point of view and convert the complex θ-joins to equijoins so that those well-known estimation techniques become applicable to structural join size estimation. Theoretical analyses and extensive experiments have been performed on these estimation methods. It is shown that discrete cosine transform requires the least memory and yields the best estimates among the three techniques. Compared with state-of-the-art method IM-DA-Est, discrete cosine transform is much faster, requires less memory, and yields comparable estimates.