A major issue in LBS (Location Based Service) is the handling of numerous historical moving object data, affecting query performance and service quality in application systems. In order to store and search lots of data rapidly, an effective index structure is required for improving not only the insertion method, but also the search performance.
In order to improve the performance of both applications, we propose the GIP+ (Group Insertion tree with Projection Plus) for historical data manageme
dc.language
eng
dc.relation.ispartofseries
The Journal of systems and software
dc.title
Historical index structure for reducing insertion and search cost in LBS