Moving Query Method Based on Double R-Tree and Double Indexing

In order to effectively index a huge amount of moving objects within a limited area, and to put forward a universal solution to response moving query, according to the mobile characteristic of moving objects in the road grid, speed accumulation model which can predict the current speed and the moving query method based on double R-tree and double indexing (DTDI)structure that can predict where the moving objects will be in the future are proposed. The DTDI structure builds up the space dividing tree based on grid to expand the already existing GG TPR-tree query structure. The space dividing tree, the GG TPR-tree, the GG TPR-tree indexing, and the Hash indexing in the memory together make up the DTDI structure to meet the requirements for all kinds of moving queries. Experimental results showed that the accuracy for the DTDI structure is better than other structures in querying a great capacity of moving objects within a limited area.