If the number of properties is greater than n, return from a highly connected graph in Neo4j -

-

this question direct extension of question asked here (and , earlier version here).

say have graph database looks this:

enter image description here

just previous questions asked, interesting thing someproperty can 'yes' or 'no'.

in top row, 1 of 3 nodes has 'yes' property.

on bottom row, 3 nodes of 5 nodes have 'yes' property.

(slight philosophical sidenote: i'm starting suspect bad graph schema. why? because, within each set of nodes, each node in connected every other node. i'm not worried fact there 2 groups of nodes, fact when populate graph, talkback says, 'returned 530 rows.' think means created 530 subpaths within graph structure , seems overkill.)

anyway, problem i'm trying solve pretty same problem trying solve in earlier, simpler, more linear context here.

i want return full path of either of these disjoint graphs, whereas anywhere within said graph count occurrences of someproperty greater 2.

i think common, simple problem. example, had 2 unrelated families, , says, "show me family has more 2 left handed people."

the super smart #cybersam recommended simpler incarnation of problem, along lines of: 

match p=(a:person)-[:related_to*]->(b:person)   not ()-[:related_to]->(a) ,   not (b)-[:related_to]->() ,   2 < reduce(s = 0, x in nodes(p) | case when x. someproperty = 'yes' s + 1 else s end) return p;

...which works great if graph resembles more of straight line, , doesn't have each node in set related each other node.

i think reason why #cybersam's query won't handle more complex graph because there no terminal node.

(another philosophical sidenote: i'm starting come theories dense, intricate relationships in graph pose combinatorial problems, performance querying. think might due bidirectionality used cypher when querying?)

here's data. advice appreciate , helping me climb learning curve. 

// match (n) detach delete n;  create (albert:person {gender: 'male', name: 'albert', someproperty: 'yes'}) create (annie:person {gender: 'female', name: 'annie', someproperty: 'no'}) create (adrian:person {gender: 'female', name: 'adrian', someproperty: 'no'})  create (albert)-[:related_to]->(annie) create (annie)-[:related_to]->(albert) create (annie)-[:related_to]->(adrian) create (adrian)-[:related_to]->(annie) create (albert)-[:related_to]->(adrian) create (adrian)-[:related_to]->(albert)   create (bill:person {gender: 'male', name: 'bill', someproperty: 'yes'}) create (barb:person {gender: 'female', name: 'barb', someproperty: 'yes'}) create (barry:person {gender: 'male', name: 'barry', someproperty: 'yes'}) create (bart:person {gender: 'male', name: 'bart', someproperty: 'no'}) create (bartholemu:person {gender: 'male', name: 'bartholemu', someproperty: 'no'})  create (bill)-[:related_to]->(barb) create (barb)-[:related_to]->(bill) create (barb)-[:related_to]->(barry) create (barry)-[:related_to]->(barb) create (barry)-[:related_to]->(bart) create (bart)-[:related_to]->(barry) create (bart)-[:related_to]->(bartholemu) create (bartholemu)-[:related_to]->(bart) create (bill)-[:related_to]->(bartholemu) create (bartholemu)-[:related_to]->(bill)

if families of people, easiest fix add :family node each relational group, so: 

create (f:family) f  match (a:person {name:"adrian"})-[:related_to*]->(b:person)   merge (f:family)<-[:family]-(a)  merge (f:family)<-[:family]-(b)

replace "adrian" "barry" create second family group.

that gives central :family node each family group. can pick family group has enough :person.someproperty = "yes" family members so:

// find families 2 or more :person.someproperty = "yes" match p = (f:family)<-[:family]-(psn:person) psn.someproperty = "yes"  f, count(psn) cnt  cnt > 2  // family members  match (a:person)<-[r1:related_to]-(b:person)-[r2:related_to*]->(c) (a)-[:family]-(f)   , = c  // nodes in loop   // report first record which'll have 2   // family members , relationships return a, r1, b, r2  limit 1

Comments

Post a Comment

Popular posts from this blog

ios - Memory not freeing up after popping viewcontroller using ARC -

-
hi project arc based, using uinavigationcontroller make transition between viewcontroller. using profiler analyse happening behind scene memory. noticed when push viewcontroller allocate memory components , when pop not freeing allocated memory. since using arc unable implement dealloc or release component. have analysed in detail , there no memory leak in project. i not using strong property push viewcontroller. here how pushing viewcontroller. viewcontroller *obj = [[viewcontroller alloc] init]; [self.navigationcontroller pushviewcontroller:obj animated:no]; any clue whats going on? should free memory have consumed. please advise your description indicates have retain cycle, leads objects not being deallocated. typical source of retain cycles properties assigned loading nib files (usually declared iboutlet ). two strategies break them , release objects: declare property weak : @property (nonatomic, weak) iboutlet uilabel *statuslabel; set property nil in...
Read more

Django REST Framework perform_create: You cannot call `.save()` after accessing `serializer.data` -

-
i have following viewset: class artistprofileviewset(viewsets.modelviewset): queryset = artistprofile.objects.all() serializer_class = artistprofileserializer def perform_create(self, serializer): if serializer.is_valid(): serializer.save() with following serializers: class simpleartisttrackserializer(serializers.hyperlinkedmodelserializer): class meta: model = artisttrack fields = (...my fields...) class artistprofileserializer(serializers.hyperlinkedmodelserializer): owners = userserializer(many=true, required=false) tracks = simpleartisttrackserializer(many=true, required=false) class meta: model = artistprofile fields = (...my fields...) i getting following error: assertionerror: cannot call `.save()` after accessing `serializer.data`.if need access data before committing database inspect 'serializer.validated_data' instead. i don't see editing serializer.data object. th...
Read more

Why does Go error when trying to marshal this JSON? -

-
i'm trying rather simple example of trying decode json file structs using golang. however, when attempting error that json: cannot unmarshal object go value of type []main.track which don't understand. here's code in question, , json can found here . package main import ( "encoding/json" "fmt" "net/http" "os" ) // tracks group of track types type tracks struct { tracks []track } // track represents singular track type track struct { name string url string artist artist } // artist represents single artist type artist struct { name string mbid string url string } func main() { url := "http://ws.audioscrobbler.com/2.0/?method=geo.gettoptracks&api_key=c1572082105bd40d247836b5c1819623&format=json&country=netherlands" response, err := http.get(url) if err != nil { fmt.printf("%s\n", err) os.exit(1) } de...
Read more