Ontological query answering via rewriting

Authors:
Georg Gottlob;Giorgio Orsi;Andreas Pieris
Affiliations:
Department of Computer Science, University of Oxford, UK;Institute for the Future of Computing, University of Oxford, UK;Department of Computer Science, University of Oxford, UK
Venue:
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Year:
2011

Citing 22
Cited 6

Undecidable optimization problems for database logic programs

Journal of the ACM (JACM)
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive power of stratified logic programs with value invention

Information and Computation
Testing implications of data dependencies

ACM Transactions on Database Systems (TODS)
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
The Implication Problem for Data Dependencies

Proceedings of the 8th Colloquium on Automata, Languages and Programming
An efficient SQL-based RDF querying scheme

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Data exchange: semantics and query answering

Theoretical Computer Science - Database theory
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
The chase revisited

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Datalog vs. first-order logic

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A general datalog-based framework for tractable query answering over ontologies

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting and answering under constraints in data integration systems

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Tractable Query Answering over Conceptual Schemata

ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
The DL-lite family and relations

Journal of Artificial Intelligence Research
Query answering under non-guarded rules in datalog+/-

RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Advanced processing for ontological queries

Proceedings of the VLDB Endowment
Query answering under expressive entity-relationship schemata

ER'10 Proceedings of the 29th international conference on Conceptual modeling
On rules with existential variables: Walking the decidability line

Artificial Intelligence
Ontological queries: Rewriting and optimization

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
OWLIM: A family of scalable semantic repositories

Semantic Web

A general Datalog-based framework for tractable query answering over ontologies

Web Semantics: Science, Services and Agents on the World Wide Web
A broad class of first-order rewritable tuple-generating dependencies

Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Query patterns for existential rules

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Synthesis of the canonical models for database integration preserving semantics of the value inventive data models

ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Effective support of databases with ontological dependencies: Relational languages instead of description logics

Programming and Computing Software
Datalog-based framework for efficient query answering over fuzzy ontologies

International Journal of Metadata, Semantics and Ontologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ontological databases extend traditional databases with ontological constraints. This technology is crucial for many applications such as semantic data publishing and integration as well as model-driven database design. For many classes of ontological constraints, query answering can be solved via query rewriting. In particular, given a conjunctive query and a set of ontological constraints, the query is compiled into a first-order query, called the perfect rewriting, that encodes the intensional knowledge implied by the constraints. Then, for every database D, the answer is obtained by directly evaluating the perfect rewriting over D. Since first-order queries can be easily translated into SQL, ontological query answering can be delegated to traditional DBMSs. This allows us to utilize all the query optimization techniques available in the underlying DBMS. This paper surveys current approaches to rewriting-based query answering of ontological databases.