Buffered Count-Min Sketch on SSD: Theory and Experiments

DOI10.4230/LIPIcs.ESA.2018.41OpenAlexW2963135734MaRDI QIDQ5009602

Dzejla Medjedovic, Prashant Kumar Pandey, Emina Mekic, Mayank Goswami

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1804.10673

zbMATH Keywords

frequencycountingBloom filterexternal memorycount-min sketchstreaming modelcounting filteri/o efficiencyquotient filter

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
• An improved data stream summary: the count-min sketch and its applications
• New Algorithms for Heavy Hitters in Data Streams (Invited Talk)
• An Improved Construction for Counting Bloom Filters
• Space/time trade-offs in hash coding with allowable errors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Buffered Count-Min Sketch on SSD: Theory and Experiments