Mapping of personally-identifiable information to a person-based on traversal of a graph

A non-transitory computer readable medium having stored thereon a sequence of instructions which, when stored in memory and executed by one or more processors causes the one or more processors to perform a set of acts for associating personally identifiable information to an entity from a plurality of content objects, the set of acts comprising:

• identifying an entity graph, wherein
• the entity graph comprises a first portion and a second portion,
• the first portion comprises a first personally identifiable information (PII) node and a first entity node corresponding to the first PII node, the first PII node representing first PII that is identified from a first content object, and
• the second portion comprises a second PII node and a second entity node corresponding to the second PII node, wherein the second PII node represents second PII that is identified from one or more second content objects;
• and
• processing a query that comprises instructions to execute at least one operation on the entity graph at least by:
• executing a first instruction that retrieves at least the first or the second entity node from memory and determines a direct association and an indirect association between respective entries in a data structure representing a plurality of content objects and the first entity node or the second node;
• executing a second instruction that retrieves at least the first or the second portion from the memory and determines a subset of content objects from the data structure based at least in part upon respective ranks of the direct association and the indirect association, wherein the respective ranks are determined based at least in part upon a first score associated with the direct association and a second score associated with the second association;
• traversing at least a first edge connecting the first portion and the second portion in the entity graph for identifying, based at least in part upon the first entity node and the subset of content objects, a common PII node that is connected to at least the first entity node;
• identifying the second entity node and a separate PII node that is linked to the second entity node, wherein the second entity node is identified from traversing at least a second edge based at least in part upon the common PII node in the entity graph;
• and
• formulating a query result set for the first entity node at least by incorporating, into the query result set, first information pertaining to the separate PII node for the second entity node and second information pertaining to the common PII node.

A system for associating personally identifiable information to an entity from a plurality of content objects, the system comprising:

• a non-transitory storage medium having stored thereon a sequence of instructions;
• and
• one or more processors that execute the sequence of instructions to cause the one or more processors to perform a set of acts, the set of acts comprising:
• identifying an entity graph, wherein
• the entity graph comprises a first portion and a second portion,
• the first portion comprises a first personally identifiable information (PII) node and a first entity node corresponding to the first PII node, the first PII node representing first PII that is identified from a first content object, and
• the second portion comprises a second PII node and a second entity node corresponding to the second PII node, wherein the second PII node represents second PII that is identified from one or more second content objects;
• and
• processing a query that comprises instructions to execute at least one operation on the entity graph at least by:
• executing a first instruction that retrieves at least the first or the second entity node from memory and determines a direct association and an indirect association between respective entries in a data structure representing a plurality of content objects and the first entity node or the second node;
• executing a second instruction that retrieves at least the first or the second portion from the memory and determines a subset of content objects from the data structure based at least in part upon respective ranks of the direct association and the indirect association, wherein the respective ranks are determined based at least in part upon a first score associated with the direct association and a second score associated with the second association;
• traversing at least a first edge connecting the first portion and the second portion in the entity graph for identifying, based at least in part upon the first entity node, a common PII node that is connected to at least the first entity node;
• identifying the second entity node and a separate PII node that is linked to the second entity node, wherein the second entity node is identified from traversing at least a second edge based at least in part upon the common PII node in the entity graph;
• and
• formulating a query result set for the first entity node at least by incorporating, into the query result set, first information pertaining to the separate PII node for the second entity node and second information pertaining to the common PII node.