Database Cost Analysis: a Top-Down Approach.

@inproceedings{DBLP:conf/sigmod/Merrett77,
  author    = {T. H. Merrett},
  editor    = {Diane C. P. Smith},
  title     = {Database Cost Analysis: a Top-Down Approach},
  booktitle = {Proceedings of the 1977 ACM SIGMOD International Conference on
               Management of Data, Toronto, Canada, August 3-5, 1977},
  publisher = {ACM},
  year      = {1977},
  pages     = {135-143},
  ee        = {http://doi.acm.org/10.1145/509404.509426, db/conf/sigmod/Merrett77.html},
  crossref  = {DBLP:conf/sigmod/77},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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. Thepaper 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.

Copyright © 1977 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/smod7592 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

Online Edition: ACM Digital Library

References

[1]

...

[2]

George G. Dodd: Elements of Data Management Systems. ACM Comput. Surv. 1(2): 117-133(1969) BibTeX

[3]

...

[4]

...

[5]

Vincent Y. Lum, Michael E. Senko, C. P. Wang, H. Ling: A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies. Commun. ACM 18(6): 318-322(1975) BibTeX

[6]

...

[7]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[8]

Dennis G. Severance, Richardo Duhne: A Practitioner's Guide To Addressing Algorithms. Commun. ACM 19(6): 314-326(1976) BibTeX

[9]

Alfonso F. Cardenas: Analysis and Performance of Inverted Data Base Structures. Commun. ACM 18(5): 253-263(1975) BibTeX

[10]

James B. Rothnie Jr., Tomas Lozano: Attribute Based File Organization in a Paged Memory Environment. Commun. ACM 17(2): 63-69(1974) BibTeX

[11]

...

[12]

S. J. Waters: Hit Ratios. Comput. J. 19(1): 21-24(1976) BibTeX

[13]

S. Bing Yao, K. Sundar Das, Toby J. Teorey: A Dynamic Database Reorganization Algorithm. ACM Trans. Database Syst. 1(2): 159-174(1976) BibTeX

[14]

K. Maruyama, S. E. Smith: Optimal Reorganization of Distributed Space Disk Files. Commun. ACM 19(11): 634-642(1976) BibTeX

[15]

Alfonso F. Cardenas: Evaluation and Selection of File Organization - A Model and System. Commun. ACM 16(9): 540-548(1973) BibTeX

[16]

...

[17]

...

[18]

...

[19]

Vincent Y. Lum: General Performance Analysis of Key-to-Address Transformation Methods Using an Abstract File Concept. Commun. ACM 16(10): 603-612(1973) BibTeX

[20]

...

[21]

...

[22]

...

[23]

Mario Schkolnick: Secondary Index Optimization. SIGMOD Conference 1975: 186-192 BibTeX

[24]

Gilles Farley, Stewart A. Schuster: Query Execution and Index Selection for Relational Data Bases. VLDB 1975: 519 BibTeX

[25]

...

[26]

Michael Hammer, Arvola Chan: Index Selection in a Self-Adaptive Data Base Management System. SIGMOD Conference 1976: 1-8 BibTeX

[27]

...

[28]

...

[29]

Mark J. Eisner, Dennis G. Severance: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases. J. ACM 23(4): 619-635(1976) BibTeX

[30]

Jair M. Babad: A Record and File Partitioning Model. Commun. ACM 20(1): 22-31(1977) BibTeX

[31]

...

[32]

...

[33]

...

[34]

...

[35]

...

[36]

Howard L. Morgan, K. Dan Levin: Optimal Program and Data Locations in Computer Networks. Commun. ACM 20(5): 315-322(1977) BibTeX

[37]

...

[38]

Shi-Kuo Chang: Data Base Decomposition in a Hierarchical Computer System. SIGMOD Conference 1975: 48-53 BibTeX

[39]

Leo R. Gotlieb: Computing Joins of Relations. SIGMOD Conference 1975: 55-63 BibTeX

[40]

Ben Shneiderman: Optimum Data Base Reorganization Points. Commun. ACM 16(6): 362-365(1973) BibTeX

[41]

...

[42]

...

[43]

Toby J. Teorey, K. Sundar Das: Application of an Analytical Model to Evaluate Storage Structures. SIGMOD Conference 1976: 9-19 BibTeX

Referenced by

1. Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984)
2. Kenneth C. Sevcik: Data Base System Performance Prediction Using an Analytical Model (Invited Paper). VLDB 1981: 182-198