{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:37Z","timestamp":1763468137241},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10619-013-7131-9","type":"journal-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T22:07:34Z","timestamp":1374703654000},"page":"315-335","source":"Crossref","is-referenced-by-count":27,"title":["A unifying framework for \u2113 0-sampling algorithms"],"prefix":"10.1007","volume":"32","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donatella","family":"Firmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,25]]},"reference":[{"key":"7131_CR1","first-page":"274","volume-title":"ACM Principles of Database Systems","author":"D. Achlioptas","year":"2001","unstructured":"Achlioptas, D.: Database-friendly random projections. In: ACM Principles of Database Systems, pp.\u00a0274\u2013281 (2001)"},{"key":"7131_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/1.9781611973099.40","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"K.J. Ahn","year":"2012","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 459\u2013467 (2012)"},{"key":"7131_CR3","unstructured":"Barkay, N., Porat, E., Shalem, B.: Feasible Sampling of Non-strict Turnstile Data Streams (2012). arXiv:1209.5566"},{"issue":"10","key":"7131_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1562764.1562787","volume":"52","author":"K. Beyer","year":"2009","unstructured":"Beyer, K., Gemulla, R., Haas, P.J., Reinwald, B., Sismanis, Y.: Distinct-value synopses for multiset operations. Commun. ACM 52(10), 87\u201395 (2009)","journal-title":"Commun. ACM"},{"key":"7131_CR5","first-page":"163","volume-title":"Meeting on Algorithm Engineering & Experiments","author":"G. Cormode","year":"2013","unstructured":"Cormode, G., Firmani, D.: On unifying the space of \u2113 0 sampling algorithms. In: Meeting on Algorithm Engineering & Experiments, pp. 163\u2013172 (2013)"},{"key":"7131_CR6","first-page":"3","volume-title":"International Conference on Very Large Data Bases","author":"G. Cormode","year":"2008","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. In: International Conference on Very Large Data Bases, pp. 3\u201320 (2008)"},{"key":"7131_CR7","first-page":"35","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"G. Cormode","year":"2004","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Johnson, T., Spatscheck, O., Srivastava, D.: Holistic UDAFs at streaming speeds. In: ACM SIGMOD International Conference on Management of Data, pp. 35\u201346 (2004)"},{"key":"7131_CR8","first-page":"25","volume-title":"International Conference on Very Large Data Bases","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S., Rozenbaum, I.: Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In: International Conference on Very Large Data Bases, pp. 25\u201336 (2005)"},{"key":"7131_CR9","volume-title":"Synposes for Massive Data: Samples, Histograms, Wavelets and Sketches","author":"G. Cormode","year":"2012","unstructured":"Cormode, G., Garofalakis, M., Haas, P., Jermaine, C.: Synposes for Massive Data: Samples, Histograms, Wavelets and Sketches. Now Publishers, Hanover (2012)"},{"key":"7131_CR10","volume-title":"An Elementary Proof of the Johnson\u2013Lindenstrauss Lemma","author":"S. Dasgupta","year":"1999","unstructured":"Dasgupta, S., Gupta, A.: An Elementary Proof of the Johnson\u2013Lindenstrauss Lemma. International Computer Science Institute, Berkeley (1999). Tech. Rep. TR-99-006"},{"key":"7131_CR11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/978-3-540-73951-7_55","volume-title":"Workshop on Algorithms and Data Structures","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T.: Space-efficient straggler identification in round-trip data streams via Newton\u2019s identitities and invertible Bloom filters. In: Workshop on Algorithms and Data Structures, pp. 637\u2013648 (2007)"},{"key":"7131_CR12","first-page":"142","volume-title":"Symposium on Computational Geometry","author":"G. Frahling","year":"2005","unstructured":"Frahling, G., Indyk, P., Sohler, C.: Sampling in dynamic data streams and applications. In: Symposium on Computational Geometry, pp. 142\u2013149 (2005)"},{"issue":"3","key":"7131_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.tcs.2007.02.031","volume":"378","author":"S. Ganguly","year":"2007","unstructured":"Ganguly, S.: Counting distinct items over update streams. Theor. Comput. Sci. 378(3), 211\u2013222 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"7131_CR14","first-page":"237","volume-title":"ACM Symposium on Theory of Computing","author":"A.C. Gilbert","year":"2007","unstructured":"Gilbert, A.C., Strauss, M.J., Tropp, J.A., Vershynin, R.: One sketch for all: fast algorithms for compressed sensing. In: ACM Symposium on Theory of Computing, pp. 237\u2013246 (2007)"},{"key":"7131_CR15","first-page":"454","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"P. Indyk","year":"1999","unstructured":"Indyk, P.: A small approximately min-wise independent family of hash functions. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 454\u2013456 (1999)"},{"key":"7131_CR16","first-page":"604","volume-title":"ACM Symposium on Theory of Computing","author":"P. Indyk","year":"1998","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)"},{"key":"7131_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. Johnson","year":"1984","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of Lipshitz mapping into Hilbert space. Contemp. Math. 26, 189\u2013206 (1984)","journal-title":"Contemp. Math."},{"key":"7131_CR18","first-page":"49","volume-title":"ACM Principles of Database Systems","author":"H. Jowhari","year":"2011","unstructured":"Jowhari, H., Sa\u011flam, M., Tardos, G.: Tight bounds for l p samplers, finding duplicates in streams, and related problems. In: ACM Principles of Database Systems, pp. 49\u201358 (2011)"},{"key":"7131_CR19","first-page":"41","volume-title":"ACM Principles of Database Systems","author":"D.M. Kane","year":"2010","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: ACM Principles of Database Systems, pp. 41\u201352 (2010)"},{"issue":"4","key":"7131_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N. Manerikar","year":"2009","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68(4), 415\u2013430 (2009)","journal-title":"Data Knowl. Eng."},{"key":"7131_CR21","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/1353343.1353418","volume-title":"EDBT","author":"A. Metwally","year":"2008","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic. In: EDBT, pp.\u00a0618\u2013629 (2008)"},{"key":"7131_CR22","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1137\/1.9781611973075.92","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"M. Monemizadeh","year":"2010","unstructured":"Monemizadeh, M., Woodruff, D.P.: 1-pass relative-error l p -sampling with applications. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1143\u20131160 (2010)"},{"key":"7131_CR23","first-page":"204","volume-title":"ACM Symposium on Theory of Computing","author":"N. Nisan","year":"1990","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computations. In: ACM Symposium on Theory of Computing, pp. 204\u2013212 (1990)"},{"key":"7131_CR24","first-page":"1","volume-title":"ACM Symposium on Theory of Computing","author":"M. Patrascu","year":"2011","unstructured":"Patrascu, M., Thorup, M.: The power of simple tabulation hashing. In: ACM Symposium on Theory of Computing, pp. 1\u201310 (2011)"},{"issue":"4","key":"7131_CR25","first-page":"277","volume":"13","author":"R. Pike","year":"2005","unstructured":"Pike, R., Dorward, S., Griesemer, R., Quinlan, S.: Interpreting the data: parallel analysis with sawzall. Sci. Program. 13(4), 277\u2013298 (2005)","journal-title":"Sci. Program."},{"key":"7131_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/1.9781611973082.4","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"E. Price","year":"2011","unstructured":"Price, E.: Efficient sketches for the set query problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 41\u201356 (2011)"},{"key":"7131_CR27","first-page":"331","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"J.P. Schmidt","year":"1993","unstructured":"Schmidt, J.P., Siegel, A., Srinivasan, A.: Chernoff\u2013Hoeffding bounds for applications with limited independence. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 331\u2013340 (1993)"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-013-7131-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-013-7131-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-013-7131-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:50Z","timestamp":1559244590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-013-7131-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,25]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["7131"],"URL":"https:\/\/doi.org\/10.1007\/s10619-013-7131-9","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,25]]}}}