如何存储具有数十亿节点和顶点的大型有向无权图 [英] How to store a large directed unweighted graph with billions of nodes and vertices

问题描述

图表大小在数十亿个节点和数百亿个顶点中。

它将存储网页URL，并且网页之间的链接将被使用用于测试排名算法。

任何语言都可以，但是java是首选。

到目前为止发现的解决方案：

2. 
   
   

   是的，我已阅读最佳存储/访问方式一个定向图。
   
   

   更新
   
   

   数据可以分布在多台计算机上，不需要完全在内存中。根据您的实施情况，另一种解决方案可能是Terracotta 。我认为使用分布式虚拟堆支持这个量级的对象图。
   
   

   http://www.terracotta.org/web/display/docs/Concept+and+Architecture+Guide#ConceptandArchitectureGuide-VirtualHeap

   
   

   The graph size is in the billions of nodes, and tens of billions of vertices.

   It will store webpages urls, and links between webpages and it will be used for testing ranking algorithms.

   Any language is fine but java is prefered.

   Solutions i found so far:

   1. neo4j
   2. storing in sorted flat files

   Yes, i have already read Best Way to Store/Access a Directed Graph.

   Update

   The data can be distributed on multiple computers and does not need to be fully in-memory.

   解决方案

   Depending on your implementation, another solution could be Terracotta. I think supports object graphs of this magnitude using a distributed virtual heap.

   http://www.terracotta.org/web/display/docs/Concept+and+Architecture+Guide#ConceptandArchitectureGuide-VirtualHeap

   这篇关于如何存储具有数十亿节点和顶点的大型有向无权图的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！