Indexing structure for moving object databases based on R-tree

A general trajectory model based on moving point is introduced, which can model low dimension and high dimension moving objects. Discrete update strategies are discussed. On this basis a 2-level indexing structure based on R-tree is put forward. It indexes the object's current and past moving trajectory by R-tree and dynamic array connected with its leaf node. The method of update, insertion and deletion based on the structure has been discussed in detail. It is implied that the structure supports queries on past, now and future, and the space intersection is very small.