Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Btree
Btree is an example of multilevel indexing. Record pointers will be present at leaf nodes as well as on internal
nodes.
Whereas in B+ tree we will have data record pointers only at leaf level.
Now we will discuss about each of the node separately:
Root
Children:Root can have children/pointers between 2 and p inclusive.
Keys:Root can have keys between 1 to p1 inclusive.
Internal Node
Children:Internal Node can have children/pointers between ceilp/2 and p inclusive.
Keys:Internal Node can have keys between ceilp/21 to p1 inclusive.
Leaf Node
Keys:Lead Node can have keys between ceilp/21 to p1 keys inclusive.
QuestionIn a B tree, suppose search key is 9 Bytes long, disk block size is 512 Bytes, record pointer is 7 Bytes,
Block pointer is 6 Bytes, then calculate the order of Btree node.
Answer
http://scanftree.com/dbms/btree 1/1