SEB-tree: An Approach to Index Continuously Moving Objects

The paper gives the data format of object movement under the zoning based index updating policy, and proposes the SEB-tree (Start/End time stamp B-tree), which has fast insertion and query algorithm, and it outperforms the existing structures in the experimental evaluations.

Abstract

Recently, the requirement for storing the locations of continuously moving objects arises in many applications. The paper extends our previous work on zoning based index updating policy [1]. In the paper, we give the data format of object movement under the policy. Then, we propose the SEB-tree (Start/End time stamp B-tree). This index structure has fast insertion and query algorithm, and it outperforms the existing structures in the experimental evaluations.