Publicación: CQA-WF: CONSISTENT QUERY ANSWERS TO CONJUNCTIVE QUERIES USING THE WELL-FOUNDED SEMANTICS
Fecha
2012
Título de la revista
ISSN de la revista
Título del volumen
Editor
30TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY
Resumen
A DATABASE INSTANCE CAN BECOME INCONSISTENT WITH RESPECT TO ITS INTEGRITY CONSTRAINTS (ICS), FOR INSTANCE, AFTER UPDATE OPERATIONS. WHEN THIS HAPPENS, IT IS POSSIBLE TO COMPUTE THE REPAIRS OF THE DATABASE. A MINIMAL REPAIR IS A NEW DATABASE INSTANCE THAT SATISFIES THE ICS, IS OBTAINED BY APPLYING UPDATE OPERATIONS OVER THE ORIGINAL INSTANCE, AND DIFFERS MINIMALLY FROM THE ORIGINAL INSTANCE. WE CAN EVALUATE QUERIES OVER THE REPAIRS, AN ANSWER TO A CONJUNCTIVE QUERY IS CONSISTENT IF IT IS AN ANSWER IN EVERY REPAIR. THE REPAIRS OF DATABASE INSTANCES CAN BE SPECIFIED BY REPAIR PROGRAMS. MOREOVER, WE CAN COMPUTE CONSISTENT ANSWERS TO QUERIES BY EVALUATING QUERY PROGRAMS TOGETHER WITH THE REPAIR PROGRAMS UNDER THE STABLE MODEL SEMANTICS. THE USE OF LOGIC PROGRAMS DOES NOT EXCEED THE INTRINSIC COMPLEXITY OF CONSISTENT QUERY ANSWERING. NEVERTHELESS, FOR A CERTAIN CLASS OF CONJUNCTIVE QUERIES AND ICS IT IS POSSIBLE TO USE THE ALTERNATIVE WELL-FOUNDED SEMANTICS (WFS) TO EVALUATE QUERIES. WE PRESENT CQA-WF, A SYSTEM THAT ALLOWS THE COMPUTATION OF CONSISTENT ANSWERS TO CONJUNCTIVE QUERIES OVER INCONSISTENT DATABASES WITH RESPECT TO FUNCTIONAL DEPENDENCIES (FDS). CQA-WF EVALUATES LOGIC PROGRAMS UNDER THE WFS. THE WFS HAS LOWER DATA COMPLEXITY THAN THE STABLE MODELS SEMANTICS.
