Efficient searching I: B-Trees

video-placeholder
Loading...
Visualiser le programme de cours

Avis

4.6 (55 évaluations)

  • 5 stars
    67,27 %
  • 4 stars
    25,45 %
  • 3 stars
    5,45 %
  • 2 stars
    1,81 %

CV

8 mai 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

28 sept. 2020

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

À partir de la leçon

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.

Enseigné par

  • Placeholder

    Mark de Berg

    Prof.dr.

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.