Count-min sketch with variable number of hash functions: an experimental study

DOI10.1007/978-3-031-43980-3_17MaRDI QIDQ6545427

Éric Fusy, Gregory Kucherov

Publication date: 29 May 2024

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Finding frequent items in data streams
• Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures
• Tight Thresholds for Cuckoo Hashing via XORSAT
• An improved data stream summary: the count-min sketch and its applications
• Cuckoo hashing
• Cores in random hypergraphs and Boolean formulas
• Phase transition in count approximation by count-min sketch with conservative updates

This page was built for publication: Count-min sketch with variable number of hash functions: an experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545427)