Deductive database development with optimization (Q2763601)

In order to find an answer to a query of the form \(W(x_1,\dots,x_n)\) the authors propose two steps: \(1^0\) using Naive or Semi-Naive or Henschen-Naqvi method construct the set \(S\) of derived relations; \(2^0\) translate \(S\) into \(SQL\) and by \(SQL\)-processor find the proper answer. However, is it practical to performe both such steps, in the case when \(S\) has a large number of elements?NEWLINENEWLINEFor the entire collection see [Zbl 0977.00022].