초록 ▼

Determining metadata associated with a graph-based computation includes functionally transforming metadata associated with a first portion of a graph to generate transformed metadata associated with a second portion of the graph; determining a third portion of the graph related to the second portion

Determining metadata associated with a graph-based computation includes functionally transforming metadata associated with a first portion of a graph to generate transformed metadata associated with a second portion of the graph; determining a third portion of the graph related to the second portion of the graph; and propagating the transformed metadata from the second portion of the graph to the third portion of the graph.

대표청구항 ▼

1. A method for determining metadata associated with a graph-based computation by a process executed on a computer system, the method including: generating a partial ordering of graph elements in a graph, the partial ordering determined at least in part by links representing data flows interconnecti

1. A method for determining metadata associated with a graph-based computation by a process executed on a computer system, the method including: generating a partial ordering of graph elements in a graph, the partial ordering determined at least in part by links representing data flows interconnecting the graph elements; anddetermining metadata of the graph elements according to the partial ordering, including propagating metadata internally within individual graph elements, and propagating metadata externally between different graph elements,the internal metadata propagation including functionally transforming metadata that specifies at least one characteristic of data processed by a first portion of the graph to generate transformed metadata that specifies at least one characteristic of data processed by a second portion of the graph, andthe external metadata propagation including identifying a third portion of the graph related to the second portion of the graph by a link representing a first data flow of data elements output from the second portion of the graph and received at the third portion of the graph, andpropagating the transformed metadata that was generated for the second portion of the graph to the third portion of the graph according to the link representing the first data flow of data elements, and after propagating the transformed metadata, moving a graph element in the third portion of the graph to the end of the partial ordering. 2. The method of claim 1, wherein the first portion of the graph includes a first port of a first graph element and the second portion of the graph includes a second port of the first graph element, and the first data flow includes a data flow between the second port of the first graph element and a port of the graph element in the third portion of the graph. 3. The method of claim 2, wherein the first port of the first graph element and the second port of the first graph element are related by an internal data flow of the first graph element. 4. The method of claim 2, wherein the functional transformation includes a metadata definition that includes at least one reference to the metadata associated with the first port. 5. The method of claim 4, wherein the metadata definition defines metadata for the second port as a function of the referenced metadata. 6. The method of claim 2, wherein the second port is an output port and the port of the graph element in the third portion is an input port. 7. The method of claim 1, wherein the metadata being functionally transformed supplied by a user. 8. The method of claim 1, wherein the metadata being functionally transformed is propagated from a fourth portion of the graph. 9. The method of claim 1, further including propagating the transformed metadata in response to a change in connectivity of the graph. 10. The method of claim 1, further including propagating the transformed metadata in response to a user action. 11. The method of claim 1, further including: receiving a request from a user; anddisplaying metadata associated with a graph element to the user in response to the request. 12. The method of claim 11, wherein the request from the user includes input from the user selecting a graph element for which metadata is to be displayed. 13. The method of claim 12, wherein the input from the user includes positioning an on-screen pointer near a graphical representation of the selected graph element for a predetermined amount of time. 14. The method of claim 11, wherein the displayed metadata includes metadata propagated from another graph element. 15. The method of claim 11, wherein the displayed metadata is displayed before the graph is run. 16. Software stored on a non-transitory computer-readable medium, for determining metadata associated with a graph-based computation, the software including instructions for causing a computer system to: generate a partial ordering of graph elements in a graph, the partial ordering determined at least in part by links representing data flows interconnecting the graph elements; anddetermine metadata of the graph elements according to the partial ordering, including propagating metadata internally within individual graph elements, and propagating metadata externally between different graph elements,the internal metadata propagation including functionally transforming metadata that specifies at least one characteristic of data processed by associated with a first portion of the graph to generate transformed metadata that specifies at least one characteristic of data processed by a second portion of the graph, andthe external metadata propagation including identifying a third portion of the graph related to the second portion of the graph by a link representing a first data flow of data elements output from the second portion of the graph and received at the third portion of the graph, andpropagating the transformed metadata that was generated for the second portion of the graph to the third portion of the graph according to the link representing the first data flow of data elements, and after propagating the transformed metadata, moving a graph element in the third portion of the graph to the end of the partial ordering. 17. The software of claim 16, wherein the first portion of the graph includes a first port of a first graph element and the second portion of the graph includes a second port of the first graph element, and the first data flow includes a data flow between the second port of the first graph element and a port of a second graph element in the third portion of the graph. 18. The software of claim 17, wherein the first port of the first graph element and the second port of the first graph element are related by an internal data flow of the first graph element. 19. The software of claim 17, wherein the functional transformation includes a metadata definition that includes at least one reference to the metadata associated with the first port. 20. The software of claim 19, wherein the metadata definition defines metadata for the second port as a function of the referenced metadata. 21. The software of claim 17, wherein the second port is an output port and the port of the graph element in the third portion is an input port. 22. A system for determining metadata associated with a graph-based computation, the system including: means for generating a partial ordering of graph elements in a graph, the partial ordering determined at least in part by links representing data flows interconnecting the graph elements; andmeans for determining metadata of the graph elements according to the partial ordering, including propagating metadata internally within individual graph elements, and propagating metadata externally between different graph elements,the internal metadata propagation including functionally transforming metadata that specifies at least one characteristic of data processed by a first portion of the graph to generate transformed metadata that specifies at least one characteristic of data processed by a second portion of the graph, andthe external metadata propagation including identifying a third portion of the graph related to the second portion of the graph by a link representing a first data flow of data elements output from the second portion of the graph and received at the third portion of the graph, andpropagating the transformed metadata that was generated for the second portion of the graph to the third portion of the graph according to the link representing the first data flow of data elements, and after propagating the transformed metadata, moving a graph element in the third portion of the graph to the end of the partial ordering. 23. The system of claim 22, wherein the first portion of the graph includes a first port of a first graph element and the second portion of the graph includes a second port of the first graph element, and the first data flow includes a data flow between the second port of the first graph element and a port of a second graph element in the third portion of the graph. 24. The system of claim 23, wherein the first port of the first graph element and the second port of the first graph element are related by an internal data flow of the first graph element. 25. The system of claim 23, wherein the functional transformation includes a metadata definition that includes at least one reference to the metadata associated with the first port. 26. The system of claim 25, wherein the metadata definition defines metadata for the second port as a function of the referenced metadata. 27. The system of claim 23, wherein the second port is an output port and the port of the graph element in the third portion is an input port.