Task: B-Tree vs Hash Table Performance Comparison for Database Index Operations

Task: B-Tree vs Hash Table Performance Comparison for Database Index Operations: a task in Terminal-Lego-15k (Harbor dataset). Implement both a B-Tree index and a Hash Table index in Python, then benchmark them across the typical database operations that explain why MySQL uses B-Trees as its…

The task

Implement both a B-Tree index and a Hash Table index in Python, then benchmark them across the typical database operations that explain why MySQL uses B-Trees as its default index structure instead of hash tables.

Part of PrimeIntellect/Terminal-Lego-15k.