...
Operating-Systems
October 4, 2023
Logical-Reasoning
October 4, 2023
Operating-Systems
October 4, 2023
Logical-Reasoning
October 4, 2023

Database-Management-System

Question 187

In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a non-leaf node in a B+ tree implementing this file structure is

A
23
B
24
C
34
D
44
Question 187 Explanation: 
From the structure of B+ tree we can get this question:
n × p + (n – 1) × k ≤ B (for non-leaf node)
Here, n = order, p = tree/block/index pointer, B = size of block
So,
n × p + (n – 1) × k ≤ B
n × 6 + (n – 1) × 9 ≤ 512
n ≤ 34.77
∴ n = 34
Correct Answer: C
Question 187 Explanation: 
From the structure of B+ tree we can get this question:
n × p + (n – 1) × k ≤ B (for non-leaf node)
Here, n = order, p = tree/block/index pointer, B = size of block
So,
n × p + (n – 1) × k ≤ B
n × 6 + (n – 1) × 9 ≤ 512
n ≤ 34.77
∴ n = 34
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!