The wsort BASIC program is a simulation of the sort command that additionally exploits B-tree indexes. For example:
|
sort entity by name |
In this example, only one attribute is specified. If there happens to be an index defined on the attribute referenced by name, the response is practically immediate, since it can fetch the presorted B-tree for the requested list. If it were to contain a more complex expression, such as:
|
sort entity by zip by name |
Again, assuming that indexes are defined on both the zip and name field, AQL processes the sentence as though the indexes were not even there.
In some rare cases, wsort may be faster than the sort command.
In addition, AQL does not use the indexes if any ^ or [ and ] characters are present in the sentence.
Example(s)
|
wsort entity by zip by name with name "a]" |
See Also