shreyas-gopalakrishna / Concurrent-Skip-listLinks
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).
☆25Updated 4 years ago
Alternatives and similar repositories for Concurrent-Skip-list
Users that are interested in Concurrent-Skip-list are comparing it to the libraries listed below
Sorting:
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated last month
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- ☆123Updated 3 years ago
- Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”☆27Updated 2 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- ☆30Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months ago
- ☆15Updated 9 months ago
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆129Updated last year
- ☆55Updated last year
- ☆74Updated last month
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆55Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆22Updated 6 years ago
- ☆143Updated 3 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- WiscKey is a highly SSD optimized key-value storage based on LevelDB.☆32Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- ☆53Updated 2 years ago
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated last year
- An update-in-place key-value store for modern storage.☆146Updated last year
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- Key-value store with new indexing☆37Updated 6 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- ☆149Updated 2 years ago
- OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …☆99Updated 3 weeks ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- High-Performance C++ Data System☆131Updated 3 months ago