Have Geek Brain

B + trees by choosing an order

I am learning B + trees for the first time. I just want to know on what basis the developer chooses the B + tree order?

Also, is there something like B + trees for the mannequin guide? I desperately need it.

+1


a source to share


2 answers


If you mean the "order" of the number of outgoing pointers in a B + -tree node, you should consider the order of k so that the node on disk is a multiple of the disk's sector size or filesystem block size, for example 4KB.



If you are reading a node from disk, the disk (I assume the disks are here, not the SSD) should look for the node position and read the node. The seek time is much longer than the actual transfer time for a node on disk for a node with some KB in size. So choosing an ordering so that the node is 64KB in size might be a good choice.

+4


a source


Ideally, you will want to select an order that has good link locality to help with caching. An ordering that encourages sequential key scans can also be helpful. In general, it will depend on your data.



+1


a source






More articles:


All Articles