Estimating arbitrary subset sums with few probes

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2005, Pages 317-325

  Alon, Noga ^a   Duffield, Nick ^b   Lund, Carsten ^b   Thorup, Mikkel ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Databases; IP Flows; Preprocessing; Sampling

Indexed keywords

ESTIMATION; SET THEORY;

ARBITRARY SUBSET SUMS; STANDARD DEVIATION; SYNTHETIC DATA;

DATABASE SYSTEMS;

EID: 33244459147     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065209     Document Type: Conference Paper

References (19)

1. N. Alon and J. H. Spencer, The Probabilistic Method, 2nd ed., Wiley, 2000.
2. L. Arge "External Memory Data Structures" In Handbook of Massive Data Sets, J. Abello, P.M. Pardalos, M.G.C. Resende (Eds.), Kluwer Academic Publishers, 2002, pages 313-357
3. L. Arge and V. Samoladas and J. S. Vitter, On Two-Dimensional Indexability and Optimal Range Search Indexing, PODS 1999: 346-357
4. S. Acharya, P.B. Gibbons, V. Poosala, S. Ramaswamy: The Aqua Approximate Query Answering System. SIGMOD Conference 1999: 574-576
5. R.J Adler, R.E. Feldman and M.S. Taqqu, (Eds.) "A practical guide to heavy tails", Birkhauser, Boston, 1998.
6. B.C. Arnold and N. Balakrishnan, "Relations, Bounds and Approximations for Order Statistics", Lecture Notes in Statistics, vol. 53, Springer, New York, 1988.
7. K.R.W. Brewer and M. Hanif, "Sampling With Unequal Probabilities", Lecture Notes in Statistics, vol. 15, Springer, New York, 1983.
8. E. Cohen, "Size-estimation framework with applications to transitive closure and reachability", J. Comput. Syst. Sci., 55(3):441-453, 1997.
9. S. Chaudhuri, R. Motwani, V.R. Narasayya, "On Random Sampling over Joins", SIGMOD Conference 1999: 263-274
10. H.A. David, "Order Statistics", Second Edition, Wiley Series in Probability and Mathematical Statistics, Wiley, New York, 1981
11. N.G. Duffield, C. Lund, M. Thorup, "Learn more, sample less: control of volume and variance in network measurements", Manuscript, 2002, to appear in IEEE Trans. on Information Theory.
12. N.G. Duffield, C. Lund, M. Thorup, "Flow Sampling Under Hard Resource Constraints", ACM SIGMETRICS 2004, pages 85-96.
13. P.B. Gibbons, Y. Matias, "New Sampling-Based Summary Statistics for Improving Approximate Query Answers", SIGMOD Conference 1998: 331-342.
14. C.L. Hays, "What They Know About You", New York Times, November 14, 2004, Section 3, Page 1.
15. J.M. Hellerstein, P.J. Haas, H.J. Wang, "Online Aggregation", SIGMOD Conference 1997: 171-182
16. F. Olken, D. Rotem: "Random Sampling from Databases - A Survey" http://pueblo.lbl.gov/~olken/ sampling.html March 1994
17. K. Park, G. Kim, and M. Crovella, "On the Relationship Between File Sizes, Transport Protocols, and Self-Similar Network Traffic". In Proc. 4th Int. Conf. Network Protocols (ICNP), 1996.
18. M. Szegedy, "Near optimality of the priority sampling procedure". Electronic Colloquium on Computational Complexity Report TR05-001, 2005.
19. J.S. Vitter, "Random Sampling with a Reservoir", ACM Trans. Math. Softw. 11(1): 37-57 (1985)