Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Schema and ontology matching with COMA++
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Data sharing in the Hyperion peer database system
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Queue - Semi-structured Data
Ontology-based data source localization in a structured peer-to-peer environment
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
A survey of schema-based matching approaches
Journal on Data Semantics IV
Hi-index | 0.00 |
In a P2P DBS, the databases are often developed independently so their schemas are highly heterogeneous. Creating matching rules (henceforth MR) between a given mediated schema and each peer schema at the design-time is not suitable for a volatile P2P environment; in which, a peer may participate in the system only once. For this reason, the MR must be done at the run-time. Schema designers are often the only persons knowing about the semantics of their schemas. At the run-time, one (or both) schema designer(s) could not be available; hence the user must be able to create the MR to support his/her changing requirements. Given that the semantics of a domain ontology is explicitly explained and in order to help the user to create the MR, we propose a schema matching method based on a domain ontology which plays a similar role as that played by a given mediated schema.