International Journal of Engineering Research and Development (IJERD)
In the present day digital world, it is imperative that all organizations and enterprises facilitate efficient processing of queries on XML data. XML queries typically specify patterns of selection predicates on multiple elements that have specified tree structured relationships. The primitive tree-structured relationships are parent-child and ancestor-descendant. Finding all occurrences of these relationships in an XML database is a core operation for XML query processing. In this paper the pattern matching algorithms TwigStack and TwigStackList are discussed. The behavior of TwigStack is analyzed, and a comparison of these two algorithms is attempted.