Register
Webpage for Databases:

Recent questions tagged databases

1 votes
0 answers
2011
Made Easy Test Series
The number of view equal serial schedules possible for the given schedule are: S: w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A)
The number of view equal serial schedules possible for the given schedule are:S: w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A)
User Avatar
0 votes
0 answers
2013
dbms ..
just expalin about view serilizable
just expalin about view serilizable
User Avatar
0 votes
1 answer
2014
MadeEasy Subject Test: Databases - Transactions
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positions So number of schedules will be 5 which are view eq to given schedule. But ans given is 10
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positionsSo number of schedules will be 5 which are view eq to given schedule.But ans given is 10
User Avatar
0 votes
1 answer
2016
# gate cse 1998 1mark question
plz explain why the answer is occupation ????
plz explain why the answer is occupation ????
User Avatar
1 votes
1 answer
2018
# gate cse 1998 2 marks
Plz explain the answer of ques no. 4 a) 2NF b) 3NF
Plz explain the answer of ques no. 4a) 2NFb) 3NF
User Avatar
1 votes
1 answer
2021
Mock Test
Is statement 1 true for all safe expressions ?
Is statement 1 true for all safe expressions ?
User Avatar
0 votes
0 answers
2022
MadeEasy Subject Test: Databases - Joins
Maximum no. of possible records in the result of the following expression is?
Maximum no. of possible records in the result of the following expression is?
User Avatar
0 votes
1 answer
2023
Database Lossless Join
User Avatar
2 votes
1 answer
2028
Test by Bikram | Mock GATE | Test 2 | Question: 5
Consider the following relation instance: A B C 1 2 3 2 3 5 1 4 3 2 3 6 ... $AB\rightarrow C$ $BC\rightarrow A$ $AC\rightarrow B$ II, III & V only I, IV & VI only III & V only V only
Consider the following relation instance:ABC123235143236 $$\begin{array}{|c|c|c|} \hline A & B &C \\ \hline 1 & 2 & 3 \\ \hline 2 & 3 & 5 \\ \hline 1 & 4 & 3 \\ \hlin...
User Avatar
0 votes
2 answers
2030
Which statement is wrong about SQL?
Which statement is wrong about SQL? 1. Some SQL versions will not allow HAVING clause without GROUP BY 2. Some SQL versions will allow HAVING clause without GROUP BY 3. Some SQL versions allow only ONE null for UNIQUE key 4. Some SQL versions allow multiple NULLs for UNIQUE Key
Which statement is wrong about SQL?1. Some SQL versions will not allow HAVING clause without GROUP BY2. Some SQL versions will allow HAVING clause without GROUP BY3. Som...
User Avatar
1 votes
1 answer
2031
MadeEasy Subject Test: Databases - Transactions
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
Consider the following scheduleS : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)The number of schedules equal to given schedule(s) which not conflict equal toschedule(s) are ______...
User Avatar
1 votes
1 answer
2032
Gateforum Test
1-In self referential relation we alwasy need 1 table. 2-If there is a total participation of one entity with the relation,we can can merge E1,the relation and E2 into a single table. Which of the above given statements are true?
1-In self referential relation we alwasy need 1 table.2-If there is a total participation of one entity with the relation,we can can merge E1,the relation and E2 into a ...
User Avatar
1 votes
3 answers
2033
Is the decomposition preserving dependencies?
a relational schema R (A, B, C, D) is decomposed into (A, B), (B, C), (B, D). If functional dependencies A → B, B → C, C → D and D → B were present in R, is the decomposition preserving dependencies?
a relational schema R (A, B, C, D) is decomposed into (A, B), (B, C), (B, D). If functional dependencies A → B, B → C, C → D and D → B were present in R, is the d...
User Avatar
1 votes
1 answer
2038
MadeEasy Subject Test: Databases - Sql
Correct Ans and how?
Correct Ans and how?
User Avatar
1 votes
4 answers
2040
Conflict Serializable and Timestamp based protocol
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules produced by timestamp based protocol ?
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules prod...
User Avatar
Page: