Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

B-tree

Related lectures (30)

Binary Search Trees: Operations and Implementations

Covers operations and implementations of binary search trees.

Compression: Kraft Inequality

Explains compression and Kraft inequality in codes and sequences.

Untitled

Binary Search Trees Operations

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Wood Properties

Explores wood properties, benefits of building with wood, tree structure, and microstructure.

Safe Mutation in Scala

Explores safe mutation in Scala, emphasizing the management of mutable state and its significance in interactions, modeling, and implementation efficiency.

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Structural Induction on Trees

Introduces structural induction on trees, demonstrating with IntSets and their laws.

Algorithmes: introduction MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers the basics of algorithms, problem-solving, and efficient resolution methods.

Fold Reduce Operations

Explores fold (reduce) operations in parallel programming using Scala, covering associative operations, expression trees, parallel reduction, and array reduction.

Building a Decision Tree

Covers building decision trees to classify mushrooms as poisonous or not.

Networks: Structure and Properties

Explores the structure and properties of networks, including dating and protein networks, small-world effect, hubs, and scale-free property.

Tree-Structured Indexing: B+ Trees Explained Log in to Mediaspace to watch this video

Covers B+ Trees, a key data structure for efficient indexing in databases.

The Forgotten Operator: Delete Tradeoffs in Data Stores Log in to Mediaspace to watch this video

Explores the tradeoffs of delete operations in data stores, focusing on logical deletes and introducing the Lethe storage engine.

Tree-Structured Indexing: B+ Tree Log in to Mediaspace to watch this video

Explores tree-structured indexing with a focus on B+ trees in databases.

Storage: Tree Indexing Log in to Mediaspace to watch this video

Explores storage layers, disk management, flash disks, and B+ tree indexing for efficient data retrieval.

Indexing in Database Systems Log in to Mediaspace to watch this video

Explores indexing in database systems, covering storage, files, and efficient data retrieval techniques using various types of indexes.

Disk Storage & Indexing Log in to Mediaspace to watch this video

Explores disk storage anatomy, access times, buffer management, and tree-structured indexing techniques like B+ Trees.

Indexing: File Organization & Techniques Log in to Mediaspace to watch this video

Explores file organization, indexing techniques, and metadata in databases, emphasizing the importance of choosing the right search key.