GraphAcademy

Graph Data Science

graph catalog

The set of projections currently held in memory, each listed and dropped by name.

Example

Everything currently in memory, and then one of them removed.

cypher
CALL gds.graph.list()
YIELD graphName, nodeCount, relationshipCount
RETURN graphName, nodeCount, relationshipCount
cypher
CALL gds.graph.drop('people')

gds.graph.list() names every projection the catalog holds. gds.graph.drop('people') removes that one and frees the memory it was using.

Lessons that use this term

The lesson and course links below open in a new tab.

3 lessons use this term. Results are ordered by term density.

Get started with Graph Data Science6 mentions

Related terms

multipartite graph
A graph with three or more kinds of node, where relationships only ever join nodes of different kinds.2 shared lessons
monopartite graph
A graph in which every node is the same kind of thing, so relationships connect like to like.2 shared lessons
bipartite graph
A graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind.2 shared lessons
node similarity
An algorithm that scores how alike two nodes are by comparing the neighbours they share.1 shared lesson
degree centrality
A score for each node equal to its number of outgoing relationships.1 shared lesson
projection
An in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds.3 shared lessons
PageRank
A centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are.1 shared lesson
graph data science
Analysing data through the structure of its connections. Also the name of the Neo4j library that implements it.2 shared lessons

All glossary terms