영문내용
(English Abstract) |
Nowadays, with numerous emerging applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.), access methods to process current and future queries for moving objects are becoming increasingly important. Among these methods, the time-parameterized R-tree (TPR-tree) seems likely the most flexible method in one, two, or three-dimensional space. A key point of TPR-tree is that the (conservative) bounding rectangles are expressed by functions of time. In this paper, we propose a new method, which takes into account positions of its moving objects against the rectangle''s bounds. In proposed method, the size of bounding rectangle is significantly smaller than the traditional bounding rectangle in many cases. By this approach, we believe that the TPR-tree can improve query performance considerably. |
