The Proposed Boost B-tree Library
Offered By: CppNow via YouTube
Course Description
Overview
Explore the world of B-trees and their crucial role in databases, file systems, and disk-resident associate containers in this comprehensive conference talk. Gain insights into the proposed Boost B-tree library, which offers disk-resident B-tree map, multimap, set, and multiset containers. Delve into a brief introduction to B-trees before examining how the proposed library containers relate to C++ standard library associative containers. Discover the actual interface, potential pitfalls, handling of variable length data, and performance considerations. Learn about the current state of the proposed library's implementation and participate in a feedback and discussion session to contribute to its development.
Syllabus
Beman Dawes: The Proposed Boost B-tree Library
Taught by
CppNow
Related Courses
Data Structures and Algorithm Design Part II | 数据结构与算法设计(下)Tsinghua University via edX Hacking PostgreSQL: Data Access Methods
Ural Federal University via edX Ordered Data Structures
University of Illinois at Urbana-Champaign via Coursera I/O-efficient algorithms
EIT Digital via Coursera Data Structures and Algorithms (III)
Tsinghua University via Coursera