The Bag Semantics of Ontology-Based Data Access
Lists
Only you see this
Abstract
Ontology-based data access (OBDA) is a popular approach for integrating and querying multiple data sources by means of a shared ontology. The ontology is linked to the sources using mappings, which assign views over the data to ontology predicates. Motivated by the need for OBDA systems supporting database-style aggregate queries, we propose a bag semantics for OBDA, where duplicate tuples in the views defined by the mappings are retained, as is the case in standard databases. We show that bag semantics makes conjunctive query answering in OBDA coNP-hard in data complexity. To regain tractability, we consider a rather general class of queries and show its rewritability to a generalisation of the relational calculus to bags.
BibTeX
@inproceedings{nikolaou2017bag,
author = {Charalampos Nikolaou and Egor V. Kostylev and George Konstantinidis and Mark Kaminski and Bernardo Cuenca Grau and Ian Horrocks},
title = {{The Bag Semantics of Ontology-Based Data Access}},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
doi = {10.24963/ijcai.2017/170},
}| Bagging the DL-Lite Family Further | Description Logics · 2019 |
| Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP | arXiv · 2013 |
| Answering Counting Aggregate Queries over Ontologies of the DL-Lite Family | AAAI · 2013 |
| Combined FO Rewritability for Conjunctive Query Answering in DL-Lite | Description Logics · 2009 |
| Ontology-Based Access to Probabilistic Data | Iswc · 2012 |
| The Combined Approach to OBDA: Taming Role Hierarchies using Filters | Ssws+hpcsw@iswc · 2012 |