e. Retrieve the names of all employees who work on every project.

Slides:



Advertisements
Similar presentations
Exercise 2 Relational Calculus
Advertisements

Database System - Assignment #3 Sept. 2012Yangjun Chen ACS Assignment #3 due Wed., Nov. 14, (30) Exercise 7.17 on Page 235 Show the result.
Lossless-join Jan. 2012Yangjun Chen ACS Outline: Lossless-join Chapter 15 – 3rd ed. (Chap. 15 – 4 th, 5 th ed.; Chap. 16, 6 th ed.) Basic definition.
Jan. 2014Dr. Yangjun Chen ACS Database security and authorization (Ch. 22, 3 rd ed. – Ch. 23, 4 th ed. – Ch. 24, 6 th )
NORMALIZATION. Normalization Normalization: The process of decomposing unsatisfactory "bad" relations by breaking up their attributes into smaller relations.
Ch 10, Functional Dependencies and Normal forms
Dept. of Computer & Information Sciences
Ms. Hatoon Al-Sagri CCIS – IS Department Normalization.
Fig. 16-CO, p Fig. 16-1, p. 450 Fig. 16-2, p. 450.
Copyright © 2004 Pearson Education, Inc.. Chapter 10 Functional Dependencies and Normalization for Relational Databases.
Employee database: Conceptual Schema in ERD Chapter 3, page 62.
Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide
1 Functional Dependency and Normalization Informal design guidelines for relation schemas. Functional dependencies. Normal forms. Normalization.
AL-MAAREFA COLLEGE FOR SCIENCE AND TECHNOLOGY INFO 232: DATABASE SYSTEMS CHAPTER 6 NORMALIZATION FOR RELATIONAL DATABASES Instructor Ms. Arwa Binsaleh.
DatabaseIM ISU1 Chapter 10 Functional Dependencies and Normalization for RDBs Fundamentals of Database Systems.
Retrieve the names of all employees in department 5 who work more than 10 hours per week on the ‘ProductX’ project. p10ssn ← (Π essn (σ hours > 10 (works-on.
Functional Dependencies and Normalization for Relational Databases.
By Abdul Rashid Ahmad. E.F. Codd proposed three normal forms: The first, second, and third normal forms 1NF, 2NF and 3NF are based on the functional dependencies.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 15 Basics of Functional Dependencies and Normalization for Relational.
1 Functional Dependencies and Normalization Chapter 15.
Advanced Accounting Information Systems Day 10 answers Organizing and Manipulating Data September 16, 2009.
EXAMPLE 2 Use the Midsegment Theorem In the kaleidoscope image, AE BE and AD CD. Show that CB DE. SOLUTION Because AE BE and AD CD, E is the midpoint of.
File Organizations Jan. 2008Yangjun Chen ACS Outline: Hashing (5.9, 5.10, 3 rd. ed.; 13.8, 4 th ed.) external hashing static hashing & dynamic hashing.
Chapter 7 Functional Dependencies Copyright © 2004 Pearson Education, Inc.
ACS-4902Assignment 4 due: April 03, (15) What is the shadow paging principle? Assume that a database contains 7 pages and during the execution of.
Al-Imam University Girls Education Center Collage of Computer Science 1 st Semester, 1432/1433H Chapter 10_part 1 Functional Dependencies and Normalization.
Chapter 10 Functional Dependencies and Normalization for Relational Databases Copyright © 2004 Pearson Education, Inc.
10/3/2017.
10/3/2017.
Assignment #1 due Wed. Feb. 15, (15)
COP 6726: New Directions in Database Systems
Relational Normalization Theory
Database Management Systems
Functional Dependency and Normalization
Introduction to the database systems (1)
Indexes By Adrienne Watt.
Module 2: Intro to Relational Model
CHAPTER 14 Basics of Functional Dependencies and Normalization for Relational Databases.
Schedule Today: Next After that Normal Forms. Section 3.6.
Functional Dependencies and Normalization for Relational Databases
Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases.
Functional Dependencies and Normalization for RDBs
Payroll Management System
Chapter 2: Intro to Relational Model
Constraints AND Examples
Functional Dependencies and Normalization for Relational Databases
Table Normal Forms.
Chapter 4 Indexes.
CH 4 Indexes.
static hashing & dynamic hashing hash function
Outline: Normalization
Assignment #3 Due: April 03, 2017
Initial Design of Entity Types: EMPLOYEE, DEPARTMENT, PROJECT, DEPENDENT Gender.
CH 4 Indexes.
Normalization DB Design Guidelines Presented by: Dr. Samir Tartir
Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases.
Chapter 2: Intro to Relational Model
Chapter 2: Intro to Relational Model
Normalization February 28, 2019 DB:Normalization.
Sampath Jayarathna Cal Poly Pomona
Example of a Relation attributes (or columns) tuples (or rows)
Chapter 2: Intro to Relational Model
1. Explain the following concepts: (a) superkey (b) key
1.(5) Describe the working process with a database system.
Chapter Outline 1 Informal Design Guidelines for Relational Databases
= x 2 = = 20 4 x 5 = = 16 4 x 4 = = 18 6 x 3 = = 12 2 x 6 = 12.
Join Dependencies and Fifth Normal Form
Constraints AND Examples
Quizzes on FD and NF Chapter 19
3.1 Normalization of Relations (1)
Presentation transcript:

e. Retrieve the names of all employees who work on every project. Due: April 06, 2009 (48) Specify the following queries in SQL (see Fig. 7.5 on my home page). a. Retrieve the name of all employees in department 5 who work more than 10 hours per week on the ‘Product X’ project. b. List the names of all employees who have a dependent with the same first name as themselves. c. Find the names of all employees who are directly supervised by ‘Franklin Wong’. d. For each project, list the project name and the total hours per week (by all employees) spent on that project. e. Retrieve the names of all employees who work on every project. f. Retrieve the names of all employees who do not work on any project. 2. (16) What update anomalies occur in the EMP_PROJ and EMP_DEPT relations of Figures 14.3 and 14.4 (on my home page). Jan. 2009 Yangjun Chen ACS-3902

3. (18) In what normal form is the LOTS relation schema in Figure 14 3. (18) In what normal form is the LOTS relation schema in Figure 14.11(a) with respect t the restrictive interpretations of normal form that take only the primary key into account? Would it be in the same normal form if the general definitions of normal form were used? (By the general definitions of normal forms, not only the primary key, but also all the key should be considered. See 14.4.3 in 3rd ed., 10.4.3. in 4th and 5th ed. ) 4. (18) Consider a relation R(A, B, C, D, E) with the following dependencies: AB C, CD  E, DE  B. Is AB a candidate key of this relation? If not, is ABD? Explain your answer. Jan. 2009 Yangjun Chen ACS-3902