Oliver Irwin

Bâtiment B, Bureau B213

Inria, Avenue Halley

59650 Villeneuve d'Ascq

I am currently a PhD candidate in Computer Science at the University of Lille, in the LINKS team. I mainly work with Florent Capelli and Sylvain Salvati on knowledge compilation and query evaluation problems in databases.

I also explore the design of algorithms for worst-case optimal join operations and probabilistic data sampling, aiming to tackle fundamental challenges in handling large datasets.

One of the main research directions of this thesis has also been to try improving on the readability and simplicity of the algorithmic tools and proofs in these areas. I am also interested in extending my current results on direct access and optimal joining to dynamic databases.

My PhD is part of the KCODA project, that is funded by the French ANR. The aim of this project is to explore new methods for optimisation and learning problems over large datasets.

If you like ducks (and automata), you can also have a look at Charles Paperman

selected publications

ICDT

A Simple Algorithm for Worst Case Optimal Join and Sampling

Florent Capelli, Oliver Irwin, and Sylvain Salvati

In 28th International Conference on Database Theory (ICDT 2025), March 25 to March 28, 2025, Barcelona, Spain, Mar 2025

Bib PDF Details

@inproceedings{capelli2025sawcojs,
  author = {Capelli, Florent and Irwin, Oliver and Salvati, Sylvain},
  title = {{A Simple Algorithm for Worst Case Optimal Join and Sampling}},
  booktitle = {28th International Conference on Database Theory (ICDT 2025), March 25 to March 28, 2025, Barcelona, Spain},
  pages = {23:1--23:19},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  isbn = {978-3-95977-364-5},
  issn = {1868-8969},
  year = {2025},
  month = mar,
  volume = {328},
  editor = {Roy, Sudeepa and Kara, Ahmet},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address = {Dagstuhl, Germany},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.23},
  urn = {urn:nbn:de:0030-drops-229647},
  doi = {10.4230/LIPIcs.ICDT.2025.23},
  annote = {Keywords: join queries, worst-case optimality, uniform sampling},
  details = {wcojs},
}

ICDT

Direct Access for Conjunctive Queries with Negations

Florent Capelli, and Oliver Irwin

In 27th International Conference on Database Theory, ICDT 2024, March 24 to March 28, 2024, Paestum, Italy, Mar 2024

Awarded Bib PDF Details

Best Newcomer Paper

@inproceedings{capelli2024dacqn,
  title = {Direct {{Access}} for {{Conjunctive Queries}} with {{Negations}}},
  author = {Capelli, Florent and Irwin, Oliver},
  editor = {Cormode, Graham and Shekelyan, Michael},
  year = {2024},
  month = mar,
  pages = {13:1--13:20},
  issn = {1868-8969},
  booktitle = {27th International Conference on Database Theory, {ICDT} 2024, March
                24 to March 28, 2024, Paestum, {Italy}},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  url = {https://doi.org/10.4230/LIPICS.ICDT.2024.13},
  doi = {10.4230/LIPICS.ICDT.2024.13},
  isbn = {9783959773126},
  langid = {english},
  keywords = {Conjunctive queries,direct access,factorized databases,hypertree decomposition,Information systems → Relational database model},
  details = {dacqn}
}