Conclusions
Conjunctive query plans are insufficient to handle functional dependencies and limitations on binding patterns.
Recursive query plans can produce maximal sets of answers, even in the presence of functional dependencies and limitations on binding patterns.
Recursive query plans can be easily constructed in polynomial time.