XML Path Algorithm for Matching XML Elements with Different Queries

The vital operation in XML query is searching for the elements of a tree pattern query in XML database. Earlier work shows that holistic rooted labeled tree pattern matching algorithm is an efficient technique to answer an XML tree pattern with Parent-Child (P-C) and Ancestor-Descendant (A-D) relationships, as it can effectively control the size of midway results during query processing. On the other side, XML query languages (e.g., XPath and Xquery) define more axes and functions such as negation function, order-based axis and wildcards.

Provided by: The International Journal of Innovative Research in Computer and Communication Engineering Topic: Data Management Date Added: Mar 2013 Format: PDF

Find By Topic