Recent questions tagged tbb-dbms-1

1 votes
1 answer
1
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
0 votes
1 answer
2
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
0 votes
1 answer
3
What does the following Tuple Relational Calculus query produce?The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ...
1 votes
1 answer
6
Checkpoints are a part ofRecovery measuresSecurity measuresConcurrency measuresAuthorization measures
0 votes
1 answer
7
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
1 votes
2 answers
8
Given R(A,B,C,D,E) with the set of FDs,F{AB→CD, ABC → E, C → A}the normal form of R is2NFBCNF4NF3NF
0 votes
1 answer
10
A transaction is in __________ state after the final statement has been executed.partially committedactivecommittedaborted
0 votes
1 answer
11
What is the Minimum space utilization for a $B+$ Tree index node:$80 \%$$60 \%$$50 \%$$75 \%$
0 votes
1 answer
12
Which is the best file organization when data is frequently added or deleted from a file?SequentialDirectIndex sequentialNone of the above
3 votes
2 answers
14
This is an Instance of Sailors Relation$$\overset{\text{Sailors Table}} { \begin{array}{|l|l|} \hline \text{S_ID} & \text{S_Name} & \text{Rating} & \text{Age} \\ \hline 1...
1 votes
1 answer
15
The FD $A \rightarrow B, \ \ DB \rightarrow C$ implies$DA \rightarrow C$$A \rightarrow C$$B \rightarrow A$$DB \rightarrow A$
1 votes
1 answer
20
0 votes
1 answer
21
Consider the relation $R(A, B, C, D, E)$ with the set of function dependencies: $F = \{ AB \rightarrow C, \ \ D \rightarrow E, \ \ A \rightarrow D \}$ The candidate K...
1 votes
1 answer
23
The rule that a value of a foreign key must appear as a value of some specific table is called aReferential constraintIndexIntegrity constraintFunctional dependency
0 votes
1 answer
25
In SQL the statement→ Select * from R ,S is equivalent to:select * from R natural join Sselect * from R inner join Sselect * from R cross join Sselect * from R union j...
0 votes
2 answers
26
Two transactions of $T1$ and $T2$ are given as follows:$T1: \text{R1(A) W1(A) R1(B) W1(B)}$$T2 : \text{ R2(B) W2(B) R2(C) W2(C)}$Total number of Conflict Serializable...
0 votes
1 answer
27
Each dealer owns one or more cars and each car is owned by at-most one dealer. If Dealer table has $20$ tuples and Cars table has $60$ tuples then owns table can have max...
0 votes
2 answers
28
Suppose that the transaction T1 and T2 access the same database items.$$\begin{array}{|l|l|} \hline T1 & T2 \\ \hline \text{read(X)} & {} \\ X=X-N & {} \\ \hline {} & \te...
1 votes
2 answers
29
Under what condition does the selection operation distribute over theta join operation?Let $R$ and $S$ are two relations then which one of the following statements about ...
3 votes
1 answer
30
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$$2$$3$$4$$5$...
To see more, click for the full list of questions or popular tags.