Abstract
The paper presents a pragmatic approach to the workload analysis in relational database systems. A set of extensional and statistical parameters is proposed, that can be easily estimated for the permanent relations of the database, and then computed for any derived relation. In this way arbitrarily complex transactions can be analized.
Both data the data access cost and the processing cost are considered. The latter is usually neglected, but may become a relevant aspect in relational systems, and provides an important information in the design and configuration of specialized systems, like database machines.
The proposed methodology may also be valuable in database design, both at the physical and at the logical level. In fact it allows to compare on a quantitative basis different logical schema for the same application, and suggests the appropriate actions to improve the hysical data organization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
Bancilhon F. et al.: VERSO, A Relational Backend Database Machine, in Advanced Database Machine Architectures, D. K. Hsiao ed., Prentice-hall 1983.
Cheung T.: A Statistical Method for Estimating the Number of Records in a Relational Database, Inf. Proc. Lett. Vol. 15 No. 3, Oct 82.
Christodoulakis S.: Estimating Block Transfers and Join Sizes, Proc. ACM-SIGMOD 1983, pp. 40–54.
Codd E. F.: Extending the Database Relational Model to Capture More Meaning, ACM TODS, Vol. 4, No. 4, Dec. 1979, pp. 397–434.
Demolombe R.: Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language, Proc. VLDB 1980, pp.55–63.
Gelembe E., Gardy D.: The Size of Projections of Relations Satisfying a Functional Dependency, Proc. VLDB 1982, pp.325–333.
Gonzales-Rubio R., Rohmer J., Terral D.: The SHUSS Filter: a Processor for Non-Numerical Data Processing, 11th Annual International Symposium on Computer Architecture, Ann Arbor, Michigan, June 84.
Hawthorn P. B.: The Effect of Target Applications on the Design of Database Machines, Proc. ACM SIGMOD 1981, pp. 188–197.
Richard P.: Evaluation of the Size of a Query Expressed in Relational Algebra, ACM SIGMOD 1981, pp. 155–163.
Rosenthal A. S.: Note on the Expected Size of a Join, SIGMOD Rec. Vol. 11 No. 4.
Salza S., Terranova M .: A Methodology for the Analysis of the Workload in Relational Database Systems, Report R-97 of Istituto di Analisi dei Sistemi ed Informatica del CNR, 1984.
Salza S., Terranova M., Velardi P.: Performance Modelling of the DBMAC Architecture, Proc. 3rd International Workshop on Database Machines, Munich Sept. 83, pp. 74–90.
Sevcik K. C.: Data Base System Performance Prediction Using An Analytical Model, Proc. VLDB 1981, pp. 182–198.
Wang K., Wiederhold G., Sagalowicz D.: Separability—An Approach to Physical Database Design, IEEE Trans. on Computers, Vol. C-33 No. 3, March 84, pp. 209–222
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Salza, S., Terranova, M. (1985). Workload Modeling for Relational Database Systems. In: DeWitt, D.J., Boral, H. (eds) Database Machines. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5144-6_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5144-6_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96200-9
Online ISBN: 978-1-4612-5144-6
eBook Packages: Springer Book Archive