How iSAX is constructed

This section is going to describe the way an iSAX index is constructed. All the presented information is based on the research paper that describes iSAX. The logical steps are as follows:

• We begin with a node that is the root of the iSAX index. The root contains no actual data (subsequences) but it contains pointers to all nodes with the specified segments value and a cardinality value of 2, which is a single bit that can only have two values, 0 and 1.
• After that, we construct the children of the root node, which at this initial point are all terminal nodes without any subsequences in them.
• We now begin adding subsequences to the children of the root based on their SAX representation.
• When the threshold value of a terminal node is reached, we perform the splits, based on the specified promotion strategy, and we distribute the subsequences to the two newly created terminal nodes.
• The process goes on until all subsequences have been inserted...