| 摘要 |
<p>The present invention allows to store in a parallel way branches and nodes of a hierarchy into a database by creating queues (Q0, Q1, Q2). Each Queue has a status (RUNNING, WAIT, FULL) and a unlock item indicating if a superior node has already been stored. A process (P2) looks up this indicators and performs according to commands received from a first process (P1) control of the queues (Q0, Q1, Q2).</p> |
