Sciweavers

33 search results - page 6 / 7
» Approximating Aggregation Queries in Peer-to-Peer Networks
Sort
View
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 5 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 5 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
IPSN
2007
Springer
13 years 11 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
14 years 5 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 6 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura