eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-03-17
10:1
10:19
10.4230/LIPIcs.ICDT.2023.10
article
Diversity of Answers to Conjunctive Queries
Merkl, Timo Camillo
1
Pichler, Reinhard
1
Skritek, Sebastian
1
TU Wien, Austria
Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may be prohibitively expensive if it is too big. In this case, outputting a small, sufficiently diverse subset of the solutions would be preferable. This leads to the Diverse-version of the original enumeration problem, where the goal is to achieve a certain level d of diversity by selecting k solutions. In this paper, we look at the Diverse-version of the query answering problem for Conjunctive Queries and extensions thereof. That is, we study the problem if it is possible to achieve a certain level d of diversity by selecting k answers to the given query and, in the positive case, to actually compute such k answers.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol255-icdt2023/LIPIcs.ICDT.2023.10/LIPIcs.ICDT.2023.10.pdf
Query Answering
Diversity of Solutions
Complexity
Algorithms