Alternatives and similar repositories for Concurrent-Skip-list

Users that are interested in Concurrent-Skip-list are comparing it to the libraries listed below

• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 8 months ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated 5 months ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆69Updated last week
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆27Updated 2 years ago
• viktorleis / mmapbench
  ☆146Updated 3 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆147Updated 2 years ago
• luyi0619 / star
  GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication
  ☆22Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆56Updated last year
• wheatman / BP-Tree
  ☆15Updated 11 months ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 9 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• Thesys-lab / sosp23-s3fifo
  The repo for SOSP23 paper: FIFO queues are all you need for cache evictions
  ☆136Updated last year
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆93Updated last year
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• viktorleis / vmcache
  ☆79Updated 3 months ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated last month
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• zz-jason / leanstore
  LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.
  ☆46Updated this week
• sfu-dis / skeena
  Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)
  ☆21Updated 2 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago