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:
- Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”☆25Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 3 months ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆63Updated 3 months ago
- ☆54Updated last year
- ☆15Updated 6 months ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- 知乎文章附带代码☆15Updated 2 years ago
- ☆29Updated 2 years ago
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆22Updated 6 years ago
- ☆121Updated 3 years ago
- OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …☆94Updated 2 weeks ago
- ☆72Updated 4 months ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 4 months ago
- High-Performance C++ Data System☆131Updated last week
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- ☆44Updated 3 years ago
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆125Updated last year
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆21Updated 3 months 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
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆200Updated 2 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Adaptive Radix Tree in C++☆45Updated 2 weeks ago
- Software Transactional Objects☆58Updated last year
- ☆53Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- ☆149Updated 2 years ago
- ☆140Updated 3 years ago