Alternatives and similar repositories for countminsketch

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

• papergitkeeper / heavy-keeper-project
  ☆35Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 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…
  ☆182Updated 8 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 7 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆195Updated last year
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆119Updated 4 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 5 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆213Updated 10 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 8 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 4 years ago
• fomy / destor
  An experimental platform for chunk-level data deduplication. Key words: DDFS, Sparse Index, Extreme Binning, SiLo, Sample Index, BLC; CBR…
  ☆166Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• CGCL-codes / DCF
  Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…
  ☆39Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆52Updated 8 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆398Updated 8 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• kohler / masstree-beta
  Beta release of Masstree.
  ☆456Updated 2 years ago