Technical Report Computer Science Department, Stanford University, 2004.

abstract bibtex

abstract bibtex

As Peer-to-Peer (P2P) networks become popular, there is an emerging need to collect a variety of statistical summary information about the participating nodes. The P2P networks of today lack mechanisms to compute even such basic aggregates as MIN, MAX, SUM, COUNT or AVG. In this paper, we define and study the NODEAGGREGATION problem that is concerned with aggregating data stored at nodes in the network. We present generic schemes that can be used to compute any of the basic aggregation functions accurately and robustly. Our schemes can be used as building blocks for tools to collect statistics on network topology, user behavior and other node characteristics.

@techreport{bawa_estimating_2004, title = {Estimating {Aggregates} on a {Peer}-to-{Peer} {Network}}, abstract = {As Peer-to-Peer (P2P) networks become popular, there is an emerging need to collect a variety of statistical summary information about the participating nodes. The P2P networks of today lack mechanisms to compute even such basic aggregates as MIN, MAX, SUM, COUNT or AVG. In this paper, we define and study the NODEAGGREGATION problem that is concerned with aggregating data stored at nodes in the network. We present generic schemes that can be used to compute any of the basic aggregation functions accurately and robustly. Our schemes can be used as building blocks for tools to collect statistics on network topology, user behavior and other node characteristics.}, institution = {Computer Science Department, Stanford University}, author = {Bawa, Mayank and Garcia-Molina, Hector and Gionis, Aristides and Motwani, Rajeev}, year = {2004}, pages = {1--13} }

Downloads: 0