A simple and efficient estimation method for stream expression cardinalities

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 171-182

  Chen, Aiyou ^a   Cao, Jin ^a   Bu, Tian ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRAMER-RAO BOUNDS; ESTIMATION; MAXIMUM LIKELIHOOD;

CRAMER RAO LOWER BOUND; EFFICIENT ESTIMATION; MAXIMUM LIKELIHOOD ESTIMATORS (MLE); MEMORY REQUIREMENTS; RELATIVE STANDARD ERROR; STATE-OF-THE-ART ALGORITHMS; STATISTICAL EFFICIENCY; STATISTICAL MODELING;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 85011023524     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (STOC), pages 20-29, 1996.
2. N. Alon and J. Spencer. The Probabilistic Method. Wiley, New York, 1992.
3. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In In Proc. RANDOM '02, 2002.
4. P. Bickel and K. Doksum. Mathematical Statistics: Basic Ideas and Selected Topics, Vol 1, (2nd Edition). Prentice Hall, 2000.
5. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer and System Sciences, 60:630-659, 2000.
6. M. Cai, J. Pan, Y.-K. Kwok, and K. Hwang. Fast and accurate traffic matrix measurement using adaptive cardinality counting. In SIGCOMM'05 Workshops, 2005.
7. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In ICDE '04: Proceedings of the 20th International Conference on Data Engineering, page 449, Washington, DC, USA, 2004. IEEE Computer Society.
8. M. Durand and P. Flajolet. Loglog counting of large cardinalities. In Proceedings of European Symposium on Algorithms, pages 605-617, 2003.
9. 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.
10. P. Flajolet and G. Martin. Probabilistic counting algorithms for database applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
11. P. Flajolet and G. N. Martin. Probabilistic counting. In In Proc. Symp. on Foundations of Computer Science (FOCS), 1983.
12. S. Ganguly. Counting distinct items over update streams. In ISAAC, pages 505-514, 2005.
13. S. Ganguly, M. Garofalakis, and R. Rastogi. Tracking set-expression cardinalities over continuous update streams. The VLDB Journal, 13:354-369, 2004.
14. M. Garofalakis, J. M. Hellerstein, and P. Maniatis. Proof sketches: Verifiable in-network aggregation. In Proceedings of the IEEE 23rd International Conference on Data Engineering, Istanbul, Turkey, 2007.
15. P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. The VLDB Journal, pages 541-550, 2001.
16. F. Giroire. Order statistics and estimating cardinalities of massive data sets. In C. Martínez, editor, 2005 International Conference on Analysis of Algorithms, pages 157-166. Discrete Mathematics and Theoretical Computer Science, 2005.
17. P. Indyk. A small approximately min-wise independent family of hash functions. In Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, 1999.
18. NLNAR. www.nlanr.net.
19. Q. G. Zhao, A. Kumar, J. Wang, and J. J. Xu. Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices. In Proceedings of the ACM SIGMETRICS, pages 350-361, 2005.