[問題] 資料結構問題
小弟在資料結構方面有兩題不懂地方希望各位高手能幫忙.
1.What is the defference between B-tree and B+tree?
2.To efficiently search a key vaule form a table(or file) with hung data
size,we usually establish a stored index for the table(or file).
This is called ”indexing” in the area of file structure.Give an
example to thoroughly explain the concept of “indexing”.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 210.69.126.253