期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2013
卷号：1
期号：1
出版社：S&S Publications
摘要：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 anXML tree pattern with parent-child (P-C) and ancestor-descendant (A-D) relationships, as it can effectively control thesize 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. The previous research alarge set of XML tree pattern, that contains P-C, A-D relations, negation functions, wildcards, and/or expressions, orderrestrictions and all other axes that are defined in the xpath and xquery languages. XML Path algorithm is the algorithmproposed theoretically. This method is predicted to increase the algorithmic efficiency and to speed up the query. Thismethod avoids generating large midway results which do not contribute to the final outcome. This technique reducesboth input I/O cost and redundant midway result sizes and achieve good performance.
