DMCA
Minimization of Tree Pattern Queries with Constraints
| Citations: | 7 - 0 self |
BibTeX
@MISC{Chen_minimizationof,
author = {Ding Chen and Chee-yong Chan},
title = {Minimization of Tree Pattern Queries with Constraints},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. Since the size of a TPQ is a key determinant of its evaluation cost, recent research has focused on the problem of query minimization using integrity constraints to eliminate redundant query nodes; specifically, TPQ minimization has been studied for the class of forward and subtype constraints (FT-constraints). In this paper, we explore the TPQ minimization problem further for a richer class of FBST-constraints that includes not only FT-constraints but also backward and sibling constraints. By exploiting the properties of minimal queries under FBST-constraints, we propose efficient algorithms to both compute a single minimal query as well as enumerate all minimal queries. In addition, we also develop more efficient minimization algorithms for the previously studied class of FT-constraints. Our experimental study demonstrates the effectiveness and efficiency of query minimization using FBST-constraints.
Keyphrases
tree pattern query minimal query query minimization recent research integrity constraint easy formalism efficient minimization algorithm experimental study efficient algorithm efficient processing key determinant tpq minimization problem evaluation cost tpq minimization redundant query node tree-structured xml data subtype constraint single minimal query
