From: <ga...@gm...> - 2013-02-21 09:45:01
|
Hello all, I was trying out JUNG2 for calculating Pagerank for larger datasets, exactly for dbpedia-datasets. Well using Strings with larger datasets is of course not very smart, so a Integer representation is necessary. I use a DirectedSparseGraph<Integer, Integer> and the following amount of (almost Integer) data: preferenceVector as HashMap<Integer, Double> containing 18*10^6 entries edges: 130*10^6 vertices: 18*10^6 Trying out calculation of pagerank with DirectedSparseGraph<Integer, Integer> leads to huge RAM consumption (graph.addEdge(Integer, Integer, Integer, EdgeType.DIRECTED)). Why is that this way? Is there an more efficient way? Any important archetectural background? I allocated 30GB RAM and its not possible to calculate Pagerank with the above amount of edges and vertices with simple Integer values. best regards |