Neo4j按范围性能匹配

Question

I've got following setup:

About 1,5m nodes of type IpRangeBlock consisting of start and end properties - both of them are of type Long. There's an index on the start property.

What I then do is to find a range containing given IP. So, eg for ip 0.0.0.2 I convert it to long and then perform comparison on all nodes n.start <= 2 && n.end >= 2 .

The cypher query I run looks like this:

MATCH (n:IpRangeBlock) WHERE n.start <= {ip} AND n.end >= {ip} RETURN n LIMIT 1

All is fine, though as I mentioned, for 1,5m nodes I have it can take up to 20s for Neo4j to find matching range. My question is, is there a way to speed up this operation or is the fault in my db design?

Answer 1

Ok, I tried caching node references and performing the comparison on the app side. As you might expect - pulling that much of nodes takes time.

So I tried another approach - I examined our data set and it turned out that all ip ranges' start and end properties begin with the same first octet. I used those octets as grouping nodes to quickly narrow down subset of probable IP ranges. This worked well, as our dataset is actually well distributed across all ip ranges. now, instead of comparing 100k nodes' properties, each query has to do it 'only' for around 8-10k.

I know it's not perfect aproach but it worked for me. There's neo4j article I got this idea from.