Author:
Chen Yangjun, ,Che Dunren,
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.
Publisher
Fuji Technology Press Ltd.
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Human-Computer Interaction
Reference23 articles.
1. J. McHugh and J. Widom, “Query Optimization for XML,” Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999.
2. W. Fan and J. Simeon, “Integrity Constraints for XML,” Proceedings of ACM PODS Conference, pp. 23-34, 2000.
3. S. Amer-Yahia et al., “Minimization of Tree Pattern Queries,” Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 497-508, 2001.
4. S. Chakravathy, J. Grant, and J. Minker, “Foundations of Semantic Query Optimization for Deductive Databases,” Foundations of DD and LP, 1988.
5. D. Florescu, A. Levy, and D. Suciu, “Query Containment for Conjunctive Queries with Regular Expressions,” Proceedings of the 17th ACM Symp., Principles of Database Systems, pp. 139-148, 1998.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献