Which of the following is not a valid schedule of 2 transactions, T1: {R(X), W(X)} and T2: {R(Y), W(Y)}?

Consider the

following schedule.

Which of the following statement(s) is/are TRUE?

Consider the following two statements about database transaction schedules:

I. Strict two-phase locking protocol produces conflict serializable schedules which are not recoverable.

II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can produce view serializable schedules that are not conflict serializable.

Consider a B+ tree, the size of the block and node is same

as 4 kilobytes. Suppose each index entry is 40 bytes long, find out the height

of the tree of a file with one million search key values?

Consider the following

B+

tree with index of order is 1,  Find

the minimum number of nodes inclusive of root node that must be fetched in

order to satisfy the given query:

“Retrieve all records with the search key value is greater than or equal

to 7 and less than 15” is ____.

8. What is the relational algebra expression corresponding to the SQL query “SELECT city FROM store”?

Which of the

following statement is not correct for serializable of transactions?

Assume that a file is having 50000 records and it has the

following specifications.

Record size : 40bytes

Record  key size: 4 bytes

Memory size: 512KB

Disk Block size: 512

bytes

Block Address size

:  8 bytes

Which index techniques is efficient for

accessing a record, if the order of the file based on the key?

Consider the following schedule and

state that which of the following statement(s) is (are) true?

S

: r1(x),w1(x),r2(x),r1

I:

S is recoverable.

II:

If the order of w1(x) and w2(x) are interchanged, then S will be a

non-recoverable schedule.