Dynamic Hash allows us to adjust the size of hash space dynamically according to the amount of data so that we obtain the nice time/space efficiency of the hash space. One of the proposed techniques is Linear Hash (LH). However, practically the technique doesn?t always provide us with suitable results, especially in the case of collective (consecutive) inserts. In this investigation, we propose a new novel approach, called Tree Hash (TH), for the purpose of sophisticated dynamic hash processing. Here we assume distributed environment, i.e., many CPUs and huge amount of data storage connected through high speed network with each other. We show empirically the several excellent properties compared to LH*, a distributed LH.