Alternatives and similar repositories for pmemkv-python

Users that are interested in pmemkv-python are comparing it to the libraries listed below

• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 8 years ago
• Blosc / bloscpack
  Command line interface to and serialization format for Blosc
  ☆123Updated 3 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• mozafari / vprofiler
  A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications
  ☆95Updated 7 years ago
• Netflix-Skunkworks / titus-isolate
  ☆56Updated 2 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆44Updated 9 years ago
• NicolasLM / bplustree
  An on-disk B+tree for Python 3
  ☆770Updated 6 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• fastforwardlabs / cuckoofilter
  ☆40Updated 9 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆160Updated 8 years ago
• luispedro / diskhash
  Diskbased (persistent) hashtable
  ☆167Updated last year
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆70Updated 9 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated this week
• KioxiaAmerica / trocksdb
  RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance
  ☆56Updated 5 years ago
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆122Updated last week
• leifwalsh / perfume
  Interactive performance benchmarking in Jupyter
  ☆33Updated last year
• tidwall / rocksdb-server
  Fast Redis clone written in C using RocksDB as a backend.
  ☆75Updated 4 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• rjpower / falcon
  C Python, made faster.
  ☆343Updated 10 years ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆89Updated last week
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 3 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• Oaklight / Vesper-raft
  A fault-tolerant distributed key-value store using the Raft consensus algorithm.
  ☆53Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆178Updated 3 years ago
• All-less / continuum
  A platform for online learning that curtails data latency and saves you cost.
  ☆47Updated 4 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆18Updated 6 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• KeyviDev / keyvi
  Keyvi - the key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
  ☆257Updated last week