liveBook · Manning

Graph projection

As explained in Knowledge Graphs and LLMs in Action

A graph projection is an in-memory representation of selected graph data prepared for algorithmic analysis.

A graph projection is an in-memory representation of selected graph nodes and relationships, prepared for algorithmic analysis rather than general database exploration. Selection can focus analysis on a protein–protein interaction network or a relevant slice of the SNOMED ontology. section 4.2.2 section 7.7.4

A practical projection pipeline is:

  • Mark the nodes participating in the analysis, such as proteins connected by INTERACTS_WITH. section 4.2.2
  • Project the selected labels and relationships into memory, specifying relationship orientation when required. section 4.2.2
  • Run a graph algorithm on the named projection, then write or stream analytical results. section 4.2.2 section 7.7.4
Listing 4.8 Creating the graph projection in memory
call gds.graph.project(
    'ppi-graph',  #1
    'PPIProtein',  #2
    {
        INTERACTS_WITH: {  #3
            orientation: 'UNDIRECTED'
        }
    }
)

The projection query names the in-memory graph, selects PPIProtein nodes, and treats INTERACTS_WITH as undirected for downstream GDS algorithms. section 4.2.2

Two analytical projections

A PPI projection supports WCC, which found 27 connected components among 21,559 proteins, and Louvain, which found 48 communities. A SNOMED projection supports degree analysis for identifying highly connected hub nodes and filtering noisy paths between medical entities. section 4.2.2 section 7.7.4

How Knowledge Graphs and LLMs in Action covers it

How deep it goes
Explains selection, in-memory creation, relationship orientation, and downstream algorithms, but does not detail projection storage internals.
Examples
Uses protein–protein interaction and SNOMED ontology projections, including component analysis, community detection, and hub-node exclusion.
What it assumes
Assumes a Neo4j graph with suitable labels and relationships, while demonstrating node marking and projection creation.
What you can do after
Apply it via Neo4j GDS to build focused in-memory graphs and run connectivity, community, or degree analyses.
How it connects
Connects graph projection with Neo4j, Graph Data Science, weakly connected components, Louvain algorithm, degree analysis, and ontology path filtering.

Also explained in

Compare how 2 books explain graph projection →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Knowledge Graphs and LLMs in Action. The section links point to the parts of the book it draws on.