This article describes the [[Storage Layout]] of the main database table.
==Node Table==
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>
$ basex -c"create db db <xml>HiThere</xml>" -c"info storage"
PRE DIS SIZ ATS ID NS KIND CONTENT
-----------------------------------------
0 1 3 1 0 0 DOC db.xml
1 1 2 1 1 0 ELEM xml
2 1 1 1 2 0 TEXT HiThere
</pre>
===PRE Value===
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.
===ID Value===
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>
$ basex -c"create db db <xml>HiThere</xml>" -q"insert node <b/> before /xml" -c"info storage"
PRE DIS SIZ ATS ID NS KIND CONTENT
-----------------------------------------
0 1 4 1 0 0 DOC db.xml
1 1 1 1 3 0 ELEM b
2 2 2 1 1 0 ELEM xml
3 1 1 1 2 0 TEXT HiThere
</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: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==
BaseX logically splits the {{Code|tbl.basex}} file into blocks with length 4096 bytes, i.e. each block can have max 256 records each with length 16 bytes. The records within a block are sorted by their pre value (which, therefore, can be implicitly determined and need not be saved).