Alternatives and similar repositories for KiD

Users that are interested in KiD are comparing it to the libraries listed below

• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆91Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• luyi0619 / aria
  GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database
  ☆72Updated last year
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆198Updated last year
• shanzi / NvmEngine
  Experimental KV store engine on non-volatile memory
  ☆72Updated 4 years ago
• zettadb / kunlun-storage-081809
  Kunlun-storage is the storage component for Kunlun distributed DBMS. It's developed based on percona-mysql-8.0.x and contains exclusive f…
  ☆32Updated 3 years ago
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 5 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆75Updated 3 years ago
• JimChengLin / levi-db
  levi-db is a fast database engine
  ☆36Updated 7 years ago
• pentium3 / AutoTiKV
  ☆21Updated 2 years ago
• yongwen / columbia
  An efficient database query optimizer for large complex join queries
  ☆130Updated 2 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆115Updated 2 years ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆201Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 7 months 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
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 4 years ago
• eyalroz / c-store
  C-Store : A column-oriented DBMS prototype (frozen)
  ☆45Updated 4 years ago
• daseECNU / Cedar
  A distributed, shared-nothing relational database
  ☆63Updated 6 years ago
• jecyhw / tair-contest2
  第二届数据库大赛—Tair性能挑战复赛代码
  ☆19Updated 4 years ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 3 years ago
• PingCAP-QE / horoscope
  horoscope is an optimizer inspector for DBMS.
  ☆36Updated 4 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• 4paradigm / pmemstore
  Key/Value Datastore for Persistent Memory
  ☆27Updated 3 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆100Updated 2 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• memKeyDB / memKeyDB
  MemKeyDB is a fork of Redis, adjusted to store objects on both Intel Optane Persistent Memory and DRAM.
  ☆77Updated 10 months ago
• yxymit / DBx1000
  ☆288Updated 2 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago