Article

Free access

Database cost analysis: a top-down approach

Author:

T. H. MerrettAuthors Info & Claims

SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data

Pages 135 - 143

https://doi.org/10.1145/509404.509426

Published: 03 August 1977 Publication History

Abstract

A top-down approach is proposed for cost analysis for database and information system design. General principles are given which allow the analyst either to estimate rapidly the costs of a wide variety of alternatives or to investigate fewer possibilities in great detail. Techniques are developed which can be used at any level of the iterative design process - at the early stages or at the detailed phase of specific design. The paper applies the methods to the basic categories of file cost at the simpler levels of analysis and refers to the literature for more sophisticated analyses, which can be done within the framework provided here. Among the specific results developed are: the extension of a widely-used hit ratio formula to non-uniform usage distribution; the introduction of the "distribution of depths" for serial accesses; a general activity analysis and a volatility analysis for indexed sequential files.

References

[1]

Yao, S. B. (1974): Evaluation and Optimization of File Organizations through Analytic Modelling, Ph.D. Thesis, University of Michigan.

Digital Library

[2]

Dodd, G. G. (1969): Elements of Data Management Systems, Comput. Surveys 1, 2 (June 69), 117-33.

Digital Library

[3]

Lefkovitz, D. (1969): File Structures for On-Line Systems, Spartan, N.Y.

[4]

Hsiao, D. & F. Harary (1970): A Formal System for Information Retrieval from Files, Comm.ACM 13, 2 (Feb. 70), 67-73.

Digital Library

[5]

Lum, V. Y., M. E. Senko, C. P. Wang & H. Ling (1975) : A Cost-Oriented Algorithm for Data Set Allocation in Storage Hierarchies, Comm. ACM 18, 6 (June 75), 318-22.

Digital Library

[6]

Rustin, R., ed, (1974): Data Models: Data-Structure-Set versus Relational. ACM SIGMOD Workshop on Data Description, Access and Control, Ann Arbor, Mich. May 1-3, 1974.

[7]

Knuth, D. E. (1973): Sorting and Searching, The Art of Computer Programming Vol. III. Addison-Wesley, Reading, Mass.

Digital Library

[8]

Severance, D. & R. Duhne (1976): A Practitioner's Guide to Addressing Algorithms, Comm. ACM 19, 6 (June 76), 314-26.

Digital Library

[9]

Cardenas, A. F. (1975): Analysis and Performance of Inverted Data Base Structures, Comm. ACM 18, 5 (May 75), 253-63.

Digital Library

[10]

Rothnie, J. B. & T. Lozano (1974): Attribute Based File Organization in a Paged Memory Environment, Comm. ACM 17, 2 (Feb. 74), 63-9.

Digital Library

[11]

Yue, P. C. & C. K. Wong (1975): Storage Cost Considerations in Secondary Index Selection, Int. J. Comp. & Inf. Sci. 4, 4, 307-28.

[12]

Waters, S. J. (1976): Hit Ratios, Comp. J. 19, 1 (Feb. 76), 21-4.

[13]

Yao, S. B., K. S. Das & T. J. Teory (1976): A Dynamic Database Reorganization Algorithm, T.O.D.S. 1, 2, 159-74.

Digital Library

[14]

Marayuma, K. & S. E. Smith (1976): Optimal Reorganization of Distributed Space Disk Files, Comm. ACM 19, 11 (Nov. 76), 634-42.

Digital Library

[15]

Cardenas, A. F. (1973): Evaluation and Selection of File Organization - a Model and System, Comm. ACM 16, 9 (Sept. 73), 540-8.

Digital Library

[16]

Heising, W. P. (1963): Note on Random Addressing Techniques, IBM Syst. J. 2, June. 112-6.

Digital Library

[17]

Olsen, C. A. (1969): Random Access File Organization for Indirectly Addressed Records, Proc. ACM Nat. Conf. 24, 539-49.

Digital Library

[18]

Lum, V. Y., P. S. T. Yuen & M. Dodd (1971): Key-to-Address Transformation Techniques: A Fundamental Performance Study on Large Existing Formatted Files, Comm. ACM 14, 4 (April 71), 228-39.

Digital Library

[19]

Lum, V. Y. (1974): General Performance Analysis of Key-to-Address Transformation Methods using an Abstract File Concept, Comm. ACM 16, 10 (Oct. 74), 603-12.

Digital Library

[20]

Lum, V. Y. & H. Ling (1971): An Optimization Problem on the Selection of Secondary Keys, Proc. ACM Nat. Conf. 26, 349-56.

Digital Library

[21]

King, W. F. (1974): On the Selection of Indices for a File, IBM Research Report RJ-1341.

[22]

Stonebraker, M. (1974): The Choice of Partial Inversions and Combined Indices, Int. J. Comp. & Inf. Sci. 3, 2, 167-88.

[23]

Schkolnick, M. (1975): Secondary Index Optimization, Proc. SIGMOD Int. Conf. on Management of Data, San Jose, May 75, 186-92.

Digital Library

[24]

Farley, J. H. G. & S. A. Schuster (1975): Query Execution and Index Selections for Relational Data Bases, University of Toronto, CSRG-53.

[25]

Held, G. D. (1975): Storage Structures for Relational Data Base Management Systems, Electronics Research Laboratory, Berkeley, Memorandum ERL-M533, Aug. '75.

[26]

Hammer, M. & A. Chan (1976): Index Selection in a Self-Adaptive Data Base Management System, Proc. SIGMOD Int. Conf. on Management of Data, Washington, June 76, 1-8.

[27]

Stonebraker, M. (1975): A Comparison of the Use of Links and Secondary Indices in a Relational Data Base System, Electronics Research Laboratory, Berkeley, Memorandum ERL-M591, Sept. 75.

[28]

Bernstein, P. A. (1975): Normalization and Functional Dependencies in the Relational Data Model, University of Toronto, CSRG-60.

[29]

Eisner, M. J. & D. G. Severance (1976): Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases, JACM 23, 4 (Oct. 76), 619-35.

Digital Library

[30]

Babad, J. M. (1977): A Record and File Partitioning Model, Comm. ACM 20, 1 (Jan. 77), 22-30.

Digital Library

[31]

Arora, S. R. & A. Gallo (1971): Optimal Sizing, Loading and Reloading in a Multilevel Memory Hierarchy System, Proc. AFIPS 1971 SJCC, 38, 337-44.

[32]

Chu, W. W. (1969): Optimal File Allocation in a Multi-Computer Information System, IEEE Trans. on Computers, C-18, 10 (Oct. 69), 885-9.

[33]

Casey, R. G. (1972): Allocation of Copies of a File in an Information Network, Proc. AFIPS SJCC, 40 (May 72), 617-25.

[34]

Foley, J. D. & E. H. Brownlee (1974): A Model of Distributed Processing in Computer Networks, with Application to Satellite Graphics, Proc. Int. Conf. Computer Communications, Stockholm, Aug. 74, 330-6.

[35]

Urano, Y., K. Ono & S. Inoue (1974): Optimal Design of Distributed Networks, Proc. Int. Conf. Computer Communications, Stockholm, Aug. 74, 413-20.

[36]

Morgan, H. L. & K. D. Levin (1974): Optimal Program and Data Locations in Computer Networks, University of Pennsylvania, Dept. of Decision Sciences, Report 74-10-01.

[37]

Howson, H. R., L. R. Amey & W. D. Thorpe (1974): Parametric Cost Models to Evaluate Strategies in the Design of a National Databank, Dept. of Communications, Ottawa, May 74.

[38]

Chang, S. K. (1975): Data Base Decomposition in a Hierarchical Computer System, ACM SIGMOD Int. Conf. on Management of Data, San Jose, May 75, 48-53.

Digital Library

[39]

Gotlieb, L. R. (1975): Computing Joins of Relations, ACM SIGMOD Int. Conf. on Management of Data, San Jose, May 75, 55-63.

Digital Library

[40]

Schneiderman, B. (1973): Optimum Data Base Reorganization Points, Comm. ACM 16, 6 (June 73), 362-5.

Digital Library

[41]

Martin, J. (1967): Design of Real-Time Computer Systems, Prentice-Hall, Englewood Cliffs, N.J.

Digital Library

[42]

Senko, M. E., V. Y. Lum & P. Owens (1968): A File Organization Evaluation Model (FOREM), Proc. IFIPS, Aug. 68, 514-9.

[43]

Teory, T. J. & K. S. Das (1976): Application of an Analytical Model to Evaluate Storage Structures, Proc. SIGMOD Int. Conf. on Management of Data, Washington, June 76, 9-20.

Cited By

Sevcik K(1981)Data base system performance prediction using an analytical model (invited paper)Proceedings of the seventh international conference on Very Large Data Bases - Volume 710.5555/1286831.1286850(182-198)Online publication date: 9-Sep-1981
https://dl.acm.org/doi/10.5555/1286831.1286850

Recommendations

Production Cost Analysis of Plastic Woven Sack Manufacturer
IMMS '20: Proceedings of the 3rd International Conference on Information Management and Management Science

The plastic woven sack industry in Thailand is increasingly growing and competitive due to a lot of operators and price competition. The accuracy of production cost is vital for decision making in management, effect to selling price and impact the ...
On the optimality of multi item integrated production inventory systems
ASMCSS'09: Proceedings of the 3rd International Conference on Applied Mathematics, Simulation, Modelling, Circuits, Systems and Signals

In some industrial systems like petrochemicals, the same raw materials are used in producing several products. However, most of the classical production inventory systems treat the economic order quantities (EOQ) of raw materials, which are used in ...
Cost analysis of object-oriented bytecode programs

Cost analysis statically approximates the cost of programs in terms of their input data size. This paper presents, to the best of our knowledge, the first approach to the automatic cost analysis of object-oriented bytecode programs. In languages such as ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data

August 1977

181 pages

ISBN:9781450373432

DOI:10.1145/509404

Conference Chair:
J. B. Fry
University of Michigan
,
General Chair:
W. Frank King
IBM Research Lab
,
Program Chair:
Diane C. P. Smith
University of Utah

Copyright © 1977 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 August 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
1,058
Total Downloads

Downloads (Last 12 months)138
Downloads (Last 6 weeks)19

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sevcik K(1981)Data base system performance prediction using an analytical model (invited paper)Proceedings of the seventh international conference on Very Large Data Bases - Volume 710.5555/1286831.1286850(182-198)Online publication date: 9-Sep-1981
https://dl.acm.org/doi/10.5555/1286831.1286850

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents