Neo4j

Anvvee · 03-22-2019

I am working with a large graph of Wikipedia topics having more than 16 million nodes and 400 million edges. Trying to find important topics from the set of some topics. For that, I want to use PageRank on a subgraph of the Wikipedia graph. Using Pag...

Anvvee · 03-25-2019

Do you know how can this query be modified to not only include the nodes with (t.title in ["Sport_utility_vehicle", "Sports_car", "Luxury_vehicle"]) but also their adjacent nodes. i.e 1 hop away

Anvvee · 03-24-2019

I did the same hack to fasten up the query, Is there some other way so that I don't have to put the same conditions on edges(i.e they belong to set of nodes). I'll have a look into your suggestions tomorrow and get back to you

Anvvee · 03-24-2019

Hi, My whole graph has 16 million nodes and 500 million relationships. But for Pagerank I need to query on subgraph which will consist of less than 100 nodes and 10000 relationships. The machine hosting the db has 120GB of RAM. Data loading is fast, ...

Anvvee · 03-24-2019

Yes, I've created an index on the "title" company. But still the pagerank takes a lot of time. IDK why

Anvvee · 03-22-2019

Currently for pagerank for a subgraph having topics Sport_utility_vehicle, Sports_car and Luxury_vehicle I am using the below query, which is very slow. CALL algo.pageRank.stream( 'MATCH (t:TOPIC) WHERE t.title = "Sport_utility_vehicle" or t.title =...

Neo4j

User Statistics

User Activity

PageRank on subgraph of large graph

Re: PageRank on subgraph of large graph

Re: PageRank on subgraph of large graph

Re: PageRank on subgraph of large graph

Re: PageRank on subgraph of large graph

Re: PageRank on subgraph of large graph