Method of generating hierarchical data structure

A server configured to generate a multi-level hierarchical data tree structure, the hierarchical data structure having at least a first level, a second level, and a leaf level, the server comprising non-transient storage medium for storing computer-executable instructions, which instructions when executed are configured to render the server operable to:

• identify a plurality of data elements to be searched, the plurality of data elements having a set of descriptors, each descriptor within the set of descriptors being associated with a data type being different from data types of other descriptors within the set of descriptors;
• define the multi-level hierarchical data tree structure for storing elements of the plurality of data elements of the same type, the plurality of data elements having a common root, the first level accommodating a parent node, the second level accommodating a first child node and a second child node both dependent from the parent node, and the leaf level accommodating a first leaf node and second leaf node each dependent of the respective first child node and the second child node;
• the parent node for storing a first descriptor from the set of descriptors, the first descriptor associated with one or more data elements of the plurality of data elements, the descriptor being of a first data type;
• each of the first child node and the second child node for storing a respective second descriptor of the respective one of the one or more data elements;
• the respective second descriptor being of the same second data type, the same second data type being different from the first data type;
• each of the first leaf node and second leaf node for storing a respective statistical snapshot, each of the first and second leaf node comprising a plurality of third descriptors of different third data types being different from the first and second data type, the third data type being at least one of:
• (i) a data element count associated with its respective branch, and (ii) a lowest minimum and highest maximum value associated with the one or more data element stored therein.