Alternatives and similar repositories for pmemkv-python

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

• 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
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• IBM / ibmgraphblas
  ibmgraphblas
  ☆27Updated 6 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• mfs409 / nonblocking
  Nonblocking data structures
  ☆12Updated 10 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆48Updated last month
• emaxerrno / smf
  Fastest RPC in the west
  ☆21Updated 5 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆75Updated 6 years ago
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 7 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• pkhuong / aerie
  Aerie: a regex-like engine nested word grammars
  ☆16Updated 3 years ago
• mit-pdos / dsrg
  Distributed Systems Reading Group
  ☆20Updated 7 years ago
• 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
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• naftaliharris / lazysort
  A partially and lazily sorted list data structure for Python
  ☆124Updated 5 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 4 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• Shardcached / libshardcache
  C implementation of a caching and cache-filling library inspired to groupcache
  ☆43Updated 9 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• RedisBloom / t-digest-c
  Wicked Fast, Accurate Quantiles Using 'T-Digests'
  ☆21Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• IBM / sliding-window-aggregators
  Reference implementations of sliding window aggregation algorithms
  ☆45Updated 3 weeks ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago