Bucket-Based Query Rewriting with Disjunctive Data Source

Authors:
Qingyuan Bai;Jun Hong;Michael F. McTear;Hui Wang
Affiliations:
University of Ulster, UK;Queen's University of Belfast, UK;University of Ulster, UK;University of Ulster, UK
Venue:
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Year:
2004

Citing 6
Cited 0

On conjunctive queries containing inequalities

Journal of the ACM (JACM)
An algorithm for answering queries efficiently using views

ADC '01 Proceedings of the 12th Australasian database conference
Rewriting Queries Using Views

IEEE Transactions on Knowledge and Data Engineering
A Scalable Algorithm for Answering Queries Using Views

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Querying Heterogeneous Information Sources Using Source Descriptions

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A logic-based approach to data integration

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many algorithms for query rewriting using views have been proposed.Most of them are used for rewriting conjunctive queries with conjunctive views only.Only one inverse rule-based rewriting algorithm has been presented to deal with query rewriting with disjunctive views, in which a set of disjunctive inverse rules are created and used to generate the query rewritings.However, there has no been bucket-based algorithm for this issue.In this paper we apply the ideas of the previous bucket-based algorithms to deal with query rewriting using views in the presence of disjunctions in view definitions.We create a set of buckets over either a conjunctive view or a disjunctive view.Specially, when a bucket is over a disjunctive view, we present a method to remove the tuples that are in the view but not required by a given query.The rewritings obtained by our algorithm are contained in the original query.