{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T01:40:48Z","timestamp":1755826848812,"version":"3.44.0"},"reference-count":58,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1109\/icde65448.2025.00177","type":"proceedings-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:28:25Z","timestamp":1755714505000},"page":"2337-2350","source":"Crossref","is-referenced-by-count":0,"title":["BFES: Towards Optimal Bayesian Frequency Estimation Sketches in Data-Streams"],"prefix":"10.1109","author":[{"given":"Francesco","family":"Da Dalt","sequence":"first","affiliation":[{"name":"ETH,Z&#x00FC;rich"}]},{"given":"Adrian","family":"Perrig","sequence":"additional","affiliation":[{"name":"ETH,Z&#x00FC;rich"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057215"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"ref3","first-page":"161","article-title":"Blink: Fast Connectivity Recovery Entirely in the Data Plane","volume-title":"16th USENIX Symposium on Networked Systems Design and Implementation (NSDI 19","author":"Holterbach"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2663716.2663724"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2007.49"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/UIC-ATC.2012.33"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.532"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1542245.1542268"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2394316"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"issue":"1","key":"ref11","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","article-title":"An improved data stream summary: the count-min sketch and its applications","volume":"55","author":"Cormode","year":"2005","journal-title":"Journal of Algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10187.001.0001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2021.12.007"},{"issue":"431","key":"ref14","first-page":"880","article-title":"Optimal confidence sets, bioequivalence, and the limacon of pascal","volume":"90","author":"Brown","year":"1995","journal-title":"Journal of the American Statistical Association"},{"key":"ref15","article-title":"BFES Repository","volume-title":"github repository for the BFES algorithm","author":"Da Dalt","year":"2024"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00080"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137652"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523220"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS53918.2021.00034"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3388589"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467868"},{"key":"ref26","first-page":"1027","article-title":"Toward Nearly-Zero-Error Sketching via Compressive Sensing","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21)","author":"Huang","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574252"},{"key":"ref28","article-title":"A bayesian nonparametric view on count-min sketch","volume-title":"Advances in Neural Information Processing Systems","volume":"31","author":"Cai","year":"2018"},{"volume-title":"A bayesian nonparametric approach to count-min sketch under power-law data streams","year":"2021","author":"Dolera","key":"ref29"},{"volume-title":"K. M. R. Collection, Dynamic Programming, ser. Rand Corporation research study","year":"1957","author":"Bellman","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"issue":"2","key":"ref32","first-page":"216","article-title":"Hybrid monte carlo","volume-title":"Physics Letters B","volume":"195","author":"Duane","year":"1987"},{"issue":"4","key":"ref33","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1111\/j.2517-6161.1994.tb02000.x","article-title":"Representations of knowledge in complex systems","volume":"56","author":"Grenander","year":"1994","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1201\/b14835"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601055"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2411606"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"volume-title":"hyperloglog-hip","year":"2014","author":"Akiba","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/s003614450037906x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.831016"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOMWKSHPS54753.2022.9798146","article-title":"A Formal Analysis of the Count-Min Sketch with Conservative Updates","volume-title":"IEEE INFOCOM WNA 2022 - The second Workshop on Networking Algorithms (WNA)","author":"Ben Mazziane"},{"key":"ref43","first-page":"109315","article-title":"Analyzing count min sketch with conservative updates","volume-title":"Computer Networks","volume":"217","author":"Mazziane","year":"2022"},{"key":"ref44","doi-asserted-by":"crossref","DOI":"10.1145\/3219819.3219975","volume-title":"Count-min: Optimal estimation and tight error bounds using empirical error distributions","author":"Ting","year":"2018"},{"volume-title":"Eigen v3.4.0","year":"2010","author":"Guennebaud","key":"ref45"},{"volume-title":"MOSEK Optimization Suite","year":"2023","key":"ref46"},{"volume-title":"KOSARAK dataset","year":"2003","author":"Bodon","key":"ref47"},{"volume-title":"RETAIL dataset","year":"2003","author":"Brijs","key":"ref48"},{"volume-title":"UNIV1 dataset","year":"2010","author":"Bodon","key":"ref49"},{"volume-title":"MACCDC Dataset","year":"2012","key":"ref50"},{"volume-title":"Caida Anonymized Internet Traces 2016","year":"2016","key":"ref51"},{"key":"ref52","article-title":"Traffic Data Repository at the WIDE Project","volume-title":"USENIX 2000 FREENIX Track","author":"Cho","year":"2000"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.12.016"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.088102"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.3758\/s13423-014-0585-6"},{"volume-title":"A simple sketching algorithm for entropy estimation","year":"2013","author":"Clifford","key":"ref56"},{"key":"ref57","first-page":"76","volume-title":"AMS Sketch","author":"Cormode","year":"2016"},{"issue":"2","key":"ref58","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0304-4076(98)00046-3","article-title":"Ordering univariate distributions by entropy and variance","volume":"90","author":"Ebrahimi","year":"1999","journal-title":"Journal of Econometrics"}],"event":{"name":"2025 IEEE 41st International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2025,5,19]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2025,5,23]]}},"container-title":["2025 IEEE 41st International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11112833\/11112834\/11112972.pdf?arnumber=11112972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T05:24:57Z","timestamp":1755753897000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11112972\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/icde65448.2025.00177","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}