Computation of containment relationships
An example operation may include one or more of detecting, by a blockchain node, an asset aggregation or disaggregation event, performing, by the blockchain node, a single-shot update of an asset containment world-state at an ingestion of the asset aggregation or disaggregation event, determining, by the blockchain node, parent-child duration parameters for each instance of an asset parent-child association defined by the asset containment world-state, and executing a linear-time algorithm to calculate supply-chain metrics based on all combinations of the asset aggregation or disaggregation orderings based on the parent-child duration parameters.
1. A system, comprising:
a processor;
a memory on which are stored machine readable instructions that when executed by the processor, cause the processor to:
detect an asset aggregation or disaggregation event;
perform a single-shot update of an asset containment world-state at an ingestion of the asset aggregation or disaggregation event;
determine parent-child duration parameters for each instance of an asset parent-child association defined by the asset containment world-state; and
execute a linear-time algorithm to calculate supply-chain metrics based on all combinations of the asset aggregation or disaggregation orderings based on the parent-child duration parameters.
2. The system of claim 1 , wherein the instructions further cause the processor to execute the linear-time algorithm at a query time.
3. The system of claim 1 , wherein the instructions further cause the processor to unroll multiple-levels of the asset containment world-state based on children and to detect parent-child-parent loop errors.
4. The system of claim 1 , wherein the instructions further cause the processor to apply a best-estimate algorithm to account for incomplete asset-related data.
5. The system of claim 4 , wherein the best-estimate algorithm comprises a machine learning algorithm.
6. The system of claim 1 , wherein the instructions further cause the processor to determine the parent-child duration parameters comprising: a start-time, an end-time, a start-time-upper-bound, and an end-time-lower-bound.
7. The system of claim 1 , wherein the instructions further cause the processor to split the calculation of the supply-chain metrics between an ingestion time and a query time.
8. A method, comprising:
detecting, by a blockchain node, an asset aggregation or disaggregation event;
performing, by the blockchain node, a single-shot update of an asset containment world-state at an ingestion of the asset aggregation or disaggregation event;\
determining, by the blockchain node, parent-child duration parameters for each instance of an asset parent-child association defined by the asset containment world-state; and
executing a linear-time algorithm to calculate supply-chain metrics based on all combinations of the asset aggregation or disaggregation orderings based on the parent-child duration parameters.
9. The method of claim 8 , further comprising executing the linear-time algorithm at a query time.
10. The method of claim 8 , further comprising unrolling multiple-levels of the asset containment world-state based on children and detecting parent-child-parent loop errors.
11. The method of claim 8 , further comprising applying a best-estimate algorithm to account for incomplete asset-related data.
12. The method of claim 11 , wherein the best-estimate algorithm comprises a machine learning algorithm.
13. The method of claim 8 , further comprising determining the parent-child duration parameters comprising: a start-time, an end-time, a start-time-upper-bound, and an end-time-lower-bound.
14. The method of claim 8 , further comprising splitting the calculation of the supply-chain metrics between an ingestion time and a query time.
15. A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform:
detecting an asset aggregation or disaggregation event;
executing a single-shot update of an asset containment world-state at an ingestion of the asset aggregation or disaggregation event;
determining parent-child duration parameters for each instance of an asset parent-child association defined by the asset containment world-state; and
executing a linear-time algorithm to calculate supply-chain metrics based on all combinations of the asset aggregation or disaggregation orderings based on the parent-child duration parameters.
16. The non-transitory computer readable medium of claim 15 , further comprising instructions, that when read by the processor, cause the processor to execute the linear-time algorithm at a query time.
17. The non-transitory computer readable medium of claim 15 , further comprising instructions, that when read by the processor, cause the processor to unroll multiple-levels of the asset containment world-state based on children and to detect parent-child-parent loop errors.
18. The non-transitory computer readable medium of claim 15 , further comprising instructions, that when read by the processor, cause the processor to apply a best-estimate algorithm to account for incomplete asset-related data.
19. The non-transitory computer readable medium of claim 15 , further comprising instructions, that when read by the processor, cause the processor to determine the parent-child duration parameters comprising: a start-time, an end-time, a start-time-upper-bound, and an end-time-lower-bound.
20. The non-transitory computer readable medium of claim 15 , further comprising instructions, that when read by the processor, cause the processor to split the calculation of the supply-chain metrics between an ingestion time and a query time.