Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Estimating simple functions on the union of data streams
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
An Information Statistics Approach to Data Stream and Communication Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Finding Frequent Items in Data Streams
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Optimal space lower bounds for all frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal approximations of the frequency moments of data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Space efficient mining of multigraph streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Estimating entropy over data streams
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Estimating Hybrid Frequency Moments of Data Streams
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Hi-index | 0.00 |
We consider the problem of estimating the hybrid frequency moment of matrix data that is updated point-wise in arbitrary order by a data stream. In this model, data is viewed to be organized in the form of a matrix (A i ,j )1 ≤ i ,j , ≤ n . The entries A i ,j are updated coordinate-wise (both increments and decrements are allowed), in arbitrary order and possibly multiple times. The hybrid frequency moment F p ,q (A ) is defined as $\sum_{j=1}^n\left( \sum_{i=1}^n \lvert{A_{i,j}}\rvert^p\right)^q$ and is a generalization of the frequency moment of one-dimensional data streams. Prior work [10] presented a nearly space-optimal algorithm for estimating F p ,q for p *** [0,2] and q *** [0,1]. Here, we complement that work by presenting a nearly space-optimal algorithm for estimating F p ,q for p *** [0,1] and q *** [0,2].