A structural dichotomy classifies full conjunctive queries without self-joins as polynomial-time solvable or NP-hard for minimizing input deletions to eliminate k output tuples, with exact and approximation algorithms.
Given the full CQ Q containing p relations in its body, namely R1,R2,··· ,Rp , we create a set per input tuple in the p relations, and an element per output tuple in Q( D)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Generalized Deletion Propagation on Counting Conjunctive Query Answers
A structural dichotomy classifies full conjunctive queries without self-joins as polynomial-time solvable or NP-hard for minimizing input deletions to eliminate k output tuples, with exact and approximation algorithms.