
Episode 485: Howard Chu on B+tree Data Structure in Depth
Software Engineering Radio - the podcast for professional software developers
00:00
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
Transcript
Play full episode