Found this: The excellent Postgres documentation includes an SQL graph search with two different ways of graph cycle checking, here: http://www.postgresql.org/d

Found this: The excellent Postgres documentation includes an SQL graph search with two different ways of graph cycle checking, here: http://www.postgresql.org/docs/9.0/static/queries-with.html http://www.postgresql.org/docs/9.0/static/queries-with.html One way involves accumulating an array of nodes already visited as the tree gets walked, checking each node as-visited for membership in the array-to-date. The other method, a bit more of a hack, is just adding a LIMIT clause. I think the 'WITH' clause is a great addition to the SQL standard, very much worth the learning the weirdness of its syntax and its optional 'RECURSIVE' term (which, as the Postgres documentation points out, isn't really recursion, it's iteration).