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
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• 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
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆155Updated 6 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆154Updated 7 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 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
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 8 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆135Updated 4 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆47Updated last year
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 6 years ago
• wangziqi2016 / index-microbench
  ☆148Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 9 months ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆51Updated 4 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• readablesystems / sto
  Software Transactional Objects
  ☆58Updated last year
• yxymit / DBx1000
  ☆289Updated 2 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆115Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 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 7 years ago