Alternatives and similar repositories for terark-zip

Users that are interested in terark-zip are comparing it to the libraries listed below

• topling / topling-zip
  A data structure and algorithm library built for ToplingDB
  ☆59Updated this week
• 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…
  ☆37Updated 7 months 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
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆69Updated 10 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• tikv / client-c
  The C++ TiKV client used by TiFlash.
  ☆39Updated 2 months ago
• algo-data-platform / LaserDB
  distributed kv store
  ☆41Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated last month
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 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
• krareT / terark-base
  terark basic library
  ☆25Updated 6 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆198Updated last year
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• ClickHouse / libhdfs3
  HDFS file read access for ClickHouse
  ☆41Updated last month
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆159Updated last year
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 6 years ago
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• slow-steppers / NeighborHash
  A faster int-to-int hashmap implemented in C++.
  ☆42Updated 4 months ago
• giorgospan / Radix-Hash-Join
  Radix Hash Join - SIGMOD Contest 2018.
  ☆33Updated 6 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆147Updated 5 years ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 3 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• chloro-pn / tunnel
  Tunnel is a Pipeline Execution Engine based on C++20 coroutine
  ☆30Updated last year
• KernelMaker / blackwidow
  A library implements REDIS commands(Strings, Hashes, Lists, Sorted Sets, Sets, Keys, HyperLogLog) based on rocksdb
  ☆42Updated 5 years ago
• BU-DiSC / lethe-codebase
  ☆14Updated 3 years ago