> Infinite self-joins are not elegant in relational algebra. Somewhat ironic comment given the name of this site. SQL stinks as a language in many ways, won’t

> Infinite self-joins are not elegant in relational algebra. Somewhat ironic comment given the name of this site. SQL stinks as a language in many ways, won’t argue there. However for many cases even PostgreSQL does just fine with recursive CTEs (though granted when it fails it does so hard). Oracle does better (and CONNECT BY has been around for over 40 years - someone’s been getting by with it). Graphs in RDBMSes are not uncommon. Anyway, none of this has anything to do with the original claim. Are graph db implementations useful? Definitely (though often times sticking with the rdbms is the better choice). But they get their utility by being less flexible.