Hybrid Indexing Consisting of TPR*-Tree and Hash Map for Real-Time Update and Query of Tactical Moving Objects
2018 IEEE International Conference on Big Data and Smart Computing (BigComp) (2018)
Jan 15, 2018 to Jan 17, 2018
It is important to update and query the target objects in real-time in the battlefield combat system. This paper proposes a hybrid index combining TPR*-tree and hash map as an index for updating and querying target objects in real-time. A method is needed to improve the update performance of the TPR*-tree when the number of target objects collected simultaneously by several sensors is 10,000 or more. We propose a non-leaf insertion policy that directly contains target objects as well as MBRs on non-leaf nodes as a method to reduce time-parametric MBR expansion in TPR*-tree by fast target objects. Through experiments, we show that the performance of the proposed hybrid index updates and queries the target object in real-time.
database indexing, indexing, query processing, tree data structures, trees (mathematics)
S. Jung, C. Kim, J. Lee and B. Hong, "Hybrid Indexing Consisting of TPR*-Tree and Hash Map for Real-Time Update and Query of Tactical Moving Objects," 2018 IEEE International Conference on Big Data and Smart Computing (BigComp), Shanghai, China, 2018, pp. 440-447.