METHOD FOR CONTROLLING A RELATIONAL DATABASE SYSTEM

• US 20100250520A1
• Filed: 06/07/2010
• Published: 09/30/2010
• Est. Priority Date: 07/11/2006
• Status: Active Grant

• Current Assignee: Mediareif Moestl & REIF Kommunikations-Und Informationstechnologien OEG
• Original Assignee: Mediareif Moestl & REIF Kommunikations-Und Informationstechnologien OEG
• Inventors: Möstl, Matthias
• Granted Patent: US 8,296,313 B2
• Time in Patent Office: Days
• US Class Current: 707/718
• CPC Class Codes: G06F 16/2433 Query languages

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.

Claims

1. A method for controlling a relational database system, wherein a query statement consisting of keywords is first analyzed by applying a recursive transition network (RTN) and by allocating process-related properties to the keywords or group of keywords in the order given by the statement after which follows a conversion into control commands and optionally an optimization,

characterized in that

the RTN is formed of independent RTN building blocks, wherein 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,

wherein the decision paths at least partly have a recursive call function on at least one of the decision positions through which one of the RTN building blocks is run as a result of applying the selection step to all of the RTN building blocks, so that any frequently recursively nested execution of the selection step starting from the at least one of the decision positions is made possible,

and in that an access plan for the relational database system is generated from the order of the RTN building blocks and their nesting as a result of the application of the selection steps on all keywords.

2. The method according to claim 1, characterized in that, when the decision graph of the RTN building blocks is run at the decision positions, the keywords of the query statements are compared, depending on the associated mark, either with a text, a symbol, a variable or a number or an RTN building block is inserted from all of the RTN building blocks, which in turn is again run.

3. The method according to claim 1 or 2, characterized in that in the decision graphs of the RTN building blocks those decision positions at which a not predeterminable, unlimited number of consecutive calls of recursive call functions is carried out, are prefixed at least one decision position that demands a keyword (text, symbol, variable or numeral) and are followed by at least one decision position, also demanding a keyword.

4. The method according to one of the previous claims 1-2, characterized in that each RTN building block returns, after a complete run of a decision graph as a result of at least one processing function defined for the respective RTN building block depending on at least a processing input set, a processing output set with at least one value including ZERO, wherein the order of the values within these sets is stored and each obtained processing output set can be allocated to each RTN building block as one of the processing input sets.

5. The method according to one of the previous claims 1-2, characterized in that each RTN building block has at least one first weighting by which the nesting of the RTN building blocks is changed into a nesting which can be used for a further processing during each selection step or after having executed all selection steps, by superordinating RTN building blocks of a higher first weighting to the respective, originally superordinated RTN building blocks which have a comparably lower first weighting.

6. The method according to claim 5, characterized in that the first weighting of all RTN building blocks of the first generic group depends on RTN building blocks of the second generic group which are directly superordinated in the statement, which is why the first weighting that is allocated to the RTN building blocks of the first generic group is described as the initial weighting.

7. The method according to claim 6, characterized in that the RTN building blocks of the first generic group have an identical first initial weighting, preferably of an average height, and these RTN building blocks, when being introduced into RTN building blocks of the second generic group, take on their first weighting which is decreased by a single value, preferably by one.

8. The method according to claim 5, characterized in that those RTN building blocks of the second generic group which apply their processing function to the processing output set of a processing function of an RTN building block of the first or second generic group, form a first generic subgroup of the second generic group, and each has the same first weighting which is not the highest possible weighting but higher than the first initial average height weighting of the RTN building blocks of the first generic group.

9. The method according to claim 5, characterized in that those RTN building blocks of the second generic group the processing output set of which is taken as processing input set for other RTN building blocks of the first or second generic group, form a second generic subgroup of the second generic group and have a respectively different first weighting which in any case is smaller than the first initial average height weighting of the RTN building blocks of the first generic group, and the first weighting for the respective RTN building blocks individually describes the predeterminable order of the processing with regard to the RTN building blocks of the second generic subgroup of the second generic group by allocating, in each case, a lower first weighting to the respectively first to execute RTN building block of this group.

10. The method according to claim 5, characterized in that all RTN building blocks of the first and second generic group which, after a decision position that prescribes the introduction of at least one RTN building block from the first generic group, are followed by at least one further decision position, independent of the last, optional decision position that is optionally present after the conversion step and prescribes the introduction of an RTN building block from the second generic group, have a second, fixed weighting with the highest possible weighting height.

11. The method according to claim 10, characterized in that the first weighting of each RTN building block of the second generic group in the nesting order resulting from the query statement after the conversion step is compared with the first weighting of each superordinated RTN building block until the respective RTN building block of a higher first weighting or the respective superordinated RTN building block which is not located at its last decision position and has a second weighting of the highest possible weighting, is reached and that, accordingly, this determined nesting order of the RTN building block, acting as the basis for the comparison, is directly subordinated to the reached RTN building block and thus superordinated to all RTN building blocks which were skipped in the comparisons and had been superordinated before.

12. The method according to claim 5, characterized in that RTN building blocks of the first generic group are subordinated to the RTN building block of the first or second generic group which is directly superordinated to them, independent of their own first weighting and of the first weighting of the RTN building blocks superordinated to them.

13. The method according to claim 5, characterized in that, if the RTN building block of the second generic group which is to be compared has the same first weighting as one of the superordinated RTN building blocks also of the second generic subgroup, the RTN building block which needs to be compared is directly subordinated to this RTN building block if and only if these RTN building blocks are RTN building blocks of the second generic subgroup of the second generic group.

14. The method according to claim 5, characterized in that, if the RTN building block of the second generic group which is to be compared with one of the superordinated RTN building blocks that are also of the second generic subgroup has the same first weighting, the comparison with the superordinated RTN building blocks is continued as long as these RTN building blocks are RTN building blocks of the first generic subgroup of the second generic group.

15. The method according to claim 10, characterized in that the RTN building blocks of the first generic group which are predetermined to be subordinated to the RTN building blocks of the second generic group when the RTN building blocks of the first generic group are directly introduced in one of the decision positions at which one from all of the RTN building blocks is introducible, with the RTN building block having a second highest possible weighting height, are allocated a second weighting of minimum weighting height, and in that the RTN building blocks of the first generic group which have no second weighting of minimum height, in such cases, are not subordinated to RTN building blocks of the second generic group.

16. The method according to claim 10, characterized in that all RTN building blocks of the first and second generic group are allocated at least one RTN building block which is and are, respectively, to be superordinated when the RTN building blocks of the first and second generic group are directly introduced in a decision position of an RTN building block with the highest possible second weighting at which one from all of the RTN building blocks can be introduced.

17. The method according to one of the previous claims 1-2, characterized in that the RTN building blocks which are nested according to their order in the statement and according to their weighting and are allocated certain RTN building block groups, are each converted in engine interface elements, with one engine interface element having a record of independent components that can be set according to the processing step.

18. A relational database system comprising at least a computer system with at least a relational database, at least a data processing unit and at least a memory, characterized in that the data processing unit is programmatically set up in such a way that it works according to the aforementioned method according to any one of the claims 1 to 2.

19. The relational database system according to claim 18, characterized in that it has means to read into the memory a database statement or database statements given in a database language to control the relational database system of a data carrier or electronic carrier signal.

20. A data carrier or electronic carrier signal with a data base statement or database statements given in a database language to control and read into a relational database system according to claim 19,

characterized in that

the database statement or database statements present on the data carrier or the carrier signal comprise the information of an RTN that is formed of independent RTN building blocks,

wherein 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 having 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,

wherein the decision paths at least partly have a recursive call function on at least one of the decision positions through which one of the RTN building blocks is run as a result of applying the selection step to all RTN building blocks, so that any frequently recursively nested execution of the selection step starting from the at least one of the decision positions is made possible,

wherein at least one part of the decision paths has a recursive call function on at least one of the decision positions through which one of the RTN building blocks is run as a result of applying the selection step to all RTN building blocks so that any frequently recursively nested execution of the selection step starting from the at least one of the decision positions is made possible,

and in that an access plan for the relational database system is generated from the order of the RTN building blocks and their nesting as a result of the application of the selection steps to all keywords of the query statement.

21. A computer program having instructions that are adjusted to carry out the method according to any one of claims 1 to 2.

22. A computer program product having a computer-readable medium with computer program code means where a computer is prompted by the program to carry out the method each time after having loaded the computer program according to any one of claims 1 to 2.

23. A computer program product having a computer program on an electronic carrier signal where each time after the loading of the computer program a computer is prompted by the program to carry out the inventive method according to any one of claims 1 to 2.