Sciweavers

25 search results - page 3 / 5
» Finding hierarchical heavy hitters in streaming data
Sort
View
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
14 years 7 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
14 years 9 months ago
Exponentially Decayed Aggregates on Data Streams
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...
Graham Cormode, Flip Korn, Srikanta Tirthapura
PODS
2012
ACM
281views Database» more  PODS 2012»
11 years 10 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
TKDE
2010
151views more  TKDE 2010»
13 years 6 months ago
Duplicate-Insensitive Order Statistics Computation over Data Streams
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsur...
IMC
2005
ACM
14 years 1 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang