{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:52:02Z","timestamp":1777614722028,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642390524","type":"print"},{"value":"9783642390531","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_9","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"78-86","source":"Crossref","is-referenced-by-count":4,"title":["Summary Data Structures for Massive Data"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Cormode, G., Huang, Z., Phillips, J., Wei, Z., Yi, K.: Mergeable summaries. In: ACM Principles of Database Systems (2012)","DOI":"10.1145\/2213556.2213562"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: ACM-SIAM Symposium on Discrete Algorithms (2012)","DOI":"10.1137\/1.9781611973099.40"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Gibbons, P., Matias, Y., Szegedy, M.: Tracking join and self-join sizes in limited storage. In: ACM Principles of Database Systems, pp. 10\u201320 (1999)","DOI":"10.1145\/303976.303978"},{"issue":"7","key":"9_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chaudhuri, S., Motwani, R., Narasayya, V.R.: Towards estimation error guarantees for distinct values. In: ACM Principles of Database Systems, pp. 268\u2013279 (2000)","DOI":"10.1145\/335168.335230"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: ACM Symposium on Theory of Computing, pp. 205\u2013214 (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"9_CR7","unstructured":"Cormode, G., Garofalakis, M.: Sketching streams through the net: Distributed approximate query tracking. In: International Conference on Very Large Data Bases (2005)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M., Haas, P., Jermaine, C.: Synposes for Massive Data: Samples, Histograms, Wavelets and Sketches. Foundations and Trends in Databases. NOW publishers (2012)","DOI":"10.1561\/9781601985170"},{"issue":"1","key":"9_CR9","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. Journal of Algorithms\u00a055(1), 58\u201375 (2005)","journal-title":"Journal of Algorithms"},{"key":"9_CR10","unstructured":"Cukier, K.: Data, data everywhere. The Economist (February 2010)"},{"key":"9_CR11","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 and System Sciences\u00a031, 182\u2013209 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: ACM SIGMOD International Conference on Management of Data (2001)","DOI":"10.1145\/375663.375670"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-median clustering and their applications. In: ACM Symposium on Theory of Computing, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"A. Metwally","year":"2005","unstructured":"Metwally, A., Agrawal, D.P., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 398\u2013412. Springer, Heidelberg (2005)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming\u00a02, 143\u2013152 (1982)","journal-title":"Science of Computer Programming"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"9_CR17","unstructured":"Cisco NetFlow, More details at \n                    http:\/\/www.cisco.com\/warp\/public\/732\/Tech\/netflow\/"},{"key":"9_CR18","unstructured":"Olken, F.: Random Sampling from Databases. PhD thesis, Berkeley (1997)"},{"issue":"4","key":"9_CR19","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. Dynamic Grids and Worldwide Computing\u00a013(4), 277\u2013298 (2005)","journal-title":"Dynamic Grids and Worldwide Computing"},{"key":"9_CR20","unstructured":"Schechter, S., Herley, C., Mitzenmacher, M.: Popularity is everything: A new approach to protecting passwords from statistical-guessing attacks. In: Proceedings of HotNets (2010)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Shrivastava, N., Buragohain, C., Agrawal, D., Suri, S.: Medians and beyond: New aggregation techniques for sensor networks. In: ACM SenSys (2004)","DOI":"10.1145\/1031495.1031524"},{"key":"9_CR22","unstructured":"To, K., Ye, T., Bhattacharyya, S.: CMON: A general purpose continuous IP backbone traffic analysis platform. Technical Report RR04-ATL-110309, Sprint ATL (2004)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Weinberger, K.Q., Dasgupta, A., Langford, J., Smola, A.J., Attenberg, J.: Feature hashing for large scale multitask learning. In: International Conference on Machine Learning (ICML) (2009)","DOI":"10.1145\/1553374.1553516"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T07:55:31Z","timestamp":1674201331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}