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).
☆20Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for Concurrent-Skip-list
- ☆27Updated 2 years ago
- ☆51Updated 5 months ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 5 months ago
- ☆9Updated 2 weeks ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆35Updated 2 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆36Updated last year
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 2 years ago
- ☆58Updated last year
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated 3 months ago
- ☆115Updated 2 years ago
- Low level algorithms for persistent memory.☆16Updated 3 years ago
- Key-value store with new indexing☆36Updated 5 years ago
- Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”☆23Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆47Updated last month
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 7 years ago
- ☆24Updated 2 years ago
- ☆28Updated 3 years ago
- ☆21Updated 2 years ago
- ☆19Updated 5 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆20Updated last year
- LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…☆27Updated last month
- Reducing the cache misses of SIMD vectorization using IMV☆27Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆73Updated 2 years ago
- The logging module of the DBx1000 database.☆15Updated 4 years ago
- Tiered Indexing is a general way to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap, and…☆26Updated 6 months ago
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆21Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 5 years ago
- ☆57Updated 6 months ago