Alternatives and similar repositories for pmemkv-python

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

• Blosc / bloscpack
  Command line interface to and serialization format for Blosc
  ☆123Updated 2 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 8 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• leifwalsh / perfume
  Interactive performance benchmarking in Jupyter
  ☆33Updated 9 months 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.
  ☆42Updated 8 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆124Updated 5 years ago
• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆117Updated this week
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 5 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• mozafari / vprofiler
  A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications
  ☆95Updated 7 years ago
• luispedro / diskhash
  Diskbased (persistent) hashtable
  ☆164Updated 11 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• Oaklight / Vesper-raft
  A fault-tolerant distributed key-value store using the Raft consensus algorithm.
  ☆54Updated 5 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆115Updated 3 months ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆49Updated 2 years ago
• rjpower / falcon
  C Python, made faster.
  ☆342Updated 9 years ago
• rapidsai / libgdf
  [ARCHIVED] C GPU DataFrame Library
  ☆139Updated 6 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• IBM / sliding-window-aggregators
  Reference implementations of sliding window aggregation algorithms
  ☆46Updated 3 months ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated last year
• johnj / llds
  Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel
  ☆120Updated 2 years ago
• KioxiaAmerica / trocksdb
  RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance
  ☆55Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• naftaliharris / lazysort
  A partially and lazily sorted list data structure for Python
  ☆124Updated 5 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.
  ☆250Updated last week