Alternatives and similar repositories for countminsketch

Users that are interested in countminsketch are comparing it to the libraries listed below

• papergitkeeper / heavy-keeper-project
  ☆33Updated 6 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆155Updated 7 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 6 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆162Updated last year
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆136Updated 4 years ago
• LPD-EPFL / ASCYLIB
  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
• stephentu / silo
  Multicore in-memory storage engine
  ☆389Updated 7 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆114Updated 3 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆166Updated 3 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• fomy / destor
  An experimental platform for chunk-level data deduplication. Key words: DDFS, Sparse Index, Extreme Binning, SiLo, Sample Index, BLC; CBR…
  ☆163Updated 9 years ago
• mortzdk / heavy-hitters
  This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …
  ☆13Updated 9 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆444Updated last year
• twitter / cache-trace
  A collection of Twitter's anonymized production cache traces.
  ☆198Updated 3 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆47Updated last year
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated 10 months ago
• yxymit / DBx1000
  ☆290Updated 2 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆289Updated 3 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago