alabid / countminsketchLinks
Implementation of Count Min Sketch in C++
☆57Updated 6 years ago
Alternatives and similar repositories for countminsketch
Users that are interested in countminsketch are comparing it to the libraries listed below
Sorting:
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- ☆34Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 7 years ago
- NOPaxos consensus protocol☆139Updated 5 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆167Updated last month
- pmwcas☆139Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- ☆150Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- ☆125Updated 3 years ago
- Source code for our OSDI 2016 paper☆110Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- Count-Min Sketch Implementation in C☆47Updated last month
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆212Updated 9 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- Beta release of Masstree.☆450Updated 2 years ago
- This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …☆13Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.