barrust / count-min-sketchLinks
Count-Min Sketch Implementation in C
☆47Updated last year
Alternatives and similar repositories for count-min-sketch
Users that are interested in count-min-sketch are comparing it to the libraries listed below
Sorting:
- Implementation of Count Min Sketch in C++☆56Updated 6 years ago
- ☆33Updated 6 years ago
- Count-Min sketch-based approximate counting library☆45Updated 4 months ago
- ☆16Updated 2 years ago
- Material for paper "Fast Packet Processing with eBPF and XDP: Concepts, Code, Challenges and Applications", ACM CSUR 2019☆27Updated 5 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- The code for both the framework and experiments from the NSDI '19 paper "Loom: Flexible and Efficient NIC Packet Scheduling"☆31Updated 6 years ago
- A user-level TCP/IP stack with NIC offload of stateful TCP operations☆70Updated 5 years ago
- ☆25Updated 9 years ago
- ☆31Updated 6 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- ☆21Updated 6 years ago
- ☆35Updated 6 years ago
- The source code of NuevoMatch as described in "A Computational Approach to Packet Classification" (SIGCOMM, 2020)☆43Updated 4 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- ☆25Updated 6 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- DCTCP Linux kernel Patch☆42Updated 4 years ago
- ☆19Updated 4 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- Succinct C++☆24Updated 5 years ago
- ☆24Updated last year
- A datacenter network framework that aims for high utilization with zero queueing. A logically centralized arbiter controls and orchestrat…☆159Updated 8 years ago
- ☆14Updated 7 years ago
- Public code repository for Trumpet: Timely and Precise Triggers in Data Centers☆16Updated 8 years ago
- ☆29Updated last year
- Source code for our OSDI 2016 paper☆110Updated 6 years ago
- ☆21Updated 8 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- ☆20Updated 3 years ago