External access to database container artifacts
US-2017323112-A1 · Nov 9, 2017 · US
US10776330B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10776330-B2 |
| Application number | US-201715637554-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 29, 2017 |
| Priority date | Jun 29, 2017 |
| Publication date | Sep 15, 2020 |
| Grant date | Sep 15, 2020 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Whether database objects corresponding to an artifact to deploy already exists in a database is determined. Depending artifacts are calculated using a prior-generated dependency graph. Whether any database objects corresponding to the calculated depending artifacts need to be redeployed are determined. Whether a build plugin corresponding to the database objects needing to be redeployed supports a redeployment option is determined. The artifacts are processed according to an execution graph.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for minimizing redeployment, the method being executed using one or more processors and comprising: determining, by the one or more processors, whether database objects corresponding to an artifact to deploy already exist in a database; calculating, by the one or more processors, depending artifacts using a prior-generated dependency graph; processing, by the one or more processors, metadata of each of the database objects in an execution graph that is populated based on the prior-generated dependency graph to determine a validity status of each of the database objects, the validity status comprising an invalidity or a validity that is indicative of that a drop and create protocol is skippable relative to a visibility of each of the database objects in the execution graph; determining, by the one or more processors, that a first database object of a plurality of database objects corresponding to the depending artifacts needs to be redeployed based on the invalidity of the first database object; determining, by the one or more processors, that the drop and create protocol of a second database object of the plurality of database objects is skippable based on the validity of the second database object; determining, by the one or more processors, whether a build plugin corresponding to the first database object needing to be redeployed supports a redeployment option comprising a verification of the validity of the first database object needing to be redeployed; and processing, by the one or more processors, the depending artifacts according to the execution graph. 2. The computer-implemented method of claim 1 , further comprising generating the execution graph associated with the prior-generated dependency graph. 3. The computer-implemented method of claim 1 , further comprising inserting UNDEPLOY and DEPLOY nodes into the execution graph for the artifact or inserting a DEPLOY node into the execution graph for the artifact. 4. The computer-implemented method of claim 1 , further comprising determining whether any artifacts are remaining to be deployed. 5. The computer-implemented method of claim 1 , wherein determining the depending artifacts is performed transitively. 6. The computer-implemented method of claim 1 , further comprising inserting REDEPLOY node into the execution graph for the artifact or inserting an UNDEPLOY and DEPLOY node into the execution graph for the artifact. 7. The computer-implemented method of claim 1 , further comprising determining whether there are remaining depending artifacts. 8. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising: determining whether database objects corresponding to an artifact to deploy already exist in a database; calculating depending artifacts using a prior-generated dependency graph; processing metadata of each of the database objects in an execution graph that is populated based on the prior-generated dependency graph to determine a validity status of each of the database objects, the validity status comprising an invalidity or a validity that is indicative of that a drop and create protocol is skippable relative to a visibility of each of the database objects in the execution graph; determining that a first database object of a plurality of database objects corresponding to the depending artifacts needs to be redeployed based on the invalidity of the first database object; determining that the drop and create protocol of a second database object of the plurality of database objects is skippable based on the validity of the second database object; determining whether a build plugin corresponding to the first database object needing to be redeployed supports a redeployment option comprising a verification of the validity of the first database object needing to be redeployed; and processing the depending artifacts according to the an execution graph. 9. The non-transitory, computer-readable medium of claim 8 , further comprising one or more instructions to generate the execution graph associated with the prior-generated dependency graph. 10. The non-transitory, computer-readable medium of claim 8 , further comprising one or more instructions to insert UNDEPLOY and DEPLOY nodes into the execution graph for the artifact or to insert a DEPLOY node into the execution graph for the artifact. 11. The non-transitory, computer-readable medium of claim 8 , further comprising one or more instructions to determine whether any artifacts are remaining to be deployed. 12. The non-transitory, computer-readable medium of claim 8 , wherein determining the depending artifacts is performed transitively. 13. The non-transitory, computer-readable medium of claim 8 , further comprising one or more instructions to insert a REDEPLOY node into the execution graph for the artifact or to insert an UNDEPLOY and DEPLOY node into the execution graph for the artifact. 14. The non-transitory, computer-readable medium of claim 8 , further comprising one or more instructions to determine whether there are remaining depending artifacts. 15. A computer-implemented system, comprising: a computer memory; and a hardware processor interoperably coupled with the computer memory and configured to perform operations comprising: determining whether database objects corresponding to an artifact to deploy already exist in a database, calculating depending artifacts using a prior-generated dependency graph, processing metadata of each of the database objects in an execution graph that is populated based on the prior-generated dependency graph to determine a validity status of each of the database objects, the validity status comprising an invalidity or a validity that is indicative of that a drop and create protocol is skippable relative to a visibility of each of the database objects in the execution graph, determining that a first database object of a plurality of database objects corresponding to the depending artifacts needs to be redeployed based on the invalidity of the first database object, determining that the drop and create protocol of a second database object of the plurality of database objects is skippable based on the validity of the second database object, determining whether a build plugin corresponding to the first database object needing to be redeployed supports a redeployment option comprising a verification of the validity of the first database object needing to be redeployed, and processing the depending artifacts according to the an execution graph. 16. The computer-implemented system of claim 15 , further configured to generate the execution graph associated with the prior-generated dependency graph. 17. The computer-implemented system of claim 15 , further configured to insert UNDEPLOY and DEPLOY nodes into the execution graph for the artifact or to insert a DEPLOY node into the execution graph for the artifact. 18. The computer-implemented system of claim 15 , further configured to determine whether any artifacts are remaining to be deployed. 19. The computer-implemented system of claim 15 , wherein determining the depending artifacts is performed transitively. 20. The computer-implemented system of claim 15 , further configured to insert a REDEPLOY node into the execution graph for the artifact or to insert an UNDEPLOY and DEPLOY node into the execution graph for the artifact. 21. The computer-implemented s
Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title
Database tuning (G06F16/2282 takes precedence; database performance monitoring G06F11/3409) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.