efficient / HOPELinks
Order-preserving key encoder
☆126Updated 5 years ago
Alternatives and similar repositories for HOPE
Users that are interested in HOPE are comparing it to the libraries listed below
Sorting:
- HOT - Height Optimized Trie☆157Updated 7 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…☆125Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A Single-Pass Learned Index☆134Updated 2 years ago
- ☆150Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆83Updated 3 years ago
- ☆124Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- Quickstep project☆43Updated last year
- Sundial: A distributed OLTP database testbed.☆38Updated 5 years ago
- LSM-trie☆114Updated 4 years ago
- ☆291Updated 2 years ago
- Beta release of Masstree.☆447Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆158Updated 6 years ago
- Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…☆264Updated 7 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- The Cicada engine☆59Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago
- ☆74Updated 2 months ago
- ☆38Updated 5 years ago
- ☆121Updated 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
- An open-source BzTree implementation☆92Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"☆25Updated last year