alabid / countminsketchLinks
Implementation of Count Min Sketch in C++
☆56Updated 6 years ago
Alternatives and similar repositories for countminsketch
Users that are interested in countminsketch are comparing it to the libraries listed below
Sorting:
- ☆33Updated 6 years ago
- This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …☆13Updated 9 years ago
- Count-Min Sketch Implementation in C☆47Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- ☆16Updated 4 years ago
- ☆146Updated 2 years ago
- This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).☆31Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆173Updated 8 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- ☆120Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆160Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- LB+-Tree implementation☆47Updated 4 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 8 months ago
- HOT - Height Optimized Trie☆153Updated 7 years ago
- A minimalistic Count-min Sketch for Python☆56Updated 6 years ago
- Count-Min sketch-based approximate counting library☆45Updated last month
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- pmwcas☆139Updated 2 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆92Updated 2 years ago
- ☆15Updated 8 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- ☆29Updated 5 years ago
- A Fast and Cost-Efficient Hashing Index Scheme for Cloud Storage Systems☆18Updated 7 years ago
- Source code for our OSDI 2016 paper☆110Updated 6 years ago