小弟初學DB 所以請大大幫忙解惑="=
Assume you have a table that contains 27,000 records, and you have an
unclustered B+-tree index on the table. Assume further that each index node
can contain up to 100 pointers (fan outs). Assume each index node contains at
least 50 entries.
.
(a) What is the maximum possible number of levels in the B+-tree index for
this table?
(b) What is the minimum possible number of levels in the B+-tree index for
this table?
請問是依Level 1=1 page
Level 2=50的一次方 pages & Level 2=100的一次方 pages
Level 3=50的二次方 pages & Level 3=100的二次方 pages
Level 4=50的三次方 pages .......
來解答嗎? 有點看不太懂題目的意思
希望大大們可以幫忙解答並解釋一下 先在這裡感謝各位了<(_ _)>
--
◣ ◢▁ ▁▁ ▁ ω ω ▁ ω ω
˙ ◤ ∥ ▄▄▄ ∥ ▄▄
≡ x = ▁▁ ▇ ▃▃▃ ▇ ▃▃
▲▁ ∕ ﹨ ／ ／ m＠na
╱ ／ ▃▃ ／ ▃▃ 玩躲貓貓，是因為想被找到 ●
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.227.133.207