Indexing Structures: B+ Trees and Hashing

Explain why B+ trees are preferred over binary search trees for disk-based indexing.

Implement insertion and deletion operations in a B+ tree, handling node splits and merges.

Perform point and range queries on a B+ tree and analyze their I/O cost.

Compare the impact of clustered versus unclustered B+ tree indexes on query performance.

Implement and analyze an extendible hashing scheme, including directory management.

Implement and analyze a linear hashing scheme with dynamic bucket splitting.

Compare the performance of B+ trees and hash indexes for point queries, range queries, and insertions.