pass htmltest - no internal link error

Author: raphael-istari

content/deploy/admin/dgraph-administration.md

@@ -142,7 +142,7 @@ To fully secure alter operations in the cluster, the authentication token must b
 As an `Administrator` you might want to export data from Dgraph to:
 
 * backup your data
-* move the data from Dgraph Cloud instance to another Dgraph instance, or Dgraph Cloud instance
+* move the data to another Dgraph instance
 * share your data
 
 For more information about exporting your database, see [Export data]({{< relref "export-data.md" >}})
@@ -268,4 +268,4 @@ as backup and restore are cluster-wide operations and a single namespace cannot
 
 ## Post Installation
 
-Now that Dgraph is up and running, to understand how to add and query data to Dgraph, follow [Query Language Spec](/query-language). 
+Now that Dgraph is up and running, to understand how to add and query data to Dgraph, follow [Query Language Spec]({{< relref "dql-query">}}). 

content/deploy/installation/kubernetes/ha-cluster.md

@@ -329,7 +329,7 @@ upgrade the configuration in multiple steps.
 
 [helm-upgrade]: https://helm.sh/docs/helm/helm_upgrade/
 
-To upgrade to an [HA cluster setup]({{< relref "#ha-cluster-setup-using-kubernetes" >}}): 
+To upgrade to an HA cluster setup: 
 
 1. Ensure that the shard replication setting is more than one and `zero.shardReplicaCount`. For example, set the shard replica flag on the Zero node group to 3,`zero.shardReplicaCount=3`.
 2. Run the Helm upgrade command to restart the Zero node group:

content/deploy/installation/production-checklist.md

@@ -105,7 +105,7 @@ A Dgraph instance is run as a single process from a single static binary. It doe
 
 A backup policy is a predefined, set schedule used to schedule backups of information from business applications. A backup policy helps to ensure data recoverability in the event of accidental data deletion, data corruption, or a system outage.
 
-For Dgraph, backups are created using the [backups feature]({{< relref "/enterprise-features/binary-backups" >}}). You can also create full exports of your data and schema using [data exports]({{< relref "dgraph-administration.md#exporting-database" >}}).
+For Dgraph, backups are created using the [backups feature]({{< relref "/enterprise-features/binary-backups" >}}). You can also create full exports of your data and schema using [data exports]({{< relref "dgraph-administration.md#export-database" >}}).
 
 We **strongly** recommend that you have a backup policy in place before moving your application to the production phase, and we also suggest that you have a backup policy even for pre-production apps supported by Dgraph database instances running in development, staging, QA or pre-production clusters.
 

content/deploy/installation/single-host-setup.md

@@ -63,7 +63,7 @@ The command should return basic cluster information:
 ```
 
 ### Connect Ratel
-Ratel is a web-based UI dashboard for interacting with Dgraph using Dgraph's query language, [DQL]({{<relref "/dgraph-glossary#DQ">}}).
+Ratel is a web-based UI dashboard for interacting with Dgraph using Dgraph's query language, [DQL]({{<relref "/dgraph-glossary#dql">}}).
 
 Optionnaly, launch Ratel using the dgraph/ratel docker image :
 

content/design-concepts/relationships-concept.md

@@ -22,7 +22,7 @@ The first represents relations among entities (nodes in graph terminology) and t
 Often, the optional `Label` is omitted, and therefore the N-Quad data is also referred to as "triples." When it is included, it represents which `Tenant` or `Namespace` the data lives in within Dgraph.
 
 {{% notice "tip" %}}Dgraph can automatically generate a reverse relation. If the user wants to run
-queries in that direction, they would need to define the [reverse relationship]({{< relref "dql-schema.md#reverse-edges" >}})
+queries in that direction, they would need to define the [reverse relationship]({{< relref "dql-schema.md#reverse-predicates" >}})
 {{% /notice %}}
 
 For `Relationships`, the subject and object are represented as 64-bit numeric UIDs and the relationship name itself links them: <subjectUID> <relationshipName> <objectUID>.

content/dgraph-glossary.md

@@ -67,7 +67,7 @@ A relationship is  a named, directed link relating one [node](#node) to another.
 Sharding is a database architecture pattern to achieve horizontal scale by distributing data among many servers. Dgraph shards data per relationship, so all data for one relationship form a single shard, and are stored on one (group of) servers, an approach referred to as 'predicate-based sharding'.
 
 ### Triple ###
-Because RDF statements consist of three elements: <subject> <predicate> <object>, they are called triples. A triple represents a single atomic statement about a node. The object in an RDF triple can be a literal value or can point to another node. See [DQL RDF Syntax](/dql/dql-syntax/dql-rdf) for more details.
+Because RDF statements consist of three elements: <subject> <predicate> <object>, they are called triples. A triple represents a single atomic statement about a node. The object in an RDF triple can be a literal value or can point to another node. See [DQL RDF Syntax]({{< relref "dql-rdf">}}) for more details.
 - when we store that a node name is "Alice". The predicate is ``name`` and predicate value is the string "Alice". The string becomes a node property.
 - when we store that Alice knows Bob, we may use a predicate ``knows`` with the node representing Alice. The value of this predicate would be the [uid](#uid) of the node representing Bob. In that case, ``knows`` is a [relationship](#relationship).
 

content/dql/dql-get-started.md

@@ -170,7 +170,7 @@ In these five steps, you set up Dgraph, added some data, visualized it as a grap
 
 - A wider range of queries can also be found in the
 [Query Language]({{< relref "dql-query.md" >}}) reference.
-- Go to [Clients](/dql/clients/) to see how to
+- Go to [Clients]({{< relref "clients">}}) to see how to
 communicate with Dgraph from your application.
 
 ## Need Help

content/dql/dql-schema.md

@@ -62,7 +62,7 @@ When you deploy a [GraphQL API schema]({{< relref "graphql">}}), Dgraph generate
 Refer to [GraphQL and DQL schemas]({{< relref "graphql-dql-schema">}}) in the [GraphQL - DQL interoperability]({{< relref "graphql-dql">}}) section for use cases using both approaches.
 {{% /notice %}}
 
-For example, you can run the following mutation (using the [RDF](/dql/dql-syntax/dql-rdf/) notation):
+For example, you can run the following mutation (using the [RDF]({{< relref "dql-rdf">}}) notation):
 ```graphql
 {
   set {
@@ -227,7 +227,7 @@ email: string @unique @index(exact)  .
 ### Upsert directive
 
 
-To use [upsert operations](/howto/upserts/) on a predicate, specify the `@upsert` directive in the schema.
+To use [upsert operations]({{< relref "upserts" >}}) on a predicate, specify the `@upsert` directive in the schema.
 
 When committing transactions involving predicates with the `@upsert` directive, Dgraph checks index keys for conflicts, helping to enforce uniqueness constraints when running concurrent upserts.
 
@@ -251,7 +251,7 @@ email: string @index(exact) @noconflict .
 ### Predicate types from RDF Types
 
 As well as implying a schema type for a first mutation, an RDF type can override a schema type for storage.
-Dgraph supports a number of [RDF](/dql/dql-syntax/dql-rdf/) types.
+Dgraph supports a number of [RDF]({{< relref "dql-rdf">}}) types.
 
 If a predicate has a schema type and a mutation has an RDF type with a different underlying Dgraph type, the convertibility to schema type is checked, and an error is thrown if they are incompatible, but the value is stored in the RDF type's corresponding Dgraph type.  Query results are always returned in schema type.
 
@@ -421,7 +421,7 @@ Node types are optional, but there are two use cases where actually knowing the
 
 The Dgraph node types are used in those 2 use cases: when executing the `delete all predicates` mutation or the `expand all` query, Dgraph will check if the node has a ``dgraph.type`` predicate. If so, the engine is using the declared type to find the list of predicates and apply the delete or the expand on all of them.
 
-When nodes have a type (i.e have a `dgraph.type` predicate), then you can use the function [type()](/dql/dql-syntax/dql-query/#node-criteria-used-by-root-function-or-by-filter) in queries.
+When nodes have a type (i.e have a `dgraph.type` predicate), then you can use the function [type()]({{< relref "functions.md#type" >}}) in queries.
 
 {{% notice "warning" %}}
 `delete { <uid> * * . }` will only delete the predicates declared in the type. You may have added other predicates by running DQL mutation on this node: the node may still exist after the operation if it holds predicates not declared in the node type. `<>`

content/enterprise-features/access-control-lists.md

@@ -523,7 +523,7 @@ mutation {
 }
 ```
 
-In case you have [reverse edges]({{< relref "dql-schema.md#reverse-edges" >}}), they have to be given the permission to the group as well
+In case you have [reverse edges]({{< relref "dql-schema.md#reverse-predicates" >}}), they have to be given the permission to the group as well
 
 ```graphql
 mutation {

content/enterprise-features/binary-backups.md

@@ -15,7 +15,7 @@ Binary backups are full backups of Dgraph that are backed up directly to cloud
 storage such as Amazon S3 or any Minio storage backend. Backups can also be
 saved to an on-premise network file system shared by all Alpha servers. These
 backups can be used to restore a new Dgraph cluster to the previous state from
-the backup. Unlike [exports]({{< relref "dgraph-administration.md#exporting-database" >}}),
+the backup. Unlike [exports]({{< relref "dgraph-administration.md#export-database" >}}),
 binary backups are Dgraph-specific and can be used to restore a cluster quickly.