Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is(a) dependency preserving and lossless join(b) lossless join but not dependency preserving(c) dependency preserving but not lossless join(d) not dependency preserving and not lossless joinThe question was asked in semester exam.My query is from Materialized Views topic in portion Query Processing Techniques of Database Management

Consider a schema R(A, B, C, D) and functional dependencies A -> B and

1.	Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is(a) dependency preserving and lossless join(b) lossless join but not dependency preserving(c) dependency preserving but not lossless join(d) not dependency preserving and not lossless joinThe question was asked in semester exam.My query is from Materialized Views topic in portion Query Processing Techniques of Database Management
Answer» Right answer is (d) not dependency PRESERVING and not lossless join To EXPLAIN: While decomposing a relational table we MUST VERIFY the FOLLOWING properties: i) Dependency Preserving Property ii) Lossless-Join Property.

Discussion

No Comment Found

Related InterviewSolutions

A ___________________ is an explicit numeric, character, string or Boolean value not represented by an identifier.(a) Comments(b) Literals(c) Delimiters(d) IdentifiersI have been asked this question by my college professor while I was bunking the class.Query is from Advanced Query Optimization topic in section Query Processing Techniques of Database Management
_______________ has made PL/SQL code run faster without requiring any additional work on the part of the programmer.(a) SQL Server(b) My SQL(c) Oracle(d) SQL LiteI got this question during an online exam.My doubt is from Advanced Query Optimization topic in chapter Query Processing Techniques of Database Management
Which of the following is TRUE?(a) Every relation in 2NF is also in BCNF(b) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R(c) Every relation in BCNF is also in 3NF(d) No relation can be in both BCNF and 3NFThe question was posed to me in a national level competition.My doubt stems from Materialized Views topic in section Query Processing Techniques of Database Management
___________ refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails.(a) Isolation(b) Atomicity(c) Consistency(d) DurabilityI had been asked this question in an interview for job.I need to ask this question from Transformation of Relational Expressions topic in chapter Query Processing Techniques of Database Management
Tuples are generated ___________ in producer-driven pipelining, they are generated ________ on demand, in demand-driven pipelining.(a) Lazily, Eagerly(b) Eagerly, Lazily(c) Slowly, Eagerly(d) Eagerly, SlowlyThis question was addressed to me by my school principal while I was bunking the class.Enquiry is from Evaluation of Expressions topic in division Query Processing Techniques of Database Management
Pipelines can be executed in(a) 4(b) 3(c) 2(d) 5This question was posed to me in class test.My doubt is from Evaluation of Expressions in chapter Query Processing Techniques of Database Management
Pictorial representation of an expression is called(a) Expression tree(b) Operator tree(c) Expression flow(d) Expression chartI got this question during a job interview.This intriguing question comes from Evaluation of Expressions in portion Query Processing Techniques of Database Management
_______________ is a procedural extension of Oracle – SQL that offers language constructs similar to those in imperative programming languages.(a) SQL(b) PL/SQL(c) Advanced SQL(d) PQLThe question was asked in semester exam.The above asked question is from Advanced Query Optimization topic in chapter Query Processing Techniques of Database Management
Stored procedures are safe from SQL injection attacks(a) True(b) False(c) Depends on the result(d) Always safeI had been asked this question during an online interview.This question is from Estimating Statistics of Expression Results topic in portion Query Processing Techniques of Database Management
Which statement is used to define a cursor?(a) OPEN(b) FETCH(c) DECLARE CURSOR(d) FETCH_STATUSI have been asked this question by my school principal while I was bunking the class.I need to ask this question from Estimating Statistics of Expression Results topic in portion Query Processing Techniques of Database Management

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment