一种高效的移动对象索引

提出了一种基于R-树和聚类算法的高效移动对象索引,这种索引能够有效地回答各种查询,包括范围查询、瞬时查询和最邻近查询。这种索引的新特征是在节点发生分裂时采用另外一种的聚类方法,即k-mealls算法,取代传统的“两路”分裂算法,而采用“多路”分裂算法。通过实验比较,这种新的索引结构在各种条件下性能比其它相关算法优越。

An efficient index for moving objects

A new effiecient indexfor moving objects is presented, based on R-tree and existing clustering algorithms. For indexing a set of moving points so that various queries, including range queries, time-slice queries, and nearest-neighbor queries, can be answered efficiently. A novel feature of the index is that it adopt the well-known clustering algorithm, namely -means algorithm. Instead of the "two-way" split procedure and adopting"multi-way"split , which inherently is supported by clustering techniques. Finally, the experiments show that the index significantly outperforms the other algorithm under all conditions.