Go offline with the Player FM app!
S7:E5 - "To b-tree or not to b-tree"
Archived series ("Inactive feed" status)
When? This feed was archived on August 02, 2022 03:09 (). Last successful fetch was on March 25, 2020 08:40 ()
Why? Inactive feed status. Our servers were unable to retrieve a valid podcast feed for a sustained period.
What now? You might be able to find a more up-to-date version using the search function. This series will no longer be checked for updates. If you believe this to be in error, please check if the publisher's feed link below is valid and contact support to request the feed be restored or if you have any other concerns about this.
Manage episode 240239387 series 1714497
In last episode, we talked about 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as potential child nodes, and can contain more than one key. This takes us to b-trees, which is a generalized version of the 2-3 tree, and are super efficient for storing data in an indexed database, like MySQL. Based on Vaidehi Joshi's blog post, "Busying Oneself With B-Trees".
We're on Patreon!
If you like the show and want to support our work, become a patron here. You'll get stickers, postcards, and even socks. Let's make computer science more accessible and fun!
Vaidehi Joshi (co-host)
Vaidehi is a writer and an engineer at Tilde, where she works on Skylight. She's the creator of basecs, a weekly writing series that explores the fundamentals of computer science.
Saron Yitbarek (co-host)
Saron is a developer, podcaster, founder of CodeNewbie, and host of the CodeNewbie Podcast.
CodeNewbie
CodeNewbie is the most supportive community of programmers and people learning to code. They produce the CodeNewbie Podcast and the annual Codeland conference. Follow them on twitter @CodeNewbies. For more info, checkout www.codenewbie.org
74 episodes
Archived series ("Inactive feed" status)
When? This feed was archived on August 02, 2022 03:09 (). Last successful fetch was on March 25, 2020 08:40 ()
Why? Inactive feed status. Our servers were unable to retrieve a valid podcast feed for a sustained period.
What now? You might be able to find a more up-to-date version using the search function. This series will no longer be checked for updates. If you believe this to be in error, please check if the publisher's feed link below is valid and contact support to request the feed be restored or if you have any other concerns about this.
Manage episode 240239387 series 1714497
In last episode, we talked about 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as potential child nodes, and can contain more than one key. This takes us to b-trees, which is a generalized version of the 2-3 tree, and are super efficient for storing data in an indexed database, like MySQL. Based on Vaidehi Joshi's blog post, "Busying Oneself With B-Trees".
We're on Patreon!
If you like the show and want to support our work, become a patron here. You'll get stickers, postcards, and even socks. Let's make computer science more accessible and fun!
Vaidehi Joshi (co-host)
Vaidehi is a writer and an engineer at Tilde, where she works on Skylight. She's the creator of basecs, a weekly writing series that explores the fundamentals of computer science.
Saron Yitbarek (co-host)
Saron is a developer, podcaster, founder of CodeNewbie, and host of the CodeNewbie Podcast.
CodeNewbie
CodeNewbie is the most supportive community of programmers and people learning to code. They produce the CodeNewbie Podcast and the annual Codeland conference. Follow them on twitter @CodeNewbies. For more info, checkout www.codenewbie.org
74 episodes
All episodes
×Welcome to Player FM!
Player FM is scanning the web for high-quality podcasts for you to enjoy right now. It's the best podcast app and works on Android, iPhone, and the web. Signup to sync subscriptions across devices.