Lexicographic direct access under functional dependencies is characterized: unary FDs are tight via reordered extensions, general FDs have a PANDA/polymatroid-based algorithm and color-number lower bounds that meet exactly at the linear-preprocessing threshold.
A simple algorithm for worst case optimal join and sampling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lexicographic Direct Access with Functional Dependencies
Lexicographic direct access under functional dependencies is characterized: unary FDs are tight via reordered extensions, general FDs have a PANDA/polymatroid-based algorithm and color-number lower bounds that meet exactly at the linear-preprocessing threshold.