Conference Paper

Approximating Aggregation Queries in Peer-to-Peer Networks

UC Riverside
DOI: 10.1109/ICDE.2006.23 Conference: Data Engineering, 2006. ICDE '06. Proceedings of the 22nd International Conference on
Source: DBLP

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

Full-text

Available from: Benjamin Arai, Nov 19, 2014
0 Followers
 · 
116 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents CoQUOS a scalable and lightweight middleware to support continuous queries in unstructured P2P networks. A key strength of the CoQUOS system is that it can be implemented on any unstructured overlay network. Moreover,CoQUOS preserves the simplicity and flexibility of the overlaynetwork.The CoQUOS middleware is a completely decentralized scheme to register a query at different regions of the P2P network. This mechanism includes two novel components, namely cluster resilient random walk and dynamic probability-basedquery registration technique The loosely-coupled and highly dynamic nature of underlying P2P network poses several additional challenges. This paper focuses on the issues that are of particular importance to the performance of the CoQUOS system, namely Churn of the P2P overlay and Load distribution among peers.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents CoQUOS a scalable and lightweight middleware to support continuous queries in unstructured P2P networks. A key strength of this Technique is that it can be implemented on any unstructured overlay network. It preserves the simplicity and flexibility of the overlay network. It is a completely decentralized scheme to register a query at different regions of the P2P network. It includes two novel components, namely cluster resilient random walk and dynamic probability-basedquery registration technique The loosely-coupled and highly dynamic nature of underlying P2P network. This paper focuses on the issues that are of particular importance to the performance of the CoQUOS system, namely Churn of the P2P overlay and Load distribution among peers.
  • Source