To realize different kinds of spatial OLAP operations and provide spatial decision support more flexibly, a spatial data warehouse framework is studied, in which spatial data cube cooperates with spatial index structure.

Traditional spatial index structures do not work well on moving object because it need to frequently update the index which results in very poor performance.

This paper gives the definition of the CKDB-Tree and the character of the node;it also gives the algorithm of the insert,the search and the delete operation;then gives the analysis and the inference to the index structure’s memory property;finally,the experiment proves that CKDB-Tree is one kind of effective dynamic index structure in the high-dimensional spaces.