Q. A_____ is a query that retrieves rows from more than one table or view:

View solution

Q. A condition is referred to as __________

View solution

Q. Which oracle is the join condition is specified using the WHERE clause:

View solution

Q. Which are the join types in join condition:

View solution

Q. Which product is returned in a join query have no join condition:

View solution

Q. Which is a join condition contains an equality operator:

View solution

Q. Which join refers to join records from the write table that have no matching key in the left table are include in the result set:

View solution

Q. Which operation are allowed in a join view:

View solution

Q. Which view that contains more than one table in the top-level FROM clause of the SELECT statement:

View solution

Q. Pictorial representation of an expression is called

View solution

Q. The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called

View solution

Q. ______________ allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.

View solution

Q. Pipelines can be executed in

View solution

Q. In a _________ the system makes repeated requests for tuples from the operation at the top of the pipeline.

View solution

Q. In a _____________ operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.

View solution

Q. Each operation in a demand-driven pipeline can be implemented as an ____ that provides the following functions: open(), next(), and close().

View solution

Q. The iterator maintains the __________ of its execution in between calls, so that successive next() requests receive successive result tuples.

View solution

Q. Tuples are generated ___________ in producer-driven pipelining, they are generated ________ on demand, in demand-driven pipelining.

View solution

Q. When two inputs that we desire to pipeline into the join are not already sorted it is the _____________ technique.

View solution

Q. Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold:

AB->CD
DE->P
C->E
P->C
B->G

The relation schema R is

View solution