AWS Security ChangesHomeSearch

AWS neptune-analytics documentation change

Service: neptune-analytics · 2026-03-13 · Documentation low

File: neptune-analytics/latest/userguide/bfs-parents.md

Summary

Fixed typos (inteeger -> integer, Thus -> This, result -> result in) and added a backslash to escape a newline in a query example. Added a warning about using MATCH(n) without restrictions causing long-running queries.

Security assessment

The changes are typographical corrections and minor clarifications. The warning about unrestricted MATCH clauses causing long-running queries is a performance best practice, not a security fix. There is no evidence of addressing a specific security vulnerability.

Diff

diff --git a/neptune-analytics/latest/userguide/bfs-parents.md b/neptune-analytics/latest/userguide/bfs-parents.md
index d079f3843..f70a3bbef 100644
--- a//neptune-analytics/latest/userguide/bfs-parents.md
+++ b//neptune-analytics/latest/userguide/bfs-parents.md
@@ -55 +55 @@ If you provide a node label to filter on then only vertices matching that label
-    * **maxDepth** _(optional)_ – _type:_ positive inteeger or 0 or -1; _default:_ -1.
+    * **maxDepth** _(optional)_ – _type:_ positive integer or 0 or -1; _default:_ -1.
@@ -93 +93 @@ The parents of those traversed nodes.
-Thus is a standalone examples, where the source node list is explicitly provided in the query:
+This is a standalone example, where the source node list is explicitly provided in the query:
@@ -140 +140 @@ This query searches for routes to BFS from BKK, returning the starting node (BKK
-It is not good practice to use `MATCH(n)` without restriction in query integrations. Keep in mind that every node returned by the `MATCH(n)` clause invokes the algorithm once, which can result a very long-running query if a large number of nodes is returned. Use `LIMIT` or put conditions on the `MATCH` clause to restrict its output appropriately.
+It is not good practice to use `MATCH(n)` without restriction in query integrations. Keep in mind that every node returned by the `MATCH(n)` clause invokes the algorithm once, which can result in a very long-running query if a large number of nodes is returned. Use `LIMIT` or put conditions on the `MATCH` clause to restrict its output appropriately.
@@ -152 +152 @@ Here is an example of the output returned by .bfs.parents when run against the [
-                           LIMIT 2"
+                           LIMIT 2" \