As per equivalence rules for query transformation, selection operation distributes over

A. Union.

B. Set difference.

C. Intersection.

D. All of the above.

You can do it
  1. Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
  2. The one guideline to be followed while designing the database is
  3. For correct behaviour during recovery, undo and redo operation must be
  4. The default level of consistency in SQL is
  5. The data in the database at a particular moment of time is called the _______
  6. _____ command can be used to modify a column in a table
  7. Consider the join of relation R with a relation S. If R has m tuples and S has n tuples, then the maximum…
  8. The ______ key of a relation is the attribute (column) or collection of attributes, which uniquely identify…
  9. The clause in SQL that specifies that the query result should be sorted in ascending or descending order…
  10. An advantage of the database management approach is
  11. Between DRAM and magnetic disk storage another form of memory, called ______ memory is becoming common…
  12. A _____ is used to define overall design of the database
  13. Which of the following statement on the view concept in SQL is invalid?
  14. The middleware databases in which the business rules act are applicable to _______ tier architectures
  15. DROP is a statement in SQL.
  16. By ______ an area on disk in certain ways, one can make it represent a bit value of either zero (0)…
  17. Processed data is called _____
  18. A DBMS is a ____ user if at most one user can use the system and is mostly restricted to personal computer…
  19. Checkpoints are a part of
  20. A list consists of last names, first names, addresses and pin codes. If all people in the list have…
  21. Union operator is a :
  22. The full form of GUI is _________
  23. ____specifies a search condition for a group or an aggregate.
  24. Which of the following concurrency control schemes is not based on the serializability property?
  25. Which of the following relational algebra operations do not require the participating tables to be union-compatible?
  26. Which of the following ensures the atomicity of the transaction?
  27. In an E-R diagram double lines indicate
  28. Isolation of the transactions is ensured by
  29. operator is used to compare a value to a list of literals values that have been specified.
  30. Shadow paging has