Dark Mode

Answers by Shefali

0 votes

1

serializibility
My Answer is option c im i wrong if so plz correct me

answered in Databases Jan 22, 2016

198 views

1 vote

2

answered in Databases Jan 22, 2016

352 views

0 votes

3

Candidate keys
Q18). Consider the table $R$ , with attributes $A,B,C,D$ and $E$. What is the largest number of candidate keys at the same time? 1 5 10 31 As we know number of candidate keys with n number of attributes is $2^n -1$.Then how to solve this question?

answered in Databases Jan 22, 2016

426 views

0 votes

4

madeeasy test series
why table for phones is not considered here..? :)

answered in Databases Jan 22, 2016

368 views

1 vote

5

Minimum number of insertions to add a new level to this tree

answered in Databases Dec 23, 2015

558 views

1 vote

6

How is this schedule not allowed in Strict 2PL, but allowed in 2PL ?
$\begin{bmatrix} T1 &T2 \\ R(A) & \\ W(A)& \\ & R(A)\\ & W(A)\\ &R(B) \\ &W(B) \\ & Commit\\ Abort& \end{bmatrix}$ How is this schedule allowed in 2PL ? In 2PL ... phase in , which is not present in T2 ..? This example is given in the book by Raghu Ramkrishnan on page 529 and 552 (for reference)

answered in Databases Oct 7, 2015

2.6k views

9 votes

7

Find canonical cover for the given set of functional dependencies.
Consider the following set of functional dependency on the scheme (A, B,C) A→BC, B→C, A→B, AB→C The canonical cover for this set is: A. A→BC and B→C B. A→BC and AB→C C. A→BC and A→B D. A→B and B→C

answered in Databases Jul 25, 2015

10.5k views

0 votes

8

database
decompose relation into 2NF ,3NF,BCNF R(ABCDE) {AB--->C, DE----->C , B------->D} R(ABCD) {AB----->C,C-------->D,D-------->A}

answered in Databases Jul 25, 2015

1.1k views