[D] Best way to represent cross reference matrix in a graph database?
Not sure if this is the best place to ask this, but let’s say I have a ginormous cross reference matrix file, where the first row and column represent existing nodes. So then any cells they have in common represent new relationship nodes. What’s the best way to incorporating these new nodes into a graph? Assuming I don’t really want to create these new nodes.
The reason is because I’d like to keep the graph condense and maintainable, and creating all of the relationship nodes can make the graph unruly and hard to look at. Is there some structure I can store the data in, like a lookup table of sort for property graphs/Neo4j?