Mastering File Indexes: How B-Trees Accelerate File Access π
Discover how B-Trees serve as efficient, self-balancing indexes to dramatically improve file retrieval speeds in file systems. Learn the fundamentals and benefits of using B-Trees for faster data access.

Jacob Schrum
27.1K views β’ Aug 8, 2016

About this video
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.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
27.1K
Likes
283
Duration
12:36
Published
Aug 8, 2016
User Reviews
4.4
(5) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now