GraphAcademy

Graph Data Science

execution mode

How a GDS algorithm returns its results. One of stats, stream, mutate, write or estimate.

Example

The same algorithm over the same projection, run two ways.

cypher
CALL gds.degree.stream('people')
YIELD nodeId, score
RETURN gds.util.asNode(nodeId).name AS person, score
cypher
CALL gds.degree.write('people', { writeProperty: 'degree' })
YIELD nodePropertiesWritten
RETURN nodePropertiesWritten

stream returns a row for each node and stores nothing. write stores each score on its node in the database and returns how many it wrote.

Lessons that use this term

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

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

Analyze Graph Data with Python2 mentions

  • Running AlgorithmsGDS Python ClientCall algorithms using Python syntax Choose the right execution mode for your task Chain algorithms together using mutate mode Stream combined results from projections Estimate1 mention
  • GDS Workflows in PythonGDS Python Clientgraph projections and inspect them using the Graph object Choose the right execution mode for different situations Work with algorithm results as pandas DataFrames Clean up projections properly to manage1 mention

Graph Data Science in Practice2 mentions

  • Execution Modes and ConfigurationGDS FoundationsChoose the appropriate execution mode (stream, stats, mutate, write, estimate) for your task Build efficient workflows by combining modes strategically -2 mentions

Get started with Graph Data Science7 mentions

Related terms

heterogeneous graph
A graph that holds more than one node label or more than one relationship type.4 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.6 shared lessons
relationship aggregation
Collapsing the parallel relationships between two nodes into one during projection, usually carrying their count or sum as its weight.2 shared lessons
Louvain algorithm
A community detection algorithm that repeatedly merges nodes into groups for as long as merging raises modularity.5 shared lessons
node similarity
An algorithm that scores how alike two nodes are by comparing the neighbours they share.3 shared lessons
community detection
A family of algorithms that group nodes by how they connect. Each algorithm defines a community differently.4 shared lessons
monopartite graph
A graph in which every node is the same kind of thing, so relationships connect like to like.3 shared lessons
FastRP
A node embedding algorithm, short for Fast Random Projection. It builds each node's vector by combining random vectors drawn from the nodes around it.2 shared lessons

All glossary terms