Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Databases:
Recent questions tagged databases
2
votes
2
answers
2281
Er Diagram
Consider the following entity relation diagram If A has 50 entities,B has 20 entities and C has 200 entities. what is the maximum number of triples of entities that could be in the relationship Set R ? (A) 50 (B) 100 (C) 1000 (D) 10,000 ans is A,C(given) please explain how??
Consider the following entity relation diagramIf A has 50 entities,B has 20 entities and C has 200 entities. what is the maximum number of triples of entities that could ...
indrajeet
3.3k
views
indrajeet
asked
Sep 23, 2016
Databases
databases
er-diagram
test-series
gatebook-dbms
+
–
6
votes
1
answer
2282
sql query
Consider the following table Mystery Mystery A B 1 Null 2 4 3 5 Null 6 select count() from Mystery where A not in( select B from Mystery) (A) 1 (B) 0 (C) 4 (D) 3 ans is B given please explain how??
Consider the following table MysteryMysteryAB1Null2435Null6select count() from Mysterywhere A not in( select B from Mystery)(A) 1(B) 0(C) 4(D) 3ans is B givenplease expla...
indrajeet
790
views
indrajeet
asked
Sep 22, 2016
Databases
databases
sql
gatebook-dbms
+
–
4
votes
1
answer
2283
Checking for lossless-join property
The decomposition of relation R with FD set F into R1 and R2 has lossless join property iff R1 $\cap$ R2 $\rightarrow$ R1 $\in$ F$^+$ OR R1 $\cap$ R2 $\rightarrow$ R2 $\in$ F$^+$ If R is decomposed into more than 2 ... ? Or is that table drawing thing the only way to check for lossless join property ? Answers with reference(s) will be much appreciated. Thanks.
The decomposition of relation R with FD set F into R1 and R2 has lossless join property iffR1 $\cap$ R2 $\rightarrow$ R1 $\in$ F$^+$ ORR1 $\cap$ R2 $\rightarrow$ R2 $\in...
Rounak Agarwal
1.0k
views
Rounak Agarwal
asked
Sep 22, 2016
Databases
decomposition
databases
lossless-join
+
–
4
votes
3
answers
2284
Sql Query
Let R(a,b) be a schema and Q1 and Q2 are queries on R. Q1: SELECT * FROM R; Q2: (SELECT * FROM R) INTERSECT (SELECT * FROM R); Which of the following statements is true? (A) Q1 and Q2 produce the same answer. (B) The answer to Q1 is always ... The answer to Q2 is always contained in the answer to Q1. (D) Q1 and Q2 produce different answers. ans = C given please explain the logic behind
Let R(a,b) be a schema and Q1 and Q2 are queries on R.Q1: SELECT * FROM R;Q2: (SELECT * FROM R) INTERSECT (SELECT * FROM R);Which of the following statements is true?(A) ...
indrajeet
2.2k
views
indrajeet
asked
Sep 22, 2016
Databases
databases
sql
gatebook-dbms
+
–
5
votes
2
answers
2285
database-indexing-2
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
resilientknight
508
views
resilientknight
asked
Sep 20, 2016
Databases
databases
indexing
+
–
5
votes
1
answer
2286
database-indexing
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
resilientknight
731
views
resilientknight
asked
Sep 20, 2016
Databases
databases
indexing
+
–
4
votes
3
answers
2287
relational algebra
In the following relational algebra expressions, assume union and difference are multi set operators and the relations R(x),S(x) and T(x) are multi sets. Q1:(R U S)-T Q2:(R - T)U(S - T) (A) Q1 and Q2 produce the same answer (B) ... answer to Q2 is always contained in the answer to Q1 (D) They produce complete different answers what is the answer ,please explain or give example.
In the following relational algebra expressions, assume union and difference are multi set operators and the relations R(x),S(x) and T(x) are multi sets.Q1:(R U S)-TQ2:(R...
indrajeet
1.5k
views
indrajeet
asked
Sep 20, 2016
Databases
databases
relational-algebra
test-series
gatebook-dbms
+
–
1
votes
1
answer
2288
ER model
After mapping an ER diagram relationship to Relational model using the set of rules for 1:n,m:n etc,will the achieved tables will always be in BCNF ?
After mapping an ER diagram relationship to Relational model using the set of rules for 1:n,m:n etc,will the achieved tables will always be in BCNF ?
suchismith roy
492
views
suchismith roy
asked
Sep 18, 2016
Databases
er-diagram
databases
+
–
1
votes
2
answers
2289
Explain Division Operator
R/S is defined as ${\prod }_{R-S} (r) - {\prod }_{R-S} \begin{pmatrix} \left \langle {\prod }_{R-S} (r) \times S \right \rangle - {\prod }_{R-S,S} (r) \end{pmatrix}$ Please explain the validity of the statements with example
R/S is defined as${\prod }_{R-S} (r) - {\prod }_{R-S} \begin{pmatrix} \left \langle {\prod }_{R-S} (r) \times S \right \rangle - {\prod }_{R-S,S} (r) \end{pmatrix}$Please...
pC
737
views
pC
asked
Sep 18, 2016
Databases
relational-algebra
databases
+
–
0
votes
1
answer
2290
Self Doubt : Conflict Serializable
Account on the following statements IF Conflict Serial schedule then it is ALWAYS possible under 2PL
Account on the following statements IF Conflict Serial schedule then it is ALWAYS possible under 2PL
pC
815
views
pC
asked
Sep 18, 2016
Databases
databases
conflict-serializable
+
–
2
votes
4
answers
2291
database-query-normalization-true-false
if table r has only one candidate key then which of the following is true: if R is in 3nf,it is also in bcnf R may not be in bcnf
if table r has only one candidate key then which of the following is true:if R is in 3nf,it is also in bcnfR may not be in bcnf
resilientknight
3.8k
views
resilientknight
asked
Sep 17, 2016
Databases
database-normalization
databases
+
–
7
votes
2
answers
2292
DBMS
Consider the following transactions: T1: r1(x), r1(z), r1(y), w1(z) T2: r1(z), r1(x), r1(y), w1(x) Which of the statement is true about transactions T1 and T2? S1: Every non-serial schedule between T1 and T2 are conflict serializable schedule. S2: Some non-serial ... . S4: Some non-serial schedule between T1 and T2 is allowed using 2PL protocol. a)S1 and S4 b)S2 and S4 3)S2 and S3 4)Only S3
Consider the following transactions:T1: r1(x), r1(z), r1(y), w1(z)T2: r1(z), r1(x), r1(y), w1(x)Which of the statement is true about transactions T1 and T2?S1: Every non-...
srestha
1.5k
views
srestha
asked
Sep 17, 2016
Databases
databases
+
–
4
votes
3
answers
2293
er model,databases
IF A RELATION HAS ______________ CARDINALITY, THEN NO MINIMIZATION CAN TAKE PLACE. a) 1:n b)m:m c)n:1 d) none
IF A RELATION HAS ______________ CARDINALITY, THEN NO MINIMIZATION CAN TAKE PLACE.a) 1:nb)m:mc)n:1d) none
resilientknight
1.0k
views
resilientknight
asked
Sep 16, 2016
Databases
databases
er-diagram
+
–
1
votes
3
answers
2294
DBMS test
Consider a relation R(A, B) that contain r tupples, and a relation S(B, C) that contains s tupples; assume r > 0 and s > 0. Make no assumption about keys. For the relational algebra expression what can be the minimum and the maximum number of tupples that could be in the result of expression in ... and s. A) Min:0,Max:r+s B) Min:r+s,Max:r*s C) Min:max(r,s),Max:r+s D) Min:0,Max:r*s
Consider a relation R(A, B) that contain r tupples, and a relation S(B, C) that contains s tupples; assume r 0 and s 0. Make no assumption about keys. For the relationa...
srestha
1.4k
views
srestha
asked
Sep 15, 2016
Databases
databases
+
–
1
votes
1
answer
2295
UGC NET CSE | June 2010 | Part 2 | Question: 20
The PROJECT Command will create new table that has More fields than the original table More rows than original table Both (A) & (B) None of these
The PROJECT Command will create new table that hasMore fields than the original tableMore rows than original tableBoth (A) & (B)None of these
makhdoom ghaya
2.1k
views
makhdoom ghaya
asked
Sep 15, 2016
Databases
ugcnetcse-june2010-paper2
databases
sql
+
–
0
votes
1
answer
2296
UGC NET CSE | June 2010 | Part 2 | Question: 19
Which data management language component enabled the DBA to define the schema components ? DML Sub-schema DLL Schema DLL All of these
Which data management language component enabled the DBA to define the schema components ?DMLSub-schema DLLSchema DLLAll of these
makhdoom ghaya
2.5k
views
makhdoom ghaya
asked
Sep 15, 2016
Databases
ugcnetcse-june2010-paper2
databases
sql
+
–
1
votes
2
answers
2297
UGC NET CSE | June 2010 | Part 2 | Question: 18
Match the following : ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-iii, b-ii, c-iv, d-i}$
Match the following :$\begin{array}{clccl} \text{a.} & \text{2 NF} & & \text{i.} & \text{Transitive dependencies eliminated} \\ \text{b.} & \text{3 NF} & & \text{ii.} ...
makhdoom ghaya
3.4k
views
makhdoom ghaya
asked
Sep 15, 2016
Databases
ugcnetcse-june2010-paper2
databases
database-normalization
+
–
0
votes
2
answers
2298
UGC NET CSE | June 2010 | Part 2 | Question: 17
Generalization is _______ process. Top-down Bottom up Both (A) & (B) None of these
Generalization is _______ process.Top-downBottom upBoth (A) & (B)None of these
makhdoom ghaya
3.6k
views
makhdoom ghaya
asked
Sep 15, 2016
Databases
ugcnetcse-june2010-paper2
databases
generalization
+
–
1
votes
4
answers
2299
UGC NET CSE | June 2010 | Part 2 | Question: 16
An entity instance is a single occurrence of an ______. Entity type Relationship type Entity and relationship type None of these
An entity instance is a single occurrence of an ______.Entity typeRelationship typeEntity and relationship typeNone of these
makhdoom ghaya
2.5k
views
makhdoom ghaya
asked
Sep 15, 2016
Databases
ugcnetcse-june2010-paper2
databases
er-diagram
+
–
1
votes
0
answers
2300
Internet- restructuring of b + tree - deletion
Can someone please explain the restructuring of b+ tree in delete 15 step? I mean after 16,20,25 becomes the child of 13 ,after that it is not clear,how does 11 become the root?
Can someone please explain the restructuring of b+ tree in delete 15 step? I mean after 16,20,25 becomes the child of 13 ,after that it is not clear,how does 11 become t...
resilientknight
1.1k
views
resilientknight
asked
Sep 13, 2016
Databases
b-tree
databases
+
–
1
votes
1
answer
2301
Order of a leaf node in B+ tree
This question was asked in GATE 2007 : https://gateoverflow.in/1261/gate2007-63-isro2016-59 Here, they have mentioned that the order of a leaf node is the max. number of keys it can hold. Usually order and key concept are different. If nothing is mentioned, then what should we do? Assume this or follow the formula of : max. keys + 1
This question was asked in GATE 2007 :https://gateoverflow.in/1261/gate2007-63-isro2016-59Here, they have mentioned that the order of a leaf node is the max. number of ke...
prasitamukherjee
955
views
prasitamukherjee
asked
Sep 10, 2016
Databases
databases
+
–
1
votes
1
answer
2302
UGC NET CSE | December 2010 | Part 2 | Question: 47
Data mining is The process of extracting valid, previously unknown, comprehensible and actionable information from large databases and using it to make crucial business decisions. A tool that allows end users direct access and manipulation ... . A tool that helps end users extract useful business information from large database. All of the above
Data mining isThe process of extracting valid, previously unknown, comprehensible and actionable information from large databases and using it to make crucial business de...
makhdoom ghaya
2.3k
views
makhdoom ghaya
asked
Sep 9, 2016
Others
ugcnetcse-dec2010-paper2
databases
data-mining
+
–
0
votes
1
answer
2303
join
Comment on the following two statements Natural Join produce cartecian product of two tables on joing two relations with no matching coloums Full Outer Join produce cartecian product of two tables on joing two relations with no matching coloums
Comment on the following two statementsNatural Join produce cartecian product of two tables on joing two relations with no matching coloumsFull Outer Join produce cartec...
pC
508
views
pC
asked
Sep 9, 2016
Databases
databases
natural-join
+
–
11
votes
2
answers
2304
serializablity and recoverability of schedules
1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit 2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit 3) T1: W(X), T2: R(X), T1: W(X), T2: ... : Abort Can anyone explain whether these schedules are serializable, conflict-serializable, view serializable, recoverable, avoids-cascading-aborts, and strict? The abort operation actually bugging me.
1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit3) T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortCan anyo...
vix28
12.2k
views
vix28
asked
Sep 8, 2016
Databases
transaction-and-concurrency
concurrency
conflict-serializable
view-serializable
databases
+
–
0
votes
2
answers
2305
UGC NET CSE | December 2010 | Part 2 | Question: 18
Which of the following is an optimistic concurrency control method ? Validation based Time stamp ordering Lock-based None of these
Which of the following is an optimistic concurrency control method ?Validation basedTime stamp orderingLock-basedNone of these
makhdoom ghaya
4.3k
views
makhdoom ghaya
asked
Sep 7, 2016
Databases
ugcnetcse-dec2010-paper2
databases
transaction-and-concurrency
+
–
2
votes
2
answers
2306
UGC NET CSE | December 2010 | Part 2 | Question: 17
The dependency preservation decomposition is a property to decompose database schema D, in which each functional dependency $X \rightarrow Y$ specified in $F$, Appeared directly in one of the relation schemas $Ri$ in the decomposed D. Could be inferred from dependencies that appear in some $Ri$. Both (A) and (B) None of these
The dependency preservation decomposition is a property to decompose database schema D, in which each functional dependency $X \rightarrow Y$ specified in $F$,Appeared di...
makhdoom ghaya
3.5k
views
makhdoom ghaya
asked
Sep 7, 2016
Databases
ugcnetcse-dec2010-paper2
databases
database-normalization
+
–
0
votes
3
answers
2307
UGC NET CSE | December 2010 | Part 2 | Question: 16
In generalisation, the differences between members of an entity is Maximized Minimized Both (A) & (B) None of these
In generalisation, the differences between members of an entity isMaximizedMinimizedBoth (A) & (B)None of these
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Sep 7, 2016
Databases
ugcnetcse-dec2010-paper2
databases
er-diagram
+
–
0
votes
4
answers
2308
#sql #dbms
saket nandan
528
views
saket nandan
asked
Sep 6, 2016
Databases
databases
sql
+
–
2
votes
1
answer
2309
#View Serializability #DBMS
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializable But still wanted to know what is the view serializable sequence?
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializableBut still wanted to know what is the view ser...
Prajwal Bhat
986
views
Prajwal Bhat
asked
Sep 5, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
2
votes
1
answer
2310
Deleting a node from B+ tree
How to delete key 15 from below B+ tree?
How to delete key 15 from below B+ tree?
GateAspirant999
784
views
GateAspirant999
asked
Sep 4, 2016
Programming in C
b-tree
databases
algorithms
+
–
Page:
« prev
1
...
72
73
74
75
76
77
78
79
80
81
82
...
97
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register