The promotion / demotion algorithm of moving objects with large velocity differences in time-parameterized spatio-temporal index

摘要

Overlapping costs increase due to a difference in speed of moving objects, ranging from low-speed submarines to high-speed airplanes in the time-parameterized spatio-temporal index. This paper proposes a new method for promoting fast moving objects to upper non-leaf nodes to minimize overlap when the speed difference between objects in the index is considerably large. Experimental evaluation on datasets of moving objects with large speed differences demonstrates that the performance of insertion and deletion is improved. Our results show that the performance of the prediction query with speed parameters is improved by 75.8% as compared to previous approaches.