search
Log In
3 votes
992 views

Which of the following statements is correct?

  1. Aggregation is a strong type of association between two classes with full ownership
  2. Aggregation is a strong type of association between two classes with partial ownership
  3. Aggregation is a weak type of association between two classes with partial ownership
  4. Aggregation is a weak type of association between two classes with full ownership
in Databases
recategorized by
992 views

3 Answers

1 vote

Aggregation is a weak type of Association with partial ownership.

0 votes
Aggregation is a weak type of association between two classes with partial ownership.
All other statement are incorrect.
So, option (C) is correct.

Related questions

1 vote
2 answers
1
433 views
Aggregation is : an abstraction through which relationships are treated as lower level entities an abstraction through which relationships are treated as higher level entities an abstraction through which relationships are not treated at all as entities none of the above
asked Sep 26, 2017 in Databases rishu_darkshadow 433 views
4 votes
2 answers
2
2.4k views
Consider the following ORACLE relations: R(A, B, C)={<1, 2, 3>, <1, 2, 0>, <1, 3, 1>, <6, 2, 3>, <1, 4, 2>, <3, 1, 4>} S(B, C, D)={<2, 3, 7>, <1, 4, 5>, <1, 2, 3>, <2, 3, 4>, <3, 1, 4>} Consider teh following two SQL queries: SQ$_1$; SELECT R.B, AVG ... D)>1; If M is the number of tuples returned by SQ$_1$ and If N is the number of tuples returned by SQ$_2$ then M=4, N=2 M=5, N=3 M=2, N=2 M=3, N=3
asked Aug 17, 2016 in Databases jothee 2.4k views
1 vote
3 answers
3
2.2k views
Which of the following statements is true? $D_1$: The decomposition of the schema R(A, B, C) into R$_1$(A,B) and R$_2$(A,C) is always lossless $D_2$: The decomposition of the schema R(A, B, C, D, E) having AD $\rightarrow$ B, C $\rightarrow$ DE, B $\rightarrow$ ... $_2$(A, C, C, D, E) is lossless Both $D_1$ and $D_2$ Neither $D_1$ nor $D_2$ Only $D_1$ Only $D_2$
asked Aug 17, 2016 in Databases jothee 2.2k views
2 votes
2 answers
4
3.1k views
Consider teh relations $R(A, B)$ and $S(B, C)$ and the following four relational algebra queries over R ans S $\pi_{A, B} (R \bowtie S)$ $R \bowtie \pi_B(S)$ $R \cap (\pi_A(R) \times \pi_B (S))$ $\Pi_{A. R. B} (R \times S)$ where $R.B$ refers to ... determine that: I, III and IV are the same query II, III and IV are the same query I, II and IV are the same query I, II and III are the same query
asked Aug 17, 2016 in Databases jothee 3.1k views
...