Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tracking Changes in RDF(S) Repositories
EKAW '02 Proceedings of the 13th International Conference on Knowledge Engineering and Knowledge Management. Ontologies and the Semantic Web
Data Integration under Integrity Constraints
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Preserving mapping consistency under schema changes
The VLDB Journal — The International Journal on Very Large Data Bases
Temporal and versioning model for schema evolution in object-oriented databases
Data & Knowledge Engineering
Designing information-preserving mapping schemes for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Semantic adaptation of schema mappings when schemas evolve
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Query reformulation with constraints
ACM SIGMOD Record
Schema Repository for Database Schema Evolution
DEXA '06 Proceedings of the 17th International Conference on Database and Expert Systems Applications
IEEE Transactions on Knowledge and Data Engineering
Preserving XML queries during schema evolution
Proceedings of the 16th international conference on World Wide Web
Quasi-inverses of schema mappings
ACM Transactions on Database Systems (TODS)
The recovery of a schema mapping: bringing exchanged data back
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ontology change: Classification and survey
The Knowledge Engineering Review
On Graph Features of Semantic Web Schemas
IEEE Transactions on Knowledge and Data Engineering
Analyzing the Evolution of Life Science Ontologies and Mappings
DILS '08 Proceedings of the 5th international workshop on Data Integration in the Life Sciences
Graceful database schema evolution: the PRISM workbench
Proceedings of the VLDB Endowment
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
The PRISM Workwench: Database Schema Evolution without Tears
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
A Formal Approach for RDF/S Ontology Evolution
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
Approximate Rewriting of Queries Using Views
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
On Detecting High-Level Changes in RDF/S KBs
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Ontology and Schema Evolution in Data Integration: Review and Assessment
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
Modeling and querying provenance by extending CIDOC CRM
Distributed and Parallel Databases
Proceedings of the 13th International Conference on Extending Database Technology
Web Semantics: Science, Services and Agents on the World Wide Web
On the foundations of computing deltas between RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Journal on data semantics X
Scalable architecture and query optimization fortransaction-time DBs with evolving schemas
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Evolution of DL-lite knowledge bases
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Exelixis: evolving ontology-based data integration system
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Ontology evolution in data integration: query rewriting to the rescue
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Containment and minimization of RDF/S query patterns
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
A framework for ontology evolution in collaborative environments
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Hi-index | 0.00 |
The evolution of ontologies is an undisputed necessity in ontology-based data integration. Yet, few research efforts have focused on addressing the need to reflect the evolution of ontologies used as global schemata onto the underlying data integration systems. In most of these approaches, when ontologies change their relations with the data sources, i.e., the mappings, are recreated manually, a process which is known to be error-prone and time-consuming. In this paper, we provide a solution that allows query answering in data integration systems under evolving ontologies without mapping redefinition. This is achieved by rewriting queries among ontology versions and then forwarding them to the underlying data integration systems to be answered. To this purpose, initially, we automatically detect and describe the changes among ontology versions using a high level language of changes. Those changes are interpreted as sound global-as-view (GAV) mappings, and they are used in order to produce equivalent rewritings among ontology versions. Whenever equivalent rewritings cannot be produced we a) guide query redefinition or b) provide the best ''over-approximations'', i.e., the minimally-containing and minimally-generalized rewritings. We prove that our approach imposes only a small overhead over traditional query rewriting algorithms and it is modular and scalable. Finally, we show that it can greatly reduce human effort spent since continuous mapping redefinition is no longer necessary.