liveBook · Manning

Graph projection

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

How 2 Manning books explain it

Graph Algorithms for Data Science

A projected in-memory graph is an in-memory graph representation created from stored graph data for graph algorithm execution.

How it is used
Provides the in-memory input structure for Graph Data Science algorithms and lets several algorithms reuse one named graph.
How deep it goes
Explains native, Cypher, and filtered subgraph projections with parameters, trade-offs, properties, and cleanup procedures.
Examples
Demonstrates weighted retweet, hashtag-community, follower, and shared-audience network projections.
What you can do after
Operate/configure it by creating named graphs, selecting properties and orientations, filtering subgraphs, and releasing memory afterward.

Read how Graph Algorithms for Data Science explains graph projection →

Knowledge Graphs and LLMs in Action

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

How it is used
Prepares selected graph data for GDS algorithms that evaluate connectivity, communities, centrality, or domain-specific paths.
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 you can do after
Apply it via Neo4j GDS to build focused in-memory graphs and run connectivity, community, or degree analyses.

Read how Knowledge Graphs and LLMs in Action explains graph projection →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.