Paper:
Language: English:

Efficient Processing of XML Tree Pattern Queries

Yangjun Chen^* and Dunren Che^**

^*Department of Applied Computer Science, University of Winnipeg, 515 Portage Avenue, Winnipeg, Manitoba R3B 2E9, Canada
^**Department of Computer Science, Southern Illinois University, Carbondale, IL 62901, USA

Received: October 28, 2005

Accepted: March 17, 2006

Keywords: XML documents, tree pattern queries, Xpath expressions, query evaluation

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.10, No.5 pp. 738-743, 2006

Abstract

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²) time, where n is the number of nodes in a TPQ.

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here: