Prof. Dr. Felix Naumann

Advanced Data Profiling

Efficient membership tests for order dependencies


If you are interested in participating, please attend the initial session and reach out to sebastian.schmidl(at)hpi.de until November 8 (EOD). You can withdraw from this seminar until November 9 (when we give out the team topics) without consequences.

Please do not hesitate to contact us if you are interested, but the current time slot does not fit your schedule. In this case, please include a note that the current time does not fit you well. We would try to reschedule our meetings to allow more students to participate.

We have our first meeting on Thursday, 19th of October between 11:00 and 12:30 in F-E.06 (HPI Campus II). You can find the schedule below.


Data profiling is the process of extracting metadata from datasets. One important task is the discovery of order dependencies (ODs), which capture the order relationship among attributes in a relational table. There are two prominent ways to express ODs: The list-based form and the set-based canonical form. Current state-of-the-art algorithms for the automatic discovery of order dependencies use the set-based form to benefit from the increased efficiency of a smaller search space. However, most OD usage scenarios require ODs in their list-based form. One example for the application of ODs is query optimization: If a user requests a relation to be ordered by multiple columns, the optimizer can reduce the number of performed sort operations if an OD holds. Notice that the SQL ORDER BY-statement uses lists of attributes. While the discovery algorithms output a complete set of minimal set-based ODs, we need to know if a certain, potentially non-minimal, list-based OD holds to perform the query rewrite. How do we efficiently check whether a given list-based OD can be derived from the set of minimal set-based ODs?

Finding a solution to the task is non-trivial due to the following three technical challenges:

  • the complex transformation between list-based and set-based forms (factorial complexity)
  • implementation of the known OD inference axioms for a membership test algorithm
  • requirement of an efficient data structure to access potentially large collection of valid ODs (hundreds of thousands)


  • Learn about the research area of data profiling
  • Read and understand scientific papers
  • Craft a novel solution to the problem of efficient OD membership tests
  • Run experiments and evaluate results
  • Present results in written and oral form



  • Project seminar for master students 
  • Language: English
  • Maximum number of participants: 8

We will form teams of two in the first session and each team develops their own approach.


  • Prior knowledge in data profiling (preferably completed Data Profiling lecture)
  • Good programming skills in a major programming language


In the seminar, each team will develop an approach and write a short report. The final grade consists of the following three parts:

  • Approach (35%)
  • Written report (35%)
  • Midterm and final presentations (30%)


IT-Systems Engineering MA

  • HPI-OSIS-(K/T/S)

 Data Engineering MA

  • HPI-DANA-(K/T/S)
  • HPI-CODS-(K/T/S)

 Software Systems Engineering MA

  • HPI-DSYS-(C/T/S)

Time Table

2023-10-19 (in F-E.06)Seminar introduction [Slides]
2023-10-26 (in F-E.06)Intro to order dependencies [Slides]
2023-11-02 (in F-E.06)Intro to FD-Membership tests [Slides]
2023-11-10 - 2023-12-08 (in F-2.11)Weekly meetings and progress reports (Fridays from 1pm)
2023-12-14 (L-1.02)Presentation 1 (Goal & Ideas)
2023-12-15 (F-2.11)Weekly meeting and presentation feedback
2023-12-22(no meeting)
2023-12-29Christmas break
2024-01-05 - 2024-02-09 (F-2.11)Weekly meetings and progress reports
2024-02-16 (F-E.06)Presentation 2 (Implementation & Experiments)
2024-02-21Presentation feedback
2024-03-01 - 2024-03-22 (F-2.11)Weekly meetings
2024-03-22, WYASubmission deadline