alabid / countminsketch

Related projects ⓘ

Alternatives and complementary repositories for countminsketch

• papergitkeeper / heavy-keeper-project
  ☆31Updated 5 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆45Updated 9 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆151Updated 8 months ago
• zhouyangpkuer / ColdFilter
  This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).
  ☆29Updated 6 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆28Updated 6 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 4 years ago
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 5 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆148Updated 5 years ago
• njulands / HashAdaptiveBF
  ☆15Updated 3 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
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆76Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 6 months ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆110Updated 3 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆133Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated last month
• huanchenz / index-microbench
  ☆15Updated 7 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 3 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆61Updated 3 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 6 years ago
• peterboncz / bloomfilter-repro
  ☆19Updated 5 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆126Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆97Updated 6 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 3 years ago