Skip to content

Ask HN: Best database for tree storage and traversal?

6 pointscookerware2 comments
On HN

The gist of what I'm trying to do is have a tree, traverse through every possible branch until all leaf nodes have been visited.

I need to also be able to modify any node along a branch. I originally thought about using MySQL but it seems really complicated. So I turn to graph databases.

I want a python example which does this but can't find it in the docs for Neo4j, OrientDB, ArangoDB

Comments

Did you try using any MPTT libraries for your framework/rdbms? I've found that fairly simple to use. But of course performance should be better with NoSQL.

files and directories

AboutSource Built by g1lg1l

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