Welcome to DiSC 2003
SIGMOD 2002
PODS 2002
= PODS'02 Website
= SIGMOD/PODS'02 Plena
<<< = PODS'02 Papers>>>
= Invited Talks
= Tutorials
SIGMOD RECORD 2002
ADBIS 2002
CIKM 2002
CoopIS 2002
EDBT 2002
ER 2002
Data Engineering Bul
DEXA_EC-WEB 2002
DMKD 2002
DPDJ 2002
HYPERTEXT 2002
ICDE 2002
ICDM 2002
JCDL 2002
KDD 2002
KDD_EXPLORATIONS 20
KRDB 2002
MDM 2002
MIS 2002
RIDE 2002
SBBD 2002
SIGIR 2002
SIGIR FORUM 2002
SSDBM 2002
TODS 2002
TIME 2002
VLDB 2002
VLDBJ 2002

Knowledge Compilation = Query Rewriting + View Synthesis


Marco Cadoli and Toni Mancini

  View Paper (PDF)  

Return to Queries and Views


Abstract

In Knowledge Compilation (KC) an intractable deduction problem KB ? f is split into two phases: 1) KB is preprocessed, thus obtaining a data structure DKB; 2) the problem is efficiently solved using DKB and f. Our goal is to study KC in the context of relational databases: Both KB and f are represented as databases, and '?' is represented as a query Q in second-order logic. DKB is a database, to be synthesized from KB by means of an appropriate view. Q is rewritten, thus obtaining Qr. We show syntactic restrictions on Q implying that a polynomial-size DKB and a first-order Qr exist, which imply that phase 2 can be done in polynomial time. We also present classes of queries (in some sense complementary to the former ones) for which either no polynomial-size DKB or no first-order Qr exist (unless the PH collapses). Compilation to other complexity classes is also addressed.


DiSC'03 © 2003 Association for Computing Machinery