Hawkin
/
arangodb
mirror of https://gitee.com/bigwinds/arangodb
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Fix more dead links.

This commit is contained in:
Wilfried Goesgens 2016-06-14 17:13:28 +02:00
parent 8a1ca88fc5
commit 1b826e9292
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Documentation/Books/Manual/GettingStarted/Authentication.mdpp
View File

@ -7,7 +7,7 @@ all databases.
You should create a database for your application together with a
user that has access rights to this database. See
[Managing Users](../Administration/ManagingUsers/index.html).
[Managing Users](../Administration/ManagingUsers.md).
Use the *arangosh* to create a new database and user.

2
Documentation/Books/Manual/Graphs/README.mdpp
View File

@ -45,7 +45,7 @@ so if you delete documents from your vertex collections directly, the edges poin
!SUBSECTION Anonymous graphs
Sometimes you may not need all the powers of named graphs, but some of its bits may be valuable to you.
You [may use AQL Graph Functions](../../AQL/Graphs/Functions.html) that are a little deeper explained in the [traversals](Traversals/README.md) and the [Working with Edges](Edges/README.md) chapter.
You may use anonymous graphs in the [traversals](Traversals/README.md) and in the [Working with Edges](Edges/README.md) chapter.
Anonymous graphs don't have *edge definitions* describing which *vertex collection* is connected by which *edge collection*. The graph model has to be maintained in the client side code.
This gives you more freedom than the strict *named graphs*.

4
Documentation/DocuBlocks/Rest/AQL/JSF_post_api_explain.md
View File

@ -62,7 +62,7 @@ is set to *true*.
Each plan in the result is a JSON object with the following attributes:
- *nodes*: the array of execution nodes of the plan. The array of available node types
can be found [here](../../AQL/Optimizer.html)
can be found [here](../../AQL/ExecutionAndPerformance/Optimizer.html)
- *estimatedCost*: the total estimated cost for the plan. If there are multiple
plans, the optimizer will choose the plan with the lowest total cost.
@ -70,7 +70,7 @@ Each plan in the result is a JSON object with the following attributes:
- *collections*: an array of collections used in the query
- *rules*: an array of rules the optimizer applied. An overview of the
available rules can be found [here](../../AQL/Optimizer.html)
available rules can be found [here](../../AQL/ExecutionAndPerformance/Optimizer.html)
- *variables*: array of variables used in the query (note: this may contain
internal variables created by the optimizer)