METHODS AND APPARATUS USING A NODE GRAPH ARCHITECTURE

• US 20170139679A1
• Filed: 11/18/2015
• Published: 05/18/2017
• Est. Priority Date: 11/18/2015
• Status: Abandoned Application

• Current Assignee: King.com, Ltd (Microsoft Corporation)
• Original Assignee: King.com, Ltd (Microsoft Corporation)
• Inventors: Murray, Christian
• Application Number:
  US14/944,634
• Publication Number:
  US 20170139679A1
• Time in Patent Office: Days
• CPC Class Codes: G06F 11/3604 Software analysis for verifying properties of programs byte-code verification G06F9/44589
• CPC Class Codes: G06F 12/0802 Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
• CPC Class Codes: G06F 2212/1032 Reliability improvement, data loss prevention, degraded operation etc
• CPC Class Codes: G06F 2212/60 Details of cache memory
• CPC Class Codes: G06F 8/24 Object-oriented
• CPC Class Codes: G06F 8/30 Creation or generation of source code
• CPC Class Codes: G06F 8/34 Graphical or visual programming
• CPC Class Codes: G06F 9/4494 data driven

Abstract

A node graph architecture has nodes with arc between the nodes. The architectures arranged to so that for each change made to data of a node, a full history of the node graph architecture is stored. The history comprises state which is data of the nodes and the arc. When an undo function is applied, the state of the node architecture reverts to the state of one of the stored full histories.

Claims

1. A computer implemented method comprising:

responsive to a change in data of a node in a node graph architecture, storing in memory a first full history of a graph of the node graph architecture, the history comprising state, wherein the node graph architecture comprises a plurality of nodes with respective arcs there between, the state comprising data of the nodes and the arcs;

responsive to a further change in data in the node graph architecture, storing in the memory a second full history of the graph; and

applying an undo function such that a current state of the node graph architecture reverts to the state of the first history.

2. A method as claimed in claim 1 comprising wherein a data structure of the node graph architecture comprises a persistent immutable data structure.

3. A method as claimed in claim 2, wherein at least two of the histories share at least some data structures.

4. A method as claimed in claim 1, comprising storing, for each change in data a further full history of the graph.

5. A method as claimed in claim 4, wherein n full histories are stored and using the undo function a mth full history provides a current state of the node graph architecture, the method further comprising responsive to a further change to the mth full history, deleting any history which occurred in time after an initial occurrence of the mth full history.

6. A method as claimed in claim 1, comprising applying a redo function such that a state of the node graph architecture changes to a state of the graph history which occurred subsequent to the initial occurrence of a current graph history.

7. A method as claimed in claim 1, wherein the state information comprises cache data comprising an output value of a node and validity information indicating if the output value is valid, the undo function causing the cache data to revert to a respective value in the respective history.

8. A method as claimed in claim 1, wherein each history is stored with identification information.

9. A method as claimed in claim 1, comprising

determining a plurality of output data in response to input data in a respective node;

storing the plurality of output data in a cache memory with information indicating the validity of the respective data;

editing at least one node such that at least one of the respective output data is changed; and

causing the information indicating the validity of the data which is changed to indicate that the data is invalid.

10. A method as claimed in claim 9, using information about dependencies, the dependencies providing information about which used outputs from one or more other nodes a respective node at least one of directly and indirectly uses, the information being used when the respective node is required to provide an output to check the validity information associated with the used outputs and determining from the validity information being used to determine if the used output data in the cache memory is to be used.

11. A method as claimed in claim 1, comprising selecting data used by a current node, the current node using output data from a plurality of different nodes, each of the output data comprising information identifying the node which provided the output data, said selected data being one of said output data;

and using the identifying information to perform editing of the selected data in the node of the different nodes which provided the data while viewing the data in the node.

12. A data processing apparatus comprising at least one processor and at least one memory coupled to the processor, said at least one memory having program code configured to be executed by the at least one processor to implement a method, said method comprising:

responsive to a change in data of a node in a node graph architecture, storing in memory a first full history of a graph of the node graph architecture, the history comprising state, wherein the node graph architecture comprises a plurality of nodes with respective arcs there between, the state comprising data of the nodes and the arcs;

responsive to a further change in data in the node graph architecture, storing in the memory a second full history of the graph; and

applying an undo function such that a current state of the node graph architecture reverts to the state of the first history.

13. A data processing apparatus as claimed in claim 12, wherein said a data structure of the node graph architecture may comprise a persistent immutable data structure.

14. A data processing apparatus as claimed in claim 13, wherein at least two of the histories may share at least some data structures.

15. A data processing apparatus as claimed in claim 12, wherein the at least one memory is configured to store, for each change in data a further full history of the graph.

16. A data processing apparatus as claimed in claim 12, wherein n full histories are stored and using the undo function a mth full history provides a current state of the node graph architecture, the at least one processor being responsive to a further change to the mth full history, to delete any history from said memory which occurred in time after an initial occurrence of the mth full history.

17. A data processing apparatus as claimed in claim 12, wherein the processor is configured to apply a redo function such that a state of the node graph architecture changes to a state of the graph history which occurred subsequent to the initial occurrence of a current graph history.

18. A data processing apparatus as claimed in claim 12, wherein the state information comprises cache data comprising an output value of a node and validity information indicating if the output value is valid, the undo function causing the cache data to revert to a respective value in the respective history.

19. A data processing apparatus as claimed in claim 12, wherein said at least one memory is configure to store each history with identification information.

20. A computer program product, comprising a computer readable storage device having a computer readable program code stored therein, said computer readable program code containing instructions configured to be executed by at least one processor to implement a method, said method comprising:

responsive to a change in data of a node in a node graph architecture, storing in memory a first full history of a graph of the node graph architecture, the history comprising state, wherein the node graph architecture comprises a plurality of nodes with respective arcs there between, the state comprising data of the nodes and the arcs;

responsive to a further change in data in the node graph architecture, storing in the memory a second full history of the graph; and

applying an undo function such that a current state of the node graph architecture reverts to the state of the first history.