Alternatives and similar repositories for countminsketch

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

• papergitkeeper / heavy-keeper-project
  ☆34Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆181Updated 7 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated 3 weeks ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆160Updated 6 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 5 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 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
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• pmem / rpma
  Remote Persistent Memory Access Library
  ☆104Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 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.
  ☆165Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 7 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• utah-scs / lsm-sim
  Simulator for comparing memory allocation policies for caches.
  ☆19Updated 6 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 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
• utsaslab / SplitFS
  SplitFS: persistent-memory file system that reduces software overhead (SOSP 2019)
  ☆169Updated 3 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago