Hi, I am running the following query
MATCH (fn1: full_name) MATCH (fn2: full_name) WHERE fn1.full_name <> fn2.full_name and apoc.text.fuzzyMatch(fn1.full_name, fn2.full_name)=TRUE MERGE (fn1)-[:FUZZY_MATCH]-(fn2)
which is currently taking more than an hour to run. The graph consists of approximately 54K full_name nodes. The idea is to create a connection between similar names.
Is there a way for me to optimize this process?
(Screenshot of query map for reference)