43 search results - page 2 / 9 » Estimating Frequency Moments of Data Streams Using Random Li... |
SIAMCOMP
2012
11 years 8 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
IM
2006
13 years 5 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...