A new structure for high speed access

This article presents a new bloom structure which is calculable and reduces the total number of access to traditional hash schemes. Traditional schemes promote the use of multiple-choice hashing, such as d-random and d-left. However, it costs some times in choice when flows stored which translates much more times of access and it makes the scheme incalculable. In this paper, we propose a new structure which just spends certain times of access in choice and is calculable. The multilevel hash table scheme we propose gets a good consequence in the case where we spend a little more resource but much less total numbers of access than traditional schemes.