The paper claims an Omega(kappa * epsilon^2) lower bound on the expected number of keys per segment for piecewise-linear learned indexes, and benchmarks three fitting algorithms inside two index structures.
The pgm-index: a fully-dynamic com- pressed learned index with provable worst-case bounds,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Piecewise Linear Approximation in Learned Index Structures: Theoretical and Empirical Analysis
The paper claims an Omega(kappa * epsilon^2) lower bound on the expected number of keys per segment for piecewise-linear learned indexes, and benchmarks three fitting algorithms inside two index structures.