Tokutek / ft-index
This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
☆93Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for ft-index
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Beta release of Masstree.☆432Updated last year
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆97Updated 6 years ago
- PerconaFT is a high-performance, transactional key-value store☆560Updated 7 months ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆172Updated 8 years ago
- A simple, reference implementation of a B^e-tree☆148Updated 5 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- LSM-trie☆114Updated 3 years ago
- ☆142Updated last year
- QSBR and EBR library☆116Updated 4 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- The Cicada engine☆56Updated 7 years ago
- A working project for High-concurrency B-tree source code in C☆246Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆98Updated 8 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- Embedded DB Benchmark Framework☆58Updated 3 years ago
- Multicore in-memory storage engine☆373Updated 7 years ago
- ☆282Updated 5 months ago
- A Distributed Key-Value Store for FAWN☆76Updated 14 years ago
- A transactional main-memory database system on multicores☆102Updated 6 years ago
- Key Value Store based on LevelDB☆110Updated 3 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆34Updated 4 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆149Updated 3 years ago
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆165Updated 7 months ago
- ☆50Updated 6 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago