Fourth Normal Form in Relational Database

Topics: Database normalization, Relational model, Third normal form Pages: 15 (2789 words) Published: May 5, 2012
[i](
Fourth Normal Form in Relational Database (May 2012)
Amandeep Kaur, University of Auckland, New Zealand

Abstract—This report is being written to understand the concept of Fourth Normal form in context of relational database. Multivalued dependency and the rules to achieve fourth normal form are explained. The anomalies associated with the fourth normal form are discussed and the consequences of violating 4NF is explained.

INTRODUCTION

T
HE most important issue in the design of a database  is to determine the fields that should be grouped together into the records. In the relational database, fields are grouped into logical structures known as relations. Normal forms basically determines which data fields should be placed together in  a relation, this process is known as Normalization which is done to minimize redundancy and dependency. The set of data fields comprising the database is organized into relations in first through fifth normal form (5NF) according to constraints placed upon the relations in each normal form. At any step in the normalization process, we may find that the relations no longer require further reorganization; in that case, we say that final normal form has been achieved. Before we move forward to understand fourth normal form, we need to understand few concepts like Multivalued dependencies (MVD), first normal form (1NF), second Normal form (2NF), third Normal form (3NF), and Boyce Codd Normal form (BCNF). All these forms are discussed briefly in the next section.

NORMAL FORMS AND MULTIVALUED DEPENDENCY

1 First Normal Form

A relational database is said to be in 1NF if each attribute of the relation is atomic i.e. each column must contain only single value. Basic rules for 1NF are as follows: --First, eliminate duplicate column from the same table. --Second, create separate table for a group of related data and distinguish each row with a unique column or set of columns.

2 Second Normal Form

A relational database is in 2NF if it is in 1NF and each attribute that is not a primary key is fully functionally dependent on the entity's primary key; that is, non-primary key attributes are dependent on the entity's entire primary key. When a 1NF table has no composite candidate keys (candidate keys consisting of more than one attribute), the table is automatically in 2NF.

3 Third Normal Form

A relational database is in 3NF if it is in 2NF and no non-primary key attribute is functionally dependent on another non-primary key. A non-prime attribute of R is an attribute that does not belong to any candidate key of R. A transitive dependency is a functional dependency in which X → Z (X determines Z) indirectly, by virtue of X → Y and Y → Z (where it is not the case that Y → X).

4 Multivalued Dependency

The multi-valued dependency is said to hold for a relation R(X, Y, Z) if for a given set of value (set of values if X is more than one attribute) for attributes X, there is a set of (zero or more) associated values for the set of attributes Y and the Y values depend only on X values and have no dependence on the set of attributes Z. In other words, the multi-valued dependency relates to the problem when more than one multi-valued attributes exist. MVD is represented by a double arrow --->>. Example of a multi-valued dependency is explained in TABLE I. Because the lecturers attached to the course and the books attached to the course are independent of each other, this database design has a multi-valued dependency; if we were to add a new book to the Database Systems course, we would have to add one record for each of the lecturers on that course, and vice versa. Put formally, there are two multi-valued dependencies in this relation: course—»book and equivalently course—» lecturer. Databases with multivalued dependencies thus exhibit redundancy.

FOURTH NORMAL FORM

A relationship is in Fourth Normal Form (4NF) when it meets...

References: 1] E.F. CODD, "A RELATIONAL MODEL OF DATA FOR LARGE SHARED DATA BANKS", COMM. ACM 13 (6), JUNE 1970, PP. 377-387.
2] E.F. Codd, "Normalized Data Base Structure: A Brief Tutorial", ACM SIGFIDET Workshop on Data Description, Access, and Control, Nov. 11-12, 1971, San Diego, California, E.F. Codd and A.L. Dean (eds.).
3] E.F. Codd, "Further Normalization of the Data Base Relational Model", R. Rustin (ed.), Data Base Systems (Courant Computer Science Symposia 6), Prentice-Hall, 1972.
4] C.J. Date, An Introduction to Database Systems (third edition), Addison-Wesley, 1981.
5] R. Fagin, "Multivalued Dependencies and a New Normal Form for Relational Databases", ACM Transactions on Database Systems 2 (3), Sept. 1977.
6] R. Fagin, "Normal Forms and Relational Database Operators", ACM SIGMOD International Conference on Management of Data, May 31-June 1, 1979, Boston, Mass
7] W
8] T.-W. Ling, F.W. Tompa, and T. Kameda, "An Improved Third Normal Form for Relational Databases", ACM Transactions on Database Systems, 6(2), June 1981, 329-346.
11] H. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1985, ch. 4.
17] M. Young, The Techincal Writers Handbook. Mill Valley, CA: University Science, 1989.
18] J. U. Duncombe, “Infrared navigation—Part I: An assessment of feasibility (Periodical style),” IEEE Trans. Electron Devices, vol. ED-11, pp. 34–39, Jan. 1959.
19] S. Chen, B. Mulgrew, and P. M. Grant, “A clustering technique for digital communications channel equalization using radial basis function networks,” IEEE Trans. Neural Networks, vol. 4, pp. 570–578, Jul. 1993.
20] R. W. Lucky, “Automatic equalization for digital communication,” Bell Syst. Tech. J., vol. 44, no. 4, pp. 547–588, Apr. 1965.
21] S. P. Bingulac, “On the compatibility of adaptive controllers (Published Conference Proceedings style),” in Proc. 4th Annu. Allerton Conf. Circuits and Systems Theory, New York, 1994, pp. 8–16.
22] G. R. Faulhaber, “Design of service systems with priority reservation,” in Conf. Rec. 1995 IEEE Int. Conf. Communications, pp. 3–8.
24] G. W. Juette and L. E. Zeffanella, “Radio noise currents n short sections on bundle conductors (Presented Conference Paper style),” presented at the IEEE Summer power Meeting, Dallas, TX, Jun. 22–27, 1990, Paper 90 SM 690-0 PWRS.
26] J. Williams, “Narrow-band analyzer (Thesis or Dissertation style),” Ph.D. dissertation, Dept. Elect. Eng., Harvard Univ., Cambridge, MA, 1993.
27] N. Kawasaki, “Parametric study of thermal and chemical nonequilibrium nozzle flow,” M.S. thesis, Dept. Electron. Eng., Osaka Univ., Osaka, Japan, 1993.
28] J. P. Wilkinson, “Nonlinear resonant circuit devices (Patent style),” U.S. Patent 3 624 12, July 16, 1990.
29] IEEE Criteria for Class IE Electric Systems (Standards style), IEEE Standard 308, 1969.
31] R. E. Haskell and C. T. Case, “Transient signal propagation in lossless isotropic plasmas (Report style),” USAF Cambridge Res. Lab., Cambridge, MA Rep. ARCRL-66-234 (II), 1994, vol. 2.
32] E. E. Reber, R. L. Michell, and C. J. Carter, “Oxygen absorption in the Earth’s atmosphere,” Aerospace Corp., Los Angeles, CA, Tech. Rep. TR-0200 (420-46)-3, Nov. 1988.
33] (Handbook style) Transmission Systems for Communications, 3rd ed., Western Electric Co., Winston-Salem, NC, 1985, pp. 44–60.
34] Motorola Semiconductor Data Manual, Motorola Semiconductor Products Inc., Phoenix, AZ, 1989.
Continue Reading

Please join StudyMode to read the full document

You May Also Find These Documents Helpful

  • Fundamentals of a Relational Database Essay
  • Relational Databases Essay
  • Relational Databases Essay
  • History of Relational Databases Research Paper
  • Relational Database Essay
  • Comparison of Hierarchical and Relational Databases Essay
  • Relational Database Model Essay
  • Files and Relational Databases Essay

Become a StudyMode Member

Sign Up - It's Free