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:
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆60Updated 4 months ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆65Updated last week
- Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”☆25Updated 2 years ago
- An update-in-place key-value store for modern storage.☆144Updated last year
- reading...☆32Updated last month
- ☆72Updated last week
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆22Updated 6 years ago
- ☆141Updated 3 years ago
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆125Updated last year
- High-Performance C++ Data System☆131Updated last month
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆54Updated last year
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated last year
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.☆42Updated last week
- Software Transactional Objects☆58Updated last year
- ☆121Updated 3 years ago
- ☆150Updated 2 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- ☆30Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 6 months ago
- ☆22Updated 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 …☆98Updated last month
- Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index☆58Updated 11 months ago
- Key Value Store based on LevelDB☆114Updated 3 years ago
- ☆15Updated 7 months ago
- An adaptive radix tree for efficient indexing in main memory.☆163Updated last year
- Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)☆21Updated 2 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- An open-source BzTree implementation☆92Updated 4 years ago