sears / mapkeeperLinks
Thrift based key-value store with various storage backends, including MySQL, Berkeley DB, and LevelDB.
☆16Updated 13 years ago
Alternatives and similar repositories for mapkeeper
Users that are interested in mapkeeper are comparing it to the libraries listed below
Sorting:
- LSM-trie☆114Updated 4 years ago
- Scalable Structural Index Constructor for JSON Analytics☆24Updated 10 months ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- ☆149Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- The Cicada engine☆58Updated 8 years ago
- A simple, reference implementation of a B^e-tree☆156Updated 6 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- A data structure and algorithm library built for TerarkDB☆66Updated 3 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Core storage engine - UM and PM Process code☆119Updated this week
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- Adaptive Radix Tree in C++☆45Updated 2 weeks ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Embedded DB Benchmark Framework☆61Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago