efficient / HOPELinks
Order-preserving key encoder
☆123Updated 5 years ago
Alternatives and similar repositories for HOPE
Users that are interested in HOPE are comparing it to the libraries listed below
Sorting:
- A Single-Pass Learned Index☆133Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 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
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆123Updated 9 months ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- ☆148Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Beta release of Masstree.☆442Updated last year
- ☆121Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 9 months ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- ☆289Updated 2 years ago
- Quickstep project☆42Updated 8 months ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…☆258Updated 6 years ago
- ☆54Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- ☆121Updated 2 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- pmwcas☆139Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆163Updated 3 years ago
- Multicore in-memory storage engine☆389Updated 7 years ago
- ☆47Updated last year