Sciweavers

11 search results - page 1 / 3
» CR-precis: A Deterministic Summary Structure for Update Data...
Sort
View
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
13 years 10 months ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
Sumit Ganguly, Anirban Majumder
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
13 years 10 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
STACS
2007
Springer
13 years 10 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
TKDE
2008
155views more  TKDE 2008»
13 years 4 months ago
Incremental Maintenance of Online Summaries Over Multiple Streams
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
Fatih Altiparmak, Ertem Tuncel, Hakan Ferhatosmano...
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 4 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...