Are there any algorithms to draw a billion node graph or to aggregate the information? The idea would be to allow for it to be parallelized using map reduce so it could be done in realtime
I was wondering if there were any other algorithms? A google search turned up nothing.
Very large graph drawing I have found are as follows
Below is a sketch of an algorithm I thought up.
Specifically one that you can pan around and zoom? I thought of the following algorithm.
- Take a graph layout algorithm (a force directed layout algorithm)
- Create a window of locality using a graph metric that you define
- Draw everything in an epsilon of that graph metric.
- Iterate the window throughout a n-dimentional space. Where n is defined as the amount of data points you have and a tag is a $S \in $ the set of strings. (vertex, edge, $tag_{1}$, ... $tag_{n})
--Begin amended algorithm--
Step 5 is due to @vzn answer: Add a visualization of local regions. Therefore we define a region as a set of points that are "close" due to some locality measure. Pagerank is an example so you have a pagerank of 2 you are in the region.