Sciweavers

263 search results - page 2 / 53
» Efficient gossip-based aggregate computation
Sort
View
ICNP
1999
IEEE
13 years 10 months ago
An In-Depth Look at Flow Aggregation for Efficient Quality of Service
We investigate the preservation of quality of service guarantees to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent...
Jorge Arturo Cobb
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
14 years 6 months ago
Efficient computation of personal aggregate queries on blogs
There is an exploding amount of user-generated content on the Web due to the emergence of "Web 2.0" services, such as Blogger, MySpace, Flickr, and del.icio.us. The part...
Ka Cheung Sia, Junghoo Cho, Yun Chi, Belle L. Tsen...
PODS
2001
ACM
116views Database» more  PODS 2001»
14 years 5 months ago
Efficient Computation of Temporal Aggregates with Range Predicates
Donghui Zhang, Alexander Markowetz, Vassilis J. Ts...
PODS
2006
ACM
96views Database» more  PODS 2006»
14 years 5 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
ICDE
2008
IEEE
188views Database» more  ICDE 2008»
14 years 7 months ago
Efficient Aggregate Computation over Data Streams
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...
Kanthi Nagaraj, K. V. M. Naidu, Rajeev Rastogi, Sc...