Our paper "Factorized Representations of
Query Results: Size Bounds and Readability" (by Dan Olteanu and Jakub Závodný) received the ICDT 2022 Test
of Time Award. This award recognizes a paper presented 10 years prior at the ICDT conference
that has best met the "test of time" and had the highest impact in terms of research, methodology,
conceptual contribution, or transfer to practice over the past decade.
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.
Gabriel-Robert Inelus was awarded Microsoft Prize for best 4th-year
Computer Science project 2019. His project investigates factorised learning of low-rank models
(so-called quadratically regularised principal component analysis) over multi-relational databases. [
pdf
]
Radu-Bogdan Berteanu received the Microsoft Prize for best 4th-year
Computer Science Project. His project tackles the problem of computing covers, which are succinct,
lossless, relational representations for query results in relational databases.
Pierre-Yves Bigourdan was awarded the Hoare Prize for best MSc in CS
project 2016. His project investigates the problem
of many-core and distributed regression learning over factorised joins.
Maximilian Schleich received the honourable mention (2nd place out of 17
submissions) from Vienna Centre for Logic
and Algorithms (VCLA) International Student Awards for Outstanding Master Thesis.
Maximilian Schleich was awarded the Hoare Prize for best MSc in CS
project 2015. His project investigates the problem
of learning linear regression models over factorised joins.
Tomáš Kočiský was awarded the Gloucester Research Project Prize for best
4th year Maths&CS project 2012. His
project investigates the evaluation problem for queries with ORDER-BY and GROUP-BY clauses on
factorised
databases.