DataOceanLab / GLIN
A lightweight learned index for spatial range queries on complex geometries
☆12Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for GLIN
- A Recursive Spatial Model Index☆38Updated 8 months ago
- ☆39Updated 3 years ago
- ☆19Updated 2 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆20Updated 3 years ago
- Distributed In-Memory Trajectory Analytics☆37Updated 6 years ago
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆18Updated 8 months ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆141Updated 5 years ago
- NFL: Robust Learned Index via Distribution Transformation☆20Updated last year
- A Distribution-driven Learned Index☆12Updated last year
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- A Benchmark for Learned Indexes☆275Updated 2 years ago
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆23Updated last year
- ☆32Updated last year
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year
- a fully learned index for larger-than-memory databases☆13Updated 2 years ago
- Implementation of DeepDB: Learn from Data, not from Queries!☆92Updated last year
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆15Updated 5 years ago
- A new cardinality estimation scheme for join query estimation☆31Updated 2 weeks ago
- A read-optimized learned index for unsorted data☆31Updated last year
- The recursive model index, a learned index structure☆219Updated 2 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆10Updated 2 years ago
- Neural Relation Understanding: neural cardinality estimators for tabular data☆99Updated 3 years ago
- ☆68Updated last year
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆80Updated 6 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆11Updated 3 years ago
- ☆14Updated last year
- ☆13Updated 2 years ago
- Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)☆114Updated 5 years ago
- A set of learned index papers w/o notes☆12Updated 6 months ago