Efficient searching I: B-Trees

video-placeholder
Loading...
View Syllabus

Reviews

4.6 (46 ratings)

  • 5 stars
    65.21%
  • 4 stars
    28.26%
  • 3 stars
    4.34%
  • 2 stars
    2.17%

NC

Nov 5, 2019

Filled StarFilled StarFilled StarFilled StarFilled Star

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

Sep 28, 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

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

From the lesson

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.

Taught By

  • Placeholder

    Mark de Berg

    Prof.dr.

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.