DOCSLIB.ORG

Know More @ Powered by WR1334 UNIT-3 Database Management System Functional Dependencies: a → B. Each Va

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Know More @ Powered by WR1334 UNIT-3 Database Management System Functional Dependencies: a → B. Each Va UNIT-3 Database Management System Functional Dependencies: It describes the relationship between attributes in a relation. Example: A and B are attribute of relation R. B is functionally dependent on A that’s denoted by A B. each value of A is associated with exactly 1 value of B. It is specified constraints between the attributes. B is functionally A B Dependent on A Determinant- when a function dependency exists, the attribute or group of attributes on the left hand side of the arrow is called the determinant. Example: In above example A is determinant. Characteristics of functional dependencies: One to one relationship b/w attributes on the both sides. Hold for all time Are nontrivial. A dependency is trivial if the right hand side is a subset of the left side. Example: of trivial dependencies for the staff relation 1. Trivial : StaffNo, SName SName 2. Non trivial: StaffNo position , position attribute is functionally dependent to StaffNo but not true the reciprocal Inference rules for functional dependencies:A set of all functional dependencies that are implied by a given set of functional dependencies X is called closure of X. Armstrong’s axioms- set of inference rules. It specifies hoe new functional dependencies can be inferred from given ones. Take A, B, C and D are the subset of attributes of relation R. The Armstrong axioms are as follows, 1. Reflexivity : if B is a subset of A, then AB 2. Augmentation: if AB , then A,CB,C 3. Transitivity: if AB and BC, then AC 4. Self-determination: if AA 5. Decomposition: if AB,C then AB and AC 6. Union : if AB and AC, then AB,C 7. Composition: if AB and CD then A,CB,D Minimal sets of functional dependencies: A set of functional dependencies X is minimal if it satisfies the following conditions: 1. Every attribute in X has a single attribute on its right hand side. 2. Any dependency AB in X cannot be replaced with dependency CB, where C is a proper subset of A. 3. Any dependency cannot be removed from X. Know more @ www.vidyarthiplus.com Powered by WR1334 Non loss decomposition and functional dependencies: The normalization procedure involves breaking down or decomposing of given data into several tables that will be connected to each other based on the data within them and more over that the decomposition is required to be reversible. So that no information is loss in the process is called loss or non loss decomposition. Heath’s theorem: Let R {A, B, C} be a relation, Where A, B, C is sets of attributes. If R satisfies the FD AB, then R is equal to the join of its projections on {A,B} and {A,C}. More on functional dependencies: 1. Left irreducible FDs- An FD is said to be left irreducible if its left hand side is “not too big” 2. FDs are a semantic notion. Normalization: Normalization is the process of efficiently organizing data in a database. There are two goals of the normalization process: 1. Eliminating redundant data (for example, storing the same data in more than one table). 2. Ensuring data dependencies make sense (only storing related data in a table). Both of these are worthy goals as they reduce the amount of space a database consumes and ensure that data is logically stored. The Normal Forms: The database community has developed a series of guidelines for ensuring that databases are normalized. These are referred to as normal forms. They are having 5 types, 1. First normal form or 1NF 2. Second normal form or 2NF 3. Third normal form or 3NF 4. Boyce-codd normal form(BCNF) 5. Fourth normal form or 4NF 6. Fifth normal form or 5NF. 1. First Normal Form (1NF)(Multivalued attributes should be removed) First normal form (1NF) sets the very basic rules for an organized database. It is a relation in which the intersection of each row and column contains one and only one value. Rules: Eliminate duplicative columns from the same table. Create separate tables for each group of related data and identify each row with a unique column or set of columns (the primary key). The entire attribute are atomic. Example: After normalized Before normalized Department Faculty Class subject Department Faculty Class subject Computer A B.E DS Computer A B.E {DS,OS} B M.B.A {SQM,ST} Computer A B.E OS Computer B M.B.A SQM Computer B M.B.A ST Know more @ www.vidyarthiplus.com Powered by WR1334 2. Second Normal Form (2NF)(Partial dependency should be removed) Second normal form (2NF) further addresses the concept of removing duplicative data. It meets the following conditions, Meet all the requirements of the first normal form. Remove subsets of data that apply to multiple rows of a table and place them in separate tables. It’s don’t have partial dependencies that’s means its having fully functional dependency. 3. Third Normal Form (3NF) Third normal form (3NF) goes one large step further: Meet all the requirements of the second normal form. Remove columns that are not dependent upon the primary key. It has no transitivity dependency. Dependency preservation: Decomposition must be lossless so that we do not lose any information from the relation that is decomposed. Dependency preservation is another important requirement since a dependency is a constraint on the database and if X -> Y holds than we know that the two (sets) attributes are closely related and it would be useful if both attributes appeared in the same relation so that the dependency can be checked easily. Boyce-codd normal form (BCNF): It requires that there be no non-trivial functional dependencies of attributes on something other than a superset of a candidate key (called a super key). Difference b/w 3NF & BCNF: AB i. If 3NF, ‘B’ is a primary key and A is not a candidate key. ii. If BCNF, ‘A’ must be a candidate key.\ Multi- valued dependencies and Fourth Normal Form (4NF): Multi- valued dependencies: MVD represents a dependency between attributes in a relation, such that each value of A Finally, fourth normal form (4NF) has one additional requirement: Meet all the requirements of the third normal form. A relation is in 4NF if it has no multi-valued dependencies. Example: A >B A >C Department Faculty Class Computer A B.E Computer A B.E Computer B M.B.A Computer B M.B.A Example: Know more @ www.vidyarthiplus.com Powered by WR1334 Department >Faculty Department >Class Fourth normal form: Multivalued dependencies (MVD) are removed in 4NF. The normalization of BCNF relations to 4NF involves the removal of the MVD from the relation by placing the attributes in a new relation along with a copy of the determinant. Join dependencies and 5NF: Join dependencies: Lossless join dependency is a property of decomposition, which ensures that no spurious tuples are generated when relations are reunited through a join operation. Fifth normal form: A relation that has no join dependency is in fifth normal form. Consider the property item supplier relation. Item supplier Property no Item Supplier no description PG4 Bed S1 PG4 Chair S2 PG16 Bed S2 Item Description Supplier No Bed S1 Chair S2 Property item property supplier Property No Item Description PG4 Bed PG4 Chair PG16 Bed Property No Supplier No PG4 S1 PG4 S2 PG16 S2 In supplier relation table it contains a join dependency, it is therefore not in fifth normal form. To remove the join dependency, decompose the relation into three relations i.e. , property item, item supplier, property supplier. Know more @ www.vidyarthiplus.com Powered by WR1334 .
Load more

Recommended publications
  • Normalization
    Normalization Normalization is a process in which we refine the quality of the logical design. Some call it a form of evaluation or validation. Codd said normalization is a process of elimination, through which we represent the table in a preferred format. Normalization is also called “non-loss decomposition” because a table is broken into smaller components but no information is lost. Are We Normal? If all values in a table are single atomic values (this is first normal form, or 1NF) then our database is technically in “normal form” according to Codd—the “math” of set theory and predicate logic will work. However, we usually want to do more to get our DB into a preferred format. We will take our databases to at least 3rd normal form. Why Do We Normalize? 1. We want the design to be easy to understand, with clear meaning and attributes in logical groups. 2. We want to avoid anomalies (data errors created on insertion, deletion, or modification) Suppose we have the table Nurse (SSN, Name, Unit, Unit Phone) Insertion anomaly: You need to insert the unit phone number every time you enter a nurse. What if you have a new unit that does not have any assigned staff yet? You can’t create a record with a blank primary key, so you can’t just leave nurse SSN blank. You would have no place to record the unit phone number until after you hire at least 1 nurse. Deletion anomaly: If you delete the last nurse on the unit you no longer have a record of the unit phone number.
    [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]
  • 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]
  • Database Normalization—Chapter Eight
    DATABASE NORMALIZATION—CHAPTER EIGHT Introduction Definitions Normal Forms First Normal Form (1NF) Second Normal Form (2NF) Third Normal Form (3NF) Boyce-Codd Normal Form (BCNF) Fourth and Fifth Normal Form (4NF and 5NF) Introduction Normalization is a formal database design process for grouping attributes together in a data relation. Normalization takes a “micro” view of database design while entity-relationship modeling takes a “macro view.” Normalization validates and improves the logical design of a data model. Essentially, normalization removes redundancy in a data model so that table data are easier to modify and so that unnecessary duplication of data is prevented. Definitions To fully understand normalization, relational database terminology must be defined. An attribute is a characteristic of something—for example, hair colour or a social insurance number. A tuple (or row) represents an entity and is composed of a set of attributes that defines an entity, such as a student. An entity is a particular kind of thing, again such as student. A relation or table is defined as a set of tuples (or rows), such as students. All rows in a relation must be distinct, meaning that no two rows can have the same combination of values for all of their attributes. A set of relations or tables related to each other constitutes a database. Because no two rows in a relation are distinct, as they contain different sets of attribute values, a superkey is defined as the set of all attributes in a relation. A candidate key is a minimal superkey, a smaller group of attributes that still uniquely identifies each row.
    [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]
  • Unit-3 Schema Refinement and Normalisation
    DATA BASE MANAGEMENT SYSTEMS UNIT-3 SCHEMA REFINEMENT AND NORMALISATION Unit 3 contents at a glance: 1. Introduction to schema refinement, 2. functional dependencies, 3. reasoning about FDs. 4. Normal forms: 1NF, 2NF, 3NF, BCNF, 5. properties of decompositions, 6. normalization, 7. schema refinement in database design(Refer Text Book), 8. other kinds of dependencies: 4NF, 5NF, DKNF 9. Case Studies(Refer text book) . 1. Schema Refinement: The Schema Refinement refers to refine the schema by using some technique. The best technique of schema refinement is decomposition. Normalisation or Schema Refinement is a technique of organizing the data in the database. It is a systematic approach of decomposing tables to eliminate data redundancy and undesirable characteristics like Insertion, Update and Deletion Anomalies. Redundancy refers to repetition of same data or duplicate copies of same data stored in different locations. Anomalies: Anomalies refers to the problems occurred after poorly planned and normalised databases where all the data is stored in one table which is sometimes called a flat file database. 1 DATA BASE MANAGEMENT SYSTEMS Anomalies or problems facing without normalization(problems due to redundancy) : Anomalies refers to the problems occurred after poorly planned and unnormalised databases where all the data is stored in one table which is sometimes called a flat file database. Let us consider such type of schema – Here all the data is stored in a single table which causes redundancy of data or say anomalies as SID and Sname are repeated once for same CID . Let us discuss anomalies one by one. Due to redundancy of data we may get the following problems, those are- 1.insertion anomalies : It may not be possible to store some information unless some other information is stored as well.
    [Show full text]
  • Functional Dependencies Keys Armstrong's Axioms Splitting
    Functional Dependencies Keys Armstrong's Axioms A . A B . B Assume a relation with schema R(A , . ., A ). Reflexivity – If {B , . ., B } {A , . ., A } then 1 m 1 n 1 n 1 n 1 m A subset of {A , . ., A } is a superkey of R if it functionally A . A B . B . (These are the trivial functional 1 n 1 m 1 n determines all the attributes of R. dependencies.) “A , . ., A functionally determine B , . ., B ” 1 m 1 n Augmentation – If A . A B . B , then A superkey is a key if no proper subset of it is a superkey. 1 m 1 n A . A C . C B . B C . C . 1 m 1 k 1 n 1 k gearhead(person_ID, main_address, make, model, year, color, Transitivity – If A . A B . B and B . B C . income, parking_space, age, insurance_policy, tag_number) 1 m 1 n 1 n 1 . C , then A . A C . C . k 1 m 1 k These are sufficient to infer the consequences of a set of functional dependencies. 1 2 3 Splitting/Combining Closure of Attributes Computing the Closure A useful consequence of Armstrong's axioms is the Suppose that S is a set of functional dependencies and that To compute the closure of {A , . ., A } with respect to S: 1 m splitting/combining rule. {A , . ., A } is a set of attributes. The closure of {A , . ., 1 m 1 Let X = {A , . ., A }. A } (with respect to S) is the set of attributes B such that 1 m m A . A B is a consequence of the functional Repeat: A .
    [Show full text]
  • Normalization Process
    Database Technology Normal Forms Heiko Paulheim Previously on Database Technology • Designing databases with ER diagrams – Modeling a domain as a collection of entities and relationships – Entity: a “thing” or “object” in the domain • Described by a set of attributes – Relationship: an association among several entities – Represented diagrammatically by an entity-relationship diagram 03/14/18 Heiko Paulheim 2 Today • More about database design – Features of Good Relational Design – Atomic Domains and First Normal Form – Decomposition Using Functional Dependencies • 2nd, 3rd Normal Form and Boyce Codd Normal Form – Decomposition Using Multivalued Dependencies • 4th Normal Form – More Normal Forms 03/14/18 Heiko Paulheim 3 The Normalization Process • Iteratively improve the database design – Rule out non-atomic values – Eliminate redundancies • Iterations – Move database design from one normal form to the next • In each iteration – The design is changed (usually: smaller, but more relations) – Some typical problems are eliminated 03/14/18 Heiko Paulheim 4 5 Higher Complexity More Tables Better Consistency Less Redundancy Heiko Paulheim Heiko Domain Key Normal Form (DKNF) (DKNF) Form Key Normal Domain Boyce-Codd Normal Form (BCNF) (4NF) Form Normal Fourth (5NF) Form Normal Fifth First Normal Form (1NF) Form Normal First (2NF) Form Normal Second Third Normal Form (3NF) – – – – – – – Levels of normalization based on the amount of redundancy in the database Various levels of normalization are: 03/14/18 • • The Normalization Process Normalization The Atomicity • Consider the following relation ID Name Instructor Programs CS-101 Introduction to Computer Science Melanie Smith CS, DS, Math, CE CS-205 Introduction to Databases Mark Johnsson DS, Soc CS-374 Data Mining Mark Johnsson CS, DS, Soc MA-403 Linear Algebra Mary Williams Math, CS ..
    [Show full text]
  • Relation Normalization
    Introduction to Database Management Systems Relation Normalization Why Normalization? Functional Dependencies. First, Second, and Third Normal Forms. Boyce/Codd Normal Form. Fourth and Fifth Normal Form. No loss Decomposition. Summary CIS Relation Normalization 1 Why Normalization? An ill-structured relation contains redundant data Data redundancy causes modification anomalies: Insertion anomalies -- Suppose we want to enter SCUBA as an activity that costs $100, we can’t until a student signs up for it Update anomalies -- If we change the price of swimming for student 150, there is no guarantee that student 200 will pay the new price Deletion anomalies -- If we delete Student 100, we lose not only the fact that he/she is a skier, but also the fact that skiing costs $200 Normalization is the process used to remove modification anomalies ACTIVITY SID Activity Fee How can this table be changed 100 Skiing 200 to fix these problems??? 150 Swimming 50 175 Squash 50 200 Swimming 50 CIS Relation Normalization 2 Dave McDonald, CIS, GSU 10-1 Introduction to Database Management Systems Why Normalization... Course SID Name Grade Course# Text Major Dept s1 Joseph A CIS8110 b1 CIS CIS s1 Joseph B CIS8120 b2 CIS CIS s1 Joseph A CIS8140 b5 CIS CIS s2 Alice A CIS8110 b1 CS MCS s2 Alice A CIS8140 b5 CS MCS s3 Tom B CIS8110 b1 Acct Acct s3 Tom B CIS8140 b5 Acct Acct s3 Tom A CIS8680 b1 Acct Acct Is there any redundant data? Insertion anomalies? Update anomalies? Deletion anomalies? CIS Relation Normalization 3 Functional Dependencies Given two attributes, X and Y, of a relation R, Y is functionally dependent on X iff each X value must always occur with the same Y value in R.
    [Show full text]
  • Bcs 204 Dbe Lecture Notes
    LECTURE NOTES OF DATABASE ENGINEERING (BCS-204) CR.-04 Prepared by Dr. Suvasini Panigrahi, Dr. Satyabrata Das, Dr. Rakesh Mohanty DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Veer Surendra Sai University of Technology (VSSUT) Formerly University College Of Engineering, Burla Sambalpur, Odisha, India LECTURE PLAN OF DATABASE ENGINEERING (3-1-0) Cr.-04 MODULE – I (10 Lectures) Lecture 1: Introduction to Database Systems and its Applications Lecture 2: Database System Architecture Lecture 3: Data Abstraction, Data Independence Lecture 4: Data Models – Network, Hierarchical and Relational Data Models Lecture 5: Data Models – Relational and Object Oriented Data Models Lecture 6: Entity Relationship (ER) Model Lecture 7: Mapping ER Model to Relational Model Lecture 8: Data Definitions Languages Lecture 9: Data Manipulation Languages Lecture 10: Integrity Constraints and Data Manipulation Operations MODULE – II (08 Lectures) Lecture 11: Relation Query Language, Fundamental Relation Algebra Operations Lecture 12: Extended Relation Algebra Operations Lecture 13: Tuple and Domain Relational Calculus Lecture 14: SQL Lecture 15: QBE, Domain and Data Dependency Lecture 16: Armstrong’s Axioms, Dependency Preservation, Lossless Design Lecture 17: Normal Forms – 1NF, 2NF, 3NF, BCNF Lecture 18: Higher Normal Forms – 4NF, 5NF, Comparison of Oracle and DB2 MODULE – III (08 Lectures) Lecture 19: Introduction to Query Processing Lecture 20: Translating SQL Queries into Relational Algebra Lecture 21: Algorithms for External Sorting Lecture 22: Algorithms for
    [Show full text]