Authors: Eung Jae Lee, Hoang Do Thanh Tung, Keun Ho Ryu, Young Jin Jung
Tags: 2004, conceptual modeling
Nowadays, with a great number of mobile (moving) objects using wireless communication or GPS technology, monitoring systems having the capability of handling anticipated future queries of the mobile objects are literally important. To cater for these applications, the TPR-tree indexing method, which is able to support the future queries, is substantially feasible for the real world. The crucial idea of them is to make the bounding rectangle as a motion function of time. In this paper, we propose an extended method of the TPR-tree, named Horizon TPR-tree or HTPR-tree. The general idea that we make a new motion function of time is to reduce speed of growing sizes of MBR (minimum bounding rectangles). Smaller MBR alleviates overlap problem and increases the effect of query in R-tree based methods. During creating and updating index, motion function influences organizing operations, such as splitting and adjusting. Our experiments show that the HTPR-tree outperforms the TPR-tree for anticipated future queries. In addition, the idea of the proposed method is able to apply to not only the TPR-tree but also variants of the TPR-tree. The proposed method is applicable to vehicle-traffic network systems.Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-540-30466-1_8
