I am trying to calculate the order of my B+-Tree for a SSD with Page size 8KB. I know that the least write and read unit is a page and I want to use the space as efficient as possible.
My thoughts: My B+-Tree node has 3 pointers: pointers - block pointer, record pointer and key pointer and I assume that the pointer size is 8 Byte. My calculation: 8000 >= (2order+1)8 + 2order8 + 2order8 i am getting a very huge number for order (166). Is this correct?
question from:https://stackoverflow.com/questions/65838115/calculate-the-order-of-b-tree
