Diversity of Answers to Conjunctive Queries

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 preferabl...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 21, Issue 1
Main Authors: Merkl, Timo Camillo, Pichler, Reinhard, Skritek, Sebastian
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science e.V 01.01.2025
Subjects:
computer science - computational complexity
computer science - databases
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Pichler, Reinhard
Skritek, Sebastian
Merkl, Timo Camillo
Author_xml – sequence: 1
  givenname: Timo Camillo
  surname: Merkl
  fullname: Merkl, Timo Camillo
– sequence: 2
  givenname: Reinhard
  surname: Pichler
  fullname: Pichler, Reinhard
– sequence: 3
  givenname: Sebastian
  surname: Skritek
  fullname: Skritek, Sebastian
BookMark eNpNkE1LAzEQhoNUsNb-AG97VGQ1k2Tz4a20fhQKIug5pNmJbGk3kmyV_nu3rYhzeWfmhefwnJNBG1sk5BLorZDM6Lv1xueSwRXcm2tGWXVChqAlLSujxODffkbGOa9oP5yDZnJIbmbNF6bcdLsihmLS5u_-KrpYTGO72ra-6-vidYupwXxBToNbZxz_5oi8Pz68TZ_LxcvTfDpZlJ5T2ZWqUo4J7lQASp3xtQteO6QChDeINXpAFFiHZUCu3FI6rUVQqlZBeOkcH5H5kVtHt7Kfqdm4tLPRNfbwiOnDutQ1fo2W0VpWAQA0KCG9NEJQA6GqIGgBFfQsOLJ8ijknDH88oPYgz-7lWQYWrLF7efwHfS5kcA
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-21(1:9)2025
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_20d65f11181746c6944091f551f84151
10_46298_lmcs_21_1_9_2025
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c306t-757a243a7f100a9cdafc8ae0414c9eedec1ee4edfbfe37ab6a884f77d7f4c6aa3
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001410857700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:53:36 EDT 2025
Sat Nov 29 06:21:52 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c306t-757a243a7f100a9cdafc8ae0414c9eedec1ee4edfbfe37ab6a884f77d7f4c6aa3
OpenAccessLink https://doaj.org/article/20d65f11181746c6944091f551f84151
ParticipantIDs doaj_primary_oai_doaj_org_article_20d65f11181746c6944091f551f84151
crossref_primary_10_46298_lmcs_21_1_9_2025
PublicationCentury 2000
PublicationDate 2025-01-01
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – month: 01
  year: 2025
  text: 2025-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2025
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.3460228
Snippet Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - computational complexity
computer science - databases
Title Diversity of Answers to Conjunctive Queries
URI https://doaj.org/article/20d65f11181746c6944091f551f84151
Volume 21, Issue 1
WOSCitedRecordID wos001410857700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxcDCN6J8yQMDIFnEseMPtlK1YqECCaRuluPYEggS1LSM_HbOSYrKxMKSwYoi-51y715iv0PoXAelCu8oya1MCKc8I7lPGQlK5t5yJpM8aZpNyMlETaf6YaXVV9wT1toDt8CBOC9EFmg8Hym5cEJzUCQ0ANEHBeTTCB-oelbEVJODGYuFc_sbk4tUq-u3d1eTlF7QG30Jij_7RUQrfv0NsYy30WZXEeJBO5MdtObLXbS17LaAu5dvD0F26rZQ4CrgQVnH9mZ4XuFhVb4CO8W8hR8X0bi43kfP49HT8I50rQ6Ig5p9TmQmbcqZlYEmidWusMEp6xMAz2mgMUDTe-6LkAfPpM2FVYoHKQsZuBPWsgPUK6vSHyIsgkgTSHFcRXO9kNrAKKMBdFeiYwHSR1fLdZuP1tHCgBJoQDIRJJNSQ402EaQ-uo3I_NwYzaibAQiR6UJk_grR0X885BhtxAm1Xz9OUG8-W_hTtO4-5y_17KyJPlzvv0bfQ1uxYQ
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Diversity+of+Answers+to+Conjunctive+Queries&rft.jtitle=Logical+methods+in+computer+science&rft.au=Merkl%2C+Timo+Camillo&rft.au=Pichler%2C+Reinhard&rft.au=Skritek%2C+Sebastian&rft.date=2025-01-01&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=21%2C+Issue+1&rft_id=info:doi/10.46298%2Flmcs-21%281%3A9%292025&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_21_1_9_2025
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon