You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
-[ ] Search for the feature you are working on (mentions) and make updates if needed
25
+
-[ ] Provide a basic example of usage
26
+
-[ ] In case your feature is an Enterprise one, list it under [ME page](https://memgraph.com/docs/database-management/enabling-memgraph-enterprise) and mark its page with Enterprise ([example](https://memgraph.com/docs/database-management/authentication-and-authorization/role-based-access-control)).
23
27
-[ ] Check all content with Grammarly
24
28
-[ ] Perform a self-review of my code
25
-
-[ ] Make corresponding changes to the rest of the documentation (consult with the DX team)
26
29
-[ ] The build passes locally
27
30
-[ ] My changes generate no new warnings or errors
Copy file name to clipboardExpand all lines: pages/advanced-algorithms/available-algorithms/pagerank_online.mdx
+18-5Lines changed: 18 additions & 5 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -48,10 +48,18 @@ its expectation, which is Rank(v).
48
48
|**Edge weights**| unweighted |
49
49
|**Parallelism**| sequential |
50
50
51
+
<Callouttype="info">
52
+
This algorithm is currently running in a sequential manner, but can be parallelized.
53
+
If you have a use case for parallelizing this algorithm, please contact us over
54
+
**[Discord](https://discord.gg/memgraph).**
55
+
</Callout>
56
+
51
57
## Procedures
52
58
53
59
Online PageRank should be used by executing the procedures in the following way:
54
-
1. Parameters and the context is set using the `set()` procedure.
60
+
1. With the `set()` procedure, the PageRank values are calculated on the graph for the first time. This function
61
+
is also important as it sets the streaming context for this algorithm, so further updates of the graph
62
+
can result in faster execution.
55
63
56
64
2. To make the incremental flow, set the proper trigger using the `update()` function:
57
65
@@ -63,7 +71,9 @@ Online PageRank should be used by executing the procedures in the following way:
63
71
SET node.rank = rank;
64
72
```
65
73
66
-
3. Use the `get()` procedure to return the resulting values stored in the cache.
74
+
3. Use the `get()` procedure to return the resulting values stored in the cache. If the user hasn't previously run
75
+
`set()`, the procedure will also do the `set()` functionality first in order to initialize the streaming context of
76
+
this algorithm.
67
77
4. Finally, the `reset()` function resets the context and enables you to start new runs.
68
78
69
79
<Callouttype="info">
@@ -72,12 +82,15 @@ You can execute this algorithm on [graph projections, subgraphs or portions of t
72
82
73
83
### `set()`
74
84
75
-
The procedure calculates PageRank for the nodes in the graph.
85
+
The procedure calculates PageRank for the nodes in the graph. The procedure is currently running in a
86
+
sequential manner, but can be parallelized
87
+
(the [non-streaming version of pagerank](/advanced-algorithms/available-algorithms/pagerank) offers
88
+
parallelism, but is not applicable as it doesn't set the streaming context for the algorithm).
76
89
77
90
{<h4> Input: </h4>}
78
91
79
92
-`subgraph: Graph` (**OPTIONAL**) ➡ A specific subgraph, which is an [object of type Graph](/advanced-algorithms/run-algorithms#run-procedures-on-subgraph) returned by the `project()` function, on which the algorithm is run.
80
-
-`walks_per_node: integer (default=10)` ➡ Number of sampled walks per node.
93
+
-`walks_per_node: integer (default=10)` ➡ Number of sampled walks per node. Note that increasing the number of walks per node will make the execution run for more time.
81
94
-`walk_stop_epsilon: double (default=0.1)` ➡ The probability of stopping when deriving
82
95
the random walk. On average, it will create walks of length `1 /
83
96
walk_stop_epsilon`.
@@ -93,7 +106,7 @@ The procedure calculates PageRank for the nodes in the graph.
description: Explore key features, such as community detection, node embeddings, and graph neural networks, alongside integrations with popular AI libraries like LangChain and LlamaIndex, to create powerful, data-driven GenAI solutions.
4
+
---
5
+
6
+
import { Card, Cards } from'nextra/components'
7
+
import { Callout } from'nextra/components'
8
+
9
+
# Memgraph's AI Ecosystem
10
+
11
+
To learn about Memgraph's key features to build AI apps, explore the following
0 commit comments