{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:17:08Z","timestamp":1779175028117,"version":"3.51.4"},"reference-count":102,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Key-Area Research and Development Program of Guangdong Province","award":["2020B0101390001"],"award-info":[{"award-number":["2020B0101390001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U20A20179"],"award-info":[{"award-number":["U20A20179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>A Sketch is an excellent probabilistic data structure, which records the approximate statistics of data streams. Linear additivity is an important property of sketches. This paper studies how to keep the linear property after sketch compression. Most existing compression methods do not keep the linear property. We propose TreeSensing, an accurate, efficient, and flexible framework to linearly compress sketches. In TreeSensing, we first separate a sketch into two parts according to counter values. For the sketch with small counters, we propose a technique called TreeEncoding to compress it into a hierarchical structure. For the sketch with large counters, we propose a technique called SketchSensing to compress it using compressive sensing. We theoretically analyze the accuracy of TreeSensing. We use TreeSensing to compress 7 sketches and conduct two end-to-end experiments: distributed measurement and distributed machine learning. Experimental results show that TreeSensing outperforms prior art on both accuracy and efficiency, which achieves up to 100\u00d7 smaller error and 5.1\u00d7 higher speed than state-of-the-art Cluster-Reduce. All related codes are open-sourced.<\/jats:p>","DOI":"10.1145\/3588910","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-28","source":"Crossref","is-referenced-by-count":8,"title":["TreeSensing: Linearly Compressing Sketches with Flexibility"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9062-6565","authenticated-orcid":false,"given":"Zirui","family":"Liu","sequence":"first","affiliation":[{"name":"Peking University &amp; Peng Cheng Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0465-9510","authenticated-orcid":false,"given":"Yixin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University &amp; Peng Cheng Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8541-4496","authenticated-orcid":false,"given":"Yifan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Peking University &amp; Peng Cheng Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-9195","authenticated-orcid":false,"given":"Ruwen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University &amp; Peng Cheng Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University &amp; Peng Cheng Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2163-2723","authenticated-orcid":false,"given":"Kun","family":"Xie","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4677-7452","authenticated-orcid":false,"given":"Sha","family":"Wang","sequence":"additional","affiliation":[{"name":"Peking University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7168-3628","authenticated-orcid":false,"given":"Tao","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1681-4677","authenticated-orcid":false,"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247513"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749443"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2662236"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407830"},{"key":"e_1_2_2_6_1","volume-title":"Online sketch-based query optimization. arXiv preprint arXiv:2102.02440","author":"Izenov Yesdaulet","year":"2021","unstructured":"Yesdaulet Izenov, Asoke Datta, Florin Rusu, and Jun Hyung Shin. Online sketch-based query optimization. arXiv preprint arXiv:2102.02440, 2021."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452840"},{"key":"e_1_2_2_8_1","volume-title":"Simpli-squared: A very simple yet unexpectedly powerful join ordering algorithm without cardinality estimates. arXiv preprint arXiv:2111.00163","author":"Datta Asoke","year":"2021","unstructured":"Asoke Datta, Yesdaulet Izenov, Brian Tsan, and Florin Rusu. Simpli-squared: A very simple yet unexpectedly powerful join ordering algorithm without cardinality estimates. arXiv preprint arXiv:2111.00163, 2021."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452802"},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/ICDE.2004.1319998","volume-title":"Proceedings. 20th International Conference on Data Engineering","author":"Tao Yufei","year":"2004","unstructured":"Yufei Tao, George Kollios, Jeffrey Considine, Feifei Li, and Dimitris Papadias. Spatio-temporal aggregation using sketches. In Proceedings. 20th International Conference on Data Engineering, pages 214--225. IEEE, 2004."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476287"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2556661"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457289"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3450980.3450990"},{"key":"e_1_2_2_15_1","volume-title":"Amr El Abbadi, and Ahmed Metwally. Spacesaving \u00b1: An optimal algorithm for frequency estimation and frequent items in the bounded deletion model. arXiv preprint arXiv:2112.03462","author":"Zhao Fuheng","year":"2021","unstructured":"Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, and Ahmed Metwally. Spacesaving \u00b1: An optimal algorithm for frequency estimation and frequent items in the bounded deletion model. arXiv preprint arXiv:2112.03462, 2021."},{"key":"e_1_2_2_16_1","volume-title":"What's new: Finding significant differences in network data streams","author":"Cormode Graham","year":"2005","unstructured":"Graham Cormode and Shanmugavelayutham Muthukrishnan. What's new: Finding significant differences in network data streams. IEEE\/ACM Transactions on Networking, 2005."},{"key":"e_1_2_2_17_1","first-page":"13","volume-title":"Proceedings of the 31st international conference on Very large data bases","author":"Cormode Graham","year":"2005","unstructured":"Graham Cormode and Minos Garofalakis. Sketching streams through the net: Distributed approximate query tracking. In Proceedings of the 31st international conference on Very large data bases, pages 13--24, 2005."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476261"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320218"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0172-z"},{"key":"e_1_2_2_21_1","first-page":"31","article-title":"parallel and fast sketches for finding top-k frequent elements","author":"Mandal Ankush","year":"2018","unstructured":"Ankush Mandal, He Jiang, Anshumali Shrivastava, and Vivek Sarkar. Topkapi: parallel and fast sketches for finding top-k frequent elements. Advances in Neural Information Processing Systems, 31, 2018.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212795"},{"key":"e_1_2_2_23_1","first-page":"12691","article-title":"Differentially private linear sketches: Efficient implementations and applications","volume":"35","author":"Zhao Fuheng","year":"2022","unstructured":"Fuheng Zhao, Dan Qiao, Rachel Redberg, Divyakant Agrawal, Amr El Abbadi, and Yu-Xiang Wang. Differentially private linear sketches: Efficient implementations and applications. Advances in Neural Information Processing Systems, 35:12691--12704, 2022.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_24_1","unstructured":"Fuheng Zhao Punnal Ismail Khan Divyakant Agrawal Amr El Abbadi Arpit Gupta and Zaoxing Liu. Panakos: Chasing the tails for multidimensional data streams."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196894"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467217"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389713"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465480.3466926"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00169"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824126"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358926"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"e_1_2_2_34_1","first-page":"142","volume-title":"ON","author":"Mandal Kalikinkar","year":"2018","unstructured":"Kalikinkar Mandal, Guang Gong, and Chuyi Liu. Nike-based fast privacy-preserving high dimensional data aggregation for mobile devices. IEEE T Depend Secure; Technical Report; University of Waterloo: Waterloo, ON, Canada, pages 142--149, 2018."},{"key":"e_1_2_2_35_1","volume-title":"Hokusai-sketching streams in real time. arXiv preprint arXiv:1210.4891","author":"Matusevych Sergiy","year":"2012","unstructured":"Sergiy Matusevych, Alex Smola, and Amr Ahmed. Hokusai-sketching streams in real time. arXiv preprint arXiv:1210.4891, 2012."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"e_1_2_2_39_1","unstructured":"Treesensing related codes. https:\/\/github.com\/TowerSensing\/TowerSensing."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_2_2_41_1","volume-title":"Webdocs. Cs. Ualberta. Ca","author":"Deng Fan","year":"2007","unstructured":"Fan Deng and Davood Rafiei. New estimation algorithms for streaming data: Count-min can do more. Webdocs. Cs. Ualberta. Ca, 2007."},{"key":"e_1_2_2_42_1","volume-title":"Count-min-log sketch: Approximately counting with approximate counters. arXiv preprint arXiv:1502.04885","author":"Pitel Guillaume","year":"2015","unstructured":"Guillaume Pitel and Geoffroy Fouquier. Count-min-log sketch: Approximately counting with approximate counters. arXiv preprint arXiv:1502.04885, 2015."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2192447"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00080"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.31"},{"key":"e_1_2_2_47_1","volume-title":"Power-law distribution of the world wide web. science, 287(5461):2115--2115","author":"Adamic Lada A","year":"2000","unstructured":"Lada A Adamic and Bernardo A Huberman. Power-law distribution of the world wide web. science, 287(5461):2115--2115, 2000."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.3115\/1603899.1603924"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384529.1375472"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3120085"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2923772"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1951"},{"key":"e_1_2_2_54_1","volume-title":"Arithmetic coding. IBM Journal of research and development, 23(2):149--162","author":"Rissanen Jorma","year":"1979","unstructured":"Jorma Rissanen and Glen G Langdon. Arithmetic coding. IBM Journal of research and development, 23(2):149--162, 1979."},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00667"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(91)90002-F"},{"key":"e_1_2_2_57_1","volume-title":"Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE transactions on information theory, 52(12):5406--5425","author":"Candes Emmanuel J","year":"2006","unstructured":"Emmanuel J Candes and Terence Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE transactions on information theory, 52(12):5406--5425, 2006."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_22"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.183"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1984.tb01288.x"},{"key":"e_1_2_2_64_1","volume-title":"Cosamp: Iterative signal recovery from incomplete and inaccurate samples. Applied and computational harmonic analysis, 26(3):301--321","author":"Needell Deanna","year":"2009","unstructured":"Deanna Needell and Joel A Tropp. Cosamp: Iterative signal recovery from incomplete and inaccurate samples. Applied and computational harmonic analysis, 26(3):301--321, 2009."},{"key":"e_1_2_2_65_1","volume-title":"Iterative thresholding for sparse approximations. Journal of Fourier analysis and Applications, 14(5):629--654","author":"Blumensath Thomas","year":"2008","unstructured":"Thomas Blumensath and Mike E Davies. Iterative thresholding for sparse approximations. Journal of Fourier analysis and Applications, 14(5):629--654, 2008."},{"key":"e_1_2_2_66_1","first-page":"2016","article-title":"Compressive sensing in signal processing: algorithms and transform domain formulations","author":"Orovic Irena","year":"2016","unstructured":"Irena Orovic, Vladan Papic, Cornel Ioana, Xiumei Li, and Srdjan Stankovic. Compressive sensing in signal processing: algorithms and transform domain formulations. Mathematical Problems in Engineering, 2016, 2016.","journal-title":"Mathematical Problems in Engineering"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBCAS.2017.2665659"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2015.12"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958521"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180440"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24178-9_9"},{"key":"e_1_2_2_72_1","first-page":"327","volume-title":"Secure information aggregation for smart grids using homomorphic encryption. In 2010 first IEEE international conference on smart grid communications","author":"Li Fengjun","year":"2010","unstructured":"Fengjun Li, Bo Luo, and Peng Liu. Secure information aggregation for smart grids using homomorphic encryption. In 2010 first IEEE international conference on smart grid communications, pages 327--332. IEEE, 2010."},{"key":"e_1_2_2_73_1","volume-title":"A comprehensive comparison of multiparty secure additions with differential privacy","author":"Goryczka Slawomir","year":"2015","unstructured":"Slawomir Goryczka and Li Xiong. A comprehensive comparison of multiparty secure additions with differential privacy. IEEE transactions on dependable and secure computing, 14(5):463--477, 2015."},{"key":"e_1_2_2_74_1","first-page":"120","volume-title":"Proceedings of the workshop on selected areas of cryptography","author":"Benaloh Josh","year":"1994","unstructured":"Josh Benaloh. Dense probabilistic encryption. In Proceedings of the workshop on selected areas of cryptography, pages 120--128, 1994."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_2"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835781"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994515"},{"key":"e_1_2_2_79_1","first-page":"31","article-title":"Gradient sparsification for communication-efficient distributed optimization","author":"Wangni Jianqiao","year":"2018","unstructured":"Jianqiao Wangni, Jialei Wang, Ji Liu, and Tong Zhang. Gradient sparsification for communication-efficient distributed optimization. Advances in Neural Information Processing Systems, 31, 2018.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_80_1","volume-title":"Distributed learning with compressed gradient differences. arXiv preprint arXiv:1901.09269","author":"Mishchenko Konstantin","year":"2019","unstructured":"Konstantin Mishchenko, Eduard Gorbunov, Martin Tak\u00e1c, and Peter Richt\u00e1rik. Distributed learning with compressed gradient differences. arXiv preprint arXiv:1901.09269, 2019."},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00060"},{"key":"e_1_2_2_82_1","first-page":"8133","article-title":"Rethinking gradient sparsification as total error minimization","volume":"34","author":"Sahu Atal","year":"2021","unstructured":"Atal Sahu, Aritra Dutta, Ahmed M Abdelmoniem, Trambak Banerjee, Marco Canini, and Panos Kalnis. Rethinking gradient sparsification as total error minimization. Advances in Neural Information Processing Systems, 34:8133--8146, 2021.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_83_1","first-page":"560","volume-title":"International Conference on Machine Learning","author":"Bernstein Jeremy","year":"2018","unstructured":"Jeremy Bernstein, Yu-Xiang Wang, Kamyar Azizzadenesheli, and Animashree Anandkumar. signsgd: Compressed optimisation for non-convex problems. In International Conference on Machine Learning, pages 560--569. PMLR, 2018."},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375670"},{"key":"e_1_2_2_85_1","unstructured":"Fpga xc7vx690t-2ffg1761i specifications. https:\/\/dir.heisener.com\/specification-pdf\/en\/XC7VX690T-2FFG1761I.pdf."},{"key":"e_1_2_2_86_1","unstructured":"Murmur hashing source codes. https:\/\/github.com\/aappleby\/smhasher."},{"key":"e_1_2_2_87_1","unstructured":"Hash website. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html."},{"key":"e_1_2_2_88_1","unstructured":"The caida anonymized internet traces. https:\/\/www.caida.org\/catalog\/datasets\/passive_dataset."},{"key":"e_1_2_2_89_1","unstructured":"The criteo dataset. Available: https:\/\/ailab.criteo.com\/ressources\/."},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.576"},{"key":"e_1_2_2_91_1","volume-title":"Uci machine learning repository","author":"Asuncion Arthur","year":"2007","unstructured":"Arthur Asuncion and David Newman. Uci machine learning repository, 2007."},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303978"},{"key":"e_1_2_2_93_1","unstructured":"The redis in-memory data store. https:\/\/redis.io."},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0480-7"},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806515"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_33"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452808"},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_24"},{"key":"e_1_2_2_100_1","volume-title":"Sketches for size of join estimation. ACM Transactions on Database Systems (TODS), 33(3):1--46","author":"Rusu Florin","year":"2008","unstructured":"Florin Rusu and Alin Dobra. Sketches for size of join estimation. ACM Transactions on Database Systems (TODS), 33(3):1--46, 2008."},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247503"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319894"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588910","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:36Z","timestamp":1750178856000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":102,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588910"],"URL":"https:\/\/doi.org\/10.1145\/3588910","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}