Changes

Currently, the following index structures exist in BaseX:

: All element and attribute names are automatically indexed and enriched with statistical information.

: Unique paths in a document or collection are referenced by the path index, which is applied e.g. to rewrite descendant to more specific child steps.

: This index caches references to all document nodes in a database. It provides fast access to single documents in large database instances.

: This index speeds up equality tests and simple range queries on text nodes in XPath location steps with predicates.

: This index speeds up equality tests and simple range queries on attribute value in XPath location steps with predicates.

: This index speeds up queries using the {{Mono|contains text}} keyword. Internally, BaseX handles two different index structures: the default index sorts all keys alphabetically by their character length. It is particularly fast if fuzzy searches are performed. The second index is a compressed trie structure, which needs slightly more memory, but is specialized on wildcard searches.