A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
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