Estimating the cost of updates in a relational database

In this paper, cost formulas are derived for the updates of data and indexes in a relational database. The costs depend on the data scan type and the predicates involved in the update statements. We show that update costs have a considerable influence, both in the context of the physical database design problem and in access path selection in query optimization for relational DBMSs.

[1]  P. Bruce Berra,et al.  Minimum cost selection of secondary indexes for formatted files , 1977, TODS.

[2]  Donald D. Chamberlin,et al.  SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control , 1976, IBM J. Res. Dev..

[3]  Ketil Bo,et al.  Data Base Design , 1980, CAD Advanced Course.

[4]  Gio Wiederhold,et al.  Database Design , 1977 .

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

[6]  Alice U. Jones.  A User-Oriented Data-Base Retrieval System , 1977, IBM Syst. J..

[7]  Arvola Chan,et al.  Index selection in a self-adaptive data base management system , 1976, SIGMOD '76.

[8]  Anne Putkonen.  On the selection of the access path in inverted database organization , 1979, Inf. Syst..

[9]  Mario Schkolnick,et al.  The Optimal Selection of Secondary Indices for Files , 1975, Inf. Syst..

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

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

[12]  Robert E. Bleier,et al.  File organization in the SDC Time-Shared Data Management System (TSMS) , 1968, IFIP Congress.

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

[14]  John G. Kollias.  A heuristic approach for determining the optimal degree of file inversion , 1979, Inf. Syst..

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

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

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

[18]  Gio Wiederhold,et al.  Separability - an approach to physical data base design , 1981, VLDB 1981.

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

[20]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[21]  Stavros Christodoulakis,et al.  Implications of certain assumptions in database performance evauation , 1984, TODS.

[22]  Paolo Tiberio,et al.  On Estimating Access Costs in Relational Databases , 1984, Inf. Process. Lett..

[23]  M. W. Blasgen,et al.  Storage and Access in Relational Data Bases , 1977, IBM Syst. J..

[24]  Irving L. Traiger,et al.  A history and evaluation of System R , 1981, CACM.