Building Database Coordination in p2p Systems Using Eca Rules

Recently, data integration systems and peer database management systems that attempt to model and integrate data in a peer-to-peer (p2p) environment have attracted the attention of researchers. Such systems give opportunities to the local relational database management system to exchange data with other nodes in a p2p environment. The databases systems in p2p are completely autonomous, heterogeneous and independent, each maintaining its own data. We would like to use these databases to answer complex queries that go beyond the keyword searches. To accomplish this, we use database coordination as managing semantic interdependencies among databases at runtime. We define database coordination in four basic notions: Interest Group, Acquaintances, Correspondence Rules and Coordination Rules. The work below is concentrated on implementation issues of the coordination rules. The coordination rules specify under what conditions, when and where to propagate queries in a decentralized environment. We are representing our current solution of the coordination rules implementation for data exchange in p2p based on ECA rules technology.