In this video we dive into storing B+Tree on disk, how the data is aligned, more information about pointers, importance of tracking root node and problem with storing zero as keys (or values) in B+Tree.
Chapters:
00:00 Previous video topics
01:24 Data alignment
02:41 Data alignment | Paddings
06:10 Order of nodes in an index file
09:28 Pointers: what are chunk and position elements?
12:10 Tracking the root node
13:49 Storing zero
Coffee has a cost 😄 (I do not monetize my videos)
Any sort of small or large donations can be a motivation in maintaining this and other projects, create more detailed videos and improve the quality of videos
ETH: 0x5F120228C12e2C6923AfDeb0e811d74160166d90
TRC20: TJjw5n26KFBqkJQbs7eKdxkVuk4pvJdFzE
BTC: bc1qmtewrl7srjrkl8t4z5vantuqkz086srj4clzh3