Mateusz Pawlik

Mateusz Pawlik

Senior Scientist

PLUS Faculty of Natural and Life Sciences

Department of Psychology

My research journey started during my Erasmus 2006/2007 when I visited Free University of Bozen-Bolzano, Italy. I did an internship under the supervision of Prof. Johann Gamper and worked on the 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 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), and 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.


Tree Edit Distance - reference website to measuring similarity of tree structured data using the tree edit distance measure. The runnable and source code of the RTED algorithm - most efficient tree edit distance algorithm.


University of Salzburg

Free University of Bozen-Bolzano



Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning
Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S.Jensen
Information Systems Frontiers


An Efficient Index for Reachability Queries in Public Transport Networks
Mateusz Pawlik, Nikolaus Augsten, Christian S.Jensen, Michael H.Böhlen, Bezaye Tesfaye
Advances in Databases and Information Systems
Minimal Edit-Based Diffs for Large Trees
Mateusz Pawlik, Nikolaus Augsten
Proceedings of the ACM International Conference on Information and Knowledge Management


A Link is not Enough - Reproducibility of Data
Mateusz Pawlik, Thomas Hütter, Daniel Kocher, Willi Mann, Nikolaus Augsten
Effective Filters and Linear Time Verification for Tree Similarity Joins
Thomas Hütter, Mateusz Pawlik, Robert Loschinger, Nikolaus Augsten
35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019


A New Perspective on the Tree Edit Distance
Stefan Schwarz, Mateusz Pawlik, Nikolaus Augsten
Similarity Search and Applications


Tree edit distance: Robust and memory-efficient
Mateusz Pawlik, Nikolaus Augsten
Information Systems


Efficient Computation of the Tree Edit Distance
Mateusz Pawlik, Nikolaus Augsten
ACM Transactions on Database Systems


A Memory-Efficient Tree Edit Distance Algorithm
Mateusz Pawlik, Nikolaus Augsten
Database and Expert Systems Applications


RTED: A robust algorithm for the tree edit distance.
Mateusz Pawlik, Nikolaus Augsten
Proceedings of the VLDB Endowment