A B+ tree is a type of m-ary tree that has a large number of children per node. It is commonly used for efficient data retrieval in block-oriented storage systems like filesystems because of its high fanout, which reduces the number of I/O operations needed to find an element in the tree. Unlike binary search trees, B+ trees only store keys and have an additional level of linked leaves at the bottom.
UC Berkeley
Spring 2023
This project-heavy course covers access methods, data models, query languages, database services, and interfaces. It introduces transaction processing and requires CS 61A, CS 61B, and CS 61C as prerequisites/corequisites. It suggests proficiency in Java for project work.
No concepts data
+ 23 more concepts