An Approximation Algorithm for Secondary Index Selection in Relational Database Physical Design
Open Access
- 1 January 1985
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 28 (4) , 398-405
- https://doi.org/10.1093/comjnl/28.4.398
Abstract
The operational efficiency of a relational DBMS is greatly dependent on the effectiveness of the physical design. A problem of considerable interest for the DBA is to provide an efficient set of access structures taking into account both memory constraints and workload characteristics. The paper presents an approximation algorithm which produces a near-optimal solution to the secondary index selection problem for the entire set of DB relations, given that primary access structures have already been chosen.Keywords
This publication has 0 references indexed in Scilit: