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).
☆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:
- LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…☆37Updated 8 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
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆53Updated 2 weeks ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 2 months ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆57Updated 3 weeks ago
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆22Updated 5 years ago
- ☆68Updated last month
- ☆53Updated last year
- ☆13Updated 3 months ago
- ☆28Updated 2 years ago
- Source code for Practical DB-OS Co-Design with Privileged Kernel Bypass☆10Updated 4 months ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- Radix Hash Join - SIGMOD Contest 2018.☆33Updated 6 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆100Updated 2 years ago
- ☆29Updated 5 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆72Updated last year
- ☆43Updated 3 years ago
- Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)☆21Updated 2 years ago
- ☆137Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- 知乎文章附带代码☆15Updated 2 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …☆91Updated this week
- Key Value Store based on LevelDB☆113Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- Lightning In-Memory Object Store☆46Updated 3 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- ☆53Updated 2 years ago