HN Explorer

Ask HN: Best database for tree storage and traversal?

6 points by cookerware ↗ 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

2 comments

[ 2.9 ms ] story [ 12.2 ms ] thread
truncate
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.