Efficient searching I: B-Trees

video-placeholder
Loading...
查看授課大綱

審閱

4.6(44 個評分)
  • 5 stars
    68.18%
  • 4 stars
    25%
  • 3 stars
    4.54%
  • 2 stars
    2.27%
NC
2019年11月5日

Everything was clearly explained and the questions were quite intuitive and checking my knowledge. More examples for different scenarios too would help us a lot to learn more.

YZ
2020年9月28日

Really like the course. Though it's difficult and challenging, I managed to understand the concept. I will keep practicing.

從本節課中
I/O-efficient data structures
In this module we introduce some I/O-efficient data structures: B-trees and buffer trees, and an I/O-efficient priority queue based on buffer trees.

教學方

  • Placeholder

    Mark de Berg

    Prof.dr.

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。