A Glance on Current XML Twig Pattern Matching Algorithms

  • Authors:

  • Duy-Bo Dao;Jinli Cao

  • Affiliations:

  • Binh Dinh Teacher Training College, Binh Dinh, Vietnam;La Trobe University, Bundoora, Australia Vic 3083

  • Venue:
  • ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Extensible Markup Language (XML) has become a de facto standard for information representation and exchange over the Internet. The core operation of XML Query Processing is twig pattern matching, that is, finding in an XML document tree Dall matches of a given twig query Q. Modern twig query matching algorithms often first decompose individual path matches and then merge them to form twig matches. In this paper, we review and evaluate two current efficient algorithms, namely HolisticTwigStackand TwigList. The HolisticTwigStackalgorithm, which based on TwigStack, a notable and effective algorithm, uses a stack structure to avoid the storage of intermediate matches and the process of merging matches, whereas the TwigListalgorithm use simple lists. Our analysis on experimental results show that the advantages and disadvantages of both HolisticTwigStackand TwigListfor efficient XML Twig Pattern Matching in term of processing time and memory usage.