Two improved range-efficient algorithms for F0 estimation

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.

[1]  Piotr Indyk,et al.  Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.

[2]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[3]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[4]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[5]  Srikanta Tirthapura,et al.  Range-efficient computation of F/sub 0/ over massive data streams , 2005, 21st International Conference on Data Engineering (ICDE'05).

[6]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[7]  Luca Trevisan,et al.  Counting Distinct Elements in a Data Stream , 2002, RANDOM.

[8]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[9]  Srikanta Tirthapura,et al.  Range Efficient Computation of F0 over Massive Data Streams , 2005, ICDE.

[10]  P. Flajolet,et al.  Loglog counting of large cardinalities , 2003 .

[11]  Piotr Indyk,et al.  Comparing Data Streams Using Hamming Norms (How to Zero In) , 2002, VLDB.

[12]  R. Weron.  Correction to: "On the Chambers–Mallows–Stuck Method for Simulating Skewed Stable Random Variables" , 1996 .

[13]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[14]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[15]  José D. P. Rolim,et al.  Randomization and Approximation Techniques in Computer Science , 2002, Lecture Notes in Computer Science.

[16]  Graham Cormode,et al.  Estimating Dominance Norms of Multiple Data Streams , 2003, ESA.

[17]  Srikanta Tirthapura,et al.  Estimating simple functions on the union of data streams , 2001, SPAA '01.

[18]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[19]  Frédéric Giroire,et al.  Order statistics and estimating cardinalities of massive data sets , 2009, Discret. Appl. Math..

[20]  Rajeev Rastogi,et al.  Tracking set-expression cardinalities over continuous update streams , 2004, The VLDB Journal.

[21]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[22]  Graham Cormode.  Stable Distributions for Stream Computations : it ’ s as easyas 0 , 1 , 2 , 2003 .