Alternatives and similar repositories for ft-index

Users that are interested in ft-index are comparing it to the libraries listed below

• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆442Updated last year
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• percona / PerconaFT
  PerconaFT is a high-performance, transactional key-value store
  ☆562Updated last year
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 4 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆250Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 8 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 4 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆69Updated 11 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆88Updated 11 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆387Updated 7 years ago
• wangziqi2016 / index-microbench
  ☆146Updated 2 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 5 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆160Updated 3 years ago
• andy-yx-chen / cornerstone
  A C++ Raft implementation, project moved
  ☆24Updated 8 years ago
• spdk / rocksdb
  SPDK RocksDB mirror
  ☆33Updated 10 months ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆181Updated 7 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆206Updated 4 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 3 years ago
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆462Updated 9 years ago
• efficient / memc3
  MemC3
  ☆151Updated 8 years ago