Hybrid Indexing of Moving Objects with Frequent Updates

TPR-tree is the most popular indexing method for the current and future position of moving objects，but its frequent updates performance is very low. HTPR-tree, which is based on TPR-tree, supplemented by a hash index on leaf nodes and a memory-based direct-access table pointing to internal nodes of TPR-tree is presented for moving objects with frequent updates. Also an extended bottom-up update algorithm is developed for HTPR-tree. Performance analysis and experimental results show that the HTPR-tree update performance outperforms any other indexing method including TPR\+*-tree at the cost of slight query performance degrade.