Your order by should be really fast
It uses a top n select and you only access the node-id directly which is instant
Von meinem iPhone gesendet
> Am 13.07.2015 um 16:20 schrieb matias.bu...@brinqa.com:
>
> Yeah, that's much better. I didn't know that I could put a fulltext field in
> the WHERE
Yeah, that's much better. I didn't know that I could put a fulltext field
in the WHERE clause. Thank you so much.
What about the ORDER BY case? Is there any tweak I can do?
Matias.
On Tuesday, July 7, 2015 at 4:46:02 PM UTC-3, Michael Hunger wrote:
>
> What you do is basically a hash join betwee
What you do is basically a hash join between the 650K nodes to match the single
n node.
This is a better way, please try.
> START
> n=node(6494)
> MATCH n<-[:`host`]-x
WHERE x.allContent =~ ".*Adobe.*"
>
> RETURN
> cou
Hi, i'm using version Neo4j 1.9 version and i'm running in to several
performance issues in a db with 1M nodes.
First problem is with fulltext indexing, for me this should be very fast
but for example this query:
START
n=node(6494), x=node:fulltext_index("allConten
