A graph projection is an in-memory graph containing all or part of the data loaded from a graphset. Ultipa graph algorithms run on graph projections for peak efficiency, with certain projections also enabling faster query execution.
Based on the Shards + HDCs architecture of Ultipa Powerhouse (v5), graph data can be projected to either an HDC server or shard servers, resulting in HDC or distributed projections.
Selecting between a HDC or distributed projection involves factors such as physical infrastructure, data volume, and specific business needs. The table below highlights key distinctions between them:
Projection Type |
Algorithm Efficiency | Algorithm Execution Modes | Computing Framework |
---|---|---|---|
HDC | Faster | Writebacks, Returns | Centralized high-density computing |
Distributed | Fast | Writebacks | Distributed computing |
For more details, see the corresponding projection: