Abstract: A method for controlling a relational database system, with a query statement comprised of keywords being analyzed, with the RTN being formed of independent RTN building blocks. Each RTN building block has an inner, directed decision graph which is defined independently from the inner, directed decision graphs of the other RTN building blocks with at least one decision position along at least one decision path. The inner decision graphs of all RTN building blocks are run by means of the keywords in a selection step and all possible paths of this decision graph are followed until either no match with the respectively selected path is determined by the decision graph and the process is interrupted, or the respectively chosen path is run until the end.

Abstract: A method for controlling a relational database system, wherein a query statement to be processed, which consists of keywords, is first analyzed by applying a recursive transition network (RTN) and then converted into control commands by the following steps: defining the RTN in a presetting step by forming independent RTN building blocks each having an inner, directed decision graph and optionally at least one recursive call function; forming an RTN building block-independent reference group, the elements of which refer to a residual decision graph with the first decision position removed; carrying out a reference processing step and running the residual decision graphs, which may prescribe the recursive call function; and generating an optimized access plan for the relational database system.

Abstract: A method for controlling a relational database system, with a query statement comprised of keywords being analyzed, with the RTN being formed of independent RTN building blocks. Each RTN building block has an inner, directed decision graph which is defined independently from the inner, directed decision graphs of the other RTN building blocks with at least one decision position along at least one decision path. The inner decision graphs of all RTN building blocks are run by means of the keywords in a selection step and all possible paths of this decision graph are followed until either no match with the respectively selected path is determined by the decision graph and the process is interrupted, or the respectively chosen path is run until the end.

Abstract: A method for controlling a relational database system, with a query statement comprised of keywords being analyzed, with the RTN being formed of independent RTN building blocks. Each RTN building block has an inner, directed decision graph which is defined independently from the inner, directed decision graphs of the other RTN building blocks with at least one decision position along at least one decision path. The inner decision graphs of all RTN building blocks are run by means of the keywords in a selection step and all possible paths of this decision graph are followed until either no match with the respectively selected path is determined by the decision graph and the process is interrupted, or the respectively chosen path is run until the end.

Abstract: A method for controlling a relational database system, wherein a query statement to be processed, which consists of keywords, is first analyzed by applying a recursive transition network (RTN) and then converted into control commands by the following steps: defining the RTN in a presetting step by forming independent RTN building blocks each having an inner, directed decision graph and optionally at least one recursive call function; forming an RTN building block-independent reference group, the elements of which refer to a residual decision graph with the first decision position removed; carrying out a reference processing step and running the residual decision graphs, which may prescribe the recursive call function; and generating an optimized access plan for the relational database system.

Abstract: A method for controlling a relational database system, with a query statement comprised of keywords being analyzed with the RTN being formed of independent RTN building blocks with each RTN building block having an inner, directed decision graph which is defined independently from the inner, directed decision graphs of the other RTN building blocks with at least one decision position along at least one decision path. with the inner decision graphs of all RTN building blocks by means of the keywords being run in a selection step and all possible paths of this decision graph being followed until either no match with the respectively selected path is determined by the decision graph and the process is interrupted or the respectively chosen path is run until the end.