The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
| Hi-index | 0.00 |
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.