Abstract: R^＊ tree is the most popular variation of R-tree, but not suitable for the situation of frequent insertion and deletion because its construction cost is many times than original R-tree. Therefore, a novel method of dynamic R-tree is proposed based on lazy

Key words: TR-tree, Lazy splitting, Clustering