Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Data model and query evaluation in global information systems
Journal of Intelligent Information Systems - Special issue: networked information discovery and retrieval
On Datalog vs. polynomial time
Journal of Computer and System Sciences
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unfold/fold transformations for disjunctive logic programs
Information Processing Letters
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
A More Aggressive Use Of Views To Extract Information
A More Aggressive Use Of Views To Extract Information
Query planning and optimization in information integration
Query planning and optimization in information integration
Parallel complexity of logical query programs
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On Answering Queries in the Presence of Limited Access Patterns
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Minimizing View Sets without Losing Query-Answering Power
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Linearly Bounded Reformulations of Unary Databases
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Description Logics for Information Integration
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Linearly Bounded Reformulations of Conjunctive Databases
CL '00 Proceedings of the First International Conference on Computational Logic
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Data Integration Needs Reasoning
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
Approximate Rewriting of Queries Using Views
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
View-based query answering in Description Logics: Semantics and complexity
Journal of Computer and System Sciences
Finding equivalent rewritings in the presence of arithmetic comparisons
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
| Hi-index | 0.00 |
We consider the problem of answering datalog queries using materialized views. More specifically, queries are rewritten to refer to views instead of the base relations over which the queries were originally written. Much work has been done on program rewriting that produces an equivalent query. In the context of information integration, though, the importance of using views to infer as many answers as possible has been pointed out. Formally, the problem is: Given a datalog program P is there a datalog program Pv which uses only views as EDB predicates and (i) produces a subset of the answers that P produces and (ii) any other program P′v over the views with property (i) is contained in Pv? In this paper we investigate the problem in the case of disjunctive view definitions.