A file-based hash map is a method of using persistent disk storage while retaining the performance benefits of direct memory access.The implementation involves adapting hash maps for file-based storage using a hash function.Collisions (when the hash function returns the same address for different keys) are addressed using separate chaining.The final structure consists of an index, heap, and buckets with keys and values.