A modular user-oriented decision support for physical database design
Decision Support Systems
Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
Integer and combinatorial optimization
Integer and combinatorial optimization
Optimal Selection of Secondary Indexes
IEEE Transactions on Software Engineering
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Comments on an Optimal Set of Indices for a Relational Database
IEEE Transactions on Software Engineering
On Workload Characterization of Relational Database Environments
IEEE Transactions on Software Engineering
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
The Design of the XMP Linear Programming Library
ACM Transactions on Mathematical Software (TOMS)
Analysis and performance of inverted data base structures
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Modeling on-line rebalancing with priorities and executing on parallel database systems
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Exact and inexact methods for selecting views and indexes for OLAP performance improvement
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An index selection method without repeated optimizer estimations
Information Sciences: an International Journal
A genetic algorithm for the index selection problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Selecting materialized views for RDF data
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering
| Hi-index | 0.00 |
The index selection problem (ISP) is an important optimization problem in the physical design of databases. The aim of this paper is to show that ISP, although NP-hard, can in practice be solved effectively through well-designed algorithms. We formulate ISP as a 0-1 integer linear program and describe an exact branch-and-bound algorithm based on the linear programming relaxation of the model. The performance of the algorithm is enhanced by means of procedures to reduce the size of the candidate index set. We also describe heuristic algorithms based on the solution of a suitably defined knapsack subproblem and on Lagrangian decomposition. Finally, computational results on several classes of test problems are given. We report the exact solution of large-scale ISP instances involving several hundred indexes and queries. We also evaluate one of the heuristic algorithms we propose on very large-scale instances involving several thousand indexes and queries and show that it consistently produces very tight approximate (and sometimes provably optimal) solutions. Finally, we discuss possible extensions and future directions of research.