AN APPROXIMATION ALGORITHM FOR SECONDARY INDEX SELECTION IN RELATIONAL DATABASE PHYSICAL DESIGN

被引：11

作者：

BONANNO, R ^{[1
]}

MAIO, D ^{[1
]}

TIBERIO, P ^{[1
]}

机构：

[1] UNIV BOLOGNA,DIPARTIMENTO ELLETTR,CNR,CIOC,I-40126 BOLOGNA,ITALY

来源：

COMPUTER JOURNAL | 1985年 / 28卷 / 04期

关键词：

COMPUTER PROGRAMMING - Algorithms;

D O I：

10.1093/comjnl/28.4.398

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：398 / 405

页数：8