Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Constraint-based XML query rewriting for data integration
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient query reformulation in peer data management systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Declarative programming of integrated peer-to-peer and Web based systems: the case of Prolog
Journal of Systems and Software
Peer-to-peer semantic coordination
Web Semantics: Science, Services and Agents on the World Wide Web
Management of executable schema mappings for XML data exchange
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
We discuss the problem of semantic data integration in a highly-dynamic environment consisting of a community of peer-to-peer cooperating agents (partners). Peers decide when to join and when to leave the system, how to describe their local data, when to communicate and share their resources with partners. An agent issues queries to its partners (friends) which are able partly answer the query and then propagate the query to their partners along semantic paths existing in the system. Semantic paths are determined by schema mappings defined between partners. We propose a method for specifying schema mappings and to translate them to XQuery expressions. Mappings are represented by means of logical formulas. We also propose a declarative specification of semantic-driven communication in the system. The specification is made in a peer-oriented extension of Prolog.