Group Insert Tree with Projection for Handling Vehicle Information Effectively in LBS

The dynamic advances of wireless telecommunication and positioning technologies lead to develop the moving object management system and provide suitable services according to the vehicle locations. To provide these location based services smoothly, it is necessary for an index technique to store and search lots of moving object data rapidly. However, most of the existing bulk loading techniques of moving object indices have not good search performance, because they focus on the effective insert manner. To solve this problem, we propose a GIP(Group Insert tree with Projection) in this paper. The proposed GIP reduces the input cost effectively since the manner stores the moving object location data in a group. Besides, it also reduces the search cost with Projection storage. Then we confirm the effect of the GIP which reduces the insert cost and improves the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed GIP would be useful in the environments that require frequent insert as well as search of location information such as a transportation vehicle management and a tour-guide system.