Welcome to ShenZhenJia Knowledge Sharing Community for programmer and developer-Open, Learning and Share
menu search
person
Welcome To Ask or Share your Answers For Others

Categories

image.png
像b+树结构,存储在磁盘中它是顺序存储,还是随机存储起来的?比如要找一个区间 id >30。那么取出若干条记录是不是可以只产生一次顺序io,而不用磁盘随机转动寻址?
如果是顺序io的话,是不是要预先给b+树分配好足够大的磁盘空间呢?如果b+树的大小突破了这个空间,那又应该怎么办呢?


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
thumb_up_alt 0 like thumb_down_alt 0 dislike
3.4k views
Welcome To Ask or Share your Answers For Others

1 Answer

等待大神解答

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
thumb_up_alt 0 like thumb_down_alt 0 dislike
Welcome to ShenZhenJia Knowledge Sharing Community for programmer and developer-Open, Learning and Share
...