Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies
Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies
复制标题
DOI：
10.1007/s11390-008-9185-0
复制
发表时间：
2008-11
影响因子：
0.7
通讯作者：
N. Chen;Lidan Shou;Gang Chen;Jinxiang Dong
中科院分区：
文献类型：
--
作者：
N. Chen;Lidan Shou;Gang Chen;Jinxiang Dong
近年来，移动对象的管理已成为空间访问方法的一个活跃话题。已经提出了各种数据结构（索引）来处理移动点的查询，例如，众所周知的Bx树使用新颖的映射机制来减少索引更新成本。然而，几乎所有现有的索引预测查询是不适用于某些情况下，当更新频率的移动对象变得高度可变，当系统需要平衡的性能更新和查询。本文介绍了两种新的索引：By-tree和αBy-tree。通过将预测生命周期与每个移动对象相关联，所提出的索引适用于具有高度可变的更新频率的环境。此外，αBy-tree可以根据平衡参数来平衡更新和查询的性能。实验结果表明，By-tree和α-By-tree在各种情况下都优于Bx-tree。
In recent years, management of moving objects has emerged as an active topic of spatial access methods. Various data structures (indexes) have been proposed to handle queries of moving points, for example, the well-known Bx-tree uses a novel mapping mechanism to reduce the index update costs. However, almost all the existing indexes for predictive queries are not applicable in certain circumstances when the update frequencies of moving objects become highly variable and when the system needs to balance the performance of updates and queries. In this paper, we introduce two kinds of novel indexes, named By-tree and αBy-tree. By associating aprediction life periodwith every moving object, the proposed indexes are applicable in the environments with highly variable update frequencies. In addition, the αBy-tree can balance the performance of updates and queries depending on a balance parameter. Experimental results show that the By-tree and αBy-tree outperform the Bx-tree in various conditions.