Efficient evaluation for a subset of recursive queries
Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen · 1987
Well-known results on graph traversal are used to develop a practical, efficient algorithm for evaluating regularly and linearly recursive queries in databases that contain only binary relations. Transformations are given that reduce a subset of regular and linear queries involving n-ary relations (n > 2) to queries involving only binary relations.