Multi-Approximation based Time-Parameterized moving objects R-tree

A moving polygonal object takes up large storage space in moving database, which incurs heavy disk I/O cost in querying process. Motivated by TPR-tree and MR-tree, Multiple-Approximation is advanced to be TPMA with Time-Parameterized technology to deal with indexing of moving polygonal objects. New indexing structure for moving polygonal objects based on TPMA, which is termed as MTPR-tree, is presented in this paper. MTPR-tree uses TPBR and TPMEC to approximate moving polygon, which can decrease number of candidate results in a query. A hash structure is introduced into MTPR-tree to reduce negative effect of TPMA. Advantage of MTPR-tree is not only deduced theoretically, but also verified by extensive experiments in our study.