{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:09:10Z","timestamp":1775297350280,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":18,"publisher":"Springer New York","isbn-type":[{"value":"9781461482666","type":"print"},{"value":"9781461482659","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_87","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T06:54:32Z","timestamp":1544079272000},"page":"653-659","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Count-Min Sketch"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"1","key":"87_CR3717","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S. An improved data stream summary: the count-min sketch and its applications. J Algorith. 2005;55(1):58\u201375.","journal-title":"J Algorith"},{"key":"87_CR3718","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"Moses Charikar","year":"2002","unstructured":"Charikar M, Chen K, Farach-Colton M. Finding frequent items in data streams. In: Proceedings of the 29th International Colloquium on Automata, Languages, and Programming; 2002. p. 693\u2013703."},{"issue":"1","key":"87_CR3719","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon N, Matias Y, Szegedy M. The space complexity of approximating the frequency moments. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing; 1996. p. 20\u20139. Journal version in J Comput Syst Sci. 1999;58(1):137\u201347.","journal-title":"Journal version in J Comput Syst Sci"},{"issue":"4","key":"87_CR3720","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/964725.633056","volume":"32","author":"Cristian Estan","year":"2002","unstructured":"Estan C, Varghese G. New directions in traffic measurement and accounting. In: Proceedings of the ACM International Conference of the on Data Communication; 2002. p. 323\u201338.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"87_CR3721","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P. Randomized algorithms. Cambridge: Cambridge University Press; 1995."},{"key":"87_CR3722","doi-asserted-by":"crossref","unstructured":"Cormode G, Muthukrishnan S. Summarizing and mining skewed data streams. In: Proceedings of the 2005 SIAM International Conference on Data Mining; 2005.","DOI":"10.1137\/1.9781611972757.5"},{"key":"87_CR3723","doi-asserted-by":"crossref","unstructured":"Lee GM, Liu H, Yoon Y, Zhang Y. Improving sketch reconstruction accuracy using linear least squares method. In: Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement; 2005. p. 273\u20138.","DOI":"10.1145\/1330107.1330138"},{"key":"87_CR3724","doi-asserted-by":"crossref","unstructured":"Bhattacharrya S, Madeira A, Muthukrishnan S, Ye T. How to scalably skip past streams. In: Proceedings of the 1st International Workshop on Scalable Stream Processing Systems; 2007. p. 654\u201363.","DOI":"10.1109\/ICDEW.2007.4401052"},{"key":"87_CR3725","unstructured":"Indyk P. Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms; 2003."},{"key":"87_CR3726","doi-asserted-by":"crossref","unstructured":"Lakshminath B, Ganguly S. Estimating entropy over data streams. In: Proceedings of the 14th European Symposium on Algorithms; 2006. p. 148\u201359.","DOI":"10.1007\/11841036_16"},{"key":"87_CR3727","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s T, Benz\u00far A, Csalog\u00e1ny K, Fogaras D, R\u00e1cz B. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: Proceedings of the 15th International World Wide Web Conference; 2006. p. 297\u2013306.","DOI":"10.1145\/1135777.1135823"},{"key":"87_CR3728","doi-asserted-by":"crossref","unstructured":"Spiegel J, Polyzotis N. Graph-based synopses for relational selectivity estimation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2006. p. 205\u201316.","DOI":"10.1145\/1142473.1142497"},{"key":"87_CR3729","doi-asserted-by":"crossref","unstructured":"Rusu F, Dobra A. Statistical analysis of sketch estimators. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2007. p. 187\u201398.","DOI":"10.1145\/1247480.1247503"},{"key":"87_CR3730","doi-asserted-by":"crossref","unstructured":"Cormode G, Muthukrishnan S. Space efficient mining of multigraph streams. In: Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2005. p. 271\u201382.","DOI":"10.1145\/1065167.1065201"},{"issue":"1","key":"87_CR3731","first-page":"26","volume":"28","author":"G Kollios","year":"2005","unstructured":"Kollios G, Byers J, Considine J, Hadjieleftheriou M, Li F. Robust aggregation in sensor networks. Q Bull IEEE TC Data Eng. 2005;28(1):26\u201332.","journal-title":"Q Bull IEEE TC Data Eng"},{"issue":"1","key":"87_CR3732","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1111322.1111326","volume":"36","author":"M Roughan","year":"2006","unstructured":"Roughan M, Zhang Y. Secure distributed data mining and its application in large-scale network measurements. Computer Communication Review. 2006;36(1):7\u201314.","journal-title":"Computer Communication Review"},{"key":"87_CR3733","doi-asserted-by":"crossref","unstructured":"Cormode G, Korn F, Muthukrishnan S, Johnson T, Spatscheck O, Srivastava D. Holistic UDAFs at streaming speeds. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 35\u201346.","DOI":"10.1145\/1007568.1007575"},{"key":"87_CR3734","doi-asserted-by":"crossref","unstructured":"Lai Y-K, Byrd GT. High-throughput sketch update on a low-power stream processor. In: Proceedings of the ACM\/IEEE Symposium on Architecture for Networking and Communications Systems; 2006. p. 123\u201332.","DOI":"10.1145\/1185347.1185364"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-8265-9_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:41:19Z","timestamp":1775295679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4614-8265-9_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_87","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}