Abstract
The physical database design problem has received considerable attention in the past. In this paper we present a sample of the techniques and models used to solve some of the problems in this area. A detailed analysis of two of these problems is shown.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, H. D. and Berra, P. B., “Minimum Cost Selection of Secondary Indexes for Formatted Files,” ACM TODS, Vol. 2, No. 1, March 1977, 68–90.
Babad, J. M., “A Record and File Partitioning Model,” Comm. ACM 20, 1 (Jan. 1977), 22–31.
Benner, F. J., “On Designing Generalized File Records for Management Information Systems,” Proc. AFIPS 1967 FJCC, 291–303.
Cardenas, A. F., “Evaluation and Selection of File Organization — A Model and a System,” Comm. ACM 16, 9 (Sept. 1973), 540–548.
Cardenas, A. F., “Analysis and Performance of Inverted Database Structures,” Comm. ACM 18, 5 (May 1975), 253–263.
Cardenas, A. F. and Sagamang, J. P., “Doubly-Chained Tree Database Organization — Analysis and Design Strategies,” The Computer Journal, Vol. 20, No. 1, 15–26, 1977.
Dearnley, P. A., “A Model of a Self Organizing Data Management System,” The Computer Journal, Vol. 17, No. 1, 13–16, 1974.
Dodd, G. G., “Elements of Data Management Systems,” Computing Surveys, Vol. 1, No. 2, June 1969, 117–133.
Duhne, R. A., “Optimal Design of a Generalized File Organization,” Ph.D. dissertation, Department of Computer Sciences, Cornell University, 1977.
Duhne, R. A. and Severance, D. G., “Selection of an Efficient Combination of Datafiles for a Multiuser Database,” Proc. AFIPS NCC 1978, Anaheim, Cal.
Eisner, M. J. and Severance, D. G., “Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases,” JACM 23,4 (Oct. 1976), 619–635.
Farley, J. H. G. and Schuster, S. A., “Query Execution and Index Selection for Relational Data Bases,” Computer Systems Research Group Technical Report CSRG-53, University of Toronto, 1975.
Gerritsen, R., private communication.
Gambino, T. J. and Gerritsen, R., “A Database Design Decision Support System,” Proc. VLDB, Tokyo, Japan, Oct. 1977, 534–544.
Hammer, M. and Chan, A., “Index Selection in a Self-Adaptive Data Base Management System,” Proc. ACM SIGMOD, 1976, 1–8.
Heald, G. D., “Storage Structures for Relational Data Base Management Systems,” Memo No. ERL-M533, University of California, Berkeley, California, August 1975.
Hoffer, J. A., “A Clustering Approach to the Generation of Subfiles for the Design of a Computer Data Base,” Ph.D. Dissertation, Department of Operations Research, Cornell University, 1975.
Hoffer, J. A. and Severance, D. G., “The Use of Cluster Analysis in Physical Database Design,” Proceedings VLDB 1975, Framingham, Mass. USA, Sept. 1975, 69–86.
Honeywell Information Systems Inc., “Integrated Data Store,” Wellesley Hills, Massachusetts, Order No. BR69, 1971.
Hsiao, D. and Harary, F., “A Formal System for Information Retrieval from Files,” Comm. ACM 14,2 (Feb. 1970), 67–73. Also see CACM Vol. 13,4, April 1970, 266.
IBM Corp., “Introduction to IBM Direct-Access Storage Devices and Organization Methods,” IBM, GC20-1649.
IBM Corp., “DBPROTOTYPEII, Program Description/Operations Manual,” IBM IUP No. 5796-PJK, April 1977.
IBM Corp., “IMS/VS General Information Manual,” IBM Publication GH20-]260, revised 1977.
Keehn, D. G. and Lacy, J. O., “VSAM Dataset Design Parameters,” IBM System Journal, Vol. 13, No. 3, Sept. 1974, 186–212.
King, W. F., “On the Selection of Indices for a File,” IBM Research Report RJ1341, San Jose, Cal., 1974.
Kollias, J. G., Stocker, P. M. and Dearnley, P. A., “Improving the Performance of an Intelligent Data Management System,” The Computer Journal, Vol. 20, No. 4, pp. 302–307, 1977.
Lefkovitz, D., “File Structures for On-Line Systems,” Spartan Books, New York, 1969.
Lum, V. Y., “Multiattribute Retrieval with Combined Indexes,” Comm. ACM 13, 11 (Nov. 1970), 660–665.
Lum, V. Y. and Ling, H., “An Optimization Problem on the Selection of Secondary Keys,” Proc. ACM NCC, 1971, 349–356.
March, S. T. and Severance, D. G., “The Determination of Efficient Record Segmentation and blocking Factors for Shared Data Files,” ACM TODS, Vol. 2, No. 3, (Sept. 1977), 279–296.
March, S. T. and Severance, D. G., “A Mathematical Modelling Approach to the Automatic Selection of Database Design,” Proc. SIGMOD 1978, Austin, Texas.
Schkolnick, M., “Secondary Index Optimization,” Proc. ACM SIGMOD, 1975, 186–192.
Schkolnick, M., “The Optimal Selection of Secondary Indices for Files,” Information Systems, Vol. 1, (March 77), 27–44.
Schkolnick, M., “A Clustering Algorithm for Hierarchical Structures,” ACM TODS, Vol. 2, No. 1, (March 77), 27–44.
Schkolnick, M., Tiberio, P., “Considerations in Developing a Design Tool for a Relational DBMS,” Proceedings of the COMPSAC'79 Conference, Chicago, November 1979, 228–235.
Shneiderman, B., “Optimum Database Reorganization Points,” Comm. ACM 16,6 (June 1973), 362–365.
Senko, M. E., Lum, V. Y. and Owens, P. J., “A File Organization Evaluation Model (FOREM),” Proceeding IFIP'68, 514–519.
Senko, M. E., Ling, H. and Lum, V. Y., “File Design Handbook,” IBM Report, San Jose Research Laboratory, November 1969.
Severance, D. G., “Some Generalized Modelling Structures for Use in Design of File Organization,” Ph.D. thesis, University of Michigan, 1972.
Severance, D. G., “A Parametric Model of Alternative File Structures,” Information Systems 1,2 (1975), 51–55.
Severance, D. G. and Carlis, J. V., “A Practical Approach to Selecting Record Access Paths,” Computing Surveys, Vol. 9,4, Dec. 77, 259–272.
Stocker, P. M. and Dearnley, P. A., “Self Organizing Data Management Systems,” The Computer Journal, Vol. 16, No. 2, pp. 100–105, 1973.
Stonebraker, M., “The Choice of Partial Inversions and Combined Indices,” International Journal of Computer and Information Sciences, 3,2 (1974).
Teorey, T. J. and Sundar-Das, K., “Application of Analytical Model to Evaluate Storage Structures,” Proc. ACM-SIGMOD, 1976, 9–19.
Teorey, T. J. and Oberlander, L. B., “Network Database Evaluation Using Analytical Modelling,” Proc. AFIPS NCC, 1978, Anaheim, Cal.
Tuel, W. E., “Optimum Reorganization Points for Linearly Growing Files,” ACM TODS, March 1978, Vol. 3, No. 1, 32–40.
Yao, S. B., “Evaluation and Optimization of File Organizations Through Analytic Modelling,” Ph.D. Thesis, University of Michigan, 1974.
Yao, S. B. and Merten, A. G., “Selection of File Organizations Using an Analytic Model,” Proceedings VLDB 1975, Framingham, Mass. USA, 255–267.
Yao, S. B., “A Hierarchical Access Model for Data Base Organizations,” Tech. Rep. TR-177, Computer Sciences, Purdue University, Lafayette, Ind., Feb. 1976.
Yao, S. B., Das, K. S. and Teorey, T. J., “A Dynamic Database Reorganization Algorithm,” TODS, June 1976, Vol. 1, No. 2, pp. 159–174.
Yao, S. B., “An Attribute Based Model for Database Access Cost Analysis,” ACM TODS, Vol. 2 No. 1, March 1977, 45–67.
Yao, S. B., “Approximating Block Accesses in Database Organizations,” Comm. ACM, Vol. 20 No. 4, April 1977, 260–261.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schkolnick, M. (1982). Physical database design techniques. In: Yao, S.B., Kunii, T.L. (eds) Data Base Design Techniques II:. DBDT 1979. Lecture Notes in Computer Science, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11215-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-11215-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11215-0
Online ISBN: 978-3-540-39054-1
eBook Packages: Springer Book Archive