File Systems 1: File Indexes with B-Trees

One way to speed up file access is to use an index, and a common way to create such an index is by using a B-Tree, a particular type of self balancing tree. The structure of B-Trees is introduced, along with examples of how insertions modify the tree. Much of this material is based on content from the book Operating Systems: Internals and Design Principles by William Stallings.

[brunofantini]

thank you so much for the clear explanation.

[pabliospark]

Another very clearly explained topic, thank you!!

[srkntdj]

Wow, much better explanation than any textbook.
Could you also show us how to delete elements from this tree?

[verryberrypie]

Thank you for this amazing video! It really helped me understand B-trees

[kaumsatria]

keep update ur video, im broke to get in university. i need youtube chanel like yours to get free knowledge. thank you :-)

[VengatRamanan]

doesnt the degree of the tree represent the # of keys in the node rather than the child pointers. # of keys min (d - 1) and max 2 * d - 1