摘要
基于固定网络的移动对象索引MON树采用两层R树和一个散列表结构,该索引能有效地实现了对网络环境下的移动对象过去信息的索引与查询,但却不能实现对当前和将来信息的索引,针对这一问题,本文对MON树进行了扩展,使其能实现对移动对象过去、当前和将来信息的全时态索引,并在此基础上实施了范围查询。
MON-tree consists of two levels R-Tree and a hash structure, which can efficiently store and retrieve objects moving in fixed networks. The index structure stores the complete trajectories of the moving objects and is capable to answer queries about the past states of the database. But MON-tree can＇ t query the present and filture positions of the moving objects. In this paper, we develop MON-tree structure in order to index and query the past, present and future positions of moving objects.Moreover,range query are implemented based on this index structure.
出处
《齐齐哈尔大学学报（自然科学版）》
2008年第6期8-11,共4页
Journal of Qiqihar University(Natural Science Edition)
