{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:57Z","timestamp":1750307517825,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,29]]},"DOI":"10.1145\/1559795.1559819","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"157-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Space-optimal heavy hitters with strong error bounds"],"prefix":"10.1145","author":[{"given":"Radu","family":"Berinde","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Cormode","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Indyk","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin J.","family":"Strauss","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor,, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Proceedings of the 9th DBPL International Confenrence on Data Base and Programming Languages","author":"Arasu A.","year":"2003","unstructured":"]] A. Arasu , S. Babu , and J. Widom . Cql: A language for continuous queries over streams and relations . Proceedings of the 9th DBPL International Confenrence on Data Base and Programming Languages , pages 1 -- 11 , 2003 . ]]A. Arasu, S. Babu, and J. Widom. Cql: A language for continuous queries over streams and relations. Proceedings of the 9th DBPL International Confenrence on Data Base and Programming Languages, pages 1--11, 2003."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797556"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304214"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/648058.746944"},{"key":"e_1_3_2_1_6_1","first-page":"33","volume-title":"Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity","author":"Bose P.","year":"2003","unstructured":"]] P. Bose , E. Kranakis , P. Morin , and Y. Tang . Bounds for frequency estimation of packet streams . Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity , pages 33 -- 42 , 2003 . ]]P. Bose, E. Kranakis, P. Morin, and Y. Tang. Bounds for frequency estimation of packet streams. Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity, pages 33--42, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283418"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315492"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24698-5_7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740658"},{"key":"e_1_3_2_1_14_1","volume-title":"Oct.","author":"Donoho D.L.","year":"2004","unstructured":"]] D.L. Donoho . Compressed sensing. Unpublished manuscript , Oct. 2004 . ]]D.L. Donoho. Compressed sensing. Unpublished manuscript, Oct. 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505212"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671338"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250824"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375664"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065211"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007413"},{"key":"e_1_3_2_1_21_1","volume-title":"streaming and sublinear-space algorithms. Graduate course notes,","author":"Indyk P.","year":"2007","unstructured":"]] P. Indyk . Sketching , streaming and sublinear-space algorithms. Graduate course notes, available at http:\/\/stellar.mit.edu\/S\/course\/6\/fa07\/6.895\/, 2007 . ]]P. Indyk. Sketching, streaming and sublinear-space algorithms. Graduate course notes, available at http:\/\/stellar.mit.edu\/S\/course\/6\/fa07\/6.895\/, 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.82"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287400"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_28_1","unstructured":"]]Compressed sensing resources.\n   Available at http:\/\/www.dsp.ece.rice.edu\/cs\/ 2006\n  . \n  Rice DSP Group\n  .  ]]Compressed sensing resources. Available at http:\/\/www.dsp.ece.rice.edu\/cs\/ 2006. Rice DSP Group."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031524"},{"key":"e_1_3_2_1_30_1","volume-title":"Human Behavior and The Principle of Least Effort","author":"Zipf G.","year":"1949","unstructured":"]] G. Zipf . Human Behavior and The Principle of Least Effort . Addison-Wesley , 1949 . ]]G. Zipf. Human Behavior and The Principle of Least Effort. Addison-Wesley, 1949."}],"event":{"name":"SIGMOD\/PODS '09: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Providence Rhode Island USA","acronym":"SIGMOD\/PODS '09"},"container-title":["Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559795.1559819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1559795.1559819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:11Z","timestamp":1750249091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559795.1559819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":30,"alternative-id":["10.1145\/1559795.1559819","10.1145\/1559795"],"URL":"https:\/\/doi.org\/10.1145\/1559795.1559819","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}