Skip Navigation

The Computer Journal 1985 28(4):398-405; doi:10.1093/comjnl/28.4.398
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bananno, R.
Right arrow Articles by Tiberio, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Approximation Algorithm for Secondary Index Selection in Relational Database Physical Design

R. Bananno1 *, D. Maio2 § and P. Tiberio2 §

1 CRAI, Cosenza, Italy, 2 CIOC-CNR, Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Bologna, Italy

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.


* CRAI, Cosenza, Italy

§ CIOC-CNR, Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.