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
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 7 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 5 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 4 years ago
• peterboncz / bloomfilter-repro
  ☆27Updated 5 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆179Updated 7 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 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)
  ☆79Updated 2 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆112Updated 3 years ago
• zhouyangpkuer / ColdFilter
  This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).
  ☆31Updated 6 years ago
• apache / datasketches-cpp
  Core C++ Sketch Library
  ☆230Updated last month
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆155Updated last year
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆58Updated 4 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆114Updated 2 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆280Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 4 years ago