I’m currently using dgraph and I was checking that I cannot really remove a node, instead of that I have to remove its edges and triples but I was thinking in one use of case. What happens if I have a tree (Think about a files system which actually is a tree) and I have something like
/home/user/Downloads/myDownload/[myFirstDownload mySecondDownload etc…]
The [ ] representation is thinking that myFirstDownload and so on… are children of Download.
Then I want to remove Download so in dgraph I just only remove the edge that connects user with Download something like:
<user uid> <child_edge> <download uid> .
and then the relation will be deleted. So my question is… If I remove that relation will download (and consequently children) be removed?
I meant you do you have a kind of garbage collector condition to make a node available again? Because the Download node and its children won’t be used again and I expect that all of these uids make it available after that.
Thinking this example with zillions of nodes subsequiently of that download node