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).
☆24Updated 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)☆69Updated 3 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 8 months ago
- An adaptive radix tree for efficient indexing in main memory.☆167Updated last month
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆135Updated last year
- An update-in-place key-value store for modern storage.☆147Updated last year
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 4 years ago
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆22Updated 6 years ago
- ☆151Updated 2 years ago
- LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.☆45Updated this week
- Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”☆27Updated 2 years ago
- A version of RocksDB that uses persistent memory☆93Updated last year
- Scalable Hashing on Persistent Memory☆193Updated last year
- OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …☆102Updated 2 months ago
- Key Value Store based on LevelDB☆117Updated 4 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- Key Value Development Kit☆203Updated last year
- High-Performance C++ Data System☆131Updated 4 months ago
- ☆146Updated 3 years ago
- Software Transactional Objects☆56Updated last year
- ☆125Updated 3 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆137Updated 9 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 9 months ago
- ☆79Updated 3 months ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆125Updated last year
- WiscKey is a highly SSD optimized key-value storage based on LevelDB.☆32Updated 4 years ago
- reading...☆32Updated 5 months ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆211Updated 2 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆55Updated last year
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago