1. Aho, A. V., Hopcroft, J. E., Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. Bancilhon, F., “Naive evaluation of recursively defined relations,” in On Knowledge Base Management Systems, (M. L. Brodie and J. Mylopoulos, eds.), Springer-Verlag, New York, 1986.
3. Bancilhon, F., Maier D., Sagiv, Y., Ullman, J. D., “Magic sets and other strange ways to implement logic programs,” Proc. 5th ACM Symp. on Prociples of Database Sytems, pp. 1–15, 1986.
4. Grahne, G., Sippu, S., Soisalon-Soininen, E., “Efficient evaluation for a subset of recursive queries,” Journal of Logic Programming, 10:301–332, 1991.
5. Harel, D., Tarjan, R.E., “Fast algorithms for finding nearest common ancestors,” SIAM J. Computing
13(2), pp 338–355, 1984.