4paradigm / pskiplistLinks
An implementation of the persistent skiplist based on Intel Optane Persistent Memory. It is with Intel's pmemkv as an storage engine
☆13Updated 4 years ago
Alternatives and similar repositories for pskiplist
Users that are interested in pskiplist are comparing it to the libraries listed below
Sorting:
- Key Value Store based on LevelDB☆117Updated 4 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆76Updated 5 years ago
- ☆75Updated 9 months ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 4 years ago
- Key Value Development Kit☆204Updated last year
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆74Updated last year
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆211Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆94Updated 2 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆27Updated 3 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆77Updated 3 years ago
- ☆150Updated 2 years ago
- ☆125Updated 3 years ago
- ☆60Updated 2 years ago
- Key-value store with new indexing☆36Updated 6 years ago
- 第二届数据库大赛—Tair性能挑战复赛代码☆19Updated 5 years ago
- Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory☆39Updated 3 years ago
- A transactional main-memory database system on multicores☆105Updated 7 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago
- ☆36Updated 3 years ago
- Key/Value Datastore for Persistent Memory☆27Updated 4 years ago
- An open-source FPTree implementation☆27Updated 3 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.☆46Updated this week
- KVell: the Design and Implementation of a Fast Persistent Key-Value Store☆292Updated 3 weeks ago
- A version of RocksDB that uses persistent memory☆93Updated last year
- ☆30Updated 3 years ago
- Source code for DPTree: Differential Indexing for Persistent Memory☆61Updated 4 years ago