Hybrid Indexing of Moving Objects with Frequent Updates

Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong

Journal of Computer Research and Development > 2006 > 43(5): 888-893.

Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.

Citation:

Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.

Citation:

Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.

PDF (380 KB)

Hybrid Indexing of Moving Objects with Frequent Updates

Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong

(College of Electronic Science and Engineering, National University of Defense Technology, Changsha 410073)

More Information

Published Date: May 14, 2006

Graphical Abstract

Abstract

Abstract

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.
- moving object indexing method,
- HTPR-tree,
- bottom-up update

FullText(HTML)

References (0)

[1]	Jiang Luyu, Ouyang Dantong, Zhang Qi, Tai Ran, Zhang Liming. Incremental Information Interaction-Based Algorithm for Enumerating MUSes[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440326
[2]	Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
[3]	Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
[4]	Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
[5]	Qiu Jiangtao, Tang Changjie, Zeng Tao, Liu Yintian. Strategy of Revising Rules for Association Text Classification[J]. Journal of Computer Research and Development, 2009, 46(4): 683-688.
[6]	Zhong Yong, Qin Xiaolin, and Bao Lei. An Association Rule Mining Algorithm of Multidimensional Sets[J]. Journal of Computer Research and Development, 2006, 43(12): 2117-2123.
[7]	Xiong Zhongmin, Hao Zhongxiao. An Approach to Termination Decision for a Rule Set Based on Activation Path and Conditional Formula[J]. Journal of Computer Research and Development, 2006, 43(5): 901-907.
[8]	Hao Zhongxiao, Xiong Zhongmin. An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database[J]. Journal of Computer Research and Development, 2006, 43(2): 281-287.
[9]	Hao Zhongxiao, Ren Chao, Zhao Lingqiang. Termination Analysis of Active Rule Based on Dependency Set[J]. Journal of Computer Research and Development, 2005, 42(12): 2199-2205.
[10]	Tian Daxin, Liu Yanheng, Li Yongli, Tang Yi. A Fast Matching Algorithm and Conflict Detection for Packet Filter Rules[J]. Journal of Computer Research and Development, 2005, 42(7): 1128-1135.