This Article 
 Bibliographic References 
 Add to: 
Comments on an Optimal Set of Indices for a Relational Database
February 1992 (vol. 18 no. 2)
pp. 168-171

M. Y. L. Ip et al. solved the index selection problem for a relational database by reducing it to a classical knapsack problem and then applying an approximation algorithm. It is shown that this reduction process does not work in general by providing a counterexample, and its practical significance is discussed. It turns out that the main idea of Ip et al. need not be discarded. In particular, the approximation algorithm used can be adapted fairly easily to take care of the problems which were raised by the counterexample. In spite of its simplicity, this modification can lead to a reduced number of indices, which is rather attractive from a practical point of view.

[1] R. Bayer and E. McCreight, "Organization and maintenance of large ordered indices,"Acta Inform., vol. 1, pp. 173-189, 1972.
[2] M. Hammer and A. Chan, "Index selection in a self-adaptive database management system," inProc. 1976 ACM-SIGMOD Conf.(Washington, DC).
[3] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[4] M. Y. L. Ip, L. V. Saxton, and V. V. Raghavan, "On the selection of an optimal set of indexes,"IEEE Trans. Software Eng., vol. SE-9, pp. 135-143, Mar. 1983.
[5] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[6] M. Schkolnick, "The optimal selection of secondary indices for files,"Inform. Syst., vol. 1, pp. 141-146, 1975.

Index Terms:
index selection problem; relational database; classical knapsack problem; approximation algorithm; reduction process; approximation theory; database theory; optimisation; relational databases
B.-J. Falkowski, "Comments on an Optimal Set of Indices for a Relational Database," IEEE Transactions on Software Engineering, vol. 18, no. 2, pp. 168-171, Feb. 1992, doi:10.1109/32.121758
Usage of this product signifies your acceptance of the Terms of Use.