Efficient searching I: B-Trees

Loading...
查看授課大綱

審閱

4.5(36 個評分)
  • 5 stars
    63.88%
  • 4 stars
    27.77%
  • 3 stars
    5.55%
  • 2 stars
    2.77%
從本節課中
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.

探索我們的目錄

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