Marko A. Rodriguez tweets:
There are 251,818,304,970,074,185 (251 quadrillion) length 5 paths in the #dbpedia graph.
Just in case you are curious.
With a pointer to: Faunus.
One of the use cases for Faunus is graph derivation:
Given an input graph, derive a new graph based upon the input graph’s structure and semantics. Other terms include graph rewriting and graph transformations.
Sounds like merging would fit into “derivation,” “graph rewriting” and “graph transformation” doesn’t it?
Or even spawning content in one graph based in its structure or semantics, using structure and semantics from one or more other graphs as sources.
Much to be thought about here.