Lunds Tekniska Högskola


CS MSc Thesis Presentations 8 June 2022


Tid: 2022-06-08 09:15 till 15:00
Plats: E:2405 (Glasburen) and E:4130 (Lucas)
Kontakt: birger [dot] swahn [at] cs [dot] lth [dot] se
Spara händelsen till din kalender

Two Computer Science MSc theses to be presented on 8 June

Wednesday, 8 June there will be two master thesis presentations in Computer Science at Lund University, Faculty of Engineering.

The presentations will take place in E:2405 (Glasburen). See time and location for each presentation below.

Note to potential opponents: Register as an opponent to the presentation of your choice by sending an email to the examiner for that presentation ( Do not forget to specify the presentation you register for! Note that the number of opponents may be limited (often to two), so you might be forced to choose another presentation if you register too late. Registrations are individual, just as the oppositions are! More instructions are found on this page.

09:15-10:00 in E:2405 (Glasburen)

Presenter: Samer Alkhodary
Title: The Evaluation of Using Backend-For-Frontend in a Microservices Environment
Examiner: Niklas Fors
Supervisor: Alfred Åkesson (LTH)

In modern web applications, the client keeps track of several services in a backend consisting of several microservices, known as the microservices pattern. The client makes several requests to the services to gather the needed information, which adds extra latency. The backend for frontend pattern (BFF) is a possible solution that mitigates the microservice pattern's performance overhead. The BFF pattern is where a BFF service acts as a gateway between the client and the backend services. Therefore, all communication between the services and the client goes through the BFF. This thesis investigated the BFF pattern's effects on latency, data usage, the dependencies between the client and the backend, and the client's code. We implemented the BFF pattern in Qlik's staging environment using three different technologies,i.e., gRPC, REST, and GraphQL. As a result, we found that the BFF positively impacted all the criteria mentioned above.

Link to popular science summary:

14:15-15:00 in E:2405 (Glasburen)

Presenters: Linnea Johnsson, Jonathan Frisk
Title: Comparing Event Matching Algorithms for Content-Based Publish-Subscribe Systems
Examiner: Flavius Gruian​​​​​​​
Supervisors: Per Andersson (LTH), Oscar Bäckström (Volvo Cars AB)

As more data is produced and distributed in systems the need to efficiently handle that data arises. However, not all parties are interested in all changes to the data. Due to this, representing data changes as events and letting users subscribe to them in a publish-subscribe system is one effective way of handling the data. One granular way of subscribing to events is through content-based subscription, which matches the event's content. However, as events and subscriptions increase in content size, the matching time increase. This may impose a bottleneck, also known as the event matching problem. To solve this problem, efficient event matching algorithms are developed. From research, three event matching algorithms from different categories are identified and implemented in order to understand how they compare to each other. The algorithms are evaluated on matching time, subscription insertion time, and memory consumption. Furthermore, they are compared with a baseline to understand if, and how well, they outperform it. According to the results, no algorithm steadily performs the best for every scenario. However, GEM-Tree and Maema show the most potential when it comes to matching time, but with a noticeable trade-off with worse subscription time and memory consumption.

Link to popular science summary: