{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:42Z","timestamp":1725573402974},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_51","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T03:24:24Z","timestamp":1133493864000},"page":"505-514","source":"Crossref","is-referenced-by-count":10,"title":["Counting Distinct Items over Update Streams"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing STOC 1996, Philadelphia, Pennsylvania, May 1996, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"issue":"1","key":"51_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1998","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating frequency moments. Journal of Computer Systems and Sciences\u00a058(1), 137\u2013147 (1998)","journal-title":"Journal of Computer Systems and Sciences"},{"key":"51_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45726-7_1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Z. Bar-Yossef","year":"2002","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, p. 1. Springer, Heidelberg (2002)"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations (Extended Abstract). In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing STOC 1998, Dallas, Texas, May 1998, pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"},{"issue":"3","key":"51_CR5","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. Journal of Computer Systems and Sciences\u00a060(3), 630\u2013659 (2000)","journal-title":"Journal of Computer Systems and Sciences"},{"key":"51_CR6","unstructured":"Dubhashi, D., Priebe, V., Ranjan, D.: Negative Dependence through the FKG Inequality. Basic Research in Computer Science, Report Series, BRICSRS-96-27"},{"issue":"2","key":"51_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic Counting Algorithms for Database Applications. Journal of Computer Systems and Sciences\u00a031(2), 182\u2013209 (1985)","journal-title":"Journal of Computer Systems and Sciences"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Ganguly, S., Garofalakis, M., Rastogi, R.: Processing Set Expressions over Continuous Update Streams. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA (2003)","DOI":"10.1145\/872757.872790"},{"key":"51_CR9","unstructured":"Ganguly, S., Garofalakis, M., Rastogi, R., Sabnani, K.: Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks. Bell Laboratories Technical Memorandum (2004)"},{"key":"51_CR10","unstructured":"Gibbons, P.B.: Distinct Sampling for Highly-accurate Answers to Distinct Values Queries and Event Reports. In: Proceedings of the 27th International Conference on Very Large Data Bases, Roma, Italy (September 2001)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete, Greece, July 2001, pp. 281\u2013291 (2001)","DOI":"10.1145\/378580.378687"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Tirthapura, S.: Distributed streams algorithms for sliding windows. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 2002, pp. 63\u201372 (2002)","DOI":"10.1145\/564870.564880"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.: Tight Lower Bounds for the Distinct Elements Problem. In: Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003), San Diego, CA (2003)","DOI":"10.1109\/SFCS.2003.1238202"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:02:56Z","timestamp":1619492576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11602613_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}