for finding the order in B+ tree and B tree is both the formulas are different or same ??

Dark Mode

5,956 views

28 votes

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 $10$ $bytes$ long; disk block size is $512$ $bytes$; each data pointer P_{D} is $8$ bytes long and each block pointer P_{B} is $5$ bytes long. In order for each $B$-tree node to fit in a single disk block, the maximum value of $p$ is

- $20$
- $22$
- $23$
- $32$

43 votes

Best answer

0