Skip to content

Comment on Ask HN: Implementing a graph database using Postgres tables for nodes and edges?

Comments

If directed acyclic is sufficient for your use case, you can use this approach, which has worked perfectly for me in the past: http://www.codeproject.com/Articles/22824/A-Model-to-Represe...

This is a really interesting approach, thanks! I have a relational-to-graph problem that can be done as a DAG, and I was planning on using Postgres as a source of truth and mirroring out the data to Neo4J just for queries, but I think I might try this instead.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.