Give an example of how a b-tree might be organized. — 1024 children per node. Store root in memory. 3 nodes accessed gets us 1024^3 disk pages. 4 nodes accessed gets us 1024^4 disk pages.
G
1.2KGoogle Interview
This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university