Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
954 views
in Technique[技术] by (71.8m points)

pointers - Calculate the order of B+-Tree

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

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)
Waitting for answers

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...