Hi All,
I am new to graph databases and need some help on modeling.
Let's assume, I have 3 sets of below CSV files with sample data:
file#1: (master file with unique nodeID's and their names)
nodeID, nodeName
1, A
2, B
3, C
4, D
file#2: parent-child relationships with all diff kind of relations between nodes i.e. recursive, self, bi-directional and/or with multiple parents etc. All 3 columns make it unique (composite pk)
startNode, endNode, nodeRelation
1, 2, x
2, 3, y
2, 4, y
4, 1, z
3, 2, x
file#3: All 3 columns make it unique (composite pk)
nodeID, exceptionCatg, exceptionReason
1, AAA, xyz
1, BB, xyz
2, AAA, cde
3, CCCC, mno
How to model the above structure ?
Mainly interested in searching for a specific nodeName as such that it would show all the upward/downward hierarhcy path along with the relationships from that node point onwards with search on nodeName to show paths with all matching names.
example:
Please help/suggest.
Thanks!