Consider the relational algebra expression:

Assume that the join is based on the department identifier and that the condition Dept='CSE' refers only to attributes of DEPARTMENT. Which transformation is generally beneficial for reducing the number of tuples participating in the join?

A relation R is in First Normal Form (1NF) if:

When the query optimizer transforms a relational algebra expression into equivalent alternatives, which equivalence rule is commonly applied?

In a B+ tree, the actual data record pointers or data entries are stored at the Answer Question 14 level

Consider a sorting algorithm executes A and B block of pseudo code to accomplish the sorting operation of a SQL query.

Block A: 

Block B: 

What could be the time complexity of the algorithm ? 

Which of the following statement(s) about materialization vs. pipelining is/are correct?

Consider the following scenario involving three transactions and two data items:

i) Deadlock will not occur because each transaction holds only one lock at a time.

Which relational algebra operation selects rows that satisfy a specified condition?

To retrieve a specific record from the physical storage device, the query process should execute 10 block transfer with avg. transfer time of 10 mSec for each and 200 times of seek operation involve 1 sec for each. If the search operation is based on indexing with B+ tree and height of the tree is 7, what is the total query cost of finding a specific record (in second)?

In static hashing, the number of primary buckets in the hash file is generally: