http://rdf.ncbi.nlm.nih.gov/pubchem/patent/EP-2367122-A1
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_07ccf7ecd5703ac78a6b999e2d0aca0d |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2246 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24566 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
| filingDate | 2011-02-15-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_13972b9753b28a9169076dc60cb8a980 |
| publicationDate | 2011-09-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | EP-2367122-A1 |
| titleOfInvention | Method of structuring hierarchical data in relational databases |
| abstract | The invention relates to a method of structuring, in an ordered tree of predetermined depth P ', data respecting predetermined criteria Fs and organized in the form of an acyclic oriented graph of depth P which comprises nodes and links between these nodes, these nodes and links being stored by type in tables of a relational DBMS able to be interrogated 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, characterized in that it comprises the following steps: a) creation of a "CACHE" table in the RDBMS, b) determination by the RDBMS of a set E, b) running an iteration having an identifier id and / or properties which comprises the following substeps: i) determination by the RDBMS of the set S of the children of the nodes of E respecting the criteria Fs, ii) insertion by the RDBMS of the nodes of the set S and their respective indexes in the table "CACHE", iii) determination by the application server of criteria Fe as a function of the depth P ', the identifier id and / or properties of the iteration, iv) determination by the RDBMS of the set E by applying the criteria Fe to all the nodes in the table "CACHE", v) P '= P'-1, repeat steps i, ii, iii, iv and v while P'> 0 and S ≠ ∅, c) sending by the RDBMS to the application server an end of processing information with the number of nodes loaded in the "CACHE" table and an access identifier to the "CACHE" table. |
| priorityDate | 2010-02-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 16.