FrankBro / be-treeLinks
BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Space
☆41Updated last year
Alternatives and similar repositories for be-tree
Users that are interested in be-tree are comparing it to the libraries listed below
Sorting:
- General purpose C++ library for iZENECloud☆42Updated 10 years ago
- A high-performance distributed shared-log for Ceph☆115Updated 5 years ago
- A C implementation of OpenHistogram log-linear histograms☆114Updated 2 years ago
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆104Updated 9 months ago
- Order-preserving key encoder☆122Updated 5 years ago
- A Swiss Army knife for read-write quorum systems☆84Updated 4 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- ActorDB main source☆46Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- Cache-Sensitive Skip List.☆22Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- A project to implement Augmented Time☆50Updated 11 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- ☆28Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆72Updated 4 years ago
- Central build environment for Smyte C++ projects.☆47Updated 6 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- Append-only key-value database on a distributed shared-log☆49Updated 10 months ago
- W-TinyLFU cache C++11 header only implementation☆60Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 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
- Wannabe Main Memory Database and More☆53Updated 4 years ago
- Concurrent trie-hash map library☆92Updated last year
- An Elastic, Tiered-Storage Service☆30Updated 6 years ago