Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query containment for data integration systems
Journal of Computer and System Sciences - Special issue on PODS 2000
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Query rewriting and answering under constraints in data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Views and queries: Determinacy and rewriting
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
In this paper, we study the problem to compute certain answers in case when view definitions are expressed as non-recursive datalog programs with negation and queries are expressed as semi-positive non-recursive datalog programs with negation. Two situations are analyzed: the open world assumption (OWA) and the close world assumption (CWA). Associated to a view, and an extension of the view, a tree is constructed, which is useful to specify a method to compute certain answers.