{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T18:08:46Z","timestamp":1782929326180,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212584","type":"print"},{"value":"9783540246985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_7","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"29-38","source":"Crossref","is-referenced-by-count":112,"title":["An Improved Data Stream Summary: The Count-Min Sketch and Its Applications"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Gibbons, P., Matias, Y., Szegedy, M.: Tracking join and self-join sizes in limited storage. In: Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems (PODS 1999), pp. 10\u201320 (1999)","DOI":"10.1145\/303976.303978"},{"key":"#cr-split#-7_CR2.1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 20???29 (1996);","DOI":"10.1145\/237814.237823"},{"key":"#cr-split#-7_CR2.2","doi-asserted-by":"crossref","unstructured":"Journal version in Journal of Computer and System Sciences??58, 137???147 (1999)","DOI":"10.1006\/jcss.1997.1545"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of Symposium on Principles of Database Systems (PODS), pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 693\u2013703. Springer, Heidelberg (2002)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically. In: Proceedings of ACM Principles of Database Systems, pp. 296\u2013306 (2003)","DOI":"10.1145\/773153.773182"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s new: Finding significant differences in network data streams. In: Proceedings of IEEE Infocom (2004)","DOI":"10.1109\/TNET.2005.860096"},{"key":"7_CR7","unstructured":"Estan, C., Varghese, G.: Data streaming in computer networks. In: Proceedings of Workshop on Management and Processing of Data Streams (2003), http:\/\/www.research.att.com\/conf\/mpds2003\/schedule\/estanV.ps"},{"key":"#cr-split#-7_CR8.1","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting. In: 24th Annual Symposium on Foundations of Computer Science, pp. 76???82 (1983);","DOI":"10.1109\/SFCS.1983.46"},{"key":"#cr-split#-7_CR8.2","doi-asserted-by":"crossref","unstructured":"Journal version in Journal of Computer and System Sciences??31, 182???209 (1985)","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Garofalakis, M., Gehrke, J., Rastogi, R.: Querying and mining data streams:You only get one look. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2002)","DOI":"10.1145\/564793.564794"},{"key":"7_CR10","unstructured":"Gibbons, P., Matias, Y.: Synopsis structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, A (1999)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast, smallspace algorithms for approximate histogram maintenance. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 389\u2013398 (2002)","DOI":"10.1145\/509961.509966"},{"key":"#cr-split#-7_CR12.1","unstructured":"Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Surfing wavelets on streams: Onepass summaries for approximate aggregate queries. In: Proceedings of 27th International Conference on Very Large Data Bases, pp. 79???88 (2001);"},{"key":"#cr-split#-7_CR12.2","doi-asserted-by":"crossref","unstructured":"Journal version in IEEE Transactions on Knowledge and Data Engineering 15(3), 541???554 (2003)","DOI":"10.1109\/TKDE.2003.1198389"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: How to summarize the universe: Dynamic maintenance of quantiles. In: Proceedings of 28th International Conference on Very Large Data Bases, pp. 454\u2013465 (2002)","DOI":"10.1016\/B978-155860869-6\/50047-0"},{"issue":"2","key":"7_CR14","first-page":"58","volume":"30","author":"M. Greenwald","year":"2001","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. SIGMOD Record (ACM Special Interest Group on Management of Data)\u00a030(2), 58\u201366 (2001)","journal-title":"SIGMOD Record (ACM Special Interest Group on Management of Data)"},{"key":"7_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"7_CR16","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. In: ACM-SIAM Symposium on Discrete Algorithms (2003), http:\/\/athos.rutgers.edu\/~muthu\/stream-1-1.ps"},{"key":"7_CR17","unstructured":"Woodruff, D.: Optimal space lower bounds for all frequency moments. In: ACM-SIAM Symposium on Discrete Algorithms (2004)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:56:06Z","timestamp":1637117766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}