{"id":"https://openalex.org/W4281743163","doi":"https://doi.org/10.1109/infocomwkshps54753.2022.9798146","title":"A Formal Analysis of the Count-Min Sketch with Conservative Updates","display_name":"A Formal Analysis of the Count-Min Sketch with Conservative Updates","publication_year":2022,"publication_date":"2022-05-02","ids":{"openalex":"https://openalex.org/W4281743163","doi":"https://doi.org/10.1109/infocomwkshps54753.2022.9798146"},"language":"en","primary_location":{"id":"doi:10.1109/infocomwkshps54753.2022.9798146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocomwkshps54753.2022.9798146","pdf_url":null,"source":{"id":"https://openalex.org/S4363607985","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03613957","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079858792","display_name":"Younes Ben Mazziane","orcid":"https://orcid.org/0000-0002-0887-9596"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Younes Ben Mazziane","raw_affiliation_strings":["Université Côte d’Azur,Inria","NEO  - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis  - France)"],"affiliations":[{"raw_affiliation_string":"Université Côte d’Azur,Inria","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"NEO  - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis  - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075282032","display_name":"Sara Alouf","orcid":"https://orcid.org/0009-0009-6643-0568"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sara Alouf","raw_affiliation_strings":["Université Côte d’Azur,Inria","NEO  - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis  - France)"],"affiliations":[{"raw_affiliation_string":"Université Côte d’Azur,Inria","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"NEO  - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis  - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085721523","display_name":"Giovanni Neglia","orcid":"https://orcid.org/0000-0001-8779-0620"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Giovanni Neglia","raw_affiliation_strings":["Université Côte d’Azur,Inria","NEO  - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis  - France)"],"affiliations":[{"raw_affiliation_string":"Université Côte d’Azur,Inria","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"NEO  - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis  - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079858792"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":1.5531,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.82260726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.8294790983200073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6699074506759644},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.5035976767539978},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.44303134083747864},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3169568181037903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1409546136856079}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.8294790983200073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6699074506759644},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.5035976767539978},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.44303134083747864},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3169568181037903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1409546136856079}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infocomwkshps54753.2022.9798146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocomwkshps54753.2022.9798146","pdf_url":null,"source":{"id":"https://openalex.org/S4363607985","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03613957v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03613957","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE INFOCOM WNA 2022 - The second Workshop on Networking Algorithms (WNA), May 2022, New York, United States. ⟨10.1109/INFOCOMWKSHPS54753.2022.9798146⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03613957v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03613957","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE INFOCOM WNA 2022 - The second Workshop on Networking Algorithms (WNA), May 2022, New York, United States. ⟨10.1109/INFOCOMWKSHPS54753.2022.9798146⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W151938044","https://openalex.org/W1571178906","https://openalex.org/W1919750904","https://openalex.org/W1965972569","https://openalex.org/W1966695467","https://openalex.org/W2012549717","https://openalex.org/W2060324268","https://openalex.org/W2071179368","https://openalex.org/W2080234606","https://openalex.org/W2128274460","https://openalex.org/W2130356538","https://openalex.org/W2131889098","https://openalex.org/W2140960149","https://openalex.org/W2572562038","https://openalex.org/W2834288129","https://openalex.org/W2909813108","https://openalex.org/W2963979055","https://openalex.org/W3087220088","https://openalex.org/W3160936076","https://openalex.org/W3208389451","https://openalex.org/W4206550928","https://openalex.org/W4231916799","https://openalex.org/W6640266135","https://openalex.org/W6681198211","https://openalex.org/W6758564351"],"related_works":["https://openalex.org/W2152752131","https://openalex.org/W161255303","https://openalex.org/W1544097700","https://openalex.org/W1488573418","https://openalex.org/W1922520186","https://openalex.org/W1946493810","https://openalex.org/W2391979747","https://openalex.org/W2981877881","https://openalex.org/W2550448639","https://openalex.org/W1964135497"],"abstract_inverted_index":{"Count-Min":[0],"Sketch":[1],"with":[2],"Conservative":[3],"Updates":[4],"(CMS-CU)":[5],"is":[6,29],"a":[7,16,42],"popular":[8],"algorithm":[9],"to":[10,45,75],"approximately":[11],"count":[12],"items\u2019":[13],"appearances":[14],"in":[15],"data":[17],"stream.":[18],"Despite":[19],"CMS-CU\u2019s":[20],"widespread":[21],"adoption,":[22],"the":[23,54,58,61,80],"theoretical":[24],"analysis":[25],"of":[26,33,60,82],"its":[27,34],"performance":[28],"still":[30],"wanting":[31],"because":[32],"inherent":[35],"difficulty.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40],"propose":[41],"novel":[43],"approach":[44],"study":[46],"CMS-CU":[47],"and":[48,57,86,99],"derive":[49,76],"new":[50],"upper":[51],"bounds":[52,93],"on":[53,97],"expected":[55],"value":[56],"CCDF":[59],"estimation":[62],"error":[63],"under":[64],"an":[65],"i.i.d.":[66],"request":[67],"process.":[68],"Our":[69],"formulas":[70],"can":[71],"be":[72],"successfully":[73],"employed":[74],"improved":[77,87],"estimates":[78],"for":[79,90],"precision":[81],"heavy-hitter":[83],"detection":[84],"methods":[85],"configuration":[88],"rules":[89],"CMS-CU.":[91],"The":[92],"are":[94],"evaluated":[95],"both":[96],"synthetic":[98],"real":[100],"traces.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}