Abstract: Approaches are described for generating suggestions for new nodes or new relationships in a knowledge graph based on content of data assets represented by existing nodes in the knowledge graph. The knowledge graph is defined by nodes connected by edges. A method includes determining that a data asset represented by a root node of a knowledge graph has been changed, where the changed data asset is represented by a version node connected to the root node. The changed data asset is processed, including: identifying one or more candidate terms in the changed data asset, and comparing each candidate term with each of one or more existing terms from data assets of the knowledge graph other than the changed data asset to obtain (i) one or more of the candidate terms that do not correspond to any existing term or (ii) one or more candidate terms that each corresponds to a respective existing term that is not related to the version node representing the changed data asset.

Abstract: Approaches are described for generating suggestions for new nodes or new relationships in a knowledge graph based on content of data assets represented by existing nodes in the knowledge graph. The knowledge graph is defined by nodes connected by edges. A method includes determining that a data asset represented by a root node of a knowledge graph has been changed, where the changed data asset is represented by a version node connected to the root node. The changed data asset is processed, including: identifying one or more candidate terms in the changed data asset, and comparing each candidate term with each of one or more existing terms from data assets of the knowledge graph other than the changed data asset to obtain (i) one or more of the candidate terms that do not correspond to any existing term or (ii) one or more candidate terms that each corresponds to a respective existing term that is not related to the version node representing the changed data asset.

Abstract: A method includes storing data in a knowledge graph, defined by nodes connected to edges, in a database. A root node representing a data asset of the knowledge graph is connected to a first version node by a first edge, the first version node representing a first version of the data asset, and being associated with a status indicator having a first state indicating that a version of the data asset represented by the version node is an editable draft version of the data asset, and the corresponding version of the data asset is editable by a user of the knowledge graph. The method includes, by one or more processors, changing the state of the status indicator associated with the first version node to a second state indicating that a version of the data asset represented by the version node is a published version of the data asset.

Abstract: A method includes storing data in a knowledge graph stored in a database. The knowledge graph is defined by nodes connected by edges, in which a root node of the knowledge graph is connected to a first version node by a first edge. The root node represents a data asset, and the first version node represents a first version of the data asset. A status indicator associated with the first version node has a first state indicating that the first version of the data asset is an editable draft version of the data asset. Responsive to receiving an instruction to publish the first version of the data asset, the state of the status indicator is changed to a second state that indicates that the first version of the data asset is a published version of the data asset.

Abstract: Approaches are described for generating suggestions for new nodes or new relationships in a knowledge graph based on content of data assets represented by existing nodes in the knowledge graph. The knowledge graph is defined by nodes connected by edges. A method includes determining that a data asset represented by a root node of a knowledge graph has been changed, where the changed data asset is represented by a version node connected to the root node. The changed data asset is processed, including: identifying one or more candidate terms in the changed data asset, and comparing each candidate term with each of one or more existing terms from data assets of the knowledge graph other than the changed data asset to obtain (i) one or more of the candidate terms that do not correspond to any existing term or (ii) one or more candidate terms that each corresponds to a respective existing term that is not related to the version node representing the changed data asset.

Abstract: Approaches are described for generating suggestions for new nodes or new relationships in a knowledge graph based on content of data assets represented by existing nodes in the knowledge graph. The knowledge graph is defined by nodes connected by edges. A method includes determining that a data asset represented by a root node of a knowledge graph has been changed, where the changed data asset is represented by a version node connected to the root node. The changed data asset is processed, including: identifying one or more candidate terms in the changed data asset, and comparing each candidate term with each of one or more existing terms from data assets of the knowledge graph other than the changed data asset to obtain (i) one or more of the candidate terms that do not correspond to any existing term or (ii) one or more candidate terms that each corresponds to a respective existing term that is not related to the version node representing the changed data asset.

Abstract: Approaches are described for generating suggestions for new nodes or new relationships in a knowledge graph based on content of data assets represented by existing nodes in the knowledge graph. The knowledge graph is defined by nodes connected by edges. A method includes determining that a data asset represented by a root node of a knowledge graph has been changed, where the changed data asset is represented by a version node connected to the root node. The changed data asset is processed, including: identifying one or more candidate terms in the changed data asset, and comparing each candidate term with each of one or more existing terms from data assets of the knowledge graph other than the changed data asset to obtain (i) one or more of the candidate terms that do not correspond to any existing term or (ii) one or more candidate terms that each corresponds to a respective existing term that is not related to the version node representing the changed data asset.

Abstract: A method includes storing data in a knowledge graph stored in a database. The knowledge graph is defined by nodes connected by edges, in which a root node of the knowledge graph is connected to a first version node by a first edge. The root node represents a data asset, and the first version node represents a first version of the data asset. A status indicator associated with the first version node has a first state indicating that the first version of the data asset is an editable draft version of the data asset. Responsive to receiving an instruction to publish the first version of the data asset, the state of the status indicator is changed to a second state that indicates that the first version of the data asset is a published version of the data asset.