Computability and logic
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
A shorter model theory
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth 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
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Deductive Object Oriented Schemas
ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Extremal Graph Theory
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Determinacy and rewriting of conjunctive queries using views: a progress report
ICDT'07 Proceedings of the 11th international conference on Database Theory
Applications of description logics: state of the art and research challenges
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
| Hi-index | 0.00 |
We study the problem of deciding the satisfiability of first-order logic queries over views, with our aim to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database research due to their role in applications such as information integration and data warehousing. Our main result is the identification of a decidable class of first-order queries over unary conjunctive views that generalizes the decidability of the classical class of first-order sentences over unary relations known as the Löwenheim class. We then demonstrate how various extensions of this class lead to undecidability and also provide some expressivity results. Besides its theoretical interest, our new decidable class is potentially interesting for use in applications such as deciding implication of complex dependencies, analysis of a restricted class of active database rules, and ontology reasoning.