Efficient evaluation for a subset of recursive queries

G. Grahne, S. Sippu, E. Soisalon-Soininen
1987 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '87  
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 lnvolvlng only binary relatloqs.
doi:10.1145/28659.28690 dblp:conf/pods/GrahneSS87 fatcat:7a7waqgxozcwxetol4zldqvjjy