16.Consider a relation R = (A,B,C,D,E) with the following functional dependencies: {C,E → D, D → B, C → A} and identify a candidate key. None of them {C,E,D} {C,E,B} {C,E} 17.A join in which tuples from R1 that do not have matching values in the common attributes of R2 are also included in the result relation. R1 left outer join R2 R1 semi join R R1 equi join R2 R1 natural join R2 18.When two transactions that access the same database items have their operations interleaved in a way that makes the values of some database items incorrect this problem is call? none of them dirty read summary problem the lost update problem 19.Protect the database from inconsistencies and data loss Database recovery Database Transaction & Concurrency control Concurrency control Concurrency control & Database recovery 20.Let E1 and E2 be two entity types in an entity relationship diagram. E1 have all three simple single-valued attributes while E2 have two simple single-valued attributes and two simple multi-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. RI and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model? a)3 b)2 c)4 d)5

Database Systems: Design, Implementation, & Management

11th Edition

ISBN:9781285196145

Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Chapter10: Transaction Management And Concurrency Control

Section: Chapter Questions

Problem 1P

See similar textbooks

Related questions

Question

DATABASE SYSTEMS

16.Consider a relation R = (A,B,C,D,E) with the following functional dependencies:

{C,E → D, D → B, C → A} and identify a candidate key.

None of them
{C,E,D}
{C,E,B}
{C,E}

17.A join in which tuples from R1 that do not have matching values in the common attributes of R2 are also included in the result relation.

R1 left outer join R2
R1 semi join R
R1 equi join R2
R1 natural join R2

18.When two transactions that access the same database items have their operations interleaved in a way that makes the values of some database items incorrect this problem is call?

none of them
dirty read
summary problem
the lost update problem

19.Protect the database from inconsistencies and data loss

Database recovery
Database Transaction & Concurrency control
Concurrency control
Concurrency control & Database recovery

20.Let E1 and E2 be two entity types in an entity relationship diagram. E1 have all three simple single-valued attributes while E2 have two simple single-valued attributes and two simple multi-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. RI and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?

a)3

b)2

c)4

d)5

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.