Abstract:

This paper compares the efficiency and performance of Binary Search Trees (BSTs) and Hash Tables in file system indexing. File systems depend heavily on efficient data retrieval, storage, and management techniques. The study analyzes how both data structures perform in terms of time complexity, memory usage, scalability, and their ability to handle large datasets. We also explore the effect of collision resolution, balancing techniques, and search latency when indexing files dynamically in modern file systems. The results demonstrate that while Hash Tables offer faster average-case lookup times, BSTs provide superior ordering and range-query capabilities. The findings guide system architects in selecting optimal indexing mechanisms for specific application environments