Page History

...

A standard sort order is very useful to enable fast matching of identical expressions though it has no impact to semantics and is not essential for general purpose use.
Each axiom is a serialization of a tree structure that can be traversed by nodes in the following order:

1. Nodes Node that are is either a SNOMED CT concept ID , or a value a value of type data property. These nodes are sorted in UTF-8 byte-order (as a sequence of bytes) rather than numbers or strings. The byte-order compares two bytes; one from each sequence, until the values of the bytes are different. Then, the ID or value with the lowest byte value would be sorted as first regardless the length difference of byte arrays;
2. The composite node ObjectSomeValuesFrom(), sorting order by concept id of attribute and then value;
3. The composite node DataHasValue(), sorting order by concept id of attribute and then value.

...