Abstract:
This paper examines a continuous query processing trajectory similarity search variant. For online detour detection, we compare the reference route Tr to the current partial route at each timestamp for a moving object from s to d.
We propose a partial trajectory similarity measure to fill the gap left by trajectory distance measures. We list all routes extended from the partial route to reach d and calculate their minimum distance to Tr.
We calculate deviations in euclidean space and road networks. Euclidean space lets us directly infer the best future path with the shortest trajectory distance.
We propose a pruning-based road network expansion algorithm. We also propose efficient incremental processing strategies for moving object query processing. Our query processing algorithms are validated by experiments on multiple real datasets.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
