期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2012
卷号：3
期号：5
页码：5210-5211
出版社：TechScience Publications
摘要：In most of the pattern matching algorithms finding all the distinct matching’s of the query tree pattern is the core operation of xml query evaluation. The existing algorithms for tree pattern matching may produce large useless intermediate results using some different notations such as wild cards, negation function, and/or order restrictions for which query processing gets bit complicated. We propose a TREEMATCH algorithm to achieve a large optimal query class using which leads to the reduction of useless intermediate results
