抄録
We propose a novel data structure, called the DIMD-tree, that provides efficient successive spatial searches in GPS navigation systems, mobile phone systems and so forth. The DIMD-tree can be applicable for the geographic data management of positioning systems as well as the query processing for current and anticipated future positions of moving objects. The basic idea introduced in the DIMD-tree is direct indexing into a node or leaf which includes the predicted position of a moving object. The performances of the DIMD-tree are evaluated by simulation tests.
