Since full hierarchical processing is a very important capability of SQLfX’s operation, it is important to know that the full nonlinear hierarchical processing used in our product and described in our documentation is not new or unproven. Over three decades ago, before the advent of relational processing, full nonlinear hierarchical processing and querying was heavily in use, very successful, and accurately performed. This means that its natural full hierarchical principles have already been discovered, tested and proven out.
The advent of relational processing with its data independence pushed inflexible fixed hierarchical data structures and their processing to the background. Today after three decades hierarchical structures have been resurrected because of the advent of XML and its popularity. But with full hierarchical processing having been forgotten about and the continued popularity of relational processing this has had the effect of limiting hierarchical processing to single linear legs keeping it close to relational processing's operartion. But Advanced Data Access Technologies, Inc. has seamlessly opened the door again to full hierarchical processing by utilizing ANSI SQL’s little known inherent hierarchical processing capability to seamlessly integrate relational and XML data at a full hierarchical level that is still performed naturally by ANSI SQL.
With ANSI SQL operating fully hierarchically, we determined that the same hierarchical principles and processing now naturally possible in relational processing are the same hierarchically proven principles and processing in use three decade ago. So the hierarchical processing produced in the relational processing described in this proposal has been previously used, tested, and proven out. This site covers these full hierarchical structure and processing rules.