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 size of the join respectively are

A. m+n and 0

B. m+n and |m-n|

C. mn and 0

D. mn and m+n

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. It is an abstraction through which relationships are treated as higher level entities
  2. Which of the following statement on the view concept in SQL is invalid?
  3. Which of the following constitutes a basic set of operations for manipulating relational data?
  4. The cost of reading and writing temporary files while evaluating a query can be reduced by
  5. _____ First proposed the process of normalization.
  6. The transactions like adding an employee, enrolling a student in a course are examples of _______
  7. A _____ is a logical unit of database processing that includes one or more data access operations that…
  8. A transaction is in state after the final statement has been executed.
  9. _______ product was acquired by Informix, integrated into its RDBMS and introduced as the Informix Universal…
  10. A relation is in attribute of other composite key. if an attribute of a composite key is dependent on…
  11. In E-R Diagram total participation is represented by
  12. Which of the following is not a characteristic of a relational database model?
  13. Which of the following is not comparison operator?
  14. The clause alter table in SQL can be used to
  15. Which of the syntax is correct for insert statement? i) insert into values ii) insert into (column list)…
  16. What are the desirable properties of a decomposition
  17. If both the functional dependencies : XY and YX hold for two attributes X and Y then the relationship…
  18. The rule that a value of a foreign key must appear as a value of some specific table is called a
  19. In an ER model,_____ is described in the database by storing its data.
  20. What is a disjoint less constraint?
  21. Which of the following is not a consequence of non-normalized database?
  22. operator is used to compare a value to a list of literals values that have been specified.
  23. Grant and revoke are _____ statements.
  24. The normalization was first proposed by .
  25. Tree structures are used to store data in
  26. Which one is correct statement?Logical data independence provides following without changing application…
  27. In multiple granularity of locks SIX lock is compatible with
  28. ______is a special type of integrity constraint that relates two relations & maintains consistency across…
  29. ………………… approach reduces time and effort required for design…
  30. Whenever two independent one-to-many relationships are mixed in the same relation, a __________ arises.