Database System Concepts
Database System Concepts
7th Edition
ISBN: 9789332901384
Author: Henry F. Korth & S. Sudarshan Abraham Silberschatz
Publisher: MCGRAW-HILL HIGHER EDUCATION
Expert Solution & Answer
Book Icon
Chapter 7, Problem 14PE

Explanation of Solution

  • Let F be a set of functional dependencies that hold on a schema R.
  • Let σ= {R1, R2, . . . , Rn} be a dependency-preserving 3NF decomposition of R. Let X be a candidate key for R.
  • Consider a legal instance r of R. Let j = ΠX(r) ⋈ΠR1 (r) ⋈ΠR2 (r)    ⋈ΠRn (r). We want to prove that r = j.
  • The user can claim that if t1 and t2 are two tuples in j such that t1[X] = t2[X], then t1 = t2. To prove this claim, we use the following inductive argument-
  • Let F ′ = F1 ∪ F2 ∪ . . . ∪ Fn, where each Fi is the restriction of F to the schema Ri in s.
  • Consider the use of the algorithm given in Figure 8.8 to compute the closure of X under F ′ . We use induction on the number of times that the f or loop in this algorithm is executed.
  • Basis : In the first step of the algorithm, result is assigned to X, and hence given that t1[X] = t2[X], we know that t1[result] = t2[result] is true.
  • Induction Step : Let t1[result] = t2[result] be true at the end of the k th execution of the f or loop...

Blurred answer
Students have asked these similar questions
Ideal MOSFET Current–Voltage Characteristics—NMOS Device and draw the circuit
1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!
1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education