stanford-futuredata / index-baselinesLinks
Simple baselines for "Learned Indexes"
☆160Updated 8 years ago
Alternatives and similar repositories for index-baselines
Users that are interested in index-baselines are comparing it to the libraries listed below
Sorting:
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- The recursive model index, a learned index structure☆229Updated 3 months ago
- ☆150Updated 2 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 7 years ago
- Order-preserving key encoder☆127Updated 5 years ago
- A Benchmark for Learned Indexes☆300Updated 3 years ago
- Learned Index Structures☆52Updated 7 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- A Single-Pass Learned Index☆137Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- Sundial: A distributed OLTP database testbed.☆39Updated 5 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 7 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- ☆125Updated 3 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- A transactional main-memory database system on multicores☆106Updated 7 years ago
- pmwcas