Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Finding Frequent Items in Data Streams
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Frequency Estimation of Internet Packet Streams with Limited Space
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simple algorithm for finding frequent elements in streams and bags
ACM Transactions on Database Systems (TODS)
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How to summarize the universe: dynamic maintenance of quantiles
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
CR-PRECIS: a deterministic summary structure for update data streams
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Deterministically Estimating Data Stream Frequencies
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Mining discriminative items in multiple data streams
World Wide Web
Distributing frequency-dependent data stream computations
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
| Hi-index | 0.00 |
We consider a basic problem in the general data streaming model, namely, to estimate a vector f ∈ Zn that is arbitrarily updated (i.e., incremented or decremented) coordinate-wise. The estimate f ∈ Zn must satisfy ∥ f - f∥∞ ≤ ∈∥f∥1, that is, ∀i (|fi - fi| ≤ ∈∥f∥1). It is known to have Õ(∈-1) randomized space upper bound [6], Ω(∈-1 log(∈n)) space lower bound [4] and deterministic space upper bound of Ω(∈-2) bits. We show that any deterministic algorithm for this problem requires space Ω(∈-2(log∥f∥1)(log n)(log-1(∈-1)) bits.