Two improved range-efficient algorithms for F0 estimation

Authors:
He Sun;Chung Keung Poon
Affiliations:
Department of Computer Science and Engineering, Fudan University, Shanghai, China;Department of Computer Science, City University of Hong Kong, Hong Kong
Venue:
Theoretical Computer Science
Year:
2009

Citing 10
Cited 3

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
Estimating simple functions on the union of data streams

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Reductions in streaming algorithms, with an application to counting triangles in graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Data streams: algorithms and applications

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Counting Distinct Elements in a Data Stream

RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Tracking set-expression cardinalities over continuous update streams

The VLDB Journal — The International Journal on Very Large Data Bases
Range-Efficient Computation of F" over Massive Data Streams

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Comparing data streams using Hamming norms (how to zero in)

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Note: Order statistics and estimating cardinalities of massive data sets

Discrete Applied Mathematics

Near-optimal private approximation protocols via a black box transformation

Proceedings of the forty-third annual ACM symposium on Theory of computing
Rectangle-efficient aggregation in spatial data streams

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present two new algorithms for the range-efficient F"0 estimating problem and improve the previously best known result, proposed by Pavan and Tirthapura in 2005. Furthermore, our algorithms can be applied to improve the previously best known result for the Max-Dominance Norm Problem.