The union operation is represented by

Related MCQs

• Once the lower-level lock is released, the operation cannot be undone by using the old values of updated data items, and must instead be undone by executing a compensating operation; such an operation is called
• View the Exhibit and examine the data in the EMPLOYEES tables. Evaluate the following SQL statement: SELECT employee_id, department_id FROM employees WHERE department_id= 50 ORDER BY department_id UNION SELECT employee_id, department_id FROM employees WHERE department_id= 90 UNION SELECT employee_id, department_id FROM employees WHERE department_id= 10; What would be the outcome of the above SQL statement?
• The               operation performs a set union of two “similarly structured” tables
• The operation which is not considered a basic operation of relational algebra is
• Whenever an update operation occurs on a page, the operation stores the LSN of its log record in the                field of the page.
• The phrase “greater than at least one” is represented in SQL by            
• Not applicable condition can be represented in relation entry as
• The entity relationship set is represented in E-R diagram as
• Weak entity set is represented as
• The total participation by entities is represented in E-R diagram as