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
Mediators over Ontology-Based Information Sources
WISE '01 Proceedings of the Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1 - Volume 1
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Efficient query reformulation in peer data management systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Composing schema mappings: second-order dependencies to the rescue
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Peer architectures for knowledge sharing
Peer architectures for knowledge sharing
Composing mappings among data sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.00 |
The problem of sharing data in peer-to-peer environment has received considerable attention in recent years. However, knowledge sharing in peer architectures has received very little attention. This paper proposes a framework for query reformulation in peer architectures. We first consider a mapping language based on a particular description logic that includes class connectors. Then a set of rules are proposed for building graphs. Because the axioms in a knowledge base have different properties, our graph generation algorithm classifies the generated graphs into four sets (Ugraph, Bgraph, Cgraph and Dgraph). Furthermore, based on the properties of the unification nodes, our algorithms can reformulate each kind of atom in a special way. Finally we do extensive simulation experiments and simulation results show that the proposed method has better performance than those of Mork's [8].