stanford-futuredata / index-baselines
Simple baselines for "Learned Indexes"
☆159Updated 7 years ago
Alternatives and similar repositories for index-baselines:
Users that are interested in index-baselines are comparing it to the libraries listed below
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆80Updated 7 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆142Updated last year
- A Single-Pass Learned Index☆130Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- The recursive model index, a learned index structure☆219Updated 2 years ago
- ☆116Updated 2 years ago
- A transactional main-memory database system on multicores☆102Updated 6 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- A simple, reference implementation of a B^e-tree☆151Updated 5 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 6 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆112Updated last year
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆87Updated 2 years ago
- A Benchmark for Learned Indexes☆274Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Learned Index Structures☆50Updated 6 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 8 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- pmwcas☆135Updated last year
- ☆37Updated 4 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 3 months ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 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…☆119Updated 3 months ago
- Concurrency Control Benchmark☆46Updated last year
- FOEDUS main source code repository☆63Updated 7 years ago