B Trees Introduction - Practice GATE 2024 Fundamental Quiz

What is the minimum height of B tree index required for 9000 keys and order of B tree node (P) is 10?

(Assume order P is max possible child pointers per B tree node and root at height 0)

Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K, where p denotes the maximum number of tree pointers in a B-tree index node. Assume that K is 12 bytes long; disk block size is 1024 bytes; each data pointer P_D is 10 bytes along and each block pointer P_B is 7 bytes long in order for each B tree node to fit in a single disk block, the maximum value of p is __________.

What is the minimum level of B tree index required for storing 7500 key and order of B tree is 6 (Order is maximum child pointer node can have) ________.

Order P is maximum child pointers per B-tree node. How many minimum levels of index required to store 300 distinct keys in B-tree with order P is 5?

Which of the following are legal B-trees for when the minimum branching factor  ?

Suppose the search key of a B tree is V = 9 bytes long, the disc block size is B = 512 bytes, a record (data) pointer is p = 6 bytes and a block pointer is 5bytes.

Calculate the order of B tree and also each node of B tree is 69% full. Let it be X

Find the average number of keys per node of the above B tree, let it be Y?

Then: X+Y = ?