On Estimating Access Costs in Relational Databases

Proposition d'une methode operationnelle pour l'evaluation du cout pour l'accession aux tuples d'une relation via un index

[1]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[2]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[3]  S. B. Yao,et al.  Optimization of query evaluation algorithms , 1979, ACM Trans. Database Syst..

[4]  Paolo Tiberio,et al.  Considerations in developing a design tool for a relational DBMS , 1979, COMPSAC.

[5]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[6]  Clement T. Yu,et al.  On the estimation of the number of desired records with respect to a given query , 1978, TODS.

[7]  Gio Wiederhold,et al.  Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.

[8]  To-Yat Cheung.  A Statistical Model for Estimating the Number of Records in a Relational Database , 1982, Inf. Process. Lett..

[9]  W. S. Luk.  On estimating block accesses in database organizations , 1983, CACM.

[10]  Paolo Tiberio,et al.  A Separability-Based Method for Secondary Index Selection in Physical Database Design , 1983, Methodology and Tools for Data Base Design.

[11]  Won Kim,et al.  Performance of the System R Access Path Selection Mechanism , 1980, IFIP Congress.

[12]  Stavros Christodoulakis,et al.  Estimating selectivities in data bases , 1982 .

[13]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[14]  S. Christodoulakis.  A Multivariate Statistical Model for Data Base Performance Evaluation , 1982 .

[15]  Alfonso F. Cardenas.  Analysis and performance of inverted data base structures , 1975, CACM.