A greedy relaxed generalized disc modulo allocation method for multiple key hashing files on multi‐disc systems

Abstract

In this paper, we propose an efficient way for the arrangement of multiple key hashing (MKH) files onto a multiple disc system. We present a greedy strategy to find a proper set of parameters of a hashing function that determines the near "optimal" bucket distribution for facilitating the maximal concurrency of disc accesses. Some experimental results are given to show that our greedy method works well in general cases and can achieve the same performance as the previously proposed method, that can only be used in some restricted cases.