@inproceedings{Grahne1987EfficientEF, title={Efficient Evaluation for a Subset of Recursive Queries}, author={G{\"o}sta Grahne and Seppo Sippu and Eljas Soisalon-Soininen}, booktitle={PODS}, year={1987} }

- Published 1987 in PODS
DOI:10.1145/28659.28690

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.

Highly Cited

This paper has 22 citations. REVIEW CITATIONS

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=28690.