SYSTEM AND METHOD FOR USING DIRECTED ACYCLIC GRAPH (DAG) FOR APPLICATION UPDATES

• US 20140013318A1
• Filed: 07/03/2013
• Published: 01/09/2014
• Est. Priority Date: 07/03/2012
• Status: Active Grant

• Current Assignee: Salesforce.com, Inc.
• Original Assignee: Salesforce.com, Inc.
• Inventors: Rychikhin, Yuri
• Granted Patent: US 9,383,988 B2
• Time in Patent Office: Days
• US Class Current: 717/172
• CPC Class Codes: G06F 8/65 Updates security arrangements therefor G06F21/57
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management

Abstract

The system automatically creates an update from an old version to a new version despite the old version possibly being several version prior to the new version. There may be some increments in the version for which no change needs to be made to the application running on the client system, even though the code running on the host may have been updated. A graph of the versions is constructed based on the new version and old version. The updates for consecutive versions for which no format change is needed are collapsed into a single no operation update or combined into a single update with an update that requires an operation. Then the shortest path along the graph connecting the current version and new version is determined. The update steps along the shortest path are automatically combined into a single update, and then the update is performed.

Claims

1. A method comprising:

determining, by a host system including at least a machine having a processor system including at least one processor and a memory system communicatively coupled to the processor system, a sequence of update steps that do not require a format change, based upon a currently installed version of an application and a new version of the application being installed;

combining, by the processor system, the sequence of update steps that do not require a format change into one update step;

building, by the host system, an update from a combination of the sequence of update steps that do not require a format change and an update step that requires a format change and

sending from the host system to the user system, the update that result from the combination to the user system.

2. The method of claim 1, the format change being a change to a structure of a schema.

3. The method of claim 1, the format change being a change to a structure of a table.

4. The method of claim 1, the application being an application for running on a smart phone.

5. The method of claim 1, the application including one or more machine instructions, which when implemented cause the application connect, via a network, to a database stored on the host machine, the application being an interface for accessing the database.

6. The method of claim 1, the host system being an on-demand multi-tenant relational database.

7. The method of claim 1, wherein the determining includes creating a directed acyclic graph (DAG) s of the update steps and the determining the series of update steps to apply are based on the directed acyclic graph.

8. The method of claim 1, wherein the determining a sequence of update steps includes:

computing the shortest path from the currently installed version to the version being installed.

9. The method of claim 1, wherein the sequence of update steps is computed by starting with a first node, representing the currently installed version, inspecting each neighboring nodes and determining properties of each update step needed to arrive at neighboring nodes;

repeating the inspecting and determining of properties of each new neighbor of each prior neighbor, if the new neighbor was not yet inspected; and

repeating the inspecting and determining of properties of each new neighbor of each prior neighbor until the node corresponding to the new version is arrived at.

10. The method of claim 1, further comprising:

determining the currently installed version;

determining the new version being installed; and

basing the building of the update on the currently installed version and the newversion to be installed.

11. The method of claim 1, further comprising:

analyzing the available update steps to determine at least whether the step includes a format change;

12. The method of claim 1, further comprising:

building an initial version of a graph of the update steps;

sorting version vertices of the graph in ascending order;

13. The method of claim 1, further comprising:

determining whether the graph is missing vertices;

determining whether the graph is missing connections;

completing the graph, if vertices or connections are missing;

14. The method of claim 1, further comprising:

computing the shortest path from the installed version to the version to update to by

starting with a first node, representing the currently installed version, inspecting each neighboring nodes and determining properties of each update step needed to arrive at neighboring nodes;

repeating the inspecting and determining of properties of each new neighbor of each prior neighbor, if the new neighbor was not yet inspected; and

repeating the inspecting and determining of properties of each new neighbor of each prior neighbor until the node corresponding to the new version is arrived at; and

performing the update along the shortest path of the graph found between the current version and the new version.

15. The method of claim 1, further comprising:

determining whether one update undoes format changes of the other update;

if one update undoes format changes of the other update, skipping both updates.

16. The method of claim 1, further comprising:

receiving a request for an update, the request including an indication of the currently installed version of the application and an indication of the new version of the application that is desired to be installed.

17. The method of claim 1, further comprising:

determining the currently installed version;

determining the new version being installed;

analyzing the available update steps to determine at least whether the step includes a format change;

building an initial version of a graph of the update steps;

sorting version vertices of the graph in ascending order;

determining whether the graph is missing vertices;

determining whether the graph is missing connections;

completing the graph, if vertices or connections are missing;

computing the shortest path from the installed version to the version to update to by running a BF-search on the graph; and

performing the update along the shortest path of the graph.

18. A non-transitory machine-readable medium carrying one or more sequences of instructions for using directed acyclic graph (DAG) for application updates in a multi-tenant database system, which instructions, when executed by one or more processors, cause the one or more processors to carry out the steps of:

Determining, by a host system, a sequence of update steps that do not require a format change, based upon the currently installed version and the version being installed, the host system including at least a processor system having one or more processors and or memory systems;

Combining, by the host system, the sequence of steps that do not require a format change into one update step; and

performing, by the host system, the resulting update step.

19. A method comprising:

receiving, at a host system, a request for an update;

determining, by the host system, the host system having at least a machine having a processor system including at least one processor and a memory system communicatively coupled to the processor system, a currently installed version;

determining, by the host system, a version being installed;

determining, by the processor system, a sequence of update steps based upon the currently installed version and the version being installed; and

performing, by the host system, an update for every upgrade step in the sequence.