| Query rewriting using views in the presence of inclusion dependencies |
| Full text |
Pdf
(214 KB)
|
| Source
|
Workshop On Web Information And Data Management
archive
Proceedings of the 5th ACM international workshop on Web information and data management
table of contents
New Orleans, Louisiana, USA
SESSION: Query and view processing
table of contents
Pages: 134 - 138
Year of Publication: 2003
ISBN:1-58113-725-7
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 57, Citation Count: 0
|
|
|
ABSTRACT
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 the query subgoal we can apply the chase procedure and rule to the subgoals of the query or view that contains the chase reachable subgoals to get a revised query or view. The condition required by the MiniCon algorithm is then satisfied. We can therefore avoid the problem of missing rewritings with the previous bucket-based algorithms. We prove that our extended algorithm can find the maximally-contained rewriting of a conjunctive query using a set of conjunctive views in the presence of inclusion dependencies. Our extension of the MiniCon algorithm does not involve a significant increase in computational complexity and our new algorithm remains scalable.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
O. M. Duschka, M. R. Genesereth, A. Y. Levy, Recursive Query Plans for Data Integration. Journal of Logic Programming, special issue on Logic Based Heterogeneous Information Systems, 43(1),49--73, 2000.
|
| |
4
|
|
| |
5
|
J. Gryz, An Algorithm for Query Folding with Inclusion Dependencies. Intelligent Information Systems VII Proceedings of the Workshop, Malbork, Poland, June, 1998.
|
| |
6
|
|
| |
7
|
|
| |
8
|
D. S. Johnson, A. Klug, Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. Journal of Computer and System Sciences, 28:167--189 (1984).
|
| |
9
|
|
| |
10
|
|
| |
11
|
A. Y. Levy, A. Rajaraman, J. J. Ordille, Query-Answering Algorithms for Information Agents. In Proceedings of AAAI, 1996.
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
Junhu Wang , Michael Maher , Rodney Topor, Rewriting general conjunctive queries using views, Proceedings of the thirteenth Australasian database conference, p.197-206, January 01, 2002, Melbourne, Victoria, Australia
|
|