diff --git a/pages/release-notes.mdx b/pages/release-notes.mdx
index eb6c1fef1..b44f7ff59 100644
--- a/pages/release-notes.mdx
+++ b/pages/release-notes.mdx
@@ -46,6 +46,41 @@ guide.
## 🚀 Latest release
+### Memgraph v3.15.0 - December 2nd, 2026
+
+{
🐞 Bug fixes
}
+
+- A query that pairs one pattern with another whose own variables are
+ compared to each other, such as
+ `MATCH (x:Label) MATCH (a)-->(b) WHERE a.v = b.v`, returns the matching
+ rows instead of an empty result.
+ [#5169](https://github.com/memgraph/memgraph/pull/5169)
+- A map literal that reads two or more properties of the same variable, such
+ as `[x IN nodes(p) | {id: x.id, name: x.name}]`, returns each node's own
+ properties instead of repeating the first node's. The same applies to such
+ map literals in `WHERE`, in `ORDER BY`, and in the filter and weight lambdas
+ of variable-length, BFS and weighted shortest path expansions.
+ [#5181](https://github.com/memgraph/memgraph/pull/5181)
+
+{🛠️ Improvements
}
+
+- Traversing the relationships of a node with a very high degree (a
+ supernode) uses much less memory while the query runs. Results are
+ unchanged, including the order relationships come back in.
+ [#5154](https://github.com/memgraph/memgraph/pull/5154)
+- A `RETURN` or `WITH` that sorts and limits evaluates its projected
+ expressions only for the rows it returns, so a costly expression no longer
+ runs for rows the `LIMIT` discards. Building a string with `reduce` no
+ longer slows down sharply as the list grows. An expression that would fail
+ only on a row that `SKIP` or `LIMIT` discards no longer raises an error.
+ [#5161](https://github.com/memgraph/memgraph/pull/5161)
+
+### Lab v3.15.0 - December 2nd, 2026
+
+
+
+## Previous releases
+
### Memgraph v3.14.0 - October 21st, 2026
{⚠️ Breaking changes
}
@@ -460,8 +495,6 @@ guide.
-## Previous releases
-
### Memgraph v3.13.2 - October 9th, 2026
{🐞 Bug fixes
}