Estimating the cost of updates in a relational database
- 1 June 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 10 (2), 163-179
- https://doi.org/10.1145/3857.3863
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- On estimating access costs in relational databasesInformation Processing Letters, 1984
- Implications of certain assumptions in database performance evauationACM Transactions on Database Systems, 1984
- PrefaceIBM Systems Journal, 1984
- A history and evaluation of System RCommunications of the ACM, 1981
- A heuristic approach for determining the optimal degree of file inversionInformation Systems, 1979
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Minimum cost selection of secondary indexes for formatted filesACM Transactions on Database Systems, 1977
- SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and ControlIBM Journal of Research and Development, 1976
- System RACM Transactions on Database Systems, 1976
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975