Issue No. 07 - July (2007 vol. 19)
Benjamin Arai , IEEE
Dimitrios Gunopulos , IEEE
Vana Kalogeraki , IEEE
Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of P2P databases. In this paper, we present novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer, the data is often highly correlated, and, moreover, even collecting a random sample of the peers is difficult to accomplish. To counter these problems, we have developed an adaptive two-phase sampling approach based on random walks of the P2P graph, as well as block-level sampling techniques. We present extensive experimental evaluations to demonstrate the feasibility of our proposed solution.
Approximation methods, computer networks, distributed databases, distributed database query processing, distributed estimation, database systems, distributed systems.
G. Das, D. Gunopulos, B. Arai and V. Kalogeraki, "Efficient Approximate Query Processing in Peer-to-Peer Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 19, no. , pp. 919-933, 2007.