Mateusz Pawlik

Mateusz Pawlik, PhD
Position & Contact
- Position: Research Assistant
- Room: 0.26
- Phone: +43 (0)662-8044-6356
- Fax: +43 (0)662-8044-172
- Email: mateusz.pawlik@sbg.ac.at
Research Background
My research journey started during my Erasmus 2006/2007 when I visited the Free University of Bozen-Bolzano, Italy. I did an internship under the supervision of Prof. Johann Gamper and worked on temporal multidimensional aggregation.
In 2009 I received my M.Sc. degree in Computer Science from Adam Mickiewicz University of Poznań, Poland. I wrote my master thesis “Storing and Retrieving Trajectories of Mobile Objects in Spatio-Temporal Databases” under the supervision of Prof. Tadeusz Pankowski.
I went back to the Free University of Bozen-Bolzano to do my PhD under the supervision of Prof. Nikolaus Augsten. I graduated in 2014 with the thesis “Efficient Computation of the Tree Edit Distance”. The examination committee was composed of:
- Prof. Alfons Kemper (Technische Universität München, Germany)
- Hélène Touzet (INRIA and University Lille, France)
- Prof. Enrico Franconi (Free University of Bozen-Bolzano, Italy)
Research Interests
My current research is focused on similarity of hierarchical data with an emphasis on ordered trees. I am devoted to developing efficient and highly applicable solutions for comparing tree structures in the context of tree-to-tree matching and similarity join queries. I am particularly interested in scalable algorithms for computing minimal and meaningful edit mappings between trees.
Projects
Tree Edit Distance
Tree Edit Distance - Reference website for measuring similarity of tree-structured data using the tree edit distance measure. Includes runnable code and source code of the RTED algorithm - the most efficient tree edit distance algorithm.
Publications
Mateusz Pawlik and Nikolaus Augsten. Tree edit distance: Robust and memory-efficient. Information Systems. 2016.
M. Pawlik, N. Augsten. Efficient Computation of the Tree Edit Distance. In ACM Transactions on Database Systems (TODS). 2015.
M. Pawlik and N. Augsten. A Memory-Efficient Tree Edit Distance Algorithm. In International Conference on Database and Expert Systems Applications (DEXA). 2014.
M. Pawlik and N. Augsten. RTED: a robust algorithm for the tree edit distance. In Proceedings of the VLDB Endowment (PVLDB). 2011.
Teaching
University of Salzburg
Datenbanken Vertiefung - Labs. Winter Semester 2016/2017 Datenbanken 2 - Labs. Winter Semester 2016/2017 Datenbanken 1 - Labs. Summer Semester 2015/2016 Datenbanken Vertiefung - Labs. Winter Semester 2015/2016