jungmair / STARTLinks
Self-Tuning Adaptive Radix Tree
☆27Updated 5 years ago
Alternatives and similar repositories for START
Users that are interested in START are comparing it to the libraries listed below
Sorting:
- ☆53Updated last year
- ☆38Updated 4 years ago
- Quickstep project☆42Updated 6 months ago
- ☆20Updated 2 years ago
- ☆70Updated 2 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated last month
- ☆28Updated 2 years ago
- ☆15Updated 5 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- HOT - Height Optimized Trie☆150Updated 7 years ago
- ☆47Updated last year
- ☆119Updated 3 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- A read-optimized learned index for unsorted data☆31Updated last year
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- ☆29Updated 5 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- A query compiler for GPUs that translates relational algebra to Cuda.☆21Updated last year
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆14Updated 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
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆55Updated last month
- NVM Evaluation Testbed☆29Updated 6 years ago