MTE.1 CSE 4701 CSE4701 Midterm Exam Statistics (Spr15) Worry a lot! Notes: Final Exam 120 points MT - range from 40-50%; FE - range from 60-50% Track Performance.

Slides:



Advertisements
Similar presentations
Database Tables and Normalization
Advertisements

Chapter 5 Normalization of Database Tables
 Definition  Components  Advantages  Limitations Contents  Definition Definition  Normal Forms Normal Forms  First Normal Form First Normal Form.
Boyce-Codd NF Takahiko Saito Spring 2005 CS 157A.
Relational Normalization Theory. Limitations of E-R Designs Provides a set of guidelines, does not result in a unique database schema Does not provide.
For the ultimate in entertainment, play with 2 or more people, individually or as a team Players alternate turns Each player picks an “answer” and must.
Database table design Single table vs. multiple tables Sen Zhang.
Design Guidelines Normalisation Table Design. Informal Design Guidelines Table Semantics A table should hold information about one and only one entity/concept.
Database Design Conceptual –identify important entities and relationships –determine attribute domains and candidate keys –draw the E-R diagram Logical.
Programming Assignment #4 CS-2301, B-Term Programming Project #4 Arrays and Pointers Due, November 24, 11:59 PM (Assignment adapted from C: How to.
Normalization of Database Tables
MTE.1 CSE4100 Midterm Exam Results Scores and Percentages – Fall 2011 Average - All 52.85/ % Average - All 52.85/ % Average w/o 5 Grades 57.1/75.
1 © Prentice Hall, 2002 Chapter 5: Logical Database Design and the Relational Model Modern Database Management 6 th Edition Jeffrey A. Hoffer, Mary B.
Chapter 5 Normalization of Database Tables
Database Systems Design, Implementation, and Management Coronel | Morris 11e ©2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or.
NORMALIZATION N. HARIKA (CSC).
LOGICAL DATABASE DESIGN
Introduction to Schema Refinement. Different problems may arise when converting a relation into standard form They are Data redundancy Update Anomalies.
REGRETFUL SIGNINGS? BY: KEVIN PHILLIPS NONPARAMETRICS HARTLAUB.
Chapter 5 Normalization of Database Tables
Week 6 Lecture Normalization
XP Chapter 1 Succeeding in Business with Microsoft Office Access 2003: A Problem-Solving Approach 1 Level 3 Objectives: Identifying and Eliminating Database.
Database Design Sections 4 & 5 Subtype, Supertype, Mutually exclusive, non-transferability, transferable, 1:1, 1:M, M:M, Redundant, Intersection entity,
MTE.1 CSE 4701 CSE4701 Midterm Exam Statistics (Spr15) Worry a lot! Notes: Final Exam 120 points MT - range from 40-50%; FE - range from 60-50% Track Performance.
Avoiding Database Anomalies
Database Systems: Design, Implementation, and Management Tenth Edition
Database Management COP4540, SCS, FIU Relation Normalization (Chapter 14)
A Normalisation Example Mark Kelly McKinnon Secondary College Vceit.com Based on work by Robert Timmer-Arends.
Database Systems: Design, Implementation, and Management Ninth Edition Chapter 6 Normalization of Database Tables.
The Relational Model and Normalization R. Nakatsu.
Normalization (Codd, 1972) Practical Information For Real World Database Design.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 5 Normalization of Database.
資料庫正規化 Database Normalization 取材自 AIS, 6 th edition By Gelinas et al.
Logical Database Design Relational Model. Logical Database Design Logical database design: process of transforming conceptual data model into a logical.
SALINI SUDESH. Primarily a tool to validate and improve a logical design so that it satisfies certain constraints that avoid unnecessary duplication of.
M Taimoor Khan Course Objectives 1) Basic Concepts 2) Tools 3) Database architecture and design 4) Flow of data (DFDs)
Chapter 7 1 Database Principles Data Normalization Primarily a tool to validate and improve a logical design so that it satisfies certain constraints that.
DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall, Modified by Dr. Mathis 3-1 David M. Kroenke’s Chapter Three: The Relational.
RDBMSSection Relational DBMS DATABASE DEVELOPMENT And Franchise Colleges By MANSHA NAWAZ.
Natural vs. Generated Keys. Definitions Natural key—a key that occurs in the data, that uniquely identifies rows. AKA candidate key. Generated key—a key.
Databases in Web Devolvement By Andy Larson Using Microsoft Sever 2000 with ASP Database Integrity Inserting data Stored procedures Views Triggers Tips.
How to build ER diagrams
Warm-up Review of Sample free- response from A.P. Statistics A scatterplot demonstrates the positive correlation between the number of churches and the.
Unit 4 Object Relational Modeling. Key Concepts Object-Relational Modeling outcomes and process Relational data model Normalization Anomalies Functional.
Stat 13, Tue 5/1/ Midterm Expected value, lotto and roulette. 3. Normal calculations. Read ch4. Hw4 is due Tue, 5/8, and Midterm 2 is Thur,
© D. Wong Ch. 3 (continued)  Database design problems  Functional Dependency  Keys of relations  Decompositions based on Functional Dependency.
E-R Modeling: Table Normalization. Normalization of DB Tables Normalization ► Process for evaluating and correcting table structures determines the optimal.
Normalization Example. Database Systems, 8 th Edition 2 Database Tables and Normalization Normalization –Process for evaluating and correcting table structures.
1 © Prentice Hall, 2002 ITD1312 Database Principles Chapter 4B: Logical Design for Relational Systems -- Transforming ER Diagrams into Relations Modern.
Logical Database Design and the Relational Model.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 7 Normalization Hour1,2 Presented & Modified by Mahmoud Rafeek Alfarra.
April 20022CS3X1 Database Design Normalisation (1) John Wordsworth Department of Computer Science The University of Reading Room.
Chapter 8: Object-Relational Modeling Object-Oriented Systems Analysis and Design Joey F. George, Dinesh Batra, Joseph S. Valacich, Jeffrey A. Hoffer.
8-1 © Prentice Hall, 2007 Chapter 8: Object-Relational Modeling Object-Oriented Systems Analysis and Design Joey F. George, Dinesh Batra, Joseph S. Valacich,
RELATIONAL TABLE NORMALIZATION. Key Concepts Guidelines for Primary Keys Deletion anomaly Update anomaly Insertion anomaly Functional dependency Transitive.
Lecture 4: Logical Database Design and the Relational Model 1.
Al-Imam University Girls Education Center Collage of Computer Science 1 st Semester, 1432/1433H Chapter 10_part 1 Functional Dependencies and Normalization.
NORMALIZATION Handout - 4 DBMS. What is Normalization? The process of grouping data elements into tables in a way that simplifies retrieval, reduces data.
SLIDE 1IS 257 – Fall 2006 Normalization Normalization theory is based on the observation that relations with certain properties are more effective.
1 First Normal Form (1NF) Unnormalized table : Contains a repeating group –Eg: from multi-valued attributes –Eg: from many-many relationship Table in 1NF:
Database Normalization. What is Normalization Normalization allows us to organize data so that it: Normalization allows us to organize data so that it:
Problem 1a - Relational Algebra (Spr15)
CSE4701 Midterm Exam Statistics (Fall16)
Chapter 5: Logical Database Design and the Relational Model
Functional Dependencies
Errors in ER Diagram Do not represent a concept as both a relationship type and an attribute Make sure every entity type must have a key attribute Relationship.
CSE255 Midterm Exam Statistics (Fa07)
Chapter 6 Normalization of Database Tables
CHAPTER 4: LOGICAL DATABASE DESIGN AND THE RELATIONAL MODEL
Review of Week 3 Relation Transforming ERD into Relations
Presentation transcript:

MTE.1 CSE 4701 CSE4701 Midterm Exam Statistics (Spr15) Worry a lot! Notes: Final Exam 120 points MT - range from 40-50%; FE - range from 60-50% Track Performance from MT to Final Exam Differential from MT to Final If Increase - Weighted Average If Stay Same - that is your Performance If Decrease - that is your Performance Worry

MTE.2 CSE 4701 CSE4701 Grade Guesstimates (Spr15) Notes: All Subject to Change Used 20%HW, 80%E From Intro Overheads Must Pass Both Projects And Exams to PASS!!!

MTE.3 CSE 4701 Problem 1a - Relational Algebra (Fa15)  List the full names of all mens players that have/had the uniform number 5. 3pts PL =  PLName, PFName (  UniformNumber=5 ( PLAYER )) MT =  TeamID (  Squad=‘Mens’ ( TEAM )) ANS1a =  PLName, PFName ( PL * ( MT * ROSTERS )) ½ pt 1 pt

MTE.4 CSE 4701 Problem 1b - Relational Algebra (Fa15)  List the full names and points per game of all mens players that averaged more than 20 points per game and at least 5 rebounds per game in one year on teams with winning regular season records. 4pts MT =  TeamID (  Squad=‘Mens’ ( TEAM )) WR =  TeamID (  Wins > Losses ( RSRECORD * MT )) ANS1b =  PLName, PFName, PPG ( PT * PLAYER ) PL = (  PPG > 20 and RPG  5 ( STATISTICS * WR )) 1 pt

MTE.5 CSE 4701 Problem 1c - Relational Algebra (Fa15)  List the full names and uniform numbers of all womens players that played for Geno Auriemma in pts ANS1c =  PLName, PFName, UniformNumber ( PLAYER*GAP ) GAP = (  CLName=‘Auriemma’ ( ROSTERS * WT )) WT =  TeamID (  Squad=‘Womens’ and Year =1996 ( TEAM )) 1 pt 1.5 pts

MTE.6 CSE 4701 Problem 1d - Relational Algebra (Fa15)  List the full names of all mens players who played on a team with a losing regular season record coached by Jim Calhoun. 4pts ANS1d =  PLName, PFName ( PLAYER*MP ) MP = (  PlayerPersonID  CLName=‘Calhoun’ ( ROSTERS * MLT )) MT =  Squad=‘Mens’ and Wins < Losses ( TEAM * RSRECORD )) 1 pt 1.5 pts

MTE.7 CSE 4701 Problem 3 – Relation to EER Person PersonId Lname Fname StartYr Player NumYrs Uniform# Coach EndYear   o Record Wins Losses RSRecord PORecord   d Team TeamID Year Squad Titles TitleType Statistics RPG PPG APG Rosters 1 n m k 1 n n Team – 2 pts Person Hier – 3 pts Record Hier – 3 pts Rosters Relat – 3pts Titles Relat – 2pts Stats Relat – 3pts has 1 1 Deductions for Misplaced attributes Missing Attributes Missing 1, n, m, k Wrong d and o

MTE.8 CSE 4701 Problem 3 - Update Anomalies (Fa15) No Modify Anomaly - only one entry per player/coach (unique LNames) Insert Anomaly - Player in past can’t be coach in future - Player or coach leaves for 1 (or more years) and then returns - no way to store his/her return. No Delete Anomaly-only one entry per player/coach (unique LNames) Note: Lots of null values due to capturing two types of people. 4pts 2pts if mention guideline 1 (not single entity) 2pts if mention null values 2pts if player/coach insert anomaly Up to at most 4pts

MTE.9 CSE 4701 Problem 3 - Update Anomalies (Fa15) There are numerous problems for this table, since many values are replicated. For Example, teams that win multiple titles (NCAA and BigEastRS) must have each player and coach listed twice to capture this data. If you insert a player for a past team (that was omitted), you would have to make sure you inserted the player for all Titles of TeamID. Specifically: Insert: Can’t have a Team without having a player. Can’t have TitleType unless there is a Team with that title. Delete: Last Player on a team - loose the team. Modify: Change PLName, impact all TeamIDs for the player Basically - I looked for reasoning and a solid argument for this table. 6pts 2pts per issue – up to three issues – including others if the argument is OK.

MTE.10 CSE 4701 Problem 3 - Update Anomalies (Fa15) Modify Anomaly - Whenever RSWins or RSLosses is modified (for a win or a loss), TTLWins or TTLLosses must be incremented. No Insert Anomaly - only one entry per team. No Delete Anomaly - no information is lost on anything but the team. No Modify Anomaly - PPG, RPG, and APG are independent of one another and no values in common across different players. No Insert Anomaly - only one entry per player. No Delete Anomaly- no information is lost on anything but the player. 2pts 3pts Looking for the key anomaly re. dependencies among totals Accepted other answers for partial credit Need to give at least a reason or only 1pt if just say NONE.

MTE.11 CSE 4701 Problem 4 - Functional Dependencies (Fa15) LName  FName, StartYear LName, PFlag  NumYears, UniformNumber LName, CFlag  EndYear Year, Squad  CLName TeamID  Year, Squad TeamID, Year, Squad  TitleType TeamID, Year, Squad  PLName CLName  TitleType CLName  TeamId, Year, Squad PLName  TitleType a. 4pts a. 2pts b. 2pts b. 3pts

MTE.12 CSE 4701 Problem 4 - Functional Dependencies (Fa15) TeamID  RSWins, RSLosses, TTLWins, TTLLosses PLName, TeamID  PPG, RPG, APG PLName  PPG, RPG, APG PLName  TeamID TeamID  PLName a. 1 pts b. 3pts

MTE.13 CSE NF – Look at NBAPLAYER2 TABLE For Team  State – State depends on Team which is NOT part of a key Transitive from Name,Year to Team to State 3pts NBAPLAYER2a(Name, Year, Team) 3pts NBAPLAYER2b(Team, State) Problem 5 (Fa15) - Normalization NBAPLAYER( Name, Year, Coach, Team, State, Salary) 2NF Team Depends on {Year, Name} which is part of key Name, Year, Coach Salary Depend on Coach which is part of key Name, Year, Coach 5pts NBAPLAYER1(Name, Year, Coach, Salary) 4pts NBAPLAYER2(Name, Year, Team, State) Need to Not Break out Coach, Salary into one table, since Coach maps to different salaries (Clinton has 800,000, 700,000, and 1,000,000) Name, Year  Team; Team  State Name, Year, Coach  Team, State, Salary Coach  Salary Name, Year  Team; Team  State