I find that a representation tree based representation such as snmp effective. Snmp details are not the right fit but the concept is correct. Btw,the graph is static at start up. If the graph changes a restartup constructs new graph.
On the cloud server i used neo4j a graphical db and the cyper query language to do this task. I would like to do this on the 32 bit node computer, but neo4j is too big for this environment.
I implimented a tree structured data base by constructing unique keys for each element of the tree. The keys are constructed so that the graphical relations and attributes are embedded in the key name.
To access values i do a redis keys pattern. This gets me close. I fo further string matching to find the desired keys, which is done in python.
There are probanly better wsys of doing this and this is the teason for the post.
--
You received this message because you are subscribed to the Google Groups "Redis DB" group.
To unsubscribe from this group and stop receiving emails from it, send an email to redis-db+u...@googlegroups.com.
To post to this group, send email to redi...@googlegroups.com.
Visit this group at https://groups.google.com/group/redis-db.
For more options, visit https://groups.google.com/d/optout.