Efficient locking strategies in large highly mutable data structures

Gothenburg, Stockholm, Paris, Munich

Today there is more geographically positioned data available than ever before. Rescue services and telecom operators track positions of cell phones and traffic control centres the location of vehicles.

A lot of this data is dynamic and is continuously changing position, which makes accessing it quickly a challenge. A common way to improve the query performance is to spatially index the data, but it is time consuming to keep this index updated when the data changes.

The purpose of the Master’s Thesis is to evaluate locking strategies to optimize the read and write throughput to an in-memory spatial index.

This task is suitable for students interested in C++, algorithms, parallelism, data structures and performance.


Fill in the application form below and we will contact you as soon as possible.


Add a link to your linkedin profile or your CV :