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)
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Index Selection in Relational Databases
MFDBS '89 Proceedings of the 2nd Symposium on Mathematical Fundamentals of Database Systems
The index suggestion problem for object database applications
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
A Framework for Automating Physical Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Compressing Very Large Database Workloads for Continuous Online Index Selection
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
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
| Hi-index | 0.00 |
When planning a database, the problem of index selection is of particular interest. The authors examine a transaction model that includes queries, updates, insertions, and deletions, and they define a function that calculates the transaction's total cost when an index set is used. Their aim is to minimize the function cost in order to identify the optimal set. The algorithms proposed in other studies require an exponential time in the number of attributes in order to solve the problem. The authors propose a heuristic algorithm based on some properties of the cost function that produces an almost optimal set in polynomial time. In many cases, the cost function properties make it possible to prove that the solution obtained is the optimal one.