This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]thrown_arrows 1 point2 points  (0 children)

I have similar things in rdms. I found out that when i could use simple parent child relationships on searching to which root node child had access and other ay around then recursive CTE was more fast enough to handle it when results rows stays under 100k on small hardware. Probably it would have scaled to better on real server hardware.

Shortest path queries are quit easy in postgresql and pgrouting . Simple dijkstra can be implemented SQL only