This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Models for the Combined Logical and Physical Design of Databases
July 1989 (vol. 38 no. 7)
pp. 955-967
Given the set of intended transactions, the authors model the problem of choosing the most efficient decomposition of the universal set of attributes. Unlike other models which neglect the logical structure developed in database theory, the model developed incorporates it as part of a mathematical program. This provides a comprehensive and an integrated formulation for the combined logical and

[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] M. M. Astrahanet al., "System R: Relational approach to database management,"Trans. Database Syst., vol. 1, no. 1, pp. 97-137, 1976.
[3] J. Biskup, U. Dayal, and P. Bernstein, "Synthesizing independent database schemes," inACM SIGMOD Conf. Proc., 1979, pp. 143-152.
[4] P. A. Bernstein, "Synthesizing third normal form relations from functional dependencies,"ACM Trans. Database Syst., vol. 1, no. 4, pp. 277-298, Dec. 1976.
[5] C. Beeri and M. Y. Vardi, "On the properties of total join dependencies," inProc. Workshop Formal Bases for Databases, Toulouse, 1979.
[6] P. P. Chen, "Design and performance tools for database systems," inProc. Int. Conf. Very Large Data Bases. 1977, pp. 3-15.
[7] D. Comer, "The difficulty of optimum index selection,"ACM Trans. Database Syst., vol. 3, no. 4, pp. 440-445, 1978.
[8] P. De, J. Park, and H. Pirkul, "An integrated model of record segmentation and access path selection for databases,"Management Sci., to be published.
[9] R. Fagin, A. O. Mendelzon, and J. D. Ullman, "A simplified universal relation assumption and its properties,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 343-360, Sept. 1982.
[10] T. J. Gambino and R. Gerritsen, "A database design decision support system," inProc. Int. Conf. Very Large Data Bases, 1977, pp. 534- 544.
[11] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[12] B. Gavish, "Models for configuring large scale distributed computing systems,"AT&T Tech. J., vol. 64, pp. 491-532, 1985.
[13] B. Gavish, "Optimization models for configuring distributed computing systems,"IEEE Trans. on Comput., pp. 773-793, 1987.
[14] B. Gavish and A. Segev, "Set query optimization on distr. data database Systems,"ACM TODS, vol. 11, no. 3, pp. 265-293, 1986.
[15] E. Horowitz and S. Sahni,Fundamentals of Data Structures, Computer Software Engineering Series, 1976.
[16] E. Hevia and T. J. Teorey, "The usage dependency model for logical database design," Univ. of Michigan, Comput. Res. Lab. Rep. CRLTR-19-84, Mar. 1984.
[17] K. B. Irani, S. Purkayastha, and T. J. Teorey, "A designer for DBMS processable database structures," inProc. Int. Conf. Very Large Data Bases, 1979, pp. 219-231.
[18] W. Kent, "Consequences of assuming a universal relation,"ACM Trans. Database Syst., vol. 6, pp. 539-556, 1981.
[19] P. A. Larson and S. D. Yang, "An approach to storage schema design for relational databases," Working Paper, Univ. of Waterloo, Ont., Canada, 1984.
[20] Y. E. Lien, "On the equivalence of database models,"J. ACM, vol. 29, no. 2, pp. 333-362, 1982.
[21] J. Martin,Managing the Database Environment. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[22] S. T. March and G. D. Scudder, "On the selection of efficient record segmentations and backup strategies for large shared databases,"ACM Trans. Database Syst., vol. 9, pp. 409-438, 1984.
[23] D. Maier, D. Rozenshtein, and D. Warren, "Windows on the world," inProc. ACM SIGMOD Int. Symp. Management Data, New York, 1983, pp. 66-78.
[24] D. Maier, J. Ullman, and M. Vardi, "On the foundations of the universal-relation model,"ACM Trans. Database Syst., pp. 283-308, Sept. 1984.
[25] D. S. Rund,Database Design Methodology, Part I and II. Pensanken, NJ: Auerbach, 1976.
[26] P. G. Severance and J. V. Carlis, "A practical approach to selecting record access paths,"ACM Comput. Surveys, vol. 9, pp. 259-272, Dec. 1977.
[27] E. Scior, "Real-world MVD's," inProc. ACM SIGMOD Conf., 1981, pp. 121-132.
[28] M. Schkolnick, "The effects of denormalization on database performance," Res. Rep. RJ3082, IBM, San Jose, CA, Dec, 1981.
[29] M. Schkolnick, "A survey of physical database design methodology and techniques," inProc. Int. Conf. Very Large Data Bases, 1978, pp. 474-487.
[30] M. Schkolnick and P. Yiberio, "Considerations in developing a design tool for a relational DBMS," inProc. IEEE COMPSAC Conf., 1979, pp. 228-235.
[31] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[32] H. K. T. Wong and N. C. Shu, "An approach to relational database schema design," IBM Res. Rep. RJ2688, San Jose, CA, 1980.
[33] M. Yannakakis, "Algorithms for acyclic database schemes," inProc. Int. Conf. Very Large Data Bases, 1981, pp. 82-94.
[34] C. Zaniolo, "A new normal form for the design of relational database scheme,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 489-499, Sept. 1982.

Index Terms:
combined logical; physical design; databases; transactions; model; decomposition; database theory; mathematical program; integrated formulation; NP-complete; database management systems; database theory.
Citation:
R.M. Dewan, B. Gavish, "Models for the Combined Logical and Physical Design of Databases," IEEE Transactions on Computers, vol. 38, no. 7, pp. 955-967, July 1989, doi:10.1109/12.30848
Usage of this product signifies your acceptance of the Terms of Use.