But the parent is one lookup and the children are 1000. Thats why.
This is only if the 1000 children are already in memory. Otherwise it is still 1000 lookups, by index. This is why the Graph Dbs on the market tend to be in memory.
I'm not saying Graph DBs don't have their place. They do, but they are the wrong answer for MOST datasets.
Graph databases also are only fast when doing graph transversal lookups. They all have index just like RDB. Sure you got from parent->child->grandchild quickly but how to do you find the parent in the first place? An index normally.