@@ -17,17 +17,16 @@ informed and prepared.
1717New releases might affect your existing code, queries or configuration.
1818Ensure they're updated to align with the latest updates and changes.
1919
20-
2120### Upgrading to Memgraph v2.21.0 breaking change
2221
2322<Callout type = " error" >
2423
25- Coordinator log store directory in ` --data-directory ` needs to be started from scratch since new type of Raft log is added and some old ones
26- were deleted. Memgraph could crash without deleting old logs from log store directory.
24+ Coordinator log store directory in ` --data-directory ` needs to be started from
25+ scratch since new type of Raft log is added and some old ones were deleted.
26+ Memgraph could crash without deleting old logs from log store directory.
2727
2828</Callout >
2929
30-
3130### Upgrading to Memgraph v2.20.0 breaking change
3231
3332<Callout type = " error" >
@@ -182,9 +181,9 @@ Memgraph (v2.11.1 and lower).
182181- Added planner optimization to replace ` point.distance ` filter with an index
183182 scan. Queries like `WITH point({ x :0 ,y :0 } ) AS a MATCH (m:L1) WHERE
184183 point.distance(m.prop, a) < 1 RETURN m;`, should run faster if there is the
185- point index created. If you are dealing with spatial data, there is a high
186- chance you need such indexes to run your queries faster.
187- [ #2362 ] ( https://github.com/memgraph/memgraph/pull/2362 )
184+ [ point index] ( /fundamentals/indexes#point-index ) created. If you are dealing
185+ with spatial data, there is a high chance you need such indexes to run your
186+ queries faster. [ #2362 ] ( https://github.com/memgraph/memgraph/pull/2362 )
188187- Significantly improved schema retrieval performance in both TRANSACTIONAL and
189188 ANALYTICAL setups. Feel free to use ` --schema-info-enabled=True ` to get
190189 schema instantly by running the ` SHOW SCHEMA INFO; ` query.
@@ -254,11 +253,12 @@ labeled with `jepsen`).
254253
255254{ <h3 > New features and improvements </h3 >}
256255
257- - Added Leiden algorithm. The implementation is "static" in a sense that it's
258- operating on the whole graph. Leiden is a modern community detection
259- algorithm that in Memgraph's implementation provides hierarchies of
260- communities. A big use-cases for Leiden community detection is
261- [ GraphRAG] ( /ai-ecosystem/graph-rag ) .
256+ - Added [ Leiden
257+ algorithm] ( /advanced-algorithms/available-algorithms/leiden_community_detection ) .
258+ The implementation is "static" in a sense that it's operating on the whole
259+ graph. Leiden is a modern community detection algorithm that in Memgraph's
260+ implementation provides hierarchies of communities. A big use-cases for
261+ Leiden community detection is [ GraphRAG] ( /ai-ecosystem/graph-rag ) .
262262 [ #508 ] ( https://github.com/memgraph/mage/pull/508 )
263263
264264## Memgraph v2.20.1 - Oct 10, 2024
0 commit comments