A group based insert manner for storing enormous data rapidly in intelligent transportation system

Abstract

The flood of data is occurred in ITS(intelligent transportation system) according to the progress of wireless telecommunication and sensor network. To deal with large data and provide suitable services smoothly, it is necessary for an index technique to store and search bulk object data rapidly. However the existing indices require a lot of costs to insert a huge amount of data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node manner reduces the input cost effectively since it stores the moving object location in a group. And then we confirm the effect of the buffer node manner which reduces the insert cost and increases the search performance in a time slice query from the experiment to compare the operation with some existing indices. © Springer-Verlag Berlin Heidelberg 2005.