Skip to content

Memgraph v3.15.0 #1855

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
katarinasupe wants to merge 5 commits into
base: main
Choose a base branch
from
Draft

Memgraph v3.15.0 #1855

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
7ffd395
Add Memgraph v3.15.0 and Lab v3.15.0 release note titles
katarinasupe Oct 23, 2026
3b03691
release notes 3.15: add #5154
katarinasupe Oct 23, 2026
0f1e03f
release notes 3.15: add #5161
katarinasupe Oct 23, 2026
0ffec2f
release notes 3.15: add #5169
katarinasupe Oct 23, 2026
b05475e
release notes 3.15: add #5181
katarinasupe Oct 23, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 35 additions & 2 deletions pages/release-notes.mdx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -46,6 +46,41 @@ guide.

## 🚀 Latest release

### Memgraph v3.15.0 - December 2nd, 2026

{<h4 className="custom-header">🐞 Bug fixes</h4>}

- 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)

{<h4 className="custom-header">🛠️ Improvements</h4>}

- 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

<LabReleasesClient version="3.15.0" />

## Previous releases

### Memgraph v3.14.0 - October 21st, 2026

{<h4 className="custom-header">⚠️ Breaking changes</h4>}
Expand Down Expand Up @@ -460,8 +495,6 @@ guide.

<LabReleasesClient version="3.14.0" />

## Previous releases

### Memgraph v3.13.2 - October 9th, 2026

{<h4 className="custom-header">🐞 Bug fixes</h4>}
Expand Down
Loading