This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Physical Database Design Evaluation System for CODASYL Databases
July 1988 (vol. 14 no. 7)
pp. 1010-1022

An interactive design tool for designing CODASYL databases is described. The system is composed of three main modules: a user interface, a transaction analyzer, and a core module. The user interface allows a designer to enter interactively information concerning a database design which is to be evaluated. The transaction analyzer allows the designer to specify the processing requirements in terms of typical logical transactions to be executed against the database and translates these logical transaction into physical transaction which access and manipulate the physical databases. The core module is the implementation of a set of analytical models and cost formulas developed for the manipulation of indexed sequential and hash-based files and CODASYL sets. These models and formulas account for the situation in which occurrences of multiple record types are stored in the same area. Also presented are the results of a series of experiments in which key design parameters are varied. The system is implemented in UCSD Pascal running on IBM PCs.

[1] H. D. Anderson and P. B. Berra, "Minimum cost selection of secondary indexes for formatted files,"ACM Trans. Database Syst., vol. 2, no. 1, pp. 68-90, Mar. 1977.
[2] D. S. Batory, "On searching transposed files,"ACM Trans. Data-base Syst., vol. 4, no. 4, pp. 531-544, Dec. 1979.
[3] D. S. Batory, "B+ trees and indexed sequential files: A performance comparison," inProc. ACM/SIGMOD 1981 Inf. Conf. Manugement of Data, Ann Arbor, MI, ACM, 1981, pp. 30-39.
[4] D. S. Batory, "Optimal file designs and reorganization points,"ACM Trans. Database Syst., vol. 7, no. 1, pp. 60-81, Mar. 1982.
[5] D. S. Batory, "A model of transactions on physical databases,"ACM Trans. Database Syst., vol. 7, no. 4, pp. 509-539, Dec. 1982.
[6] E. Berelian and K. B. Irani, "Evaluation and optimization," inProc. 4th Int. Conf. Very Large Data Bases, 1978, pp. 545-555.
[7] M. W. Blasgen and K. P. Eswaren, "Storage and access in relational databases,"IBM Syst. J., vol. 16, no. 4, pp. 363-377, 1977.
[8] I. Casas-Raposo, "Analytic modeling of database systems: The design of a System 2000 performance predictor," Dep. Comput. Sci., Univ. Toronto. Ont., Canada. Tech. Rep. 35, 1981.
[9] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[10] T. J. Gambino and R. Gerritsen, "A data base design decision support system," inProc. 4th Int. Conf. Very Large Data Bases, 1978, pp. 534-544.
[11] R. Gerritsen, "Cost effective database design: An integrated model," inProc. Conf. Advanced Information Systems Development Techniques Symp., Apr. 1977.
[12] H. Guttman, "R-trees: A dynamic index structure for spatial searching," inProc. ACM/SIGMOD Conf., 1984, pp. 47-56.
[13] J. A. Hoffer, "A clustering approach to the generation of subfiles for the design of a computer database," Ph.D. dissertation, Cornell Univ., Ithaca, NY, 1975.
[14] R. Katz and E. Wong, "An access path model for physical database design," inProc. ACM/SIGMOD Conf., 1980, pp. 22-29.
[15] D. G. Keehn and J. O. Lacy, "VSAM data set design parameters,"IBM Syst. J., vol. 13, no. 3, pp. 186-212, 1974.
[16] W. F. King, "On the selection of indices for a file," IBM Res. Lab., San Jose, CA, Rep. RJ 1341, 1974.
[17] H. Lam and S. Y. W. Su, "Modeling effective area and block size for physical design of CODASYL databases," Database Systems Research and Development Center, Univ. Florida, Gainesville, Tech. Rep., 1986.
[18] P. A. Larson, "Analysis of index-sequential files with overflow chaining,"ACM Trans. Database Syst., vol. 6, no. 4, pp. 671-680, Dec. 1981.
[19] P. A. Larson, "Performance analysis of linear hashing with partial expansions,"ACM Trans. Database Syst., vol. 7, no. 4, pp. 566- 587, Dec. 1982.
[20] P. A. Larson, "Linear hashing with overflow-handling by linear probing,"ACM Trans. Database Syst., vol. 10, no. 1, pp. 90-96, Mar. 1985.
[21] S. T. March and D. G. Severance, "The determination of efficient record segmentations and blocking factors for shared data files,"ACM Trans. Database Syst., vol. 2, no. 3, pp. 279-296, Sept. 1977.
[22] M. F. Mitoma and K. B. Irani, "Automatic data base schema design and optimization," inProc. First Int. Conf. Very Large Data Bases, 1975, pp. 286-321.
[23] B. Niamir, "Attribute partitioning in a self-adaptive relational data-base system," M.Sc. thesis, M.I.T., Cambridge, MA, Rep. MIT/ LCS/TR-192, 1978.
[24] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[25] M. Schkolnick, "The optimal selection of secondary indices for files,"Inform. Syst., vol. 1, pp. 141-146, 1975.
[26] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[27] D. G. Severance and R. Duhne, "A practitioner's guide to addressing algorithms,"Commun. ACM, vol. 19, no. 6, pp. 314-326, June 1976.
[28] D. Severance, "Differential files: their application to the maintenance of large databases,"ACM Trans. Data Base Syst., vol. 1, pp. 256-267, 1976.
[29] S. Y. W. Su and H. Lam, "A design tool for the analysis and evaluation of physical databases," U.S. Dep. Navy, Bethesda, MD, Final Rep. DDT-TR-83-01, June 1983.
[30] T. J. Teorey and J. R. Fry,Design of Database Structures. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[31] J. A. Van der Pool, "Optimum storage allocation for a file in steady state,"IBM J. Res. Develop., pp. 27-38, 1973.
[32] E. Veklerov, "Analysis of dynamic hashing with deferred splitting,"ACM Trans. Database Syst., vol. 10, no. 1, pp. 90-96, Mar. 1985.
[33] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.
[34] S. B. Yao, "Optimization of query evaluation algorithms,"ACM Trans. Database Syst., vol. 4, no. 2, pp. 133-155, June 1979.

Index Terms:
IBM PC; software tools; file organisation; DBMS; network data model; physical database design evaluation system; CODASYL databases; interactive design tool; user interface; transaction analyzer; core module; processing requirements; logical transactions; physical transaction; analytical models; cost formulas; multiple record types; UCSD Pascal; database management systems; file organisation; IBM computers; program testing; software tools; user interfaces
Citation:
H. Lam, S.Y.W. Su, N.R. Koganti, "A Physical Database Design Evaluation System for CODASYL Databases," IEEE Transactions on Software Engineering, vol. 14, no. 7, pp. 1010-1022, July 1988, doi:10.1109/32.42741
Usage of this product signifies your acceptance of the Terms of Use.