@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},
    date-added = {2026-2-10 18:21:26 +0100}
}

@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}, date-added = {2026-2-10 18:21:26 +0100} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge