Which of the following relational algebra operations do not require the participating tables to be union-compatible?

A. Union

B. Intersection

C. Difference

D. Join

You can do it
  1. Drop Table cannot be used to drop a table referenced by a ______ constraint.
  2. Which of the following is not a logical database structure?
  3. In a multi-user database, if two users wish to update the same record at the same time, they are prevented…
  4. The language that requires a user to specify the data to be retrieved without specifying exactly how…
  5. In SQL the statement select * from R, S is equivalent to
  6. Employees in a company are each assigned their own office, i.e. for each employee there exists a unique…
  7. A transaction is in state after the final statement has been executed.
  8. The middleware databases in which the business rules act are applicable to _______ tier architectures
  9. DROP is a statement in SQL.
  10. _____ database is used to provide statistical information or summaries of values based on various criteria.
  11. _____is a full form of SQL.
  12. ______is a special type of integrity constraint that relates two relations & maintains consistency across…
  13. Which of the following aggregate functions does not ignore nulls in its results?.
  14. Relational Algebra is
  15. _______ product was acquired by Informix, integrated into its RDBMS and introduced as the Informix Universal…
  16. Which two files are used during operation of the DBMS?
  17. Which of the following addressing modes permits relocation without any change over in the code?
  18. Which of the following is not a recovery technique?
  19. The part of a database management system which ensures that the data remains in a consistent state is
  20. Isolation of the transactions is ensured by
  21. In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect…
  22. Which of the following relational algebra operations do not require the participating tables to be union-compatible?
  23. A list consists of last names, first names, addresses and pin codes. If all people in the list have…
  24. Which of the following is true for network structure?
  25. What are the desirable properties of a decomposition
  26. Which is the best file organization when data is frequently added or deleted from a file?
  27. Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
  28. An advantage of views is
  29. If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
  30. Consider the join of relation R with a relation S. If R has m tuples and S has n tuples, then the maximum…