Welcome to the Database Research Group

The Database Research Group is part of the Department of Computer Sciences at the University of Salzburg, Austria. Our research interests include data-centric applications in database and information systems with a particular focus on similarity search queries over large data collections, for example, approximate matching of strings and trees, efficient indexes for distance computations, and top-k queries. Other fields of research include load balancing algorithms for distributed frameworks like MapReduce and queries in geographic information systems. The research results are new algorithms with performance guarantees, which are implemented and evaluated on the motivating application.

Nikolaus Augsten
Head of the Database Research Group

News

ACM SIGMOD Reproducibility Badge
11.05.2020
Our paper "A Scalable Index for Top-k Subtree Similarity Queries" (SIGMOD 2019) has been awarded the ACM Results Replicated label, which indicates that "the experimental results of the paper were replicated by the committee and were found to support the central results reported in the paper". All relevant source code and data will soon be available from ACM DL.
Paper at BMC Bioinformatics
21.04.2020
In an interdisciplinary project with the Department of Biosciences we have developed DeSignate, a tool for the identification of molecular characters for taxon diagnoses. DeSignate is freely available as a web application and open source. The resulting paper was recently published in the BMC Bioinformatics Journal.
Data Science for Databases: Paper at SIGMOD 2020
April 15, 2020
Our paper A Relational Matrix Algebra and its Implementation in a Column Store (joint work with researchers from the University of Zurich) was accepted for publication at SIGMOD 2020. The paper proposes an extension of SQL for linear algebra operations. The extension was implemented (github project) in the main memory database MonetDB and was shown to outperform solutions based on R and Python/NumPy.
"Salzburger Nachrichten" reports about our research success
27.12.2019
Salzburger Nachrichten published an article on our recent results on tree similarity queries. The work discussed in this article was presented at ICDE 2020 and SIGMOD 2020. Congratulations to Thomas Hütter, Daniel Kocher, and Mateusz Pawlik, the main contributors to this work.
Leibniz Prize 2020 for Database Systems research
06.12.2019
Thomas Neumann, professor in database systems at TU Munich, receives the Gottfried Wilhelm Leibniz Prize 2020 for his outstanding and influential work on main memory database systems. The Leibniz Prize is among the most prestigious and highest endowed research prizes in Germany. This is a great success and honors for the field of database systems. Congratulations, Thomas!
Top research rating for our Computer Science Department, Salzburg
23.09.2019
In the newest U-Multirank our department has been ranked highest in research among all participating universities. In German-speaking countries, we're leading in top cited publications and interdisciplinary publications, and our citation rate is ranked third. A press release can be found on our university's website.
Thomas Hütter wins Young Investigators Award
06.06.2019
Our two PhD students, Thomas Hütter and Daniel Kocher, were finalists for the Young Investigators Award 2019 at the University of Salzburg. Thomas won the 1st price for his work "Effective Filters and Linear Time Verification for Tree Similarity Joins".
Paper at SIGMOD 2019
11.03.2019
Our paper "A Scalable Index for Top-k Subtree Similarity Queries" got accepted at the ACM Special Interest Group on Management of Data (SIGMOD) 2019.
Paper at ICDE 2019
08.03.2019
Our paper "Effective Filters and Linear Time Verification for Tree Similarity Joins" got accepted at the IEEE International Conference on Data Engineering (ICDE) 2019.
Paper at VLDB 2018
18.06.2018
Our paper Set Similarity Joins on MapReduce: An Experimental Survey (joint work with researchers from Berlin and Mainz) got accepted at the Very Large Data Bases Conference (VLDB) 2018.
Paper at SISAP 2017
13.10.2017
Our paper "A New Perspective on the Tree Edit Distance" by Stefan Schwarz, Mateusz Pawlik, and Nikolaus Augsten has been published and presented in Munich at SISAP 2017 conference. You can read it [HERE].
Invited Talk - Austrian Computer Science Day
20.06.2017
Nikolaus Augsten presented an invited talk "Effiziente Techniken für Ähnlichkeitsabfragen in hierarchischen Daten" at ACSD 2017 / IMAGINE 2017 in Vienna. The slides are available for download.
Informatiker der Woche
01.06.2017
Nikolaus Augsten interviewed as "Informatiker der Woche" (computer scientist of the week). Find the full interview [HERE].
Kurt-Zopf Award for Best Paper
03.05.2017
Our TODS paper on the efficient computation of the tree edit distance received the Kurt-Zopf-Förderpreis awarded by University of Salzburg to the best journal paper 2015.
New project funded
12.2016
Our research project "FFTED - Fast and Flexible Tree Edit Distance" has been funded by Austrian Science Fund (FWF). Find more details [HERE].