Scalable Query Processing
Spatial graphs analysis
Shortest path search is the core component of distance-based queries in graphs. Routing in road networks is an exemplary application of the shortest path search in spatial graphs where the length of a path captures e.g., the overall covered distance or the traveling time. In the latter case, the problem is also known as the fastest path search. However, with more types of user data becoming available, research has focused on routing that goes beyond the computation of the shortest/fastest path, more tailored to the user preferences and context. At the same time, as smartphones and GPS-enabled devices proliferate, managing trajectories of moving objects has become critical in a wide range of domains, e.g., touristic and mobile applications, traffic monitoring and advertising. Such trajectories can assist analysis tasks in spatial networks such routing and location-aware recommendations.
More information can be found in the following link.