Overview
Explore the intricacies of the Maple Tree, an RCU-safe b-tree variant, in this 1-hour 25-minute mentorship session led by Liam Howlett, Consulting Member of Technical Staff at Oracle. Delve into the unique features of this data structure that stores non-overlapping ranges, offering greater data density while reducing lock contention through RCU-safety. Uncover the subtle implementation details that arise from introducing ranges to a tree, altering many traditional b-tree methods. Gain insights into the motivations behind the Maple Tree's development, its advantages, and its internal layout. Examine common operations such as searching, inserting, splitting, and rebalancing, providing a comprehensive understanding of this innovative data structure's functionality and applications.
Syllabus
Mentorship Session: The Maple Tree: Structure and Algorithms
Taught by
Linux Foundation