Bei Fragen zu den hier angebotenen Themen wenden Sie sich bitte an die jeweiligen Betreuer. Weitere Themen können in der Regel direkt bei den Mitarbeitern der Arbeitsgruppe erfragt werden. Eigene Themenvorschläge können an unsere Mail-Verteiler geschickt werden (je nach Vorhaben bitte an Projekt, Abschlussarbeit, oder Praktikum). Abschlussarbeiten können wahlweise auf englisch oder deutsch verfasst werden.

Themen für Abschlussarbeiten

Die folgenden offenen Themen bieten wir derzeit für Bachelor- und Masterarbeiten an (bitte anklicken).

Database Topics

  • Relational Algebra Translator for SQLValidator (Bachelor)
Supervisor: ; Victor Obionwu
Abstract: This translator will allow students to execute relational algebra statements on a database. The relational algebra translator will read a relational statement as input and perform the following basic steps.
Goals and results: 
  • Syntax Validation: The syntax of the query is verified in this step.
  • Semantics Verification: Here, Type checking and verification of valid column references will be performed.
  • Query Evaluation: The query is evaluated using database engine. Its relational algebra statement will be translated to an SQL statement and then executed against a database.
  • A Spark-based framework for discovering closed patterns
Supervisor:   Sadeq Darrab
Abstract: A frequent pattern mining method is a subfield of data mining that identifies patterns that frequently co-occur together in a dataset. There are several methods for enumerating the complete set of frequent patterns. However, these methods generate so many patterns (including redundant ones), which leads to extensive downstream analysis. Also, they are designed to handle small datasets and cannot handle big data. In this thesis, we investigate a framework to mine condensed representations for interesting patterns from big data by utilizing the spark tool.
  • NVM-optimized Bepsilon-tree
Supervisor:   Sajad Karim
Abstract: Non-volatile memory (NVM) is a new class in the traditional storage hierarchy. The technologies in this class share the characteristics of primary and secondary storage. They provide access latency close to DRAM, are addressable from cache lines, offer much higher capacity than DRAM, and are non-volatile. NVM is also often referred to as a disruptive memory technology as it has invalidated the traditional programming paradigm because, contrary to the traditional model, where data structures are generally categorized into memory and storage resident data structures, NVM-bound data structures cover both the aspects and the linked intricacies. Moreover, there has been considerable research made to leverage the characteristics of NVM, and in particular to the task mentioned in this posting, several designs for the index structures (e.g. wB+-Tree, NV-Tree, FP-Tree, LB+-Tree) [4, 5, 6, 7] that are typical to key-value storage engines are presented. However, one of the key aspects that is not addressed in the mentioned literature is they do not consider the heterogeneity of the modern storage landscape. For example, they all present NVM-DRAM optimized B-trees and do not consider block devices like SSD and HDD. Furthermore, and to the best of our knowledge, no research has been made to optimize Bepsilon-tree [1, 2, 3] for NVM despite the fact it offers similar scan operations as other B-tree variants yet its inserts and deletes are an order of magnitude faster.
Goals and results:  The goal is to implement an NVM-optimized Bepsilon-tree. It includes reviewing the recent literature and proposing data structures for the internal and leaf nodes in the B?-tree that would leverage the characteristics of NVM. Moreover, our server is equipped with the NVM module from Intel® (Intel® Optane™ DC Persistent Memory Modules), therefore, the proposed layouts should consider the characteristics of the module [8]. For example, the read and write latencies of the module are asymmetric where the reads are faster than the writes. Lastly, the proposed design has to be evaluated against the typical DRAM-based and disk-based Bepsilon-trees.
[1] Rudolf Bayer and Edward McCreight. 1970. Organization and Maintenance of Large Ordered Indices. In Proceedings of the ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control (Houston, Texas). Association for Computing Machinery, New York, NY, USA, 107–141.
[2] Gerth et al. 2003. Lower bounds for external memory dictionaries.. In SODA, Vol. 3. 546–554.
[3] Michael A Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Bradley C Kuszmaul, Donald E Porter, Jun Yuan, and Yang Zhan. 2015. An Introduction to B? -trees and Write-Optimization. login; magazine 40, 5
[4] Shimin Chen and Qin Jin. 2015. Persistent B+-trees in non-volatile main memory. Proc. VLDB Endow. 8, 7 (February 2015), 786–797.
[5] FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory.
[6] Jihang Liu, Shimin Chen, and Lujun Wang. 2020. LB+Trees: optimizing persistent index performance on 3DXPoint memory. Proc. VLDB Endow. 13, 7 (March 2020), 1078–1090.
[7] Y. Zhou, T. Sheng and J. Wan, "HBTree: an Efficient Index Structure Based on Hybrid DRAM-NVM," 2021 IEEE 10th Non-Volatile Memory Systems and Applications Symposium (NVMSA), Beijing, China, 2021, pp. 1-6, doi: 10.1109/NVMSA53655.2021.9628870.
[8] Lessons learned from the early performance evaluation of Intel optane DC persistent memory in DBMS. 10.1145/3399666.3399898

Software Engineering Topics

  • Semi-automatic approaches to support systematic literature reviews (Master)
Supervisor:   Yusra Shakeel
Abstract: Systematic Literature Review (SLR) is a methodology of research which aims to gather and evaluate all the available evidence regarding a specific research topic. The process is composed of three phases: Planning, Conducting and Reporting. Although SLRs gained immense popularity among evidence-based researchers, to conduct the entire process manually can be very time consuming. Hence, software engineering researchers are currently involved in proposing semi-automatic approaches to support different phases of an SLR. In this thesis, you analyze the current state of research related to reporting phase of the SLR process. Based on the findings, develop an approach to support researchers with the steps involved for reporting results of an SLR.
Goals and results: 
  • Determine the current-state-of-art related to approaches for reporting of an SLR
  • Propose and evaluate your concept to semi-automate the steps involved in this phase
  • Automate quality assessment of studies to support literature analysis (Bachelor/Master)
Supervisor:   Yusra Shakeel
Abstract: The number of empirical studies reported in software engineering have significantly increased over the past years. However, there are some problems associated with them, for example, the approach used to conduct the study is not clear or the conclusions are incomplete. Thus, making it difficult for evidence-based researchers to conduct an effective and valid literature analysis. To overcome this problem, a methodology to assess the quality and validity of empirical studies is important. Manually performing quality assessment of empirical studies is quite challenging hence, we propose a semi-automatic approach. In this thesis, you improve the already existing prototype for assessing quality of articles. The aim is to provide the most promising studies relevant to answer a research question.
Goals and results: 
  • Extend existing prototype to assess quality of empirical studies
  • Evaluate the proposed approach

Wissenschaftliche Teamprojekte

Für wissenschaftliche Teamprojekte bieten wir eine eigene Veranstaltung an: 

Zu Beginn dieser Veranstaltung werden verschiedene Themen vorgestellt, die innerhalb des Semesters bearbeitet werden können

Individualprojekte können mit Mitarbeitern auf Anfrage ebenfalls vereinbart werden.


Es stehen derzeit folgende Themen für ein Softwareprojekt zur Verfügung.

  • Analytic Dashboard for SQLValidator
Supervisor:   Victor Obionwu
Description: Desired features: Admin page where the respective survey statistics are analyzed and classified. A student page that shows the statistics about the students work patterns over the past week and months with respect to the exercise tasks, self-checks and team activities. The dashboard will also be able to provide recommendation based on a student’s survey and task submissions.



  • LaTeX-Vorlagen für deutsche und englische Arbeiten
    • DBSE Thesis Template 2021: GitLab
    • DBSE Thesis Template 2018: TeX, PDF
  • Microsoft Word-Vorlage: DOT


  • LaTeX-Vorlagen für Vorträge
    • DBSE Presentation Template 2021: GitLab
    • DBSE Presentation Template "Metrocity": GitHub
  • Microsoft PowerPoint-Vorlage: PPTX 4:3, PPTX 16:9

Letzte Änderung: 22.02.2022 - Ansprechpartner: