Node Storage - Revision history

CG: Text replacement - "db:pre" to "db:get"

2022-07-20T11:44:13Z

Text replacement - "db:pre" to "db:get"

CG: Text replacement - "db:open" to "db:pre"

2022-07-19T18:54:55Z

Text replacement - "db:open" to "db:pre"

CG at 18:32, 18 July 2022

2022-07-18T18:32:09Z

CG at 10:13, 15 February 2021

2021-02-15T10:13:36Z

CG at 10:13, 15 February 2021

2021-02-15T10:13:16Z

CG at 13:01, 27 February 2020

2020-02-27T13:01:10Z

CG at 14:54, 10 April 2019

2019-04-10T14:54:50Z

CG: /* Node Table */

2013-05-20T21:40:43Z

Node Table

CG: /* Node Table */

2013-05-20T21:39:49Z

Node Table

CG: moved Node table storage to Node Storage

2013-05-20T21:33:45Z

moved Node table storage to Node Storage

@@ Line 34: / Line 34: @@
 </pre>
-The {{Function|Database|db:node-pre}} and {{Function|Database|db:node-id}} functions can be called to retrieve the ''pre'' and ''id'' values of a node, and {{Function|Database|db:pre-pre}} and {{Function|Database|db:pre-id}} can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.
+The {{Function|Database|db:node-pre}} and {{Function|Database|db:node-id}} functions can be called to retrieve the ''pre'' and ''id'' values of a node, and {{Function|Database|db:get-pre}} and {{Function|Database|db:get-id}} can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.
 ==Block Storage==

@@ Line 34: / Line 34: @@
 </pre>
-The {{Function|Database|db:node-pre}} and {{Function|Database|db:node-id}} functions can be called to retrieve the ''pre'' and ''id'' values of a node, and {{Function|Database|db:open-pre}} and {{Function|Database|db:open-id}} can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.
+The {{Function|Database|db:node-pre}} and {{Function|Database|db:node-id}} functions can be called to retrieve the ''pre'' and ''id'' values of a node, and {{Function|Database|db:pre-pre}} and {{Function|Database|db:pre-id}} can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.
 ==Block Storage==

@@ Line 3: / Line 3: @@
 ==Node Table==
-BaseX stores all XML nodes in a flat table. The node table of a database can be displayed via the [[Commands#INFO STORAGE|INFO STORAGE]] command:
+BaseX stores all XML nodes in a flat table. The node table of a database can be displayed via the {{Command|INFO STORAGE}} command:
 <pre>
@@ Line 34: / Line 34: @@
 </pre>
-The [[Database Module#db:node-pre|db:node-pre]] and [[Database Module#db:node-id|db:node-id]] functions can be called to retrieve the ''pre'' and ''id'' values of a node, and [[Database Module#db:open-pre|db:open-pre]] and [[Database Module#db:open-id|db:open-id]] can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.
+The {{Function|Database|db:node-pre}} and {{Function|Database|db:node-id}} functions can be called to retrieve the ''pre'' and ''id'' values of a node, and {{Function|Database|db:open-pre}} and {{Function|Database|db:open-id}} can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.
 ==Block Storage==

@@ Line 23: / Line 23: @@
 Each database node has a persistent ''id'' value, which remains valid after update operations, and which is referenced by the [[Indexes#Value Indexes|value indexes]]. As long as no updates are performed on a database, the ''pre'' and ''id'' values are identical. The values will remain to be identical if new nodes are exclusively added to the end of the database. If nodes are deleted or inserted somewhere else, the values will diverge, as shown in the next example:
-<syntaxhighlight>
+<pre>
 $ basex -c"create db db <xml>HiThere</xml>" -q"insert node <b/> before /xml" -c"info storage"
@@ Line 32: / Line 32: @@
     2    2    1   1   0  ELEM  xml
     1    1    1   2   0  TEXT  HiThere
-</syntaxhighlight>
+</pre>
 The [[Database Module#db:node-pre|db:node-pre]] and [[Database Module#db:node-id|db:node-id]] functions can be called to retrieve the ''pre'' and ''id'' values of a node, and [[Database Module#db:open-pre|db:open-pre]] and [[Database Module#db:open-id|db:open-id]] can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If {{Option|UPDINDEX}} is turned on, an additional index will be maintained to speed up the process.

@@ Line 5: / Line 5: @@
 BaseX stores all XML nodes in a flat table. The node table of a database can be displayed via the [[Commands#INFO STORAGE|INFO STORAGE]] command:
-<syntaxhighlight>
+<pre>
 $ basex -c"create db db <xml>HiThere</xml>" -c"info storage"
@@ Line 13: / Line 13: @@
     1    2    1   1   0  ELEM  xml
     1    1    1   2   0  TEXT  HiThere
-</syntaxhighlight>
+</pre>
 ===PRE Value===

@@ Line 15: / Line 15: @@
 </pre>
-{{Code|PRE}}: The ''pre'' value of a node represents the order in which the XML nodes are visited by a SAX parser. It is actually not stored in the database; instead, it is implicitly given by the table position. As a result, it will change whenever a node with a smaller ''pre'' values is added to or deleted from a database.
+===PRE Value===
-{{Code|ID}}: Each database node has a persistent ''id'' value, which remains valid after update operations, and which is referenced by the [[Indexes#Value Indexes|value indexes]]. As long as no updates are performed on a database, the ''pre'' and ''id'' values are identical. The values will remain to be identical if new nodes are exclusively added to the end of the database. If nodes are deleted or inserted somewhere else, the values will diverge, as shown in the next example:
+The ''pre'' value of a node represents the order in which the XML nodes are visited by a SAX parser. It is actually not stored in the database; instead, it is implicitly given by the table position. As a result, it will change whenever a node with a smaller ''pre'' values is added to or deleted from a database.
 <pre>

@@ Line 15: / Line 15: @@
 </pre>
-The ''PRE'' value of a node represents the order in which the XML nodes are visited by a SAX parser. It is actually not stored in the database; instead, it is implicitly given by the table position. As a result, it will change whenever a node with a smaller ''pre'' values is added to or deleted from a database.
+{{Code|PRE}}: The ''pre'' value of a node represents the order in which the XML nodes are visited by a SAX parser. It is actually not stored in the database; instead, it is implicitly given by the table position. As a result, it will change whenever a node with a smaller ''pre'' values is added to or deleted from a database.
-Each database node has a persistent ''ID'' vaule, which remains valid after update operations, and which is referenced by the [[Indexes#Value Indexes|value indexes]]. As long as no updates are performed on a database, the ''PRE'' and ''ID'' values are identical. The values will remain to be identical if new nodes are exclusively added to the end of the database. If nodes are deleted or inserted somewhere else, the values will diverge, as shown in the next example:
+{{Code|ID}}: Each database node has a persistent ''id'' value, which remains valid after update operations, and which is referenced by the [[Indexes#Value Indexes|value indexes]]. As long as no updates are performed on a database, the ''pre'' and ''id'' values are identical. The values will remain to be identical if new nodes are exclusively added to the end of the database. If nodes are deleted or inserted somewhere else, the values will diverge, as shown in the next example:
 <pre>
@@ Line 30: / Line 30: @@
 </pre>
-The [[Database Module#db:node-pre|db:node-pre]] and [[Database Module#db:node-id|db:node-id]] functions can be called to retrieve the ''PRE'' and ''ID'' values of a node, and [[Database Module#db:open-pre|db:open-pre]] and [[Database Module#db:open-id|db:open-id]] can be used to go back and retrieve the original node. By default, ''ID'' lookups are expensive. If the [[Options#UPDINDEX|UPDINDEX]] option is turned on, an additional index will be maintained to speed up the process.
+The [[Database Module#db:node-pre|db:node-pre]] and [[Database Module#db:node-id|db:node-id]] functions can be called to retrieve the ''pre'' and ''id'' values of a node, and [[Database Module#db:open-pre|db:open-pre]] and [[Database Module#db:open-id|db:open-id]] can be used to go back and retrieve the original node. By default, ''id'' lookups are expensive. If the [[Options#UPDINDEX|UPDINDEX]] option is turned on, an additional index will be maintained to speed up the process.
 ==Block Storage==

← Older revision	Revision as of 21:33, 20 May 2013
(No difference)