%0 Conference Paper %1 lenzerini2014reducing %A Lenzerini, Maurizio %A Console, Marco %B ECAI 2014 - 21st European Conference on Artificial Intelligence %D 2014 %K Consistency OBDA optique-project %P 219-224 %R 10.3233/978-1-61499-419-0-219 %T Reducing global consistency to local consistency in Ontology-based Data Access. %X Ontology-based data access (OBDA) is a new paradigm aiming at accessing and managing data by means of an ontology, i.e., a conceptual representation of the domain of interest in the underlying information system. In the last years, this new paradigm has been used for providing users with suitable mechanisms for querying the data residing at the information system sources. Most of the research has been concentrating on making query answering efficient. Howeverquery answering is not the only service that an OBDA system must provide. Another crucial service is consistency checking. Current approaches to this problem involves executing expensive queries at run-time. In this paper we address a fundamental problem for OBDA system: given an OBDA specification, can we avoid the consistency check on the whole OBDA system (global consistency check), and rely instead on the constraint checking carried out by the DBMS on the data source (local consistency checking)? We present algorithms and complexity analysis for this problem, showing that it can be solved efficiently for a class of OBDA systems that is very relevant in practice.

@inproceedings{lenzerini2014reducing, abstract = {Ontology-based data access (OBDA) is a new paradigm aiming at accessing and managing data by means of an ontology, i.e., a conceptual representation of the domain of interest in the underlying information system. In the last years, this new paradigm has been used for providing users with suitable mechanisms for querying the data residing at the information system sources. Most of the research has been concentrating on making query answering efficient. Howeverquery answering is not the only service that an OBDA system must provide. Another crucial service is consistency checking. Current approaches to this problem involves executing expensive queries at run-time. In this paper we address a fundamental problem for OBDA system: given an OBDA specification, can we avoid the consistency check on the whole OBDA system (global consistency check), and rely instead on the constraint checking carried out by the DBMS on the data source (local consistency checking)? We present algorithms and complexity analysis for this problem, showing that it can be solved efficiently for a class of OBDA systems that is very relevant in practice.}, added-at = {2014-10-15T15:01:49.000+0200}, audience = {academic}, author = {Lenzerini, Maurizio and Console, Marco}, biburl = {https://www.bibsonomy.org/bibtex/2e869d6828db91ec84d367441c91639ac/savo.fabio}, booktitle = {ECAI 2014 - 21st European Conference on Artificial Intelligence}, doi = {10.3233/978-1-61499-419-0-219}, interhash = {b0bb0b286ba36a41673ddb625e82d31a}, intrahash = {e869d6828db91ec84d367441c91639ac}, keywords = {Consistency OBDA optique-project}, openaccess = {No}, pages = {219-224}, partneroptique = {UNIROMA1}, timestamp = {2016-12-01T19:09:39.000+0100}, title = {Reducing global consistency to local consistency in Ontology-based Data Access.}, wpoptique = {WP4}, year = 2014, yearoptique = {Y2} }