If you'd be okay with a directed acyclic graph, then SQL can work. Basically "modeling trees in SQL".
Specifically, you could use postgresql for the edge traversing and its jsonb column to store searchable attributes.
Specifically, you could use postgresql for the edge traversing and its jsonb column to store searchable attributes.
No comments yet.