0

Assume a graph database to store a very large DAG on disk:

There are many things that are not required, which allows for optimization.

Basically what I do need is:

  • store a directed acyclic graph, no cycles, at most one edge per node-pair
  • fromID, toID, weight (can be INT,INT,FLOAT)
  • return connected components efficiently and conveniently
  • return all zero-indegeree nodes efficiently and conveniently
  • return all descendents of a node efficiently and conveniently
  • manage sizes of up to 100 million nodes, with up to 10 billion edges
  • modest resource requirements
  • free / open-source

Do you have some experience that allow you to give recommendations?

Radio Controlled
  • 825
  • 8
  • 23
  • 1
    What do you mean by "modest resource requirements"? Objectivity/DB is regularly used to store billions and/or trillions of nodes and edges on architectures that are single-server, distributed multi-server, and cloud/cluster configurations. Graphs can span multiple servers. – djhallx Nov 15 '19 at 03:44
  • Certainly one Server. Obviously, it cannot work magic if I want so many nodes and quick responses, but if it could drop all unnecessary aspects and then is still low on RAM and disk use... Say at most 64GB RAM and 1TB Disk... – Radio Controlled Nov 15 '19 at 10:31
  • I had similar idea, I end up using an OKVS. – amirouche Jan 13 '20 at 18:49

0 Answers0