Can Datalog Be Approximated?
β
Surajit Chaudhuri; Phokion G. Kolaitis
π
Article
π
1997
π
Elsevier Science
π
English
β 452 KB
In this paper, we investigate whether recursive Datalog predicates can be approximated by finite unions of conjunctive queries. We introduce a quantitative notion of error and examine two types of approximation, namely, absolute approximation and relative approximation. We also stipulate that the ap