Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Xiao Hu and Stavros Sintos. Finding Smallest Witnesses for Conjunctive Queries. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hu_et_al:LIPIcs.ICDT.2024.24, author = {Hu, Xiao and Sintos, Stavros}, title = {{Finding Smallest Witnesses for Conjunctive Queries}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.24}, URN = {urn:nbn:de:0030-drops-198066}, doi = {10.4230/LIPIcs.ICDT.2024.24}, annote = {Keywords: conjunctive query, smallest witness, head-cluster, head-domination} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, and Jun Yang. Dynamic Enumeration of Similarity Joins. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{agarwal_et_al:LIPIcs.ICALP.2021.11, author = {Agarwal, Pankaj K. and Hu, Xiao and Sintos, Stavros and Yang, Jun}, title = {{Dynamic Enumeration of Similarity Joins}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.11}, URN = {urn:nbn:de:0030-drops-140803}, doi = {10.4230/LIPIcs.ICALP.2021.11}, annote = {Keywords: dynamic enumeration, similarity joins, worst-case delay guarantee} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Shaleen Deep, Xiao Hu, and Paraschos Koutris. Enumeration Algorithms for Conjunctive Queries with Projection. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deep_et_al:LIPIcs.ICDT.2021.14, author = {Deep, Shaleen and Hu, Xiao and Koutris, Paraschos}, title = {{Enumeration Algorithms for Conjunctive Queries with Projection}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {14:1--14:17}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.14}, URN = {urn:nbn:de:0030-drops-137229}, doi = {10.4230/LIPIcs.ICDT.2021.14}, annote = {Keywords: Query result enumeration, joins, ranking} }
Feedback for Dagstuhl Publishing