Answers are grounded in this paper and cite their sources.
The problem of selecting secondary indices for a file so as to minimize the expected transaction cost was frequently analyzed before. We prove that it is NP-complete by reducing the MINIMUM SET COVER problem to it.
No takes yet. Share an insight, caveat, or question.
Gregory Piatetsky-Shapiro (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: