Efficient processing of XML twig pattern: a novel one-phase holistic solution

  • Authors:
  • Zhewei Jiang;Cheng Luo;Wen-Chi Hou;Qiang Zhu;Dunren Che

  • Affiliations:
  • Computer Science Department, Southern Illinois University Carbondale, Carbondale, IL;Computer Science Department, Southern Illinois University Carbondale, Carbondale, IL;Computer Science Department, Southern Illinois University Carbondale, Carbondale, IL;Department of Computer and Info. Science, University of Michigan Dearborn, MI;Computer Science Department, Southern Illinois University Carbondale, Carbondale, IL

  • 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

Modern twig query evaluation algorithms usually first generate individual path matches and then stitch them together (through a "merge" operation) to form twig matches. In this paper, we propose a one-phase holistic twig evaluation algorithm based on the TwigStack algorithm. The proposed method applies a novel stack structure to preserve the holisticity of the twig matches. Without generating intermediate path matches, our method avoids the storage of individual path matches and the path merge process. Experimental results confirm the advantages of our approach.