Bissoy.com
Doctors Medicines MCQs Q&A

The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is

The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is Correct Answer 3NF synthesis algorithm

The result is not uniquely defined, since a set of functional dependencies can have more than one canonical cover, and, further, in some cases, the result of the algorithm depends on the order in which it considers the dependencies in Fc.

Related Questions

Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed. The underlined attributes are the respective primary keys. Schema I: Field ‘courses’ is a set-valued attribute containing the set of courses a student has registered for. Non-trivial functional dependency: rollno → courses Schema II: Non-trivial functional dependencies: rollno, courseid → email email → rollno Schema III: Non-trivial functional dependencies: rollno, courseid → marks, grade marks → grade Schema IV: Non-trivial functional dependencies: rollno, courseid → credit courseid → credit Which one of the relational schemas above is in 3NF but not in BCNF?
A _________ Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F.
The following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}: V → W VW → X Y → VX Y → Z Which of the following is irreducible equivalent for this set of functional dependencies?
In a public bathroom there are n taps 1,2,3...n. Tap1 and Tap2 take equal time to fill the tank while Tap3 takes half the time taken by Tap2 and Tap4 takes half the time taken by Tap3. Similarly each next number of tap takes half the time taken by previous number of Tap i.e, K-th Tap takes half the time taken by (K-1)th Tap.If the 10th tap takes 2 hours to fill the tank alone then what is the ratio of efficiency of 8th tap and 12th tap, respectively?
Three friends Atul, Bikram and Chotu started a business with initial investments in the ratio of 3 : 2 : 5. After 3 months, Atul further adds Rs. 20000 and Bikram adds Rs. 10000 further 3 months later.If after 1 year, the ratio of their profit sharing is 15 : 8 : 10 then what was Chotu’s initial investment?
A database of research articles in a journal uses the following schema. (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE) The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema. (VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE (VOLUME, NUMBER) → YEAR (VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE The database is redesigned to use the following schemas. (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE) (VOLUME, NUMBER, YEAR) Which is the weakest normal form that the new database satisfies, but the old one does not?  
The _______ is a set of all functional and multi values dependencies implied by a set of functional dependencies
Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
P, Q and R invested in a business for 2.5 years, such that P’s initial investment was 60% more than Q’s initial investment, while R’s initial investment was 25% less than P’s initial investment. After 10 months, each of them invested 25% of their initial investment. What part of the total profit will P received after 2.5 years?
Let R(A, B, C, D) be a relation schema and F = {A → BC, AB → D, B → C} be the set of functional dependencies defined over R. Which of the following represents the closure of the attribute set {B}?