Any recursive view must be defined as the union of two subqueries: a                query that is nonrecursive and a                      query.

Related MCQs

• The                  keyword is used to access attributes of preceding tables or subqueries in the from clause.
• Subqueries cannot:
• Which of the following statements is true concerning subqueries?
• Relational Algebra is a                      query language that takes two relations as input and produces another relation as an output of the query.
• Relational Algebra is a __________ query language that takes two relations as input and produces another relation as an output of the query.
• 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?
•                                allows a system administrator to associate a function with a relation; the function returns a predicate that must be added to any query that uses the relation.
• A type of query that is placed within a WHERE or HAVING clause of another query is called
• A type of query that is placed within a WHERE or HAVING clause of another query is called
• A UNION query is which of the following?