AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
cs.DS, cs.DB, q-bio.GN
Submitted: 2026-03-25
Updated: 2026-03-25
Code: https://github.com/detorresramos/CaramelDBBenchmarks
Terminology
Sources
- CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
- Learned Static Function Data Structures
- Partitioned Learned Bloom Filter
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles