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
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …☆13Updated 9 years ago
- pmwcas☆139Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 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
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- Count-Min Sketch Implementation in C☆47Updated last year
- ☆121Updated 3 years ago
- Source code for our OSDI 2016 paper☆110Updated 6 years ago
- ☆148Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 9 months ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆51Updated 4 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- ☆15Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- Software Transactional Objects☆58Updated last year
- ☆289Updated 2 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 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