Distinct counting with a self-learning bitmap

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 1171-1174

  Chen, Aiyou ^a   Cao, Jin ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SAMPLING; CARDINALITIES; EMPIRICAL STUDIES; FUNDAMENTAL PROBLEM; MEMORY REQUIREMENTS; MEMORY RESOURCES; MULTI-RESOLUTION; RELATIVE ESTIMATION; RELIABLE PERFORMANCE; SAMPLING RATES; SELF-LEARNING; STATE-OF-THE-ART ALGORITHMS;

EDUCATION; ESTIMATION; SAMPLING; SET THEORY;

LEARNING ALGORITHMS;

EID: 67649646371     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.193     Document Type: Conference Paper

References (15)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. ACM Symposium on Theory of Computing, 1996.
2. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, pages 1-10, 2002.
3. K. Beyer, P. Haas, B. Reinwald, Y. Sismanis, and R. Gemulla. On synopses for distinct-value estimation under multiset operations. In SIGMOD, 2007.
4. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441-453, 1997.
5. M. Durand and P. Flajolet. Loglog counting of large cardinalities. In European Symposium on Algorithms, pages 605-617, 2003.
6. C. Estan, G. Varghese, and M. Fisk. Bitmap algorithms for counting active flows on high speed links. IEEE/ACM Trans. on Networking, 14(5):925-937, 2006.
7. P. Flajolet. On adaptive sampling. Computing, 34:391-400, 1990.
8. P. Flajolet, E. Fusy, O. Gandouet, and F. Meunier. Hyperloglog: theanalysis of a near-optimal cardinality estimation algorithm. Analysis of Algorithms, 2007.
9. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
10. S. Ganguly. Counting distinct items over update streams. In Proceedings of the 16th ISAAC International Symposium on ALgorithms and Computation, pages 505-514, 2005.
11. P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. The VLDB Journal, pages 541-550, 2001.
12. F. Giroire. Order statistics and estimating cardinalities of massive datasets. In Proceedings of the 6th DMTCS Discrete Mathematics and Theoretical Computer Science, pages 157-166, 2005.
13. A. Metwally, D. Agrawal, and A. E. Abbadi. Why go logarithmic if we can go linear? towards effective distinct counting of search traffic. In Proc. ACM EDBT, March 2008.
14. R. Morris. Counting large numbers of events in small registers. Commun. ACM, 21(10):840-842, 1978.
15. K. Whang, B. Vander-Zanden, and H. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems, 1990.