DOCSLIB.ORG

Automating the Lower and Higher Normal Form Process for the Database Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Automating the Lower and Higher Normal Form Process for the Database Systems International Journal of Computer Applications (0975 – 8887) Volume 100– No.12, August 2014 Automating the Lower and Higher Normal Form Process for the Database Systems Manal Fadel Younis Department of Computer Engineering, University of Baghdad Baghdad-Iraq ABSTRACT 2. A FUNCTIONAL DEPENDENCY (FD) Normalization is an important technique for the analysis of [1][4][3] relational databases. It aims to create a set of relational tables The attribute B is functionally dependent on the with minimum data redundancy that preserve consistency and attribute A if each value in column A determines one and only facilitate correct insertion, deletion, and modification. It is one value in column B. (written A → B) very much time consuming to do this data analysis manually. Thus in this paper, a system is proposed which aims to automate the most complex phase of the database design Partial dependency: The determinant is only part normalization. It will help to achieve a good database design of the primary key. and eliminate the drawbacks of manual normalization process. Full functional dependency: If attribute B is functionally dependent on a composite key A but This system is suitable to eliminate redundancy and not on any subset of that composite key, the inconsistent dependency automatically. It aims to handle the attribute B is fully functionally dependent on A. normalization process up to fifth normal. This includes Transitive dependency: Is a functional dependence creating tables and establishing relationships between those exists among nonprime attributes. tables by using their general definitions in a step-by-step Multivalued dependency: Two or more attributes feature on the set of functional dependencies to remove are dependent on a determinant and each dependent redundant data. Then this system is tested on many examples attribute has a specific set of values. The values in with multiple candidate keys taken from different sources. these dependent attributes are independent of each other. General Terms Join dependency: A table T is subject to a join Normalization, Relational Database System dependency if T can always be recreated by joining multiple tables each having a subset of the attributes Keywords of T. Functional Dependency, Keys, Redundancy, Normal Forms. 1. INTRODUCTION Normalization works through a series of stages called normal form, these are [1][5]: Good relational database system is not enough to avoid the • First Normal Form (1NF). data redundancy. Normalization is a process used for • Second Normal Form (2NF). evaluating and correcting table structures to minimize this • Third Normal Form (3NF). redundancy, and reducing the data anomalies which is based • Boyce-Codd Normal Form (BCNF) on their functional dependencies and primary keys. The • Fourth Normal Form (4NF). normalization process involves assigning attributes to tables • Fifth Normal Form (5NF). based on the concept of determination [1]. It usually involves dividing a database into two or more tables The first normal form (1NF): and defining relationships between the tables. The objective is There are no repeating groups in the table. In other to isolate data so that additions, deletions, and modifications words, each row/column intersection contains one of a field can be made in just one table and then propagated and only one value, not a set of values. through the rest of the database via the defined relationships Define the primary key. [2]. Define all dependencies on the table. Key is one or more attributes which determine other attributes The second normal form (2NF): [1][3]. It is in 1NF. Superkey: An attribute (or combination of Remove all partial dependencies. attributes) that uniquely identifies each row in a table. The third normal form (3NF): Candidate key: A superkey that does not contain a It is in 2NF. subset of attributes that is itself a superkey. It contains no transitive dependencies. Non-prime attribute: A non-prime attribute is an attribute that does not occur in any candidate key. The Boyce-Codd normal form (BCNF): Primary key: A candidate key selected to uniquely identify all other attribute values in any given row Every determinant in the table is a candidate key. cannot contain null entries. 13 International Journal of Computer Applications (0975 – 8887) Volume 100– No.12, August 2014 Is special case of 3NF, when the table contains only Table 1: Employee one candidate key, then 3NF and the BCNF are equivalents. Name Project Task Office Floor Phone Bill 100X T1 400 4 1400 The fourth normal form (4NF): T2 400 4 1400 200Y T1 400 4 1400 It is in 3NF. T2 400 4 1400 Remove the multivalued dependencies. Sue 100X T33 442 4 1442 200Y T33 442 4 1442 The fifth normal form: 300Z T33 442 4 1442 Ed 100X T2 588 5 1588 It is in 4NF. The entity has no join dependencies. Also called First Normal Form: project-join normal form. Step 1: Eliminate the Repeating Groups This section 1 describes the introduction of the proposed work. Section 2 focuses on literature survey. Section 3 Eliminate the nulls by making sure that each repeating group describes the proposed system for automatic higher normal attribute contains an appropriate data value. form. Section 4 focuses on the result of the proposed system.. 3. LITERATURE SURVEY Step 2: Identify the Primary Key This section focus on literature survey of the paper: The above table has more than one field that represent the Sherry Verma,”Comparing manual and automatic primary key (Name, Project, Task) because the field Name is normalization techniques for relational database”, [6] not uniquely identify all of the remaining entity (row) proposed the Comparing manual and automatic normalization attributes. For example, the Name value Bill can identify any techniques for relational database, based on the dependency one of two projects. Then if the primary key composed from matrix and approach primary key to generate automatically (Name and Project) so not uniquely identify any one of two identified the final table. tasks. Amir Hassan bahmani, Mahmoud Naghib zadeh, “Automatic To maintain a proper primary key that will uniquely identify database normalization and primary key generation”, [7] the any attribute value, the new key must be composed of a authors proposed an approach for automatic database combination of Name, Project and Task. normalization and primary key generation. In discussed an automatic distinguish one primary key for every final table For example, if Name=Bill, Project=100X and Task=T1 the which is generated. The problem is to normalize the database entries for the attributes Office, Floor and Phone must be 400, tables automatically. In the current normalization process, 4, 1400 and so on. This change converts the table Employee even first normal form, second normal form and third normal to table Employee2 which is in 1NF. forms are difficult by doing automatically. Table 2: Employee2 P.B. Alappanavar, Dhiraj Patil, Radhika Grover, Srishti Hunjan, Yuvraj Girnar ,“An Ameliorated Approach towards Name Project Task Office Floor Phone Automating the Relational Database Normalization Process”, Bill 100X T1 400 4 1400 [8] aims to automate the most complex and elaborate phase Bill 100X T2 400 4 1400 of the database design process-Normalization, which will Bill 200Y T1 400 4 1400 help to achieve the trademarks of an acceptable database Bill 200Y T2 400 4 1400 design. Sue 100X T33 442 4 1442 Sue 200Y T33 442 4 1442 G.Sunitha, Dr.A.Jaya, “A KNOWLEDGE BASED Sue 300Z T33 442 4 1442 APPROACH FOR AUTOMATIC DATABASE Ed 100X T2 588 5 1588 NORMALIZATION”, [9] aims to provide automatic Step 3: Identify All Dependencies normalization of databases up to 3NF in order to reduce the time consuming in manually normalization. The primary key in step 2 identified the following dependency: Moussa Demba, “ALGORITHM FOR RELATIONAL DATABASE NORMALIZATION UP TO 3NF”, [2] the Name, Project, Task Office, Floor, Phone author proposed an algorithmic approach for database a- Partial dependency: normalization up to third normal form by taking into account Name Office, Floor, Phone all candidate keys, including the primary key. b- Fully dependency: None c- Transitive dependency: 4. PROPOSED SYSTEM FOR Office is the office number for the employee. AUTOMATIC ALL NORMAL FORM Bill works in office number 400. First Case study: Consider the following table with set of Floor is the floor on which the office is attributes to apply the proposed system: located. Phone is associated with the phone in the given office. Office Floor, Phone d- Multivalued dependency: Name Project Name Task 14 International Journal of Computer Applications (0975 – 8887) Volume 100– No.12, August 2014 Second Normal Form: Table 8: EmpNP ( Name, Project) Split the table which results from the 1NF according to partial dependency into two relations (tables):- Name Project Bill 100X Table 3: EmpNPT (Name, Project, Task) Bill 200Y Sue 100X Name Project Task Sue 200Y Bill 100X T1 Sue 300Z Bill 100X T2 Ed 100X Bill 200Y T1 Bill 200Y T2 Sue 100X T33 Table 9: EmpNT ( Name, Task) Sue 200Y T33 Sue 300Z T33 Name Task Ed 100X T2 Bill T1 Bill T2 Table 4:EmpNOFP (Name, Office, Floor, Phone) Sue T33 Ed T2 Name Office Floor Phone Bill 400 4 1400 Sue 442 4 1442 Table 10: EmpNO (Name, Office) Ed 588 5 1588 Name Office Floor Third Normal Form: Bill 400 4 Step 1: Identify the transitive dependency:- Sue 442 4 There is transitive dependency in table EmpNOFP (Name, Ed 588 5 Office, Floor, Phone) Step 2: Split EmpNOFP into two tables Table 11: EmpOPF (Office, Phone) Table 5 : EmpNPT (Name, Project, Task) Office Phone Floor Name Project Task 400 1400 4 Bill 100X T1 442 1442 4 Bill 100X T2 588 1588 5 Bill 200Y T1 Second Case study of BCNF: Bill 200Y T2 Sue 100X T33 Sue 200Y T33 To check for BCNF, it must identify all the determinants and Sue 300Z T33 make sure that they are candidate keys.
Load more

Recommended publications
  • Relational Database Design Chapter 7
    Chapter 7: Relational Database Design Chapter 7: Relational Database Design First Normal Form Pitfalls in Relational Database Design Functional Dependencies Decomposition Boyce-Codd Normal Form Third Normal Form Multivalued Dependencies and Fourth Normal Form Overall Database Design Process Database System Concepts 7.2 ©Silberschatz, Korth and Sudarshan 1 First Normal Form Domain is atomic if its elements are considered to be indivisible units + Examples of non-atomic domains: Set of names, composite attributes Identification numbers like CS101 that can be broken up into parts A relational schema R is in first normal form if the domains of all attributes of R are atomic Non-atomic values complicate storage and encourage redundant (repeated) storage of data + E.g. Set of accounts stored with each customer, and set of owners stored with each account + We assume all relations are in first normal form (revisit this in Chapter 9 on Object Relational Databases) Database System Concepts 7.3 ©Silberschatz, Korth and Sudarshan First Normal Form (Contd.) Atomicity is actually a property of how the elements of the domain are used. + E.g. Strings would normally be considered indivisible + Suppose that students are given roll numbers which are strings of the form CS0012 or EE1127 + If the first two characters are extracted to find the department, the domain of roll numbers is not atomic. + Doing so is a bad idea: leads to encoding of information in application program rather than in the database. Database System Concepts 7.4 ©Silberschatz, Korth and Sudarshan 2 Pitfalls in Relational Database Design Relational database design requires that we find a “good” collection of relation schemas.
    [Show full text]
  • Adequacy of Decompositions of Relational Databases*9+
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES 21, 368-379 (1980) Adequacy of Decompositions of Relational Databases*9+ DAVID MAIER State University of New York, Stony Brook, New York 11794 0. MENDELZON IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598 FEREIDOON SADRI Princeton University, Princeton, New Jersey 08540 AND JEFFREY D. ULLMAN Stanford University, Stanford, California 94305 Received August 6, 1979; revised July 16, 1980 We consider conditions that have appeared in the literature with the purpose of defining a “good” decomposition of a relation scheme. We show that these notions are equivalent in the case that all constraints in the database are functional dependencies. This result solves an open problem of Rissanen. However, for arbitrary constraints the notions are shown to differ. I. BASIC DEFINITIONS We assume the reader is familiar with the relational model of data as expounded by Codd [ 111, in which data are represented by tables called relations. Rows of the tables are tuples, and the columns are named by attributes. The notation used in this paper is that found in Ullman [23]. A frequent viewpoint is that the “real world” is modeled by a universal set of attributes R and constraints on the set of relations that can be the “current” relation for scheme R (see Beeri et al. [4], Aho et al. [ 11, and Beeri et al. [7]). The database scheme representing the real world is a collection of (nondisjoint) subsets of the * Work partially supported by NSF Grant MCS-76-15255. D. Maier and A. 0. Mendelzon were also supported by IBM fellowships while at Princeton University, and F.
    [Show full text]
  • Aslmple GUIDE to FIVE NORMAL FORMS in RELATIONAL DATABASE THEORY
    COMPUTING PRACTICES ASlMPLE GUIDE TO FIVE NORMAL FORMS IN RELATIONAL DATABASE THEORY W|LL|AM KErr International Business Machines Corporation 1. INTRODUCTION The normal forms defined in relational database theory represent guidelines for record design. The guidelines cor- responding to first through fifth normal forms are pre- sented, in terms that do not require an understanding of SUMMARY: The concepts behind relational theory. The design guidelines are meaningful the five principal normal forms even if a relational database system is not used. We pres- in relational database theory are ent the guidelines without referring to the concepts of the presented in simple terms. relational model in order to emphasize their generality and to make them easier to understand. Our presentation conveys an intuitive sense of the intended constraints on record design, although in its informality it may be impre- cise in some technical details. A comprehensive treatment of the subject is provided by Date [4]. The normalization rules are designed to prevent up- date anomalies and data inconsistencies. With respect to performance trade-offs, these guidelines are biased to- ward the assumption that all nonkey fields will be up- dated frequently. They tend to penalize retrieval, since Author's Present Address: data which may have been retrievable from one record in William Kent, International Business Machines an unnormalized design may have to be retrieved from Corporation, General several records in the normalized form. There is no obli- Products Division, Santa gation to fully normalize all records when actual perform- Teresa Laboratory, ance requirements are taken into account. San Jose, CA Permission to copy without fee all or part of this 2.
    [Show full text]
  • Database Normalization
    Outline Data Redundancy Normalization and Denormalization Normal Forms Database Management Systems Database Normalization Malay Bhattacharyya Assistant Professor Machine Intelligence Unit and Centre for Artificial Intelligence and Machine Learning Indian Statistical Institute, Kolkata February, 2020 Malay Bhattacharyya Database Management Systems Outline Data Redundancy Normalization and Denormalization Normal Forms 1 Data Redundancy 2 Normalization and Denormalization 3 Normal Forms First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Elementary Key Normal Form Fourth Normal Form Fifth Normal Form Domain Key Normal Form Sixth Normal Form Malay Bhattacharyya Database Management Systems These issues can be addressed by decomposing the database { normalization forces this!!! Outline Data Redundancy Normalization and Denormalization Normal Forms Redundancy in databases Redundancy in a database denotes the repetition of stored data Redundancy might cause various anomalies and problems pertaining to storage requirements: Insertion anomalies: It may be impossible to store certain information without storing some other, unrelated information. Deletion anomalies: It may be impossible to delete certain information without losing some other, unrelated information. Update anomalies: If one copy of such repeated data is updated, all copies need to be updated to prevent inconsistency. Increasing storage requirements: The storage requirements may increase over time. Malay Bhattacharyya Database Management Systems Outline Data Redundancy Normalization and Denormalization Normal Forms Redundancy in databases Redundancy in a database denotes the repetition of stored data Redundancy might cause various anomalies and problems pertaining to storage requirements: Insertion anomalies: It may be impossible to store certain information without storing some other, unrelated information. Deletion anomalies: It may be impossible to delete certain information without losing some other, unrelated information.
    [Show full text]
  • Final Exam Review
    Final Exam Review Winter 2006-2007 Lecture 26 Final Exam Overview • 3 hours, single sitting • Topics: – Database schema design – Entity-Relationship Model – Functional and multivalued dependencies – Normal forms – Also some SQL DDL and DML, of course • General format: – Final will give a functional specification for a database – Design the database; normalize it; write some queries – Maybe one or two functional dependency problems Entity-Relationship Model • Diagramming system for specifying database schemas – Can map an E-R diagram to the relational model • Entity-sets: “things” that can be uniquely represented – Can have a set of attributes; must have a primary key • Relationship-sets: associations between entity-sets – Can have descriptive attributes – Relationships uniquely identified by the participating entities! – Primary key of relationship depends on mapping cardinality of the relationship-set • Weak entity-sets – Don’t have a primary key; have a discriminator instead – Must be associated with a strong entity-set via an identifying relationship Entity-Relationship Model (2) • E-R model has extended features too • Generalization/specialization of entity-sets – Subclass entity-sets inherit attributes and relationships of superclass entity-sets • Aggregation – Relationships involving other relationships • Should know: – How to diagram each of these things – Kinds of constraints and how to diagram them – How to map each E-R concept to relational model, including rules for primary keys, candidate keys, etc. E-R Model Attributes • Attributes
    [Show full text]
  • A Simple Guide to Five Normal Forms in Relational Database Theory
    A Simple Guide to Five Normal Forms in Relational Database Theory 1 INTRODUCTION 2 FIRST NORMAL FORM 3 SECOND AND THIRD NORMAL FORMS 3.1 Second Normal Form 3.2 Third Normal Form 3.3 Functional Dependencies 4 FOURTH AND FIFTH NORMAL FORMS 4.1 Fourth Normal Form 4.1.1 Independence 4.1.2 Multivalued Dependencies 4.2 Fifth Normal Form 5 UNAVOIDABLE REDUNDANCIES 6 INTER-RECORD REDUNDANCY 7 CONCLUSION 8 REFERENCES 1 INTRODUCTION The normal forms defined in relational database theory represent guidelines for record design. The guidelines corresponding to first through fifth normal forms are presented here, in terms that do not require an understanding of relational theory. The design guidelines are meaningful even if one is not using a relational database system. We present the guidelines without referring to the concepts of the relational model in order to emphasize their generality, and also to make them easier to understand. Our presentation conveys an intuitive sense of the intended constraints on record design, although in its informality it may be imprecise in some technical details. A comprehensive treatment of the subject is provided by Date [4]. The normalization rules are designed to prevent update anomalies and data inconsistencies. With respect to performance tradeoffs, these guidelines are biased toward the assumption that all non-key fields will be updated frequently. They tend to penalize retrieval, since data which may have been retrievable from one record in an unnormalized design may have to be retrieved from several records in the normalized form. There is no obligation to fully normalize all records when actual performance requirements are taken into account.
    [Show full text]
  • A Normal Form for Relational Databases That Is Based on Domains and Keys
    A Normal Form for Relational Databases That Is Based on Domains and Keys RONALD FAGIN IBM Research Laboratory A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also, formal definitions of insertion anomaly and deletion anomaly are presented. It is shown that a schema is in DK/NF if and only if it has no insertion or deletion anomalies. Unlike previously defined normal forms, DK/NF is not defined in terms of traditional dependencies (functional, multivalued, or join). Instead, it is defined in terms of the more primitive concepts of domain and key, along with the general concept of a “constraint.” We also consider how the definitions of traditional normal forms might be modified by taking into consideration, for the first time, the combinatorial consequences of bounded domain sizes. It is shown that after this modification, these traditional normal forms are all implied by DK/NF. In particular, if all domains are infinite, then these traditional normal forms are all implied by DK/NF. Key Words and Phrases: normalization, database design, functional dependency, multivalued de- pendency, join dependency, domain-key normal form, DK/NF, relational database, anomaly, com- plexity CR Categories: 3.73, 4.33, 4.34, 5.21 1. INTRODUCTION Historically, the study of normal forms in a relational database has dealt with two separate issues. The first issue concerns the definition of the normal form in question, call it Q normal form (where Q can be “third” [lo], “Boyce-Codd” [ 111, “fourth” [16], “projection-join” [17], etc.). A relation schema (which, as we shall see, can be thought of as a set of constraints that the instances must obey) is considered to be “good” in some sense if it is in Q normal form.
    [Show full text]
  • Simple Guide to Five Normal Forms in Relational Database Theory", Communications of the ACM 26(2), Feb
    William Kent, "A Simple Guide to Five Normal Forms in Relational Database Theory", Communications of the ACM 26(2), Feb. 1983, 120-125. Also IBM Technical Report TR03.159, Aug. 1981. Also presented at SHARE 62, March 1984, Anaheim, California. Also in A.R. Hurson, L.L. Miller and S.H. Pakzad, Parallel Architectures for Database Systems, IEEE Computer Society Press, 1989. [12 pp] Copyright 1996 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or [email protected]. A Simple Guide to Five Normal Forms in Relational Database Theory William Kent Sept 1982 1 INTRODUCTION ........................................................................................................................................................2 2 FIRST NORMAL FORM ............................................................................................................................................2 3 SECOND AND THIRD NORMAL FORMS ..........................................................................................................2
    [Show full text]
  • Chapter- 7 DATABASE NORMALIZATION Keys Types of Key
    Chapter- 7 DATABASE NORMALIZATION Keys o Keys play an important role in the relational database. o It is used to uniquely identify any record or row of data from the table. It is also used to establish and identify relationships between tables. For example: In Student table, ID is used as a key because it is unique for each student. In PERSON table, passport_number, license_number, SSN are keys since they are unique for each person. Types of key: 1. Primary key o It is the first key which is used to identify one and only one instance of an entity uniquely. An entity can contain multiple keys as we saw in PERSON table. The key which is most suitable from those lists become a primary key. o In the EMPLOYEE table, ID can be primary key since it is unique for each employee. In the EMPLOYEE table, we can even select License_Number and Passport_Number as primary key since they are also unique. o For each entity, selection of the primary key is based on requirement and developers. 2. Candidate key o A candidate key is an attribute or set of an attribute which can uniquely identify a tuple. o The remaining attributes except for primary key are considered as a candidate key. The candidate keys are as strong as the primary key. For example: In the EMPLOYEE table, id is best suited for the primary key. Rest of the attributes like SSN, Passport_Number, and License_Number, etc. are considered as a candidate key. 3. Super Key Super key is a set of an attribute which can uniquely identify a tuple.
    [Show full text]
  • Relational Database Design Relational Database Design
    Literature and Acknowledgments Database Systems Reading List for SL05: Spring 2013 I Database Systems, Chapters 14 and 15, Sixth Edition, Ramez Elmasri and Shamkant B. Navathe, Pearson Education, 2010. Relational Database Design These slides were developed by: I Michael B¨ohlen,University of Z¨urich, Switzerland SL05 I Johann Gamper, Free University of Bozen-Bolzano, Italy I Relational Database Design Goals The slides are based on the following text books and associated material: I Functional Dependencies I Fundamentals of Database Systems, Fourth Edition, Ramez Elmasri I 1NF, 2NF, 3NF, BCNF and Shamkant B. Navathe, Pearson Addison Wesley, 2004. I Dependency Preservation, Lossless Join Decomposition I A. Silberschatz, H. Korth, and S. Sudarshan: Database System I Multivalued Dependencies, 4NF Concepts, McGraw Hill, 2006. DBS13, SL05 1/60 M. B¨ohlen,ifi@uzh DBS13, SL05 2/60 M. B¨ohlen,ifi@uzh Relational Database Design Guidelines/1 I The goal of relational database design is to find a good collection of relation schemas. Relational Database Design I The main problem is to find a good grouping of the attributes into Guidelines relation schemas. I We have a good collection of relation schemas if we I Ensure a simple semantics of tuples and attributes I Avoid redundant data I Avoid update anomalies I Avoid null values as much as possible I Goals of Relational Database Design I Ensure that exactly the original data is recorded and (natural) joins I Update Anomalies do not generate spurious tuples DBS13, SL05 3/60 M. B¨ohlen,ifi@uzh DBS13, SL05
    [Show full text]
  • Session 7 – Main Theme
    Database Systems Session 7 – Main Theme Functional Dependencies and Normalization Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences Presentation material partially based on textbook slides Fundamentals of Database Systems (6th Edition) by Ramez Elmasri and Shamkant Navathe Slides copyright © 2011 and on slides produced by Zvi Kedem copyight © 2014 1 Agenda 1 Session Overview 2 Logical Database Design - Normalization 3 Normalization Process Detailed 4 Summary and Conclusion 2 Session Agenda . Logical Database Design - Normalization . Normalization Process Detailed . Summary & Conclusion 3 What is the class about? . Course description and syllabus: » http://www.nyu.edu/classes/jcf/CSCI-GA.2433-001 » http://cs.nyu.edu/courses/spring15/CSCI-GA.2433-001/ . Textbooks: » Fundamentals of Database Systems (6th Edition) Ramez Elmasri and Shamkant Navathe Addition Wesley ISBN-10: 0-1360-8620-9, ISBN-13: 978-0136086208 6th Edition (04/10) 4 Icons / Metaphors Information Common Realization Knowledge/Competency Pattern Governance Alignment Solution Approach 55 Agenda 1 Session Overview 2 Logical Database Design - Normalization 3 Normalization Process Detailed 4 Summary and Conclusion 6 Agenda . Informal guidelines for good design . Functional dependency . Basic tool for analyzing relational schemas . Informal Design Guidelines for Relation Schemas . Normalization: . 1NF, 2NF, 3NF, BCNF, 4NF, 5NF • Normal Forms Based on Primary Keys • General Definitions of Second and Third Normal Forms • Boyce-Codd Normal Form • Multivalued Dependency and Fourth Normal Form • Join Dependencies and Fifth Normal Form 7 Logical Database Design . We are given a set of tables specifying the database » The base tables, which probably are the community (conceptual) level . They may have come from some ER diagram or from somewhere else .
    [Show full text]
  • A Simple Guide to Five Normal Forms in Relational Database Theory", Communications of the ACM 26(2), Feb
    William Kent, "A Simple Guide to Five Normal Forms in Relational Database Theory", Communications of the ACM 26(2), Feb. 1983, 120-125. Also IBM Technical Report TR03.159, Aug. 1981. Also presented at SHARE 62, March 1984, Anaheim, California. Also in A.R. Hurson, L.L. Miller and S.H. Pakzad, Parallel Architectures for Database Systems, IEEE Computer Society Press, 1989. [12 pp] Copyright 1996 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or [email protected]. A Simple Guide to Five Normal Forms in Relational Database Theory William Kent Sept 1982 > 1 INTRODUCTION . 2 > 2 FIRST NORMAL FORM . 2 > 3 SECOND AND THIRD NORMAL FORMS . 2 >> 3.1 Second Normal Form . 2 >> 3.2 Third Normal Form . 3 >> 3.3 Functional Dependencies . 4 > 4 FOURTH AND FIFTH NORMAL FORMS . 5 >> 4.1 Fourth Normal Form . 6 >>> 4.1.1 Independence . 8 >>> 4.1.2 Multivalued Dependencies . 9 >> 4.2 Fifth Normal Form . 9 > 5 UNAVOIDABLE REDUNDANCIES .
    [Show full text]