The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2006)
Atlanta, Georgia
Apr. 3, 2006 to Apr. 7, 2006
ISBN: 0-7695-2570-9
pp: 42
Gautam Das , UT Arlington
Vana Kalogeraki , UC Riverside
Dimitrios Gunopulos , UC Riverside
Benjamin Arai , UC Riverside
ABSTRACT
Peer-to-peer 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 ― e.g., 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 peer-to-peer 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 solutio
INDEX TERMS
null
CITATION
Gautam Das, Vana Kalogeraki, Dimitrios Gunopulos, Benjamin Arai, "Approximating Aggregation Queries in Peer-to-Peer Networks", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 42, 2006, doi:10.1109/ICDE.2006.23
51 ms
(Ver )