<div class="csl-bib-body">
<div class="csl-entry">Merkl, T. C., Pichler, R., & Skritek, S. (2023). Diversity of Answers to Conjunctive Queries (extended Abstract). In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), <i>Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023)</i>. https://doi.org/10.34726/5393</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/192932
-
dc.identifier.uri
https://doi.org/10.34726/5393
-
dc.description.abstract
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.
en
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.language.iso
en
-
dc.relation.ispartofseries
CEUR Workshop Proceedings
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Conjunctive Queries
en
dc.subject
Diversity
en
dc.subject
Query Answering
en
dc.subject
Complexity
en
dc.subject
Algorithms
en
dc.subject
Diversity of Solutions
en
dc.title
Diversity of Answers to Conjunctive Queries (extended Abstract)
