Efficiency of TreeMatch Algorithm in XML Tree Pattern Matching
M Muthukumaran · IOSR Journal of Computer Engineering · 2012
In Recent days exchange XML data more often in organizations and business sectors, so there is an increasing need for effective and efficient processing of queries on XML data.This paper presents a wide analysis to identify the efficiency of XML tree pattern matching algorithms.Previous years many methods have been proposed to match XML tree queries efficiently.In particularly TwigStack, OrderedTJ, TJFast and TreeMatch algorithms.All algorithms to achieve something through these own ways like structural relationship including Parent -Child (P-C) relationship (denoted as '/') and Ancestor-Descendent (A-D) relationships (denoted as '//') and more.Finally, we report our results to show that which algorithm is superior to previous approaches in terms of the performance.