Peer Ranking in P2P Integration System on Inconsistent Data Sources

A query processor of an integration system of P2P should be able to deal with inconsistencies emerging while responding to a query. One way to deal with inconsistency of integration systems of P2P is to express the system’s semantics through Intensional logic in which each peer is considered to be as an entirely independent entity, results of which cannot cause inconsistency in another peer. Mapping semantics between peers creates a connection structure whereby each peer’s credit can be calculated based on the others. In this study, we have employed a crediting method to peers within the network using this connection structure of peers to one another so that the tuples of answers for a query can be credited. In order to calculate this credit, the proposed idea on Page Rank algorithm was used. Each peer’s calculated credit is the probability for tuple to be a valid response for the query.