In this paper, we are going to develop a newly designed indexing scheme which is compatible to manage the moving objects and propose a cost model of the scheme. We propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. We analyzed the dynamic index structure and the cost model by the frequent position update of moving objects and verified through a performance assessment experiment. The results of our extensive experiments show that the newly proposed indexing schemes(Dynamic Hashing Index) are much more efficient than the traditional the fixed grid and R-tree.