Sciweavers

33 search results - page 7 / 7
» Approximating Aggregation Queries in Peer-to-Peer Networks
Sort
View
SPAA
2006
ACM
15 years 5 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
PVLDB
2008
116views more  PVLDB 2008»
14 years 11 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 19 days ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe