Research

Scalable query processing on complex data types

More information can be found in the following links:

 

Querying spatial graphs

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. The research of the Data Management group focuses on designing and developing novel routing services on road networks that go beyond the computation of the shortest path.

More information can be found in the following links:

 

Networks analysis & logistics

More information can be found in the following links:

 

Querying trajectories

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. Trajectories are modelled as sequences of spatio-temporal points. Very often however, trajectories are assigned additional types of information such as text. The Data Management group focuses on retrieval and path finding tasks for collections of trajectories.

More information can be found in the following links:

 

Web and social data analysis

More information can be found in the following links: