<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Martin Hentschel on DASYA</title>
    <link>https://dasya.itu.dk/supervisor/martin-hentschel/</link>
    <description>Recent content in Martin Hentschel on DASYA</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>© DASYA, IT University of Copenhagen</copyright>
    <lastBuildDate>Fri, 24 Jul 2026 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://dasya.itu.dk/supervisor/martin-hentschel/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>A Metadata Management System for Apache Wayang</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-zk-wayang-metadata-store/</link>
      <pubDate>Fri, 24 Jul 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-zk-wayang-metadata-store/</guid>
      <description>BSc / MSc Thesis.
This project focuses on designing and implementing a metadata management store for Apache Wayang. Wayang lets users express a data processing task in a platform-agnostic way and then decides which underlying platform (e.g., Spark, Flink, Postgres, Java) should execute each part of the plan. Today, however, Wayang has no dedicated component for managing metadata: information such as schemas, statistics, or learned cost functions is handled implicitly by individual subsystems rather than stored and reused in one place.</description>
    </item>
    
    <item>
      <title>AI Optimization of Database-y Workloads</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/mh-ai-db-workloads/</link>
      <pubDate>Fri, 24 Jul 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/mh-ai-db-workloads/</guid>
      <description>BSc Thesis / MSc Thesis.
The goal of this project is to use AI coding tools such as ChatGPT Codex and Claude Code together with optimization tools such as OpenEvolve to find innovative solutions for various database-y workloads, including:
 SIEM workloads, such as finding IP addresses in large security data sets String search workloads, such as finding substrings or evaluating regular expressions in large bodies of text Data analysis workloads, such as executing SQL queries over application logs  The core idea is to find better statistics to summarize data partitions.</description>
    </item>
    
    <item>
      <title>Building a Game with LLM Randomness: From Play to Personas</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/mh-llm-rng-personas/</link>
      <pubDate>Fri, 24 Jul 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/mh-llm-rng-personas/</guid>
      <description>BSc Thesis.
This project builds on a previous master&amp;rsquo;s thesis, Prompting Luck: Bias and Manipulability in LLM-Generated Randomness, that explored replacing traditional random number generators (RNG) in games with large language models (LLMs). The idea is that an LLM can produce &amp;ldquo;intelligent&amp;rdquo; random numbers, for example the outcome of a slot machine spin, that take context into account rather than being drawn from a uniform distribution. The goal of this project is to experimentally validate the findings of that thesis by building an actual game, connecting it to an LLM, and putting the idea to the test with real players.</description>
    </item>
    
    <item>
      <title>&#34;Intelligent&#34; Randomness: Can LLMs Make Games More Fun?</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-llm-vs-rng/</link>
      <pubDate>Thu, 20 Nov 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-llm-vs-rng/</guid>
      <description>BSc Thesis / MSc Thesis.
The goal of this project is to explore the feasibility and impact of replacing traditional random number generators (RNG) in games with large language models (LLMs). For example, in a slot machine game, the outcome is typically determined by a random number generated each time the &amp;ldquo;spin&amp;rdquo; button is pressed. In this project, students will investigate using an LLM to generate these numbers instead.
Research questions include:</description>
    </item>
    
    <item>
      <title>Character Maps in Query Processing</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-charmaps/</link>
      <pubDate>Wed, 02 Jul 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-charmaps/</guid>
      <description>MSc Thesis.
Character maps in database systems are specialized data structures optimized for efficient string handling. Similar to Bloom filters, they allow quick checks for the presence of characters or substrings without full string comparisons. This makes them useful for accelerating string-related queries and improving overall search performance in databases.
The goal of this project is to delve deeply into character maps: What strategies for building character maps exist, and how do they compare to Bloom filters and prefix trees (aka tries)?</description>
    </item>
    
    <item>
      <title>Database-Driven JS Game Framework</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-js-framework-udf/</link>
      <pubDate>Wed, 02 Jul 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-js-framework-udf/</guid>
      <description>BSc Thesis.
The idea of this project is to write a game framework in JavaScript (e.g., a physics engine or state machine that keeps track of the game state) that can be re-run deterministically using databases. That is, in addition to being a standalone framework, the JavaScript framework must run as a user-defined function (UDF) in a relational database where it can be executed on thousands of existing user inputs. The research questions include whether such a framework is feasible to build, how fast it executes within a database system as a UDF, and how it scales when executed against thousands or more existing game states or user input sessions.</description>
    </item>
    
    <item>
      <title>Good or Bad: LLM-Generated Datasets</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-generated-dataset/</link>
      <pubDate>Wed, 02 Jul 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-generated-dataset/</guid>
      <description>(MSc Research Project / MSc Thesis)
The goal of this project is to research how AI and large language models generate datasets. Research questions include: Where does the generated data come from? Are sources available on the internet or can they be found? What biases exist in the generated data? And how much of the data is simply wrong? Generated datasets are used in many fields in practice, including journalism (e.</description>
    </item>
    
    <item>
      <title>Min-Max Statistics in DuckDB</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-minmax-duckdb/</link>
      <pubDate>Wed, 02 Jul 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-minmax-duckdb/</guid>
      <description>MSc Thesis.
DuckDB stores data in a database file. The database file is split into partitions, and for each partition, DuckDB keeps statistics in the form of min-max summaries. Similar min-max summaries exist in Parquet files and many other database systems, such as Snowflake. Check out Lecture 8 of last semester&amp;rsquo;s Introduction to Database Systems course for a summary of min-max summaries (I can send the slide deck if needed).</description>
    </item>
    
    <item>
      <title>Role-Based Access Control in Data Lakes</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-rbac-data-lakes/</link>
      <pubDate>Wed, 02 Jul 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-rbac-data-lakes/</guid>
      <description>(MSc Research Project / MSc Thesis)
Role-based access control (RBAC) and data lakes do not seem to go together very well. RBAC controls who can access specific information. Data lakes allow all users to see all information. Is encryption the only way to bridge these two worlds?
In this computer science-focused MSc research project and/or master&amp;rsquo;s thesis, you will investigate existing approaches to managing and enforcing data access in data lakes and explore how encryption can play a central role.</description>
    </item>
    
    <item>
      <title>Deconstructed Cloud Databases: Atomic Counters</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-deconstr-counters/</link>
      <pubDate>Sat, 01 Feb 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-deconstr-counters/</guid>
      <description>The Deconstructed Cloud Databases project stems from a simple question: What are the minimum components required to build a data management system in the cloud? Our motivation for this project is based on the idea that reducing a system to its minimum set of components makes it easier to build, test, and maintain cloud data management systems. This approach requires less engineering effort, reduces the cost of software development, and lowers the risk of errors by minimizing the number of components that need to be managed.</description>
    </item>
    
    <item>
      <title>Logging in Open-Source JavaScript Applications</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-logging-javascript/</link>
      <pubDate>Tue, 24 Sep 2024 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-logging-javascript/</guid>
      <description>Open-source JavaScript applications, such as browser-based web games, are typically developed by individual software engineers or small teams. These teams often have limited financial resources to use commercial logging frameworks and cloud-based analysis systems and may also lack knowledge and expertise in logging. However, log analysis is highly important for many reasons: monitoring application health, understanding user adoption, improving the application through experiments, and detecting or preventing malicious inputs (e.</description>
    </item>
    
    <item>
      <title>Deconstructed Cloud Databases, Part II: Open Dictionary Metadata</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-deconstr-dictionary/</link>
      <pubDate>Mon, 26 Aug 2024 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-deconstr-dictionary/</guid>
      <description>The Deconstructed Cloud Databases project stems from a simple question: What are the minimum components required to build a data management system in the cloud? Our motivation for this project is based on the idea that reducing a system to its minimum set of components makes it easier to build, test, and maintain cloud data management systems. This approach requires less engineering effort, reduces the cost of software development, and lowers the risk of errors by minimizing the number of components that need to be managed.</description>
    </item>
    
  </channel>
</rss>