News

Talk schedule and evaluation

Written on 23.01.24 by Jens Zentgraf

Dear all,

here is the schedule for the talks. Please remember that you must be present at all talks. 

Schedule:
09:00 - 09:45 Hopstotch Hashing
09:45 - 10:30 XOR Filter
10:30 - 11:30 Ribbon Filter
11:30 - 12:30 Binary Fuse Filters

12:30 - 13:30 Lunch

13:30 - 14:30 Learned Monotone… Read more

Dear all,

here is the schedule for the talks. Please remember that you must be present at all talks. 

Schedule:
09:00 - 09:45 Hopstotch Hashing
09:45 - 10:30 XOR Filter
10:30 - 11:30 Ribbon Filter
11:30 - 12:30 Binary Fuse Filters

12:30 - 13:30 Lunch

13:30 - 14:30 Learned Monotone Minimal Perfect Hashing
14:30 - 15:30 SicHash – Small Irregular Cuckoo Tables for Perfect Hashing
15:30 - 16:30 RecSplit: Minimal Perfect Hashing via Recursive Splitting

Here are some additional tips:
- It's best to practice your presentation with people. Get feedback if something is not clear.
- If you are trying to explain something by waving your hands in the air, you may want to make a graphic of it.
- If you want to explain something, a step-by-step example is much easier to understand than text.
- Check that you are staying within the time limit. (Bachelor 25 min, Master 40 min)
- The projector has a resolution of 16:9, which means that you can fit an image and text side by side. Please do not use 4:3 resolution.

Evaluation:
The link to the evaluation is in the materials. You have until 31 January to complete the survey.

If you have any questions, please email me.

Best regards and see you at the talks
Jens

 

Review deadline and presentation date

Written on 08.01.24 by Jens Zentgraf

Hello everyone,
The deadline for the reviews is approaching (15th January) and the presentations are also getting closer. 
We would like to do the presentations on 01.02. starting at 9am. Please keep in mind that each presentation should last about 40 minutes and that there will be a short… Read more

Hello everyone,
The deadline for the reviews is approaching (15th January) and the presentations are also getting closer. 
We would like to do the presentations on 01.02. starting at 9am. Please keep in mind that each presentation should last about 40 minutes and that there will be a short discussion and Q&A session after each presentation. 

If someone already has a fixed date for the 01.02. (exams or something like that), please e-mail me. Then we will try to find a date with a doodle. 

Best
Jens

Review Phase

Written on 21.12.23 by Jens Zentgraf

Dear all,

I distributed the reviews yesterday, and you should all have received an email from EasyChair. 

Here is a rough idea of how a review can be structured. 
Start with a short summary of what is explained in the report. This should show that you have understood the paper.
Then you can… Read more

Dear all,

I distributed the reviews yesterday, and you should all have received an email from EasyChair. 

Here is a rough idea of how a review can be structured. 
Start with a short summary of what is explained in the report. This should show that you have understood the paper.
Then you can divide it into two sections:
1. major: Here you list all important comments. This includes, for example, contradictions in the explanation, the explanation does not fit an example, the explanation is not clear or understandable, there is no structure in the elaboration, ...
2. minor: Here you can make any comments that are not essential for you. You can point out where a little more explanation would be useful or additional graphics would be good. Also tips on how to explain or visualize something else are always very useful.
Finally, you can also list grammar and spelling mistakes. 

In general, please write down any comments, problems and suggestions for improvement that you can think of. 

Best wishes and a Merry Christmas,
Jens
 

Draft deadline

Written on 18.12.23 by Jens Zentgraf

Everyone,

the deadline for submitting your draft reports and slides is today at 23:59.

We will use the conference system EasyChair [1] for the submission and the review.
You will need to create a new account. 

To create a new submission, use: https://easychair.org/conferences/?conf=mhfa-2023
Read more

Everyone,

the deadline for submitting your draft reports and slides is today at 23:59.

We will use the conference system EasyChair [1] for the submission and the review.
You will need to create a new account. 

To create a new submission, use: https://easychair.org/conferences/?conf=mhfa-2023
After logging in, click on the "make a new submission" link.
Insert your title and 3 keywords.
The last part is to upload your draft. Since you can only upload one pdf file, please combine the report and the slides in one file.

If something does not work or is not clear, please send me an e-mail.
The assignment for the reviews will be done tomorrow (19.12.).

Best regards,
Jens

[1] https://easychair.org/

Registration LSF

Written on 20.11.23 by Jens Zentgraf

Dear all,

the seminar (10202) and proseminar (10201) are available in the LSF.
Please register as soon as possible. Make sure you register for the right one.

Best regards,
Jens

Topic assignment

Written on 13.11.23 by Jens Zentgraf

Dear all,

you can find the topic assignment in the materials section.

Best regards,
Jens

Show all

(Pro-)Seminar Modern Hashing and Filtering Algorithms

In this proseminar, we will focus on different modern hash strategies. On the one hand we will discuss modern collision resolution strategies for hash tables. This includes Robin Hood hashing, Hopscotch hashing and others. On the other hand we will take a look at efficient filter like, Bloom filter, Cuckoo filter or XOR filter.
The goal is, that you can clearly explain the provided method in the seminar thesis. In addition, in the presentation, you should communicate the learned knowledge to the other participants in a way that is easy to understand.

In this seminar, we will discuss different modern hashing and filtering algorithms. We will focus on new minimal perfect hash algorithms (BBHash, RecSplit, PTHash, ...) and modern filters (Hierarchical Interleaved Bloom Filters, XOR Filters, Binary Fuse Filters, ...).
You will reimplement and benchmark the provided algorithm and check if you can reproduce the provided results. Also you will summarize your results in a short seminar thesis and present it to the other students in a presentation.

Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators.