Renaming overview.adoc to index (#1353)

lidiazuin · web-flow · commit d41c76892edf · 2025-08-07T15:56:11.000+02:00
diff --git a/modules/ROOT/content-nav.adoc b/modules/ROOT/content-nav.adoc
@@ -105,11 +105,11 @@
 
 * xref:genai-integrations.adoc[]
 * xref:indexes/index.adoc[]
-** xref:indexes/search-performance-indexes/overview.adoc[]
+** xref:indexes/search-performance-indexes/index.adoc[]
 *** xref:indexes/search-performance-indexes/managing-indexes.adoc[]
 *** xref:indexes/search-performance-indexes/using-indexes.adoc[]
 *** xref:indexes/search-performance-indexes/index-hints.adoc[]
-** xref:indexes/semantic-indexes/overview.adoc[]
+** xref:indexes/semantic-indexes/index.adoc[]
 *** xref:indexes/semantic-indexes/full-text-indexes.adoc[]
 *** xref:indexes/semantic-indexes/vector-indexes.adoc[]
 ** xref:indexes/syntax.adoc[]
diff --git a/modules/ROOT/pages/clauses/delete.adoc b/modules/ROOT/pages/clauses/delete.adoc
@@ -142,7 +142,7 @@ DETACH DELETE n
 Deleted 3 nodes, deleted 1 relationship
 ----
 
-`DETACH DELETE` is useful when experimenting with small example datasets, but it is not suitable for deleting large amounts of data, nor does it delete xref:indexes/search-performance-indexes/overview.adoc[indexes] and xref:constraints/index.adoc[constraints].
+`DETACH DELETE` is useful when experimenting with small example datasets, but it is not suitable for deleting large amounts of data, nor does it delete xref:indexes/search-performance-indexes/index.adoc[indexes] and xref:constraints/index.adoc[constraints].
 
 To delete large amounts of data without deleting indexes and constraints, use xref::subqueries/subqueries-in-transactions.adoc#delete-with-call-in-transactions[CALL subqueries in transactions] instead.
 
diff --git a/modules/ROOT/pages/clauses/load-csv.adoc b/modules/ROOT/pages/clauses/load-csv.adoc
@@ -347,7 +347,7 @@ Added 4 nodes, Set 4 properties, Added 4 labels
 
 [NOTE]
 `MERGE` queries using dynamic values may not be as performant as those using static values.
-This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner] uses statically available information when planning queries to determine whether to use an xref:indexes/search-performance-indexes/overview.adoc[index] or not, and this is not possible when using dynamic values.
+This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner] uses statically available information when planning queries to determine whether to use an xref:indexes/search-performance-indexes/index.adoc[index] or not, and this is not possible when using dynamic values.
 For more information, see xref:clauses/merge.adoc#dynamic-merge-caveats[`MERGE` using dynamic node labels and relationship types -> Performance caveats].
 
 === Import compressed CSV files
diff --git a/modules/ROOT/pages/clauses/match.adoc b/modules/ROOT/pages/clauses/match.adoc
@@ -640,7 +640,7 @@ RETURN relationshipType, count(r) AS relationshipCount
 === Performance caveats
 
 `MATCH` queries using dynamic values may not be as performant as those using static values.
-This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner] uses statically available information when planning queries to determine whether to use an xref:indexes/search-performance-indexes/overview.adoc[index] or not, and this is not possible when using dynamic values.
+This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner] uses statically available information when planning queries to determine whether to use an xref:indexes/search-performance-indexes/index.adoc[index] or not, and this is not possible when using dynamic values.
 
 As a result, `MATCH` queries using dynamic values cannot leverage xref:planning-and-tuning/operators/operators-detail.adoc#leaf-operators[index scans or seeks] and must instead use the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-all-nodes-scan[`AllNodesScan`] operator, which reads all nodes from the node store and is therefore more costly.
 
diff --git a/modules/ROOT/pages/clauses/merge.adoc b/modules/ROOT/pages/clauses/merge.adoc
@@ -741,7 +741,7 @@ RETURN greta.name AS name, labels(greta) AS labels, type(rel) AS relType, collec
 === Performance caveats
 
 `MERGE` queries that use dynamic values may not be as performant as those using static values.
-This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner] uses statically available information when planning queries to determine whether to use an xref:indexes/search-performance-indexes/overview.adoc[index] or not, and this is not possible when using dynamic values.
+This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner] uses statically available information when planning queries to determine whether to use an xref:indexes/search-performance-indexes/index.adoc[index] or not, and this is not possible when using dynamic values.
 
 As a result, `MERGE` queries with dynamic values cannot leverage xref:planning-and-tuning/operators/operators-detail.adoc#leaf-operators[index scans or seeks] and must instead use the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-all-nodes-scan[`AllNodesScan`] operator, which reads all nodes from the node store and is therefore more costly.
 
diff --git a/modules/ROOT/pages/indexes/index.adoc b/modules/ROOT/pages/indexes/index.adoc
@@ -9,7 +9,7 @@ Once an index has been created, it will be automatically populated and updated b
 
 Neo4j supports two categories of indexes: 
 
-- xref:indexes/search-performance-indexes/overview.adoc[Search-performance indexes], for speeding up data retrieval based on _exact_ matches.
+- xref:indexes/search-performance-indexes/index.adoc[Search-performance indexes], for speeding up data retrieval based on _exact_ matches.
 This category includes range, text, point, and token lookup indexes.
-- xref:indexes/semantic-indexes/overview.adoc[Semantic indexes], for _approximate_ matches and to compute similarity scores between a query string and the matching data.
+- xref:indexes/semantic-indexes/index.adoc[Semantic indexes], for _approximate_ matches and to compute similarity scores between a query string and the matching data.
 This category includes full-text and vector indexes.
diff --git a/modules/ROOT/pages/indexes/search-performance-indexes/index.adoc b/modules/ROOT/pages/indexes/search-performance-indexes/index.adoc
diff --git a/modules/ROOT/pages/indexes/semantic-indexes/index.adoc b/modules/ROOT/pages/indexes/semantic-indexes/index.adoc
diff --git a/modules/ROOT/pages/queries/basic.adoc b/modules/ROOT/pages/queries/basic.adoc
@@ -902,5 +902,5 @@ DETACH DELETE n
 ----
 
 [NOTE]
-`DETACH DELETE` is not suitable for deleting large amounts of data, nor does it delete xref:indexes/search-performance-indexes/overview.adoc[indexes] and xref:constraints/index.adoc[constraints].
+`DETACH DELETE` is not suitable for deleting large amounts of data, nor does it delete xref:indexes/search-performance-indexes/index.adoc[indexes] and xref:constraints/index.adoc[constraints].
 For more information, and alternatives to `DETACH DELETE`, see xref:clauses/delete.adoc#delete-all-nodes-and-relationships[`DELETE` -> Delete all nodes and relationships].
