| CPC G06F 16/3344 (2019.01) [G06F 16/9027 (2019.01); G06F 40/103 (2020.01); G06F 40/295 (2020.01); G06F 40/30 (2020.01); G06N 5/02 (2013.01); G06N 20/00 (2019.01)] | 16 Claims |
|
1. A computer-implemented method comprising:
receiving a search request for searching a graph representing content of digital objects, the graph comprising nodes representing entities and edges representing relationships between the entities, the entities being descriptive of the content of the digital objects;
determining a set of operations for traversing the graph according to the search request, wherein each operation of the set of operations receives an input and provides, as output, a vector of nodes;
executing a set of intermediate operations resulting in intermediate vectors of nodes that represent intermediate object units that are portions of the digital objects, and identifying intermediate entities in the intermediate object units;
after executing the intermediate operations, executing a result operation resulting in a result vector of the nodes that represent result object units, and identifying result entities in the result object units;
for at least one of the intermediate operations, comparing the intermediate entities of the intermediate object units with the result entities of the result object units to find an intersection of common entities that are present in both the intermediate object units and the result object units;
highlighting the common entities in the result object units; and
displaying the result object units with the highlighted common entities,
wherein the set of operations comprises a node retrieval operation and at least one traversal operation, wherein the node retrieval operation receives the search request as the input and provides an initial vector of nodes that fulfils the search request,
wherein the traversal operation provides a result vector of nodes that fulfil a traversal condition and are reachable after one step traversal starting from an input vector, and
wherein the input vector is the initial vector of nodes in case the node retrieval operation is an operation immediately preceding the traversal operation, otherwise the input vector is an intermediate result vector of another immediately preceding operation.
|