HTPR*-Tree: an efficient index for moving objects to support predictive query and partial history query

  • Authors:

  • Ying Fang;Jiaheng Cao;Junzhou Wang;Yuwei Peng;Wei Song

  • Affiliations:

  • School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China

  • Venue:
  • WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Developing efficient index structures is an important issue for moving object database. Currently, most indexing methods of moving objects are focused on the past position, or on the present and future one. In this paper, we propose a novel indexing method, called HTPR*-tree (History Time-Parameterized R-tree), which not only supports predictive queries but also partial history ones involved from the most recent update instant of each object to the last update time. Based on the TPR*-tree, our HTPR*-tree adds creation or update time of moving objects to leaf node entries. This index is the foundation of indexing the past, present and future positions of moving objects. In order to improve the update performance, we present a bottom-up update strategy for the HTPR*-tree by supplementing three auxiliary structures which include hash index, bit vector, and direct access table. Experimental results show that the update performance of the HTPR*-tree is better than that of the TD_HTPR*- and TPR*-tree. Moreover, the HTPR*-tree can support partial history queries compared with TPR*-tree although the predictive query performance is a bit less.