Physical Data Base Design

  • Jay-Louise Weldon
Part of the Applications of Modern Technology in Business book series (AMTB)


The data described by a (logical) data base schema are not available to application programs or user inquiries until it has been realized physically, using the software and devices of the user’s installation. Physical data base design includes the preparation of a plan for that realization and its accomplishment. In the terminology of traditional systems design, physical design is analogous to the selection of a file organization, preparation of file record layouts, and the creation of the file itself.


Data Base Access Method Physical Design Logical Schema Customer Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buchholz, Werner, File organization and addressing, IBM Systems Journal, pp. 86-111, June 1963.Google Scholar
  2. 2.
    Dodd, George G., Elements of data management systems, ACM Comp. Surveys 1(2), pp. 117–132, June 1969.MATHCrossRefGoogle Scholar
  3. 3.
    Martin, James, Computer Data Base Organization, Prentice-Hall, Englewood Cliffs, N.J., 1976.Google Scholar
  4. 4.
    Lum, V. Y., P. S. T. Yuen, and M. Dodd, Key to address transform techniques: A fundamental performance study on large existing formatted files, Communications of the ACM 14(4), pp. 228–239, 1971.CrossRefGoogle Scholar
  5. 5.
    Cincom Systems os/total Application Programmer’s Guide, Publication No. P02-1236-00, Cincom Systems, Cincinnati, Ohio, 1976.Google Scholar
  6. 6.
    Date, C. J., An Introduction to Data Base Systems, Addison-Wesley, Reading, Mass., 1977.Google Scholar
  7. 7.
    IBM, IMS I360 System I Application Design Guide, 1972.Google Scholar
  8. 8.
    Cardenas, A. F., Evaluation and selection of file organizations: A model and a system, Communications of the ACM 16(9), pp. 540–548, 1973.CrossRefGoogle Scholar
  9. 9.
    Siler, Kenneth F., A stochastic evaluation model for database organizations in data retrieval systems, Communications of the ACM 19(2), pp. 84–95, 1976.MATHCrossRefGoogle Scholar
  10. 10.
    Yao, S. B., An attribute-based model for data base access cost analysis, ACM Transactions on Database Systems 2(1), pp. 45–67, 1977.CrossRefGoogle Scholar
  11. 11.
    Teorey, T. J., and K. S. Das, Application of an analytical model to evaluate storage structures, Proceedings of the Association for Computing Machinery SIGMOD Conference, pp. 9-19, June 1976.Google Scholar
  12. 12.
    Weldon, J. L., Data Storage Decisions for Large Data Bases, National Technical Information Service, Publication No. AS/A-023874, U.S. Dept. of Commerce, Springfield, VA, 22161, February 1976.Google Scholar
  13. 13.
    Schkolnick, M., Physical database design techniques, Proceedings of the NYU Symposium on Database Design, New York University, pp. 99-209, May 1978.Google Scholar
  14. 14.
    IBM, DBPrototype II, Program Description/Operations Manual, IBM IUP No. 5796-PJK, April 1977.Google Scholar
  15. 15.
    Hoffer, J. A., and D. G. Severance, The use of cluster analysis in physical design, Proceedings of the Conference on Very Large Data Bases 1975, pp. 69-86, Sept. 1975.Google Scholar
  16. 16.
    Schkolnick, M., A clustering algorithm for hierarchical structures, ACM Transactions on Database Systems 2(1), pp. 27–44, March 1977.MathSciNetCrossRefGoogle Scholar
  17. 17.
    Salton, G., and A. Wong, Generation and search of clustered files, ACM Transactions on Database Systems 3(4), pp. 321–346, December 1978.CrossRefGoogle Scholar
  18. 18.
    Morgan, H. L., Optimal space allocation on disk storage devices, Communications of the ACM 17(3), pp. 139–142, March 1974.MATHCrossRefGoogle Scholar
  19. 19.
    Gecsei, J., and J. A. Lukes, A model for the evaluation of storage hierarchies, IBM Systems Journal 2, pp. 163–178, 1974.CrossRefGoogle Scholar
  20. 20.
    Shneiderman, B., Optimum database reorganization points, Communications of the ACM 16(6), pp. 362–365, June 1973.MATHCrossRefGoogle Scholar
  21. 21.
    Tuel, W. E., Optimum reorganization points for linearly growing files, ACM Transactions on Database Systems 3(1), pp. 32–40, March 1978.CrossRefGoogle Scholar
  22. 22.
    Yao, S. B., K. S. Das., and T. J. Teorey, A dynamic database reorganization algorithm, ACM Transactions on Database Systems 2(1), pp. 45–67, March 1977.CrossRefGoogle Scholar
  23. 23.
    Lum, V. Y., General performance analysis of key-to-address transformation techniques using an abstract file concept, Communications of the ACM 16(10), pp. 603–612, October 1973.MATHCrossRefGoogle Scholar
  24. 24.
    Gottleib, D., S. Hagerth, P. Lehot, and H. Rabinowitz, A classification of compression methods and their usefulness for a very large data processing center, Proceedings of the National Computer Conference, American Federation of Information Processing Societies, pp. 453-458, 1975.Google Scholar
  25. 25.
    Huffman, D. A., A method for the construction of minimum redundancy codes, Proceedings of the Institute of Radio Engineers, pp. 1098–1101, September 1952.Google Scholar

Copyright information

© Plenum Press, New York 1981

Authors and Affiliations

  • Jay-Louise Weldon
    • 1
  1. 1.Graduate School of Business AdministrationNew York UniversityNew YorkUSA

Personalised recommendations