Affiliation:
1. Aleph One LLC
2. INRIA, ENS-Cachan, CACHAN Cedex, France
3. University of California San Diego, La Jolla, CA
Abstract
We investigate the question of whether a query
Q
can be answered using a set
V
of views. We first define the problem in information-theoretic terms: we say that
V
determines
Q
if
V
provides enough information to uniquely determine the answer to
Q
. Next, we look at the problem of rewriting
Q
in terms of
V
using a specific language. Given a view language
V
and query language
Q
, we say that a rewriting language
R
is complete for
V
-to-
Q
rewritings if every
Q
∈
Q
can be rewritten in terms of
V
∈
V
using a query in
R
, whenever
V
determines
Q
. While query rewriting using views has been extensively investigated for some specific languages, the connection to the information-theoretic notion of determinacy, and the question of completeness of a rewriting language have received little attention. In this article we investigate systematically the notion of determinacy and its connection to rewriting. The results concern decidability of determinacy for various view and query languages, as well as the power required of complete rewriting languages. We consider languages ranging from first-order to conjunctive queries.
Funder
Division of Information and Intelligent Systems
Publisher
Association for Computing Machinery (ACM)
Reference35 articles.
1. Complexity of answering queries using materialized views
2. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley.
3. Update semantics of relational views
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A review of data abstraction;Frontiers in Artificial Intelligence;2023-06-23
2. Synthesizing Nested Relational Queries from Implicit Specifications;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18
3. On Monotonic Determinacy and Rewritability for Recursive Queries and Views;ACM Transactions on Computational Logic;2023-03-17
4. Range-Restricted and Horn Interpolation through Clausal Tableaux;Lecture Notes in Computer Science;2023
5. When Can We Answer Queries Using Result-Bounded Data Interfaces?;Logical Methods in Computer Science;2022-06-02