I am looking for an effective query that returns a node where kilometer value of a property, appears as a shortest distance between a km value of property and km value passed in to the query as a parameter.
Please have a look at a model below to understand the problem encountered. A question regards adding new tail nodes to the model here 'X' node.
New nodes are to be fetched via a data file containing a dozen of rows with each line representing one nod...
Hi,
statements i.e. "show all roles" "grant role admin to neo4j" ends in error: unsupported administration command. Did dbms.security.auth_enabled=false and restarted server. why is that?
Look I am inexperienced with graphs, but to me your proposal worries me regarding data redundancy, as you suggest that child nodes makes aware of theirs parents through a dedicated property i.e. '350/05', while at same time this information can be ...
If while reading an input file, the encountered '05' node, satisfies / overlap all relationships from say node '350' over node '05' hits an existing node X, than do nothing (verifies and handles correct by issuing MERGE I assume), else say instruct d...
my business case requires an outcome as on figure below where both 250 and 350 branches get assigned a dedicated their own 'X' nodes. Those 'Xs' are going to get connects_to relationship afterwards also. , and not as it gets out while using suggested...
