Sciweavers

Share
WIDM
2003
ACM

Query rewriting using views in the presence of inclusion dependencies

9 years 5 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the MiniCon algorithm, have been proposed to address this issue. These algorithms can be divided into two categories: bucket-based algorithms and inverse rule-based algorithms. Some inverse rule-based algorithms have considered the problem of query rewriting in the presence of inclusion dependencies. However, there has been no bucket-base algorithm so far for the problem. All the previous bucket-based algorithms may miss query rewritings in the presence of inclusion dependencies. In this paper, we extend the MiniCon algorithm to the presence of inclusion dependencies. In the MiniCon algorithm, a view can be used in a non-redundant rewriting of a query only if at least one subgoal in the query is covered by a subgoal in the view. In the presence of inclusion dependencies, when no subgoal in a view directly covers t...
Qingyuan Bai, Jun Hong, Michael F. McTear
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where WIDM
Authors Qingyuan Bai, Jun Hong, Michael F. McTear
Comments (0)
books