| 20110202570 | Method for structuring hierarchical data in relational databases - In a method for structuring, in an ordered tree of predetermined depth P′, of data complying with predetermined criteria Fs and organized in a directed acyclic graph of depth P which comprises nodes and links between the nodes, the nodes and links stored by type in tables of a relational database which is queried by a query language from an application server connected to a user interface, the criteria Fs being determined on the nodes and/or the links, the method includes: creation of a “CACHE” table in the database; determination by the database of a set E; running of an iteration having an identifier id and/or properties; and transmission by the database to the application server of an end-of-process item of information with the number of nodes loaded into the “CACHE” table and of an identifier for access to the “CACHE” table. The iteration includes: determination by the database of the set S of children of the nodes of E complying with the criteria Fs; insertion by the database of the nodes of the set S and of their respective indices in the “CACHE” table; determination by the application server of criteria Fe as a function of the depth P′, of the identifier id and/or of properties of the iteration; determination by the database of the set E by applying the criteria Fe to all of the nodes in the “CACHE” table; and P′=P′−1. The iteration steps are repeated while P′>0 and S≠Ø. | 08-18-2011 |
