Neo4j

hagen_ivar · 01-31-2019

Hi! I'm working on a rule solving engine. The problem is that when I run it first the results needs to be fed into the engine again and potentially again and again. Is it possible to solve this with just one run? This is my data. CREATE (a:XTEST {id:...

hagen_ivar · 10-08-2018

Hi! I have a tree structure where ids are a list of parameters. For example ["A","B"]. IIf both these parameters are used as input it will fetch next node in tree and so on. This is the code and an image of the nodes. CREATE (t1:Tree {id:["A","B"]})...

hagen_ivar · 10-08-2018

Hi! I have an array of unknown length that I want to create the cartesian product for. In the example I have three arrays with 3, 1 and 2 elements each. So I use three UNWINDs, but can this be done for X number of elements in the array with one state...

hagen_ivar · 09-20-2018

Hi! I want to design a rule engine in Neo4j. One type of rule is a "inclusion 1-way". If a prameter is included in the input it can give you another parameter which in turn can give another parameter etc. Parameters is a global object and the same pa...

hagen_ivar · 09-17-2018

Hi! I've got some problems to get the OPTIONAL MATCH to work when using the WITH and WHERE operators. To simplify my complex query I have created the below example. I would like to return all Cats (a) and all persons (p) for whom all friends are bffs...

hagen_ivar · 01-31-2019

Thanks. Yes I tried to think of this as a solution: So having connections from B and E to [B,E] node and counting the number of incoming paths when running query. So if run with input A and C. The paths C-D-E-[B,E]-F and A-B-[B,E]-F with a filter th...

hagen_ivar · 01-31-2019

Thanks for fast reply. This community is great. Your solution works for the scenario I listed. But if I have further rule chain it will not solve that. If I add this CREATE (fg:XTEST {pklist:["F","G"], nodetype:"start"}) CREATE (h:XTEST {pklist:["H"...

hagen_ivar · 09-21-2018

So I have created this tree out of the above rules. MATCH (r:Regel)-[rel]-(p:Param) WHERE r.type = "inclusion 1-way" WITH r AS rule, CASE WHEN type(rel) = "SELECT" THEN p.id ELSE null END AS selpars, CASE WHEN type(rel) = "INCLUDE" THEN p.id ELSE nu...

hagen_ivar · 09-18-2018

Thanks! The All function is a good solution instead of using COUNT and SIZE, but when there are no persons who has all friends as bffs then it still returns empty. I want it to return the Animals (a) no matter what. Could the All function be combined...

hagen_ivar · 09-17-2018

I kinda managed to solve it myself by using CASE instead of WHERE.  MATCH(a:Animal) WHERE a.type = "Cat" WITH COLLECT(a) AS a OPTIONAL MATCH(p:Person)-[r2:HAS_FRIEND]->(p2:Person) WITH a, p, CASE WHEN (COUNT(p2) - SIZE( (p)-[:HAS_FRIEND {type:"bff"...

Neo4j

User Statistics

User Activity

Path conundrum for rule solving engine

Recursive path solver

Cartesian product from array

Rule engine path

WITH WHERE OPTIONAL problem

Re: Path conundrum for rule solving engine

Re: Path conundrum for rule solving engine

Re: Rule engine path

Re: WITH WHERE OPTIONAL problem

Re: WITH WHERE OPTIONAL problem