cuckoo-trie / cuckoo-trie-codeLinks
☆54Updated last year
Alternatives and similar repositories for cuckoo-trie-code
Users that are interested in cuckoo-trie-code are comparing it to the libraries listed below
Sorting:
- An open-source BzTree implementation☆92Updated 3 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆70Updated 3 months ago
- ☆29Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated 2 months ago
- ☆47Updated last year
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆20Updated 2 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- ☆121Updated 3 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆51Updated 4 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- ☆20Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 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
- 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
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆73Updated 2 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- ☆15Updated 5 years ago
- ☆148Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 8 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆47Updated 2 years ago
- A query compiler for GPUs that translates relational algebra to Cuda.☆21Updated last year
- ☆14Updated 5 months ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆61Updated 2 months ago
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- ☆137Updated 2 years ago