Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
|
Question 300
|
Each B-tree node can have at-most p tree pointers, p-1 data pointers and p-1 search key field values. These must fit into a single disk block if each B-tree node is to correspond to a disk block. Suppose the search field is V =9 bytes long, the disk block size is B=512 bytes, record (data) pointer is Pr =7 bytes and a block pointer is P=6 bytes. What is the value of p?
|
22
|
|
|
23
|
|
|
24
|
|
|
25
|
Question 300 Explanation:
Correct Answer: C
Question 300 Explanation:
Subscribe
Login
0 Comments