Confidence intervals for priority sampling

Performance Evaluation Review

Volumn 34, Issue 1, 2006, Pages 252-263

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Confidence intervals; Sampling

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; DATA REDUCTION; PARAMETER ESTIMATION; SAMPLING; SET THEORY;

CONFIDENCE INTERVALS; PRIORITY SAMPLING; SUBSETS; SYNTHETIC DATA;

COMPUTER SCIENCE;

EID: 33750300127     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1140103.1140307     Document Type: Conference Paper

References (16)

1. R.J Adler, R.E. Feldman, and M.S. Taqqu. A Practical Guide to Heavy Tails. Birkhauser, 1998.
2. K.R.W. Brewer and M. Hanif. Sampling With Unequal Probabilities, Lecture Notes in Statistics, vol. 15. Springer, New York, 1983.
3. S. Chaudhuri, R. Motwani, and V.R. Narasayya. On random sampling over joins. In Proc. ACM SIGMOD Conference, pages 263-274, 1999.
4. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-507, 1952.
5. N.G. Duffield, C. Lund, and M. Thorup. Charging from sampled network usage. In Proc. 1st ACM SIGCOMM Internet Measurement Workshop (IMW), pages 245-256, 2001.
6. N.G. Duffield, C. Lund, and M. Thorup. Flow sampling under hard resource constraints. In Proc. ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance), pages 85-96, 2004.
7. N.G. Duffield, C. Lund, and M. Thorup. Learn more, sample less: control of volume and variance in network measurements. IEEE Transactions on Information Theory, 51(5):1756-1775, 2005.
8. N.G. Duffield, C. Lund, and M. Thorup. Sampling to estimate arbitrary subset sums. Technical Report cs.DS/0509026, Computing Research Repository (CoRR), 2005. Journal version of [6].
9. D.E. Knuth, The Art of Computer Programming, 2, ed, Vol. 2: Seminumerical Algorithms. Addison-Wesley, 1981.
10. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005.
12. K. Park, G. Kim, and M. Crovella, On the relationship between file sizes, transport protocols, and self-similar network traffic. In Proc. 4th IEEE Int. Conf. Network Protocols (ICNP), 1996.
13. C. Särndal, B. Swensson, and J. Wretman. Model Assisted Survey Sampling. Springer, 1992.
14. Mario Szegedy. The DLT priority sampling is essentially optimal. In Proc. 38th ACM Symp. Theory of Computing (STOC), 2006.
15. W. Uhlmann. Vergleich der hypergeometrischen mit der binomial Verteilung, Metrica, 10:145-158, 1966.
16. Slammer worm. http://securityresponse. Symantec.com/avcenter/venc/data/ w32.sqlexp.worm.html.