论文信息 - The optimal selection of secondary indices is NP-complete

The optimal selection of secondary indices is NP-complete

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.

Gregory Piatetsky-Shapiro

[1] Mario Schkolnick,et al. The Optimal Selection of Secondary Indices for Files , 1975, Inf. Syst..

[2] Vincent Y. Lum,et al. An optimization problem on the selection of secondary keys , 1971, ACM '71.

[3] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[4] Arvola Chan,et al. Index selection in a self-adaptive data base management system , 1976, SIGMOD '76.