AWS Security ChangesHomeSearch

AWS neptune-analytics documentation change

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

File: neptune-analytics/latest/userguide/closeness-centrality.md

Summary

Fixed typos ('normalizd' to 'normalized', 'examples' to 'example') and improved warning about unrestricted MATCH(n) clauses by adding missing 'in' (from 'result a' to 'result in a')

Security assessment

The changes are grammatical corrections and query performance warnings. The warning about MATCH(n) clauses focuses on preventing long-running queries through better query practices, but doesn't explicitly reference security implications like DoS vulnerabilities.

Diff

diff --git a/neptune-analytics/latest/userguide/closeness-centrality.md b/neptune-analytics/latest/userguide/closeness-centrality.md
index fe65cfb8a..d2eebc396 100644
--- a//neptune-analytics/latest/userguide/closeness-centrality.md
+++ b//neptune-analytics/latest/userguide/closeness-centrality.md
@@ -56 +56 @@ You can use this field to turn off normalization, which is on by default. Withou
-The CC is normalizd using the Wasserman-Faust normalization formula for unconnected graphs. If there are `n` vertices reachable from vertex `u` (including vertex `u` itself), the Wasserman-Faust normalized closeness centrality score of vertex `u` is calculated as follows:
+The CC is normalized using the Wasserman-Faust normalization formula for unconnected graphs. If there are `n` vertices reachable from vertex `u` (including vertex `u` itself), the Wasserman-Faust normalized closeness centrality score of vertex `u` is calculated as follows:
@@ -129 +129 @@ This is a query integration example, where `.closenessCentrality.mutate` follows
-This is a query integration examples that returns the nodes with the 10 highest CC scores:
+This is a query integration example that returns the nodes with the 10 highest CC scores:
@@ -146 +146 @@ This is a query integration examples that returns the nodes with the 10 highest
-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.