Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Kaleb Alway, Eric Blais, and Semih Salihoglu. Box Covers and Domain Orderings for Beyond Worst-Case Join Processing. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 3:1-3:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{alway_et_al:LIPIcs.ICDT.2021.3, author = {Alway, Kaleb and Blais, Eric and Salihoglu, Semih}, title = {{Box Covers and Domain Orderings for Beyond Worst-Case Join Processing}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {3:1--3:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.3}, URN = {urn:nbn:de:0030-drops-137114}, doi = {10.4230/LIPIcs.ICDT.2021.3}, annote = {Keywords: Beyond worst-case join algorithms, Tetris, Box covers, Domain orderings} }
Feedback for Dagstuhl Publishing