Tokutek / ft-index
This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
☆94Updated 5 years ago
Alternatives and similar repositories for ft-index:
Users that are interested in ft-index are comparing it to the libraries listed below
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆176Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- The Cicada engine☆57Updated 7 years ago
- PerconaFT is a high-performance, transactional key-value store☆561Updated last year
- LSM-trie☆114Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 6 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- A working project for High-concurrency B-tree source code in C☆250Updated 4 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- Beta release of Masstree.☆441Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Order-preserving key encoder☆122Updated 5 years ago
- ☆143Updated 2 years ago
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- QSBR and EBR library☆119Updated 5 years ago
- SPDK RocksDB mirror☆33Updated 9 months ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.☆460Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- NVM key-value store API lIbrary repository.☆88Updated 11 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆55Updated 4 years ago
- Yet Another RAFT implementation☆126Updated 6 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago