speedskater / hotLinks
HOT - Height Optimized Trie
☆150Updated 7 years ago
Alternatives and similar repositories for hot
Users that are interested in hot are comparing it to the libraries listed below
Sorting:
- ☆119Updated 3 years ago
- ☆144Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- 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)☆90Updated 2 years ago
- Order-preserving key encoder☆122Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 7 months ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- ☆53Updated last year
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆47Updated last year
- Key Value Store based on LevelDB☆113Updated 3 years ago
- ☆70Updated 2 months ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated last month
- The Cicada engine☆57Updated 7 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆91Updated 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
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆159Updated 3 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆55Updated 3 weeks ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- 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
- A version of RocksDB that uses persistent memory☆92Updated 6 months ago