Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Rewriting queries using views in description logics
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Answering queries using views: A KRDB perspective for the semantic Web
ACM Transactions on Internet Technology (TOIT)
Bootstrapping pay-as-you-go data integration systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
| Hi-index | 0.00 |
This paper deals with the problem of automatic generation of mappings between data sources schemas, by exploiting existing centralized mappings between sources schemas and a global ontology. We formalize this problem in the settings of description logics and we show that it can be reduced to a problem of rewriting queries using views. We identify two subproblems: the first one is equivalent to a well known problem of computing maximally contained rewritings while the second problem constitutes a new instance of the query rewriting problem in which the goal is to compute minimal rewritings that contain a given query. We distinguish two cases to solve this latter problem: (i) for languages closed under negation, the problem is reduced to the classic problem of rewriting queries using views, and (ii) for languages with the property of structural subsumption, a technique based on hypergraphs is proposed to solve it.