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"☆81Updated 7 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- ☆143Updated 2 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- A Benchmark for Learned Indexes☆278Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 5 months ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆19Updated 3 years ago
- ☆116Updated 2 years ago
- Learned Index Structures☆50Updated 6 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 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…☆121Updated 5 months ago
- ☆15Updated 8 years ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆144Updated 6 years ago
- HOT - Height Optimized Trie☆146Updated 6 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 6 years ago
- pmwcas☆136Updated last year
- A Single-Pass Learned Index☆131Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- ☆38Updated 4 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆114Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- FOEDUS main source code repository☆64Updated 7 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated last year