Research positions (both PhD and postdoctoral) available in our research group! If you are intrigued by the kind of research we do, please consider applying. [ More Information ]
Maximilian Schleich was Highly Commended in the competition for the CPHC/BCS 2020 Distinguished Dissertation Award. Each year, BCS and the Conference of Professors and Heads of Computing (CPHC) award the best UK PhD/DPhil dissertations in computer science that stand out for their excellence.
Maximilian Schleich received an Honourable Mention for the 2021 SIGMOD Jim Gray Doctoral Dissertation Award for his DPhil dissertation entitled "Structure-Aware Learning over Multi-Relational Databases". The award recognizes excellent research by doctoral candidates in the database field.
LMFAO (Layered Multiple Functional Aggregate Optimisation) 1.0 is now released to the public. [ repository ]
The project moved from the University of Oxford to the University of Zurich along with the principal investigator and a few existing members of the team. Several current members continue to work at the University of Oxford, while other current members work at the University of Edinburgh.
Keynote on machine learning over relational data at VLDB 2020 in September 2020.
Our paper entitled Counting Triangles under Updates in Worst-Case Optimal Time received the best paper award at ICDT 2019 .
Keynote on machine learning over relational data at ICDT 2019 in Lisbon in March 2019.
This course gives a unifying overview of the latest research in efficient computation over structured data, with applications spanning databases, artificial intelligence and machine learning, algorithms, and linear algebra. Besides their theoretical interest, algorithms overviewed in this course represent a key differentiator for commercial database and relational AI engines and thus essential knowledge for the future data system engineer.
Topics: (1) Unifying language and computation for: databases, constraint satisfaction problems, satisfiability, probabilistic graphical models, linear algebra matrix computation, gradients and cost functions for machine learning; (2) Commutative semirings; (3) Functional Aggregate Queries; (4) Decompositions; (5) Width measures; (6) Solving joins optimally; (7) Worst-case optimal size bounds for joins; (8) Solving SAT; (9) Solving functional aggregate queriesRead More..
From Joins to Aggregates and Optimization Problems
The course introduces recent development on solving a host of computational problems in the database. The unifying theme underlying this development is the use of the structure of the problem to avoid redundancy in data representation and computation.Read More..
Research Projects ( 26-minute video overview )
We investigate trade-offs in static and dynamic evaluation of queries with arbitrary free variables. In the static setting, the trade-off is between the time to partially compute the query result and the delay needed to enumerate its tuples. In the dynamic setting, we additionally consider the time needed to update the query result under single-tuple inserts or deletes to the database.Read More..
Ahmet earned his PhD from the University of Dortmund in the area of Logics and Automata on data words and data trees and their applications in formal system verification. He contributes to the principles of factorized computation and its incremental maintenance.
Nadia completed a BA in Computer Science from the University of Minnesota - Twin Cities, followed by an MSc in Computer Science at the University of Oxford. She also worked as software engineer in industry, for three years before starting her MSc and then again three years before starting her PhD at UZH in February 2021.
Antonia earned her MSc in Computer Science and BSc in Computer Engineering and Informatics from University of Patras, Greece. She is a second year PhD student at the University of Oxford.
Dan earned his PhD from the University of Munich. He was a professor of Computer Science at the University of Oxford since 2007 before joining the University of Zurich in 2020. He is the head of the FDB project.
Nils earned his PhD from TU Dortmund University in 2019 on the topic of dynamic descriptive complexity theory. He joined the group in autumn 2020.
Haozhe earned his MSc in Computer Science from Oxford. He is currently a third year PhD student and contributes to incremental maintenance of analytical workloads.
Djordje Zivanovic earned his MSc in Electrical engineering and Computer Science and BSc in Electrical engineering from University of Belgrade, Serbia. He is a second year PhD student and contributes to in-database linear algebra.