An optimal algorithm for the distinct elements problem
暂无分享,去创建一个
[1] Srikanta Tirthapura,et al. Estimating simple functions on the union of data streams , 2001, SPAA '01.
[2] Ziv Bar-Yossef,et al. Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.
[3] Joshua Brody,et al. A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[4] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[5] Piotr Indyk,et al. Comparing Data Streams Using Hamming Norms (How to Zero In) , 2002, VLDB.
[6] David P. Woodruff,et al. On the exact space complexity of sketching and streaming small norms , 2010, SODA '10.
[7] Michalis Faloutsos,et al. The Connectivity and Fault-Tolerance of the Internet Topology , 2001 .
[8] Patricia G. Selinger,et al. Access path selection in a relational database management system , 1979, SIGMOD '79.
[9] Matthew Huras,et al. Multi-dimensional clustering: a new data layout scheme in DB2 , 2003, SIGMOD '03.
[10] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..
[11] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[12] Michael L. Fredman,et al. Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..
[13] Piotr Indyk,et al. Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.
[14] Anna Pagh,et al. Uniform Hashing in Constant Time and Optimal Space , 2008, SIAM J. Comput..
[15] Theodore Johnson,et al. Mining database structure; or, how to build a data quality browser , 2002, SIGMOD '02.
[16] Edith Cohen,et al. Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..
[17] Funda Ergün,et al. Periodicity in Streams , 2010, APPROX-RANDOM.
[18] Luca Trevisan,et al. Counting Distinct Elements in a Data Stream , 2002, RANDOM.
[19] David P. Woodruff. Optimal space lower bounds for all frequency moments , 2004, SODA '04.
[20] Guy E. Blelloch,et al. Compact dictionaries for variable-length keys and data with applications , 2008, TALG.
[21] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[22] Y. Ioannidis,et al. Extracting Topics of Debate between Users on Web Discussion Boards , 2010 .
[23] Peter J. Haas,et al. On synopses for distinct-value estimation under multiset operations , 2007, SIGMOD '07.
[24] Paul Brown,et al. Toward Automated Large-Scale Information Integration and Discovery , 2005, Data Management in a Connected World.
[25] David P. Woodruff,et al. Tight lower bounds for the distinct elements problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[26] Sumit Ganguly,et al. Counting distinct items over update streams , 2005, Theor. Comput. Sci..
[27] P. Flajolet,et al. HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm , 2007 .
[28] Srinivasan Seshan,et al. Detecting DDoS Attacks on ISP Networks , 2003 .
[29] Alan Siegel,et al. On Universal Classes of Extremely Random Constant-Time Hash Functions , 1995, SIAM J. Comput..
[30] George Varghese,et al. Bitmap algorithms for counting active flows on high speed links , 2003, IMC '03.
[31] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[32] Philippe Flajolet,et al. Loglog Counting of Large Cardinalities (Extended Abstract) , 2003, ESA.
[33] Phillip B. Gibbons. Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports , 2001, VLDB.
[34] Sam Lightstone,et al. Physical Database Design for Relational Databases , 2009, Encyclopedia of Database Systems.
[35] Sridhar Ramaswamy,et al. The Aqua approximate query answering system , 1999, SIGMOD '99.
[36] Jeffrey F. Naughton,et al. Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies , 1996, VLDB.
[37] Mark H. Overmars,et al. The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.