3 ms·
This sounds really cool. For distributed relational or graph databases, seems like the key trick for making queries efficient is to get related data on the sam
by jimbokun 11y ago
This sounds really cool.
For distributed relational or graph databases, seems like the key trick for making queries efficient is to get related data on the same host, whenever possible.
So would be cool to dig into the specifics of the algorithms they are using, to see exactly how they are optimizing where to store the data. With a graph database, it's impossible to guarantee having all related data together (eventually, friend of a friend of a friend...will be on a different host). So needs to be heuristics based.
For tree shaped data, on the other hand, it is possible to have the root of each tree and all of its related data on the same host (assuming each tree is "reasonable" size). Google's F1 project took this approach.
- adsharma 11y agoHello, I wrote the blog post. There is a link to a video in the blog and we published something at NSDI last week: https://www.usenix.org/conference/nsdi16/technical-sessions/presentation/shalita https://www.usenix.org/conference/nsdi16/technical-sessions/...
- jimbokun 11y agoThanks for the link! Looks like an interesting read.