Efficient Processing of XML Tree Pattern Queries Paper: jc10-5-2585; 2006/5/11 Efficient Processing of XML Tree Pattern Queries

In this paper, we present a polynomial-time algorithm for TPQ (tree pattern queries) minimization without XML constraints involved. The main idea of the algorithm is a dynamic programming strategy to find all the matching subtrees within a TPQ. A matching subtree implies a redundancy and should be removed in such a way that the semantics of the original TPQ is not damaged. Our algorithm consists of two parts: one for subtree recognization and the other for subtree deletion. Both of them needs only O(n 2) time, where n is the number of nodes in a TPQ