I have a large graph of several 100 GB, so I can not store it in RAM. A graph has polyhedra, and there are labels for each edge. I would like to fulfill queries like:
- Show me all the edges obtained from the specified node.
- Show me all the edges between two given nodes.
- Select 1000 random pairs of nodes that are connected, and show me all the edges between them.
- Select 1000 nodes selected at random.
What is a good way to store graphs on disk for these kinds of queries?
This is for one high-performance PC, not for distributed configuration. My preferred programming language is Python.
performance graph graph-databases
eleanora
source share