4 ms·
I understand that they do persist to disk and store data differently but the ones I've seen used in practice are in memory during runtime. It as been a few year
by mohaine 9y ago
I understand that they do persist to disk and store data differently but the ones I've seen used in practice are in memory during runtime. It as been a few years but so maybe this has changed. Any examples?
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.
- EGreg 9y agoBut the parent is one lookup and the children are 1000. Thats why.
- mohaine 9y agoThis 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.
- EGreg 9y agoNO. Each lookup thereafter is NOT by index. That's where the savings come from. The pointers already contain the exact block where to load the info from.