2min chapter

Software Engineering Radio - the podcast for professional software developers cover image

Episode 485: Howard Chu on B+tree Data Structure in Depth

Software Engineering Radio - the podcast for professional software developers

CHAPTER

A Ts Wa Transparent, or Transparently Usable?

A lot of the answer to that question depends on what the operating system is doing with the different memory structures, or the y. Now, the newer types of memori s, you are talking about d oters, persistent ory or like obtain a memory, or some other things like that,. You have the option of making that memory transparently usable, or you have theoption of making it an explicit block device. One page of a b plus tree equals one page in a file system, one page on disk. And in the b plus tree terminology, weregoin, we're going to call those pagesoOne page of a B PLUS TREE equals  one page in

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode