Polynomial conjunctive query rewriting under unary inclusion dependencies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Ontological query answering via rewriting
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Semantic data markets: a flexible environment for knowledge management
Proceedings of the 20th ACM international conference on Information and knowledge management
DIADEM: domain-centric, intelligent, automated data extraction methodology
Proceedings of the 21st international conference companion on World Wide Web
Getting more RDF support from relational databases
Proceedings of the 21st international conference companion on World Wide Web
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
The combined approach to ontology-based data access
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Exponential lower bounds and separation for query rewriting
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Using data-to-knowledge exchange for transforming relational databases to knowledge bases
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
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
A sound and complete backward chaining algorithm for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Query rewriting under ontology contraction
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Research summary: datalog-based data access
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Programming and Computing Software
Data complexity of query answering in description logics
Artificial Intelligence
Efficient query answering against dynamic RDF databases
Proceedings of the 16th International Conference on Extending Database Technology
Optimizing query rewriting in ontology-based data access
Proceedings of the 16th International Conference on Extending Database Technology
Extending the power of datalog recursion
The VLDB Journal — The International Journal on Very Large Data Bases
Engineering optimisations in query rewriting for OBDA
Proceedings of the 9th International Conference on Semantic Systems
On the exploration of the query rewriting space with existential rules
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Graph queries in a next-generation Datalog system
Proceedings of the VLDB Endowment
Mastro studio: managing ontology-based data access applications
Proceedings of the VLDB Endowment
Temporal description logic for ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
First-order rewritability of atomic queries in horn description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Compact rewritings for existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Sound, complete, and minimal query rewriting for existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Ontology based query answering with existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Query rewriting under query refinements
Knowledge-Based Systems
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Ontological queries are evaluated against an enterprise ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization. Query rewriting consists of the compilation of an ontological query into an equivalent query against the underlying relational database. The focus here is on soundness and completeness. We review previous results and present a new rewriting algorithm for rather general types of ontological constraints (description logics). In particular, we show how a conjunctive query (CQ) against an enterprise ontology can be compiled into a union of conjunctive queries (UCQ) against the underlying database. Ontological query optimization, in this context, attempts to improve this process so to produce possibly small and cost-effective output UCQ. We review existing optimization methods, and propose an effective new method that works for Linear Datalog卤, a description logic that encompasses well-known description logics of the DL-Lite family.