Our paper “SeDA: Bridging the Gap between Efficient Syntactic and Precise Semantic Search of Similar Passages in Large Text Corpora” has been accepted at the International Conference on Very Large Data Bases (VLDB) 2026.

Our Ph.D. student Daniel Ulrich Schmitt received the Young Investigators Award 2025 at the Faculty of Digital and Analytical Sciences at the University of Salzburg. Daniel won the 1st price for his work “Efficient, Extensible, and Robust Similarity Queries” and more information can be found here.

Our paper “Extensible and Robust Evaluation of Similarity Queries” has been accepted at the International Conference on Very Large Data Bases (VLDB) 2025.

Our paper “Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite” has been accepted at the Extended Semantic Web Conference (ESWC) 2025.

Our paper “Open benchmark for filtering techniques in entity resolution” has been published at The VLDB Journal (Springer).

Our paper “Scalable Distributed Inverted List Indexes in Disaggregated Memory” has been accepted at the ACM International Conference on Management of Data (SIGMOD) 2024.

Our paper “A Two-Level Signature Scheme for Stable Set Similarity Joins” has been accepted at the International Conference on Very Large Data Bases (VLDB) 2023.

The reproducibility package of our paper “JEDI: These aren’t the JSON documents you’re looking for…” won the “Best Artifact Award” at the ACM International Conference on Management of Data (SIGMOD) 2023.

Our paper “Feedforward-Aided Course Designs for Similarity Search” has been accepted at the International Workshop on Data Systems Education (DataEd) 2023.

Our paper “Benchmarking the Utility of w-event Differential Privacy Mechanisms - When Baselines Become Mighty Competitors” has been accepted at the International Conference on Very Large Data Bases (VLDB) 2023.

Our paper “FINEX: A Fast Index for Exact & Flexible Density-Based Clustering” has been accepted at the ACM International Conference on Management of Data (SIGMOD) 2023.

Our papers “MetricJoin: Leveraging Metric Properties for Robust Exact Set Similarity Joins”, “Benchmarking Filtering Techniques for Entity Resolution”, and “KOIOS: Top-k Semantic Overlap Set Search” have been accepted at the IEEE International Conference on Data Engineering (ICDE) 2023.

Thomas Hütter talks about our JSON Edit Distance (JEDI) on Jack Waudby’s Disseminate Podcast.

Thomas Hütter presents his work on JSON similarity queries at the Austrian Computer Science Day (ACSD) 2022.

A pre-recorded video of the presentation of our SIGMOD paper “JEDI: These aren’t the JSON documents you’re looking for…” can be found here.

Our paper on ensuring differential privacy on streams titled “Swellfish privacy: Supporting time-dependent relevance for continuous differential privacy” has been accepted for Information Systems.

Nikolaus Augsten is on sabbatical leave until September 2022. During this time, Martin Schäler leads the Database Group including all associated facilities.

Our paper on similarity queries for JSON documents with the title “JEDI: These aren’t the JSON documents you’re looking for…” has been accepted at the ACM International Conference on Management of Data (SIGMOD) 2022.

Our research project “BOSS 1.0: Biblical Online Synopsis Salzburg 1.0” has been funded by the Federal State of Salzburg.

Our research project “DESQ - Declarative and Efficient Similarity Queries” has been funded by the Austrian Science Fund (FWF). Find more details here.

Our co-authored paper “An Investigation of Atomic Synchronization for Sort-Based Group-By Aggregation on GPUs” got accepted at the Joint International Workshop on Big Data Management on Emerging Hardware and Data Management on Virtualized Active Systems (HardBD@ICDE2021). Our co-authored paper “Accurate Cardinality Estimation of Co-occurring Words Using Suffix Trees” got accepted at the International Conference on Database Systems for Advanced Applications (DASFAA) 2021.

The research of our colleague Martin Schäler in the ESQUIRE project on privacy-preserving data analysis was mentioned in a newspaper article in Süddeutsche Zeitung.

Our paper An Efficient Index for Reachability Queries in Public Transport Networks was invited as one of the best papers of ADBIS 2020 to a special issue of Information Systems Frontiers (Springer).

Congratulations to Sebastian Forster (Efficient Algorithms Group) for being awarded the prestigious ERC Starting Grant for his project “Dynamic Algorithms Against Strong Adversaries” (DynASoAr).

Our paper “Minimal Edit-Based Diffs for Large Trees” has been accepted at the ACM International Conference on Information and Knowledge Management (CIKM) 2020.

Our paper “An Efficient Index for Reachability Queries in Public Transport Networks” got accepted at the European Conference on Advances in Databases and Information Systems (ADBIS) 2020.

Our paper “DeSignate: detecting signature characters in gene sequence alignments for taxon diagnoses” (BMC Bioinformatics 2020) has been awarded as Publication of the Month May by the Department of Biosciences, University of Salzburg.

Our paper “A Scalable Index for Top-k Subtree Similarity Queries” (SIGMOD 2019) has been awarded the ACM Results Replicated label.

In an interdisciplinary project with the Department of Biosciences we have developed DeSignate, a tool for the identification of molecular characters for taxon diagnoses. The resulting paper was recently published in the BMC Bioinformatics Journal.

Our paper A Relational Matrix Algebra and its Implementation in a Column Store was accepted for publication at SIGMOD 2020.

Salzburger Nachrichten published an article on our recent results on tree similarity queries.

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.

In the newest U-Multirank our department has been ranked highest in research among all participating universities. A press release can be found on our university’s website.

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”.

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.

Our paper “Effective Filters and Linear Time Verification for Tree Similarity Joins” got accepted at the IEEE International Conference on Data Engineering (ICDE) 2019.

Our paper Set Similarity Joins on MapReduce: An Experimental Survey got accepted at the Very Large Data Bases Conference (VLDB) 2018.

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.

Nikolaus Augsten presented an invited talk “Effiziente Techniken für Ähnlichkeitsabfragen in hierarchischen Daten” at ACSD 2017 / IMAGINE 2017 in Vienna.

Nikolaus Augsten was interviewed as “Informatiker der Woche” (computer scientist of the week). Find the full interview here.

Our TODS paper on the efficient computation of the tree edit distance received the Kurt-Zopf-Förderpreis awarded by the University of Salzburg to the best journal paper 2015.

Our research project “FFTED - Fast and Flexible Tree Edit Distance” has been funded by the Austrian Science Fund (FWF). Find more details here.