I’m kind of a novice in graph databases. Sorry if I’m being stupid.
I’m wondering how edge deletion works in dgraph .
Suppose I had a graph with 100 nodes, and another graph with 100 nodes but with very complex relationships (edges).
When I perform a delete, from what I understand, Dgraph does not delete incoming edges, but it does delete outward edges from that node.
But in dgraph, edges are also predicates of a node, and I feel like the cost of deleting an empty node vs. one with a predicate should be similar.
In that case, If I didn’t care about incoming edges, would I be able to delete any of the same number of nodes such as in the above case at similar speeds?