Efficient Approximate Processing of Queries in P2P Networks

Peer-to-peer (P2P) databases are most probably used nowadays on the Internet for distributing and sharing documents, applications, and other organizational data. Finding the answers to large-scale ad hoc queries as aggregation queries on databases often gives rise to different challenges. Finding the exact solutions consumes a large amount of time and also is difficult to implement since P2P databases are often dynamic and distributed. In this paper, an approach for approximately answering ad hoc queries in dynamic and distributed databases is presented. Generally, the data is distributed across different peers in a distributed environment, and majority of the times, within each peer, the data is correlated up to a large extent. This fact is taken use of and an approach for processing queries in such environment is described in this work. Also, the results of the work are presented thereafter.