I wonder how performant this is, since I see no mention of benchmarks and such.<p>I'm currently using MongoDB to store a graph, and it's not that bad to use, except that pagination of a node's edges is unwieldy, atleast the way I have it set up.<p>But I don't see how to do it smoothly in HyperGraphDB either. I don't see a way to sort by edge weight within a query, and limit results to say the top 10, or skip them. So I'd have to load up all the edges to a node, and sort/limit/skip them myself?