We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature to obtain a novel scheme that is theoretically wellunderstood and at the same time achieves an order-of-magnitude increase in the size of the problem to be solved compared to previous “practical” methods. We demonstrate the scalability of our algorithm by constructing minimum per
Fabiano C. Botelho, Nivio Ziviani