Distributed Query Processing in P2P Systems with Incomplete Schema Information.

摘要: The peer-to-peer (P2P) paradigm has emerged recently, mainly by file sharing systems like Napster or Gnutella and in terms of scalable distributed data structures. Because the decentralization P2P promise an improved scalability robustness, they open a new view on integration approaches, too. By exploiting already available mappings between pairs peers peer joining can immediately participate access all after establishing correspondence mapping to at least one other peer. One technical challenges building based is efficient processing queries which complicated locally restricted knowledge about placement schema information. In this paper, we address problem investigating query strategies dealing with incomplete schemas present results our experimental evaluation.