KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Online Publication Date2017-03-22
Print Publication Date2017-07-01
Permanent link to this recordhttp://hdl.handle.net/10754/623103
MetadataShow full item record
AbstractWith the increasing availability of moving-object tracking data, trajectory search is increasingly important. We propose and investigate a novel query type named trajectory search by regions of interest (TSR query). Given an argument set of trajectories, a TSR query takes a set of regions of interest as a parameter and returns the trajectory in the argument set with the highest spatial-density correlation to the query regions. This type of query is useful in many popular applications such as trip planning and recommendation, and location based services in general. TSR query processing faces three challenges: how to model the spatial-density correlation between query regions and data trajectories, how to effectively prune the search space, and how to effectively schedule multiple so-called query sources. To tackle these challenges, a series of new metrics are defined to model spatial-density correlations. An efficient trajectory search algorithm is developed that exploits upper and lower bounds to prune the search space and that adopts a query-source selection strategy, as well as integrates a heuristic search strategy based on priority ranking to schedule multiple query sources. The performance of TSR query processing is studied in extensive experiments based on real and synthetic spatial data.
CitationShang S, chen L, Jensen CS, Wen J-R, Kalnis P (2017) Searching Trajectories by Regions of Interest. IEEE Transactions on Knowledge and Data Engineering: 1–1. Available: http://dx.doi.org/10.1109/TKDE.2017.2685504.