{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:40Z","timestamp":1750307020051,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"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":["XRDS"],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>The rate at which electronic information is generated in the world is exploding. In this article we explore techniques known as sketching and streaming for processing massive data both quickly and memory-efficiently.<\/jats:p>","DOI":"10.1145\/2331042.2331049","type":"journal-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T21:21:57Z","timestamp":1347484917000},"page":"14-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Sketching and streaming algorithms for processing massive data"],"prefix":"10.1145","volume":"19","author":[{"given":"Jelani","family":"Nelson","sequence":"first","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2012,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/779232.779242"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"volume-title":"Massachusetts Institute of Technology","year":"1999","author":"Prokop H.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","unstructured":"Goldreich O. Combinatorial property testing (a survey). Electronic Colloquium on Computational Complexity (ECCC) 4 56 (1997).  Goldreich O. Combinatorial property testing (a survey). Electronic Colloquium on Computational Complexity (ECCC) 4 56 (1997)."},{"key":"e_1_2_1_6_1","unstructured":"Borthakur D. The Hadoop distributed file system: Architecture and design. http:\/\/hadoop.apache.org\/common\/docs\/r0.17.2\/hdfs_design.html (last accessed June 25 2012).  Borthakur D. The Hadoop distributed file system: Architecture and design. http:\/\/hadoop.apache.org\/common\/docs\/r0.17.2\/hdfs_design.html (last accessed June 25 2012)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000004"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_2_1_10_1","unstructured":"Chakrabarti A. Data stream algorithms. Lecture Notes. http:\/\/www.cs.dartmouth.edu\/~ac\/Teach\/CS49-Fall11\/  Chakrabarti A. Data stream algorithms. Lecture Notes. http:\/\/www.cs.dartmouth.edu\/~ac\/Teach\/CS49-Fall11\/"},{"key":"e_1_2_1_11_1","unstructured":"Indyk P. Sketching streaming and sub-linear space algorithms. Lecture Notes. http:\/\/stellar.mit.edu\/S\/course\/6\/fa07\/6.895\/  Indyk P. Sketching streaming and sub-linear space algorithms. Lecture Notes. http:\/\/stellar.mit.edu\/S\/course\/6\/fa07\/6.895\/"},{"key":"e_1_2_1_12_1","unstructured":"McGregor A. More advanced algorithms. Lecture Notes. http:\/\/people.cs.umass.edu\/~mcgregor\/courses\/CS711S12\/index.html  McGregor A. More advanced algorithms. Lecture Notes. http:\/\/people.cs.umass.edu\/~mcgregor\/courses\/CS711S12\/index.html"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934993"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3488-0"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"e_1_2_1_17_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms - ESA","author":"Demaine E. D.","year":"2002"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562787"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/100800774"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1813"},{"key":"e_1_2_1_26_1","unstructured":"Vadhan S. Pseudorandomness. Foundations and Trends in Theoretical Computer Science to appear.   Vadhan S. Pseudorandomness. Foundations and Trends in Theoretical Computer Science to appear."}],"container-title":["XRDS: Crossroads, The ACM Magazine for Students"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331042.2331049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2331042.2331049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:12Z","timestamp":1750236552000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331042.2331049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1145\/2331042.2331049"],"URL":"https:\/\/doi.org\/10.1145\/2331042.2331049","relation":{},"ISSN":["1528-4972","1528-4980"],"issn-type":[{"type":"print","value":"1528-4972"},{"type":"electronic","value":"1528-4980"}],"subject":[],"published":{"date-parts":[[2012,9]]},"assertion":[{"value":"2012-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}