BibTeX Export for A Simple Algorithm for Worst Case Optimal Join and Sampling

Copy to Clipboard Download

@InProceedings{capelli_et_al:LIPIcs.ICDT.2025.23,
  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)},
  pages =	{23:1--23:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-364-5},
  ISSN =	{1868-8969},
  year =	{2025},
  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}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode