Alternatives and similar repositories for Concurrent-Skip-list

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

• zz-jason / leanstore
  LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…
  ☆39Updated this week
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• luyi0619 / star
  GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication
  ☆22Updated 6 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆60Updated 2 months ago
• viktorleis / mmapbench
  ☆137Updated 2 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 3 years ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆25Updated last year
• viktorleis / vmcache
  ☆70Updated 3 months ago
• flode / ARTSynchronized
  ☆120Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• wheatman / BP-Tree
  ☆13Updated 5 months ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆76Updated 3 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆49Updated last year
• purduedb / OpenAurora
  OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …
  ☆93Updated 3 weeks ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆58Updated 2 months ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆36Updated 2 weeks ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆101Updated 2 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆109Updated 9 months ago
• sfu-dis / skeena
  Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)
  ☆21Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• giorgospan / Radix-Hash-Join
  Radix Hash Join - SIGMOD Contest 2018.
  ☆33Updated 6 years ago
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 3 months ago
• cloud-olap / FlexPushdownDB
  ☆72Updated 3 months ago
• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 2 years ago
• CloudOLTP / Cornus
  ☆21Updated 2 years ago