Efficient searching I: B-Trees

video-placeholder
Loading...
查看授课大纲

审阅

4.6(57 个评分)

  • 5 stars
    68.42%
  • 4 stars
    24.56%
  • 3 stars
    5.26%
  • 2 stars
    1.75%

CV

May 8, 2022

The course is really good and the course material is also amazing. I highly reccomend it provided you have an interest in this specialization.

YZ

Sep 28, 2020

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.

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。