{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:51Z","timestamp":1725491811066},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_9","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"75-86","source":"Crossref","is-referenced-by-count":0,"title":["On the Variance of Subset Sum Estimation"],"prefix":"10.1007","author":[{"given":"Mario","family":"Szegedy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF00140664","volume":"5","author":"F. Olken","year":"1995","unstructured":"Olken, F., Rotem, D.: Random sampling from databases: a survey. Statistics and Computing\u00a05(1), 25\u201342 (1995)","journal-title":"Statistics and Computing"},{"key":"9_CR2","unstructured":"Haas, P.J.: Speeding up db2 udb using sampling, http:\/\/www.almaden.ibm.com\/cs\/people\/peterh\/idugjbig.pdf"},{"key":"9_CR3","unstructured":"FAQ, O.U.C.O.: http:\/\/www.jlcomp.demon.co.uk\/faq\/random.html"},{"key":"9_CR4","unstructured":"Burleson, D.K.: Inside oracle10g dynamic sampling, http:\/\/www.dba-oracle.com\/art_dbazine_oracle10g_dynamic_sampling_hint.htm"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N., Duffield, N.G., Lund, C., Thorup, M.: Estimating arbitrary subset sums with few probes. In: Proc. 24th PODS, pp. 317\u2013325 (2005)","DOI":"10.1145\/1065167.1065209"},{"key":"9_CR6","first-page":"171","volume-title":"Proc. ACM SIGMOD","author":"J.M. Hellerstein","year":"1997","unstructured":"Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online aggregation. In: Proc. ACM SIGMOD, pp. 171\u2013182. ACM Press, New York (1997)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1066157.1066159","volume-title":"Proc. ACM SIGMOD","author":"T. Johnson","year":"2005","unstructured":"Johnson, T., Muthukrishnan, S., Rozenbaum, I.: Sampling algorithms in a stream operator. In: Proc. ACM SIGMOD, pp. 1\u201312. ACM Press, New York (2005)"},{"key":"9_CR8","unstructured":"Garofalakis, M.N., Gibbons, P.B.: Approximate query processing: Taming the terabytes. In: Proc. 27th VLDB, Tutorial 4 (2001)"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1109\/TIT.2005.846400","volume":"51","author":"N.G. Duffield","year":"2005","unstructured":"Duffield, N.G., Lund, C., Thorup, M.: Learn more, sample less: control of volume and variance in network measurements. IEEE Transactions on Information Theory\u00a051(5), 1756\u20131775 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci.\u00a055(3), 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR11","unstructured":"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)"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4378-6","volume-title":"Model Assisted Survey Sampling","author":"C. S\u00e4rndal","year":"1992","unstructured":"S\u00e4rndal, C., Swensson, B., Wretman, J.: Model Assisted Survey Sampling. Springer, Heidelberg (1992)"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/1132516.1132539","volume-title":"STOC","author":"M. Szegedy","year":"2006","unstructured":"Szegedy, M.: The DLT priority sampling is essentially optimal. In: STOC. Proc. 38th ACM Symp. Theory of Computing, pp. 150\u2013158. ACM Press, New York (2006)"},{"key":"9_CR14","unstructured":"Adler, R., Feldman, R., Taqqu, M.: A Practical Guide to Heavy Tails. Birkhauser (1998)"},{"key":"9_CR15","volume-title":"ICNP","author":"K. Park","year":"1996","unstructured":"Park, K., Kim, G., Crovella, M.: On the relationship between file sizes, transport protocols, and self-similar network traffic. In: ICNP. Proc. 4th IEEE Int. Conf. Network Protocols, IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/1005686.1005699","volume-title":"Proc. ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS\/Performance)","author":"N.G. Duffield","year":"2004","unstructured":"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\u201396. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T04:13:14Z","timestamp":1684037594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_9","relation":{},"subject":[]}}