Paper:
Language: English:

Minimization of XML Tree Pattern Queries in the Presence of Integrity Constraints

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, integrity constraints

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

Abstract

In this paper, we provide a polynomial-time tree pattern query minimization algorithm whose efficiency stems from two key observations: (i) Inherent redundant "components" usually exist inside the rudimentary query provided by the user. (ii) Irredundant nodes may become redundant when constraints such as co-occurrence and required child/descendant are given. We show the result that the algorithm obtained by first augmenting the input tree pattern using the constraints, and then applying minimization, always finds the unique minimal equivalent to the original query. We complement our analytical results with an experimental study that shows the effectiveness of our tree pattern minimization techniques.

[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: