shreyas-gopalakrishna / Concurrent-Skip-list
The concurrent skip list is a multithreaded implementation of the skip list data structure where the insert, delete, get and range operations can be performed together across multiple threads. The implementation uses hand-over-hand locking to access nodes for writing and atomic variables while reading (no locks needed while reading).
☆21Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for Concurrent-Skip-list
- ☆58Updated 7 months ago
- WiscKey is a highly SSD optimized key-value storage based on LevelDB.☆26Updated 2 years ago
- ☆52Updated 6 months ago
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆21Updated 5 years ago
- LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…☆27Updated 2 months ago
- ☆43Updated 3 years ago
- ☆59Updated last year
- ☆115Updated 2 years ago
- ☆27Updated 2 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆14Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆95Updated 5 months ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆36Updated last year
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆23Updated 9 months ago
- ☆21Updated last year
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 7 years ago
- ☆15Updated 7 years ago
- High-Performance C++ Data System☆122Updated 9 months ago
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated 4 months ago
- ☆24Updated 2 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 5 months ago
- 知乎文章附带代码☆12Updated last year
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Updated 3 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- Key-value store with new indexing☆36Updated 5 years ago
- Quickstep project☆40Updated 2 weeks ago
- ☆15Updated last year