Query Containment Checking as a View Updating Problem
نویسندگان
چکیده
In this paper we present a new approach that handles query containment problems by expressing them as a view updating problem. Since this approach is independent of any particular view updating method, it provides a general framework that joins research efforts in both the query containment checking and view updating fields. In particular, the larger development of current view updating technology allows us to check properly query containment when considering negative-derived literals or integrity constraints. Existing methods for query containment checking that deal with these cases do not check actually containment but another related property called uniform containment, which is a sufficient but not necessary condition for containment. Therefore, an important outcome of our proposal is that, to the best of our knowledge, it is the first approach that checks “true” query containment instead of uniform query containment in the presence of negation and integrity constraints.
منابع مشابه
Scalable template-based query containment checking for web semantic caches
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data on edge servers. Such caches require fast query containment tests to determine if a new query is contained in the results of cached queries. Query containment checking algorithms have been studied in the context of qu...
متن کاملConjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and Integration, Data Warehousing, and Web Information Systems. Access limitations force certain attributes to be selected in order to access the tables. It is known that evaluating a conjunctive query under such access r...
متن کاملConjunctive Query Containment in the Presence of Disjunctive Integrity Constraints (extended Abstract)
This paper considers the problem of containment of conjunctive queries (CQ) with disjunctive integrity constraints. Query containment problem in the presence of integrity constraints has been studied broadly, especially with functional and inclusion dependencies. However, to handle incomplete information in the database, disjunctions are needed to be expressed as integrity constraints. In this ...
متن کاملThe Constructive Method for Query Containment Checking ( extended version )
We present a new method that checks Query Containment for queries with negated derived atoms and/or integrity constraints. Existing methods for Query Containment checking that deal with these cases do not check actually containment but another related property called uniform containment, which is a sufficient but not necessary condition for containment. Our method can be seen as an extension of...
متن کاملDeciding Containment for Queries with Complex Objects and Aggregations
We address the problem of query containment and query equivalence for complex objects. We show that for a certain conjunctive query language for complex objects, query containment and weak query equivalence are decidable. Our results have two consequences. First, when the answers of the two queries are guaranteed not to contain empty sets, then weak equivalence coincides with equivalence, and o...
متن کامل