Database Systems Homework: B+ Trees, Functional Dependencies, Indexing

This document presents the solutions to a database homework assignment, covering key concepts in database systems. The assignment includes problems on B+ trees, requiring students to perform insertions, deletions, and analyze tree structures. It also delves into functional dependencies, asking for the computation of closures and minimal covers, along with the application of Armstrong's axioms. Furthermore, the homework explores indexing techniques, specifically sparse indexing and static hashing, requiring students to understand and apply these concepts to database organization and data retrieval. The solutions provide detailed explanations and step-by-step approaches to solve each problem, offering valuable insights into database design and management.