An efficient algorithm for tree pattern query minimization under broad integrity constraints

Abstract

Purpose – Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are present and considered. Apparently, tree pattern minimization has great significance for efficient XML query processing. Although various minimization schemes/algorithms have been proposed, none of them can exploit broad ICs for thoroughly minimizing the tree patterns in XML queries. The purpose of this research is to develop an innovative minimization scheme and provide a novel implementation algorithm.Design/methodology/approach – Query augmentation/expansion was taken as a necessary first‐step by most prior approaches to acquire XML query pattern minimization under the presence of certain ICs. The adopted augmentation/expansion is also the course for the typical O(n4) time‐complexity of the proposed algorithms. This paper presents an innovative approach called allying to effectively circumvent the otherwise necessary augmentation st...