Gabriel-Robert Inelus was awarded the 2019 Microsoft Prize for best 4th-year Computer Science project at the University of Oxford. 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 2018 Microsoft Prize for best 4th-year Computer Science Project at the University of Oxford. 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 2016 Hoare Prize for best MSc in CS project at the University of Oxford. His project investigates the problem of many-core and distributed regression learning over factorised joins.
Maximilian Schleich received the honourable mention (2nd place) from Vienna Centre for Logic and Algorithms (VCLA) International Student Awards for Outstanding Master Thesis in 2016.
Maximilian Schleich was awarded the 2015 Hoare Prize for best MSc in CS project at the University of Oxford. His project investigates the problem of learning linear regression models over factorised joins.
Lo Po Tsui received the 2013 Hoare prize for best overall MSc in CS performance at the University of Oxford.
Laura Draghici was awarded the 2013 Hoare Prize for best MSc in CS project at the University of Oxford. Her project investigates the problem of updates in factorised databases.
Tomáš Kočiský was awarded the 2012 Gloucester Research Project Prize for best 4th year Maths&CS project at the University of Oxford. His project investigates the evaluation problem for queries with ORDER-BY and GROUP-BY clauses on factorised databases.
Quentin Spencer-Harper was ranked 1st in undergraduate CS and received the 2012 Gloucester Research Prize for best 3rd year CS project at the University of Oxford. His project was on the design and implementation of a query engine for probabilistic databases.
Larisa Han received the 2011 Hoare prize for best MSc in CS project at the University of Oxford. Her thesis investigated the problem of efficient inference for queries with aggregates in probabilistic databases using knowledge compilation.
Narayan Kamath received the 2010 Hoare prize for best overall MSc in CS performance at the University of Oxford.
Rasmus Wissmann received the 2009 Hoare prize for best overall MSc in CS performance at the University of Oxford.
Jiewen Huang received the 2008 Hoare prize for best overall MSc in CS performance at the University of Oxford.
Jiewen Huang received the 2008 Hoare prize for best MSc in CS project at the University of Oxford. His thesis investigated the problem of efficient inference for conjunctive queries with inequalities in probabilistic databases using knowledge compilation.
Our paper
Counting Triangles under Updates in
Worst-Case Optimal Time
received the best paper award at the International Conference on Database Theory (ICDT) 2019. The paper introduces the first fully dynamic worst-case optinal algorithm for counting triangles in graphs.
Special Journal Issues of Best-of-Conferences
Article Conjunctive Queries with Free Access Patterns Under Updates invited to Logical Methods in Computer Science (LMCS) special issue of best papers at International Conference on Database Theory (ICDT) 2023.
Article Functional collection programming with semi-ring dictionaries inved to Journal of Functional Programming (JFP) special issue of best papers at Object-oriented Programming, Systems, Languages, and Applications (OOPSLA) 2022.
Article Maintaining Triangle Queries under Updates invited to ACM Transactions on Database Systems (TODS) special issue of best papers at International Conference on Database Theory (ICDT) 2019
Article Declarative Probabilistic Programming with Datalog invited to ACM Transactions on Database Systems (TODS) special issue of best papers at International Conference on Database Theory (ICDT) 2016
