Problem # 3: Normal Form (4NF) Suppose we have the following Courses table with columns CourselD, Instructor, Book that stores the courses, the instructor teaching the course, and the recommended books for the course. The book(s) recommended for a course does not depend on the teacher teaching the course, just on the course. Here is an example of instantiation for this table: Courses: CourseID Instructor Book IT360 Crainiceanu Kroenke IT360 Crainiceanu Welling IT360 DeLooze Kroenke Welling Kroenke IT360 DeLooze S1440 Crainiceanu SI440 Crainiceanu Ramakrishna n SI440 Crainiceanu Stonebraker a) Give an example of a multivalued dependency in the Courses table. b) Is the Courses table in 4NF? If answer to yes, say why. If not, decompose the table such that the resulting tables are in 4th normal form. For each of the resulting tables, give the table name, column names, primary keys, and foreign keys.

Problem # 3: Normal Form (4NF) Suppose we have the following Courses table with columns CourselD, Instructor, Book that stores the courses, the instructor teaching the course, and the recommended books for the course. The book(s) recommended for a course does not depend on the teacher teaching the course, just on the course. Here is an example of instantiation for this table: Courses: CourseID Instructor Book IT360 Crainiceanu Kroenke IT360 Crainiceanu Welling IT360 DeLooze Kroenke Welling Kroenke IT360 DeLooze S1440 Crainiceanu SI440 Crainiceanu Ramakrishna n SI440 Crainiceanu Stonebraker a) Give an example of a multivalued dependency in the Courses table. b) Is the Courses table in 4NF? If answer to yes, say why. If not, decompose the table such that the resulting tables are in 4th normal form. For each of the resulting tables, give the table name, column names, primary keys, and foreign keys.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Safe Datalog Rule: A Datalog rule is of the form:p :- q1, ..., qn. where n>0 and p is a positive atomic formula and q1, ..., and qn are positive or negative atomic formulas. A positive atomic formula is of the form:r(x1, ..., xm) and a negative atomic formulas of the form:not r(x1, ..., xm) where m>0 and r is a relation name and x1 , ..., xm are either numbers or variables. Relation names and variables are made up of alphabetic letters or digits and start with a lower-case alphabetic letter. Even though the variables are made up of lower and upper-case letters, these should be considered case-insensitive. For example, cno, CNO, cNO, etc all should be treated as the same variable. Some examples of Datalog rules are given below: ancestor(x1, y1) :- parent(x1, y1). teaches(tno,cno) :- faculty(tno), course(cno), assigned(tno,cno). p(x,y) :- q(2,x), r(u,45,z), s(a,b,22). p(x,y,z) :- q(x), not r(y,20), s(x,z). A Datalog rule is considered “Safe” if all variables that appear to the left…
36. In a relation a. Ordering of rows is immaterial b. No two rows are identical c. a and b both are true d. None of these
J 1 Let R(A, B, C, D, E, F) be a relation schema, and let S = {A → B, BC → D, E → C, D →A, B → D} be a set of functional dependencies. Use the Nonadditive Join Test for Binary Decomposition to determine if the following decomposition is lossless.
it says relation room doesnt exist.
Example 1) In R programming language: -Create a ordinal factor named “Height” containing – high, low, mid, low, mid, low, mid, high, mid, high. -Using a logical index, create new factor of only those from “Height”" greater than low. -Replace the last index in “Height” with veryHigh and create new factor with those greater than mid
What do you mean by transitive dependency
Explain the Dependency Trees in the Real World?
Dependency Trees in the Real World
A transaction database is a set of transactions completed in a supermarket database. Each transaction is a set of items. For example, consider the following transaction database. It contains 5 transactions (t1, t2, ..., t5) and 5 items (1,2, 3, 4, 5). For example, the first transaction represents the set of items 1, 3 and 4. It is important to note that an item is not allowed to appear twice in the same transaction and that items are assumed to be sorted by lexicographical order in a transaction. Transaction id Items t1 {1, 3, 4} t2 {2, 3, 5} t3 {1, 2, 3, 5} t4 {2, 5} t5 {1, 2, 3, 5} What is the output of the Apriori algorithm run on the previous transaction database with a minimum support of 40 % (2 out of 5 transactions)?
What do you mean by "transitive dependency" in your definition?
CSC 472 Introduction to Database Systems Project Consider the contents of output tuples generated by a join operator. The advantage of "late materialization" approach is that future operators in the query plan never need to go back to the base tables to get more data. Group of answer choices True False
True or False : ___ Multiple Inheritance happens when a class has more than one sub-class. This problem can be observed in Programming Languages as well. ___ Given two relations named A and B, if we q-JOIN A and B, the maximum number of attributes in the result relation could be (the number of attributes of A) times(*) the number of attributes of B). ____ * in an SQL SELECT statement means “all the tuples”. ____ In relational algebra, Cartesian Product (X) can be implemented using the q-JOIN operator. Cartesian Product ISA q-JOIN where q-condition always evaluates to true. ____ SQL is based on Predicate Calculus. A query in SQL always specifies what should be included in the query result.