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 5 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
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆47Updated last year
• zhouyangpkuer / ColdFilter
  This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).
  ☆31Updated 7 years ago
• DAIZHENWEI / Ada-BF
  ☆16Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• mikebenfield / Learned-Index-Structures
  Learned Index Structures
  ☆50Updated 6 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• carolinux / adaptive_range_filters
  ☆18Updated 9 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆150Updated 7 years ago
• sliding-sketch / Sliding-Sketch
  ☆24Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆57Updated 3 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 4 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago