efficient / HOPE
Order-preserving key encoder
☆122Updated 5 years ago
Alternatives and similar repositories for HOPE
Users that are interested in HOPE are comparing it to the libraries listed below
Sorting:
- ☆143Updated 2 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…☆122Updated 7 months ago
- HOT - Height Optimized Trie☆150Updated 7 years ago
- ☆287Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 7 months ago
- A Single-Pass Learned Index☆133Updated 2 years ago
- ☆119Updated 3 years ago
- Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…☆256Updated 6 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆89Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- Quickstep project☆42Updated 6 months ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- An adaptive radix tree for efficient indexing in main memory.☆159Updated last year
- ☆118Updated 2 years ago
- pmwcas☆137Updated 2 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆90Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆100Updated 2 years ago
- ☆60Updated 2 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year