marcocosta97 / grafite
Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
☆13Updated 4 months ago
Alternatives and similar repositories for grafite:
Users that are interested in grafite are comparing it to the libraries listed below
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆38Updated 4 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆45Updated 10 months ago
- ☆14Updated 2 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated last month
- ☆53Updated 10 months ago
- ☆12Updated 3 years ago
- Reproducibility package for "Robust Join Processing with Diamond Hardened Joins"☆12Updated 9 months ago
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Updated 3 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆23Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Sequential implementation of the Rewired Memory Array.☆18Updated 5 years 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
- Source code of our implementation of the concurrent RMA☆12Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆14Updated last year
- ☆27Updated 5 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- ☆12Updated last year
- simd enabled column imprints☆11Updated 7 years ago
- Graphs analytics on collections of views!☆35Updated last year
- ☆28Updated 2 years ago
- ☆15Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆43Updated last week
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- Persistent Bloom Filter☆12Updated 6 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- ☆63Updated 3 weeks ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago