{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:19:59Z","timestamp":1766578799615,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3584372.3589937","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"5-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Applications of Sketching and Pathways to Impact"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0698-0922","authenticated-orcid":false,"given":"Graham","family":"Cormode","sequence":"first","affiliation":[{"name":"Meta & University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"volume-title":"Distributed Operation in the Borealis Stream Processing Engine. In ACM SIGMOD International Conference on Management of Data.","author":"Abadi D.","key":"e_1_3_2_1_1_1","unstructured":"D. Abadi, Y. Ahmad, M. Balazinska, U. Cetintemel, M. Cherniack, J. Hwang, W. Lindner, A. Rasin, N. Tatbul, Y. Xing, and S. Zdonik. 2005. Distributed Operation in the Borealis Stream Processing Engine. In ACM SIGMOD International Conference on Management of Data."},{"volume-title":"ACM SIGMOD International Conference on Management of Data. 666","author":"Abadi D.","key":"e_1_3_2_1_2_1","unstructured":"D. Abadi, D. Carney, U. cC etintemel, M. Cherniack, C. Convey, C. Erwin, E. Galvez, M. Hatoun, A. Maskey, A. Rasin, A. Singer, M. Stonebraker, N. Tatbul, Y. Xing, R. Yan, and S. Zdonik. 2003. Aurora: a data stream management system. In ACM SIGMOD International Conference on Management of Data. 666."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500128"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"volume-title":"The Space Complexity of Approximating the Frequency Moments. In ACM Symposium on Theory of Computing. 20--29","author":"Alon N.","key":"e_1_3_2_1_5_1","unstructured":"N. Alon, Y. Matias, and M. Szegedy. 1996. The Space Complexity of Approximating the Frequency Moments. In ACM Symposium on Theory of Computing. 20--29."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872854"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387658"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3522561"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"volume-title":"Foundations of Data Science","author":"Blum Avrim","key":"e_1_3_2_1_10_1","unstructured":"Avrim Blum, John Hopcroft, and Ravi Kannan. 2020. Foundations of Data Science. Cambridge University Press, Cambridge. https:\/\/www.cambridge.org\/core\/books\/foundations-of-data-science\/6A43CE830DE83BED6CC5171E62B0AA9E"},{"key":"e_1_3_2_1_11_1","volume-title":"Technical Report ICSCA-CMP-32. Institute for Computer Science","author":"Boyer B.","year":"1981","unstructured":"B. Boyer and J. Moore. 1981. A Fast Majority Vote Algorithm. Technical Report ICSCA-CMP-32. Institute for Computer Science, University of Texas."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"M. Charikar K. Chen and M. Farach-Colton. 2002. Finding Frequent Items in Data Streams. In Procedings of the International Colloquium on Automata Languages and Programming (ICALP).","DOI":"10.1007\/3-540-45465-9_59"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452021.3458323"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"volume-title":"Small Summaries for Big Data","author":"Cormode Graham","key":"e_1_3_2_1_15_1","unstructured":"Graham Cormode and Ke Yi. 2020. Small Summaries for Big Data. Cambridge University Press."},{"volume-title":"Gigascope: A Stream Database for Network Applications. In ACM SIGMOD International Conference on Management of Data.","author":"Cranor C.","key":"e_1_3_2_1_16_1","unstructured":"C. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. 2003. Gigascope: A Stream Database for Network Applications. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_1_17_1","unstructured":"D. Donoho. 2004. Compressed Sensing. http:\/\/www-stat.stanford.edu\/ donoho\/Reports\/2004\/CompressedSensing091604.pdf. Unpublished Manuscript."},{"key":"e_1_3_2_1_18_1","volume-title":"European Symposium on Algorithms (ESA). 605--617","author":"Durand Marianne","year":"2003","unstructured":"Marianne Durand and Philippe Flajolet. 2003. Loglog Counting of Large Cardinalities (Extended Abstract). In European Symposium on Algorithms (ESA). 605--617."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork. 2006. Differential privacy. In ICALP. 1--12.","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_20_1","volume-title":"RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response. In Computer and Communications Security. 1054--1067.","author":"Pihur Vasyl","year":"2014","unstructured":"\u00da lfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova. 2014. RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response. In Computer and Communications Security. 1054--1067."},{"key":"e_1_3_2_1_21_1","volume-title":"Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. In Analysis of Algorithms (AOFA). 127--146.","author":"Flajolet Phillipe","year":"2007","unstructured":"Phillipe Flajolet, Eric Fusy, O. Gandouet, and F. Meunier. 2007. Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. In Analysis of Algorithms (AOFA). 127--146."},{"key":"e_1_3_2_1_22_1","volume-title":"Probabilistic Counting. In IEEE Conference on Foundations of Computer Science. 76--82","author":"Flajolet P.","year":"1985","unstructured":"P. Flajolet and G. N. Martin. 1983. Probabilistic Counting. In IEEE Conference on Foundations of Computer Science. 76--82. Journal version in Journal of Computer and System Sciences, 31:182--209, 1985."},{"volume-title":"ACM SIGMOD International Conference on Management of Data.","author":"Greenwald M.","key":"e_1_3_2_1_23_1","unstructured":"M. Greenwald and S. Khanna. 2001. Space-efficient online computation of quantile summaries. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"volume-title":"Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In ACM Symposium on Theory of Computing. 604--613","author":"Indyk P.","key":"e_1_3_2_1_25_1","unstructured":"P. Indyk and R. Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In ACM Symposium on Theory of Computing. 604--613."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Hossein Jowhari Mert Saglam and G\u00e1bor Tardos. 2011. Tight bounds for Lp samplers finding duplicates in streams and related problems. In ACM Principles of Database Systems.","DOI":"10.1145\/1989284.1989289"},{"key":"e_1_3_2_1_28_1","volume-title":"Kane and Jelani Nelson","author":"Daniel","year":"2012","unstructured":"Daniel M. Kane and Jelani Nelson. 2012. Sparser Johnson-Lindenstrauss Transforms. In ACM-SIAM Symposium on Discrete Algorithms."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"e_1_3_2_1_30_1","volume-title":"Optimal Quantile Approximation in Streams. In IEEE Conference on Foundations of Computer Science.","author":"Karnin Zohar","year":"2016","unstructured":"Zohar Karnin, Kevin Lang, and Edo Liberty. 2016. Optimal Quantile Approximation in Streams. In IEEE Conference on Foundations of Computer Science."},{"key":"e_1_3_2_1_31_1","volume-title":"Ullman","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec, Anand Rajaraman, and Jeffrey D. Ullman. 2014. Mining of Massive Datasets. Cambridge University Press. http:\/\/mmds.org"},{"volume-title":"ACM SIGMOD International Conference on Management of Data. 426--435","author":"Manku G. S.","key":"e_1_3_2_1_32_1","unstructured":"G. S. Manku, S. Rajagopalan, and B. G. Lindsay. 1998. Approximate Medians and other Quantiles in One Pass and with Limited Memory. In ACM SIGMOD International Conference on Management of Data. 426--435."},{"key":"e_1_3_2_1_33_1","unstructured":"Dzejla Medjedovic Emin Tahirovic and Ines Dedovic. 2022. Algorithms and Data Structures for Massive Datasets. Manning."},{"volume-title":"International Conference on Database Theory.","author":"Metwally A.","key":"e_1_3_2_1_34_1","unstructured":"A. Metwally, D. Agrawal, and A. El Abbadi. 2005. Efficient computation of Frequent and Top-k Elements in Data Streams. In International Conference on Database Theory."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher Michael","key":"e_1_3_2_1_36_1","unstructured":"Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90061-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517804.3526225"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","unstructured":"Ninh Pham and Rasmus Pagh. 2013. Fast and Scalable Polynomial Kernels via Explicit Feature Maps. In ACM SIGKDD (Chicago Illinois USA). 239--247. https:\/\/doi.org\/10.1145\/2487575.2487591","DOI":"10.1145\/2487575.2487591"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512758"},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18","volume":"8265","author":"Rothchild Daniel","year":"2020","unstructured":"Daniel Rothchild, Ashwinee Panda, Enayat Ullah, Nikita Ivkin, Ion Stoica, Vladimir Braverman, Joseph Gonzalez, and Raman Arora. 2020. FetchSGD: Communication-Efficient Federated Learning with Sketching. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18 July 2020, Virtual Event (Proceedings of Machine Learning Research, Vol. 119). PMLR, 8253--8265. http:\/\/proceedings.mlr.press\/v119\/rothchild20a.html"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"N. Shrivastava C. Buragohain D. Agrawal and S. Suri. 2004. Medians and Beyond: New Aggregation Techniques for Sensor Networks. In ACM SenSys.","DOI":"10.1145\/1031495.1031524"},{"key":"e_1_3_2_1_45_1","first-page":"8","article-title":"Learning with Privacy at Scale. https:\/\/machinelearning.apple.com\/docs\/learning-with-privacy-at-scale\/appledifferentialprivacysystem.pdf","volume":"1","author":"Team Differential Privacy","year":"2017","unstructured":"Differential Privacy Team. 2017. Learning with Privacy at Scale. https:\/\/machinelearning.apple.com\/docs\/learning-with-privacy-at-scale\/appledifferentialprivacysystem.pdf. Apple Machine Learning Journal , Vol. 1, 8 (Dec. 2017).","journal-title":"Apple Machine Learning Journal"},{"key":"e_1_3_2_1_46_1","volume-title":"CMON: A general purpose continuous IP backbone traffic analysis platform. Technical Report RR04-ATL-110309. Sprint ATL.","author":"To K.","year":"2004","unstructured":"K. To, T. Ye, and S. Bhattacharyya. 2004. CMON: A general purpose continuous IP backbone traffic analysis platform. Technical Report RR04-ATL-110309. Sprint ATL."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"e_1_3_2_1_49_1","unstructured":"S. Zdonik M. Stonebraker M. Cherniack and U. Cetintemel. 2003. The Aurora and Medusa Projects. Bulletin of the Technical Committee on Data Engineering (March 2003) 3--10."},{"key":"e_1_3_2_1_50_1","volume-title":"Amr El Abbadi, and Yu-Xiang Wang","author":"Zhao Fuheng","year":"2022","unstructured":"Fuheng Zhao, Dan Qiao, Rachel Redberg, Divyakant Agrawal, Amr El Abbadi, and Yu-Xiang Wang. 2022. Differentially Private Linear Sketches: Efficient Implementations and Applications. In Advances in Neural Information Processing Systems, , S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh (Eds.), Vol. 35. Curran Associates, Inc., 12691--12704. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2022\/file\/525338e0d98401a62950bc7c454eb83d-Paper-Conference.pdf io"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23"},"container-title":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3589937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3589937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:29Z","timestamp":1750178789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3589937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":49,"alternative-id":["10.1145\/3584372.3589937","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3589937","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}