Entity discovery based on glossary data

A method comprising:

• receiving, by one or more processors, a tree data structure representing a plurality of tags arranged in a hierarchy indicating a business level of abstraction;
• executing a field level classification of data to obtain field tags related to the data;
• generating a graph data structure by:
• matching field tags of the data to a set of child tags of the tree and creating a first node in the graph data structure for at least a parent tag of the set of child tags and a second node in the graph data structure for a resource in the data corresponding to the field tags;
• based on at least one of an amount of matching between the field tags and the set of child tags, or one or more entity relationships, creating, in the graph data structure, a directed edge from the second node to the first node;
• and
• repeating the matching and the creating for a plurality of the parent tags and a plurality of the resources in the data to generate the graph data structure;
• and
• executing a ranking algorithm on the graph data structure to determine at least one of the first nodes having a rank that exceeds a rank threshold.

One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, configure the one or more processors to perform operations comprising:

• a tree data structure representing a plurality of tags arranged in a hierarchy indicating a business level of abstraction;
• executing a field level classification of data to obtain field tags related to the data;
• generating a graph data structure by:
• matching field tags of the data to a set of child tags of the tree and creating a first node in the graph data structure for at least a parent tag of the set of child tags and a second node in the graph data structure for a resource in the data corresponding to the field tags;
• based on at least one of an amount of matching between the field tags and the set of child tags, or one or more entity relationships, creating, in the graph data structure, a directed edge from the second node to the first node;
• and
• repeating the matching and the creating for a plurality of the parent tags and a plurality of the resources in the data to generate the graph data structure;
• and
• executing a ranking algorithm on the graph data structure to determine at least one of the first nodes having a rank that exceeds a rank threshold.