CODEWITHSUNDEEP
neo4jcypher
user638564
user638564

Reputation: 45

Neo4J order by count relationships extremely slow

I'm trying to model a large knowledge graph. (using v3.1.1).

My actual graph contains only two types of Nodes (Topic, Properties) and a single type of Relationships (HAS_PROPERTIES).

The count of nodes is about 85M (47M :Topic, the rest of nodes are :Properties).

I'm trying to get the most connected node:Topic for this. I'm using the following query:

MATCH (n:Topic)-[r]-()
RETURN n, count(DISTINCT r) AS num
ORDER BY num

This query or almost any query I try to perform (without filtering the results) using the count(relationships) and order by count(relationships) is always extremely slow: these queries take more than 10 minutes and still no response.

Am i missing indexes or is the a better syntax?

Is there any chance i can execute this query in a reasonable time?

Upvotes: 1

Views: 618

Answers (1)

Michael Hunger
Michael Hunger

Reputation: 41676

Use this:

MATCH (n:Topic)
RETURN n, size( (n)--() ) AS num
ORDER BY num DESC
LIMIT 100

Which reads the degree from a node directly.

Upvotes: 3

Related Questions