Implications of certain assumptions in database performance evauation
- 3 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 9 (2) , 163-186
- https://doi.org/10.1145/329.318578
Abstract
The assumptions of uniformity and independence of attribute values in a file, uniformity of queries, constant number of records per block, and random placement of qualifying records among the blocks of a file are frequently used in database performance evaluation studies. In this paper we show that these assumptions often result in predicting only an upper bound of the expected system cost. We then discuss the implications of nonrandom placement, nonuniformity, and dependencies of attribute values on database design and database performance evaluation.Keywords
This publication has 18 references indexed in Scilit:
- Estimating block selectivitiesInformation Systems, 1984
- Design Considerations for a Message File ServerIEEE Transactions on Software Engineering, 1984
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Optimal partial-match retrieval when fields are independently specifiedACM Transactions on Database Systems, 1979
- Performance evaluation of a relational associative processorACM Transactions on Database Systems, 1977
- Minimum cost selection of secondary indexes for formatted filesACM Transactions on Database Systems, 1977
- A cost oriented algorithm for data set allocation in storage hierarchiesCommunications of the ACM, 1975
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973