Concept

T-tree

Related lectures (25)

Tree-Structured Indexing: B+ Trees Explained

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

The Forgotten Operator: Delete Tradeoffs in Data Stores

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

Tree-Structured Indexing: B+ Tree

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

Wood Properties

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

Automorphism groups of trees and graphs II

Explores the uniqueness of trees, automorphism groups, Cayley-Abels graphs, and constructing vertex-transitive subgroups with prescribed local actions.

Structural Induction on Trees

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

Binary Search Trees: Operations and Procedures

Covers operations and procedures related to binary search trees, including finding successors and predecessors.

Algorithmes: introduction

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

Information Retrieval Indexing: Part 1

Explores text retrieval systems, inverted files, addressing granularity, and access structures in information retrieval.

Implementing Combiners

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

Disk Storage & Indexing

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

Storage: Tree Indexing

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

Branch and Bound: Heuristic Maximization

Explains the Branch and Bound algorithm for heuristic maximization problems using LP relaxations and pruning techniques.

Binary trees and Catalan numbers

Covers the definition of binary trees, recursive formulas, and generating functions for Catalan numbers.

Hashing & Sorting

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Hashing and Sorting Techniques in Database Systems

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

Structured Classifications: Decision Trees and Boosting

Explores decision trees, overfitting elimination, boosting techniques, and their practical applications in predictive modeling.

Spanning Trees: Definition and Applications

Introduces spanning trees in graphs and the Minimum Spanning Tree problem, exploring efficient algorithms for optimal decision-making.

Indexing: File Organization & Techniques

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

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.