On the variance of subset sum estimation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 75-86

  Szegedy, Mario ^a   Thorup, Mikkel ^b  

^a RUTGERS UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS; PARAMETER ESTIMATION; SET THEORY;

AVERAGE VARIANCE; DATA STREAMS; SUBSET SUM ESTIMATION;

DATA WAREHOUSES;

EID: 37049032964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_9     Document Type: Conference Paper

References (16)

1. Olken, F., Rotem, D.: Random sampling from databases: a survey. Statistics and Computing 5(1), 25-42 (1995)
2. Haas, P.J.: Speeding up db2 udb using sampling, http://www.almaden.ibm. com/cs/people/peterh/idugjbig.pdf
3. FAQ, O.U.C.O.: http://www.jlcomp.demon.co.uk/faq/random.html
4. Burleson, D.K.: Inside oraclelOg dynamic sampling http://www.dba-oracle. com/art_dbazine_oracle10g_dynamic_sampling_hint.htm
5. Alon, N., Duffield, N.G., Lund, C., Thorup, M.: Estimating arbitrary subset sums with few probes. In: Proc. 24th PODS, pp. 317-325 (2005)
6. Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online aggregation, In: Proc. ACM SIGMOD, pp. 171-182. ACM Press, New York (1997)
7. Johnson, T., Muthukrishnan, S., Rozenbaum, I.: Sampling algorithms in a stream operator. In: Proc. ACM SIGMOD, pp. 1-12. ACM Press, New York (2005)
8. Garofalakis, M.N., Gibbons, P.B.: Approximate query processing: Taming the terabytes. In: Proc. 27th VLDB, Tutorial 4 (2001)
9. Duffield, N.G., Lund, C., Thorup, M.: Learn more, sample less: control of volume and variance in network measurements. IEEE Transactions on Information Theory 51(5), 1756-1775 (2005)
10. Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci. 55(3), 441-453 (1997)
11. Duffield, N.G., Lund, C., Thorup, M.: Sampling to estimate arbitrary subset sums. Technical Report cs.DS/0509026, Computing Research Repository (CoRR), Preliminary journal version of [16] (2005)
12. Särndal, C., Swensson, B., Wretman, J.: Model Assisted Survey Sampling. Springer, Heidelberg (1992)
13. Szegedy, M.: The DLT priority sampling is essentially optimal. In: Proc. 38th ACM Symp. Theory of Computing (STOC), pp. 150-158. ACM Press, New York (2006)
14. Adler, R., Feldman, R., Taqqu, M.: A Practical Guide to Heavy Tails. Birkhauser (1998)
15. Park, K., Kim, G., Crovella, M.: On the relationship between file sizes, transport protocols, and self-similar network traffic. In: Proc. 4th IEEE Int. Conf. Network Protocols (ICNP), IEEE Computer Society Press, Los Alamitos (1996)
16. Duffield, N.G., Lund, C., Thorup, M.: Flow sampling under hard resource constraints. In: Proc. ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance), pp. 85-96. ACM Press, New York (2004)