110 search results - page 12 / 22 » Estimating Entropy over Data Streams |
PVLDB
2008
13 years 7 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
RTSS
2006
IEEE
14 years 1 months ago
2006
IEEE
With the emergence of large wired and wireless sensor networks, many real-time applications need to operate on continuous unbounded data streams. At the same time, many of these s...
SIAMCOMP
2012
11 years 10 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...