Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science S. 550 - 559
1. Verfasser: Fontaine, Gaelle
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2013
Schlagworte:
Complexity theory
Computer science
Data integration
Educational institutions
Maintenance engineering
Polynomials
ISBN:1479904139, 9781479904136
ISSN:1043-6871
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent query answering under various classes of constraints. It is known that for the most common constraints and queries, the problem is in CONP and might be CONP-hard, yet several relevant tractable classes have been identified. Additionally, the results that emerged suggested that given a set of key constraints and a conjunctive query, the problem of consistent query answering is either in PTIME or is CONP-complete. However, despite all the work, as of today this dichotomy remains a conjecture. The main contribution of this paper is to explain why it appears so difficult to obtain a dichotomy result in the setting of consistent query answering. Namely, we prove that such a dichotomy w.r.t. common classes of constraints and queries, is harder to achieve than a dichotomy for the constraint satisfaction problem, which is a famous open problem since the 1990s.
AbstractList A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent query answering under various classes of constraints. It is known that for the most common constraints and queries, the problem is in CONP and might be CONP-hard, yet several relevant tractable classes have been identified. Additionally, the results that emerged suggested that given a set of key constraints and a conjunctive query, the problem of consistent query answering is either in PTIME or is CONP-complete. However, despite all the work, as of today this dichotomy remains a conjecture. The main contribution of this paper is to explain why it appears so difficult to obtain a dichotomy result in the setting of consistent query answering. Namely, we prove that such a dichotomy w.r.t. common classes of constraints and queries, is harder to achieve than a dichotomy for the constraint satisfaction problem, which is a famous open problem since the 1990s.
Author Fontaine, Gaelle
Author_xml – sequence: 1
  givenname: Gaelle
  surname: Fontaine
  fullname: Fontaine, Gaelle
  email: gaelle@dcc.uchile.cl
  organization: Dept. of Comput. Sci., Univ. of Chile, Santiago, Chile
BookMark eNotzMFOwyAYAGASZ-I6vXnzwgu08pdC4WSWTt2SJotR43EBCg7jwADG9O096Om7fRVahBgsQtdAGgAib8fd8Ny0BGjD2zNUQddLSTqgcoGWQDpac9HDBapy_iCEtLwjS7R5O87YZ-wL3qo04RLxXhflA1Z4480xlniasYsJDzFkn4sNBT992zTjdcg_NvnwfneJzp36zPbq3xV6fbh_Gbb1uH_cDeuxVm0HpTbUaUsYV1RM0FqYmJDaMCqcFIJMzklDhGRM9dJIpik1gmprNICSvXGcrtDN3-uttYev5E8qzQfOemBC0F-xHEqN
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2013.62
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 559
ExternalDocumentID 6571588
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a241t-c3fbe056a38d12e1d589bc538f9880dff9c08955a79c95b33c83becb11a97cf63
IEDL.DBID RIE
ISBN 1479904139
9781479904136
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000326815000061&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 04:17:07 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a241t-c3fbe056a38d12e1d589bc538f9880dff9c08955a79c95b33c83becb11a97cf63
PageCount 10
ParticipantIDs ieee_primary_6571588
PublicationCentury 2000
PublicationDate 2013-June
PublicationDateYYYYMMDD 2013-06-01
PublicationDate_xml – month: 06
  year: 2013
  text: 2013-June
PublicationDecade 2010
PublicationTitle 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev lics
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0001035133
Score 1.9447365
Snippet A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to...
SourceID ieee
SourceType Publisher
StartPage 550
SubjectTerms Complexity theory
Computer science
Data integration
Educational institutions
Maintenance engineering
Polynomials
Title Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
URI https://ieeexplore.ieee.org/document/6571588
WOSCitedRecordID wos000326815000061&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED21FQNTgRbxLQ-MuE3iOLYnhFoqkFApAkS3ynFs0YEEtSmo_x7bTVsGFjbHU-SPu_PdvfcALmNutAioxIFkBseRirGMFcc2Flc6iqVTmvRiE2w45OOxGNXgaoOF0Vr75jPdcUNfy88KtXCpsm5CWUg5r0OdMbbCam3zKa4kRrZW2Dr6iomA4MS-Cjyoi1nba622WHM9Vd_JpiNedB_ue8-u44t0nIDOL8UV73AGzf_96h60t8g9NNr4pH2o6fwAmmvpBlTd5Bb0396XaDpH0xK52j0qC_SYuiwBkqg_dbis4mOJbECLvKKnPQp5iZ4WerZEN_n82_MXXrfhdXD70rvDlaACltZRl1gRk2ob8UjCszDSYUa5SJU1eUbYa5wZI1TABaWSCSVoSojixO5xGoZSMGUScgiNvMj1ESDhYgvDReK4hbOYy4wxHSUmSCLNDQ2OoeUWZfK54syYVOtx8vf0KexGK5kJHIRn0ChnC30OO-qrnM5nF36jfwCF-KEA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4QTfSECsbf9uDRwraua3syBiQQETFi5Ea6ro07OAwMDf-9bRngwYu3rqelP957fe993wfAdci04h4RyBNUozCQIRKhZMjE4lIFobBKk05sgvb7bDTigxK4WWNhlFKu-UzV7dDV8pOJnNtUWSMi1CeMbYFtEoaBv0RrbTIqtiiGN3bYuPqCiwCjyLwLHKyLGutr7DZfsT0V39G6J543et3mi-35wnUrofNLc8W5nHblfz-7D2ob7B4crL3SASip7BBUVuINsLjLVdB6e1_AdAbTHNrqPcwn8Cm2eQIoYCu1yKzJxwKakBY6TU9zGLIcPs_VdAHvstm3YzC8rYHX9v2w2UGFpAISxlXnSGIdKxPzCMwSP1B-QhiPpTF6mpuLnGjNpcc4IYJyyUmMsWTY7HLs-4JTqSN8BMrZJFPHAHIbXWjGI8sunIRMJJSqINJeFCimiXcCqnZRxp9L1oxxsR6nf09fgd3O8LE37nX7D2dgL1iKTiDPPwflfDpXF2BHfuXpbHrpNv0HHiKkRw
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%3Abook&rft.genre=proceeding&rft.title=2013+28th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Why+is+it+Hard+to+Obtain+a+Dichotomy+for+Consistent+Query+Answering%3F&rft.au=Fontaine%2C+Gaelle&rft.date=2013-06-01&rft.pub=IEEE&rft.isbn=9781479904136&rft.issn=1043-6871&rft.spage=550&rft.epage=559&rft_id=info:doi/10.1109%2FLICS.2013.62&rft.externalDocID=6571588
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon