Consider the following schedule due to three transactions (indicated by the subscript) using read and write on data item a, b, c and d.
r1(a), r2(c), r1(c), r3(c), r3(b), w1(a), r2(a), c1, w3(b), c3, r2(b), w2(b), w2(c), c2
Which of the following is correct for above schedule?
Given that the block size is 512 bytes, search field is 9 bytes, record pointer is 7 bytes and a block pointer is 6 bytes long, what are the orders of internal and leaf node of B+ – tree respectively?
Database __________ which is the logical design of the database, and the database _______ which is a snapshot of the data in the database at a given instant in time.
Consider a relation R (A, B, C, D, E) with the following functional dependencies:
ABC → DE
D → AB
The number of super keys of R is:
Consider the relation r1(P, Q, R) and r2(R, U, V) with primary keys R and U respectively. The relation r1 contains 1500 tupples and r2 contains 2000 tupples. The maximum size of the join r1⋈ r2 is:
Consider the following ER diagram:
The minimum number of tables needed to represent ER-diagram are __________ such that the relational database satisfies 1NF.