Abstract
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarantees on the estimated sum. In this paper we consider various sampling methods besides uniform sampling, in particular sampling a variable with probability proportional to its value, referred to as linear weighted sampling. If only linear weighted sampling is allowed, we show an algorithm for estimating sum with \(\tilde{O}(\sqrt n)\) samples, and it is almost optimal in the sense that \(\Omega(\sqrt n)\) samples are necessary for any reasonable sum estimator. If both uniform sampling and linear weighted sampling are allowed, we show a sum estimator with \(\tilde{O}(\sqrt[3]n)\) samples. More generally, we may allow general weighted sampling where the probability of sampling a variable is proportional to any function of its value. We prove a lower bound of \(\Omega(\sqrt[3]n)\) samples for any reasonable sum estimator using general weighted sampling, which implies that our algorithm combining uniform and linear weighted sampling is an almost optimal sum estimator.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Duffield, N.G., Lund, C., Thorup, M.: Estimating arbitrary subset sums with few probes. In: PODS 2005
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. JCSC 58, 137–147 (1999)
Bar-Yossef, Z., Gurevich, M. (eds.): Random sampling from a search engine’s index. In: WWW 2006
Bar-Yossef, Z., Gurevich, M.: Efficient search engine measurements. In: WWW 2007
Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling algorithms: lower bounds and applications. In: STOC 2001
Broder, A., Fontura, M., Josifovski, V., Kumar, R., Motwani, R., Nabar, S., Panigrahy, R., Tomkins, A., Xu, Y.: Estimating corpus size via queries. In: CIKM 2006
Canetti, R., Even, G., Goldreich, O.: Lower Bounds for Sampling Algorithms for Estimating the Average. Information Processing Letters 53, 17–25 (1995)
Charikar, M., Chaudhuri, S., Motwani, R., Narasayya, V.: Towards estimation error guarantees for distinct values. In: PODS 2000
Duffield, N.G., Lund, C., Thorup, M.: Learn more, sample less: control of volume and variance in network measurements. IEEE Trans. on Information Theory 51, 1756–1775 (2005)
Gulli, A., Signorini, A.: The indexable Web is more than 11.5 billion pages. In: WWW 2005
Henzinger, M.R., Heydon, A., Mitzenmacher, M., Najork, M.: On near-uniform URL sampling. In: WWW 2000
Lawrence, S., Giles, C.: Searching the World Wide Web. Science 280, 98–100 (1998)
Lawrence, S., Giles, C.: Accessibility of information on the web. Nature 400, 107–109 (1999)
Liu, J.: Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Statist. Comput. 6, 113–119 (1996)
Motwani, R., Raghavan, P.: Randomized Algorithm (1995)
Motwani, R., Raghavan, P., Xu, Y.: Estimating Sum by Weighted Sampling. Technical Report (2007)
Szegedy, M.: The DLT priority sampling is essentially optimal. In: STOC 2006
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Motwani, R., Panigrahy, R., Xu, Y. (2007). Estimating Sum by Weighted Sampling. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)