Interactive visualization of sender and recipient information in electronic communications
First Claim
1. A computer-implemented method comprising:
- querying a data store using a query, wherein the data store comprises a plurality of entities connected to one or more other entities included in the data store, the querying resulting in a first query result;
creating a node data structure corresponding to each of a plurality of entities included in the first query result and an edge data structure corresponding to each of one or more connections between the plurality of entities included in the first query result;
displaying a plurality of nodes corresponding to the created node data structures and a plurality of edges corresponding to the created edge data structures;
receiving a node selection corresponding to one of the displayed nodes;
re-querying the data store using a refined query based on the received node selection, the re-querying resulting in a second query result; and
re-performing the creating and displaying based on the second query result.
1 Assignment
0 Petitions
Accused Products
Abstract
An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types.
35 Citations
20 Claims
-
1. A computer-implemented method comprising:
-
querying a data store using a query, wherein the data store comprises a plurality of entities connected to one or more other entities included in the data store, the querying resulting in a first query result; creating a node data structure corresponding to each of a plurality of entities included in the first query result and an edge data structure corresponding to each of one or more connections between the plurality of entities included in the first query result; displaying a plurality of nodes corresponding to the created node data structures and a plurality of edges corresponding to the created edge data structures; receiving a node selection corresponding to one of the displayed nodes; re-querying the data store using a refined query based on the received node selection, the re-querying resulting in a second query result; and re-performing the creating and displaying based on the second query result. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. An information handling system comprising:
-
one or more processors; a memory accessible by at least one of the processors; a nonvolatile storage medium accessible by at least one of the processors; a display device accessible by at least one of the processors; and a set of instructions stored in the memory and executed by at least one of the processors in order to perform actions of; querying a data store using a query, wherein the data store comprises a plurality of entities connected to one or more other entities included in the data store, the querying resulting in a first query result; creating a node data structure corresponding to each of a plurality of entities included in the first query result and an edge data structure corresponding to each of one or more connections between the plurality of entities included in the first query result; displaying a plurality of nodes corresponding to the created node data structures and a plurality of edges corresponding to the created edge data structures; receiving a node selection corresponding to one of the displayed nodes; re-querying the data store using a refined query based on the received node selection, the re-querying resulting in a second query result; and re-performing the creating and displaying based on the second query result. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A computer program product comprising:
-
a computer readable memory device; first program instructions to query a data store using a query, wherein the data store comprises a plurality of entities connected to one or more other entities included in the data store, the querying resulting in a first query result; second program instructions to create a node data structure corresponding to each of a plurality of entities included in the first query result and an edge data structure corresponding to each of one or more connections between the plurality of entities included in the first query result; third program instructions to display a plurality of nodes corresponding to the created node data structures and a plurality of edges corresponding to the created edge data structures; fourth program instructions to receive a node selection corresponding to one of the displayed nodes; fifth program instructions to re-query the data store using a refined query based on the received node selection, the re-querying resulting in a second query result; sixth program instructions to re-perform the creating and displaying based on the second query result; and wherein the first, second, third, fourth, fifth, and sixth program instructions are stored on the computer readable memory device. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification