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
• mortzdk / heavy-hitters
  This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …
  ☆14Updated 8 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆47Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆151Updated 7 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• peterboncz / bloomfilter-repro
  ☆29Updated 5 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆144Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 7 months ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆51Updated 4 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 4 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• zingdle / SIGMOD2020-MonetDB-Bindex
  BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
  ☆10Updated 5 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 3 weeks ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 6 years ago