System, method, and computer program for dynamically generating a visual representation of a subset of a graph for display, based on search criteria

• US 9,753,960 B1
• Filed: 03/10/2014
• Issued: 09/05/2017
• Est. Priority Date: 03/20/2013
• Status: Active Grant

• Current Assignee: Amdocs Development Limited (Amdocs Ltd.), Amdocs Software Systems Limited (Amdocs Ltd.)
• Original Assignee: Amdocs Development Limited (Amdocs Ltd.), Amdocs Software Systems Limited (Amdocs Ltd.)
• Inventors: Troyanovsky, Alexander
• Primary Examiner(s): Coby, Frantz
• Application Number:
  US14/203,398
• Time in Patent Office: 1,275 Days
• Field of Search: 707715, 707741-746, 707754, 707797-798, 707805, 707724, 707672, 709201, 709203, 709213, 709217
• CPC Class Codes: G06F 16/1734 Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/211 Schema design and management
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/248 Presentation of query results

Abstract

A system, method, and computer program product are provided for dynamically generating a visual representation of a subset of a graph for display, based on search criteria. In use, a plurality of first documents corresponding to each of a plurality of nodes associated with at least one graph are generated, wherein each of the plurality of first documents include information corresponding to an associated node of the plurality of nodes. Additionally, a plurality of second documents corresponding to each of a plurality of edges associated with the at least one graph are generated, wherein each of the plurality of second documents include information corresponding to an associated edge of the plurality of edges. Further, the plurality of first documents corresponding to each of the plurality of nodes and the plurality of second documents corresponding to each of the plurality of edges are automatically indexed, wherein the indexing functions to allow the plurality of first documents corresponding to each of the plurality of nodes and the plurality of second documents corresponding to each of the plurality of edges to be searched utilizing at least one search engine. In addition, the plurality of first documents corresponding to each of the plurality of nodes and the plurality of second documents corresponding to each of the plurality of edges are filtered to generate a subset of the plurality of first documents corresponding to each of the plurality of nodes and the plurality of second documents corresponding to each of the plurality of edges, in response to a search query utilizing the at least one search engine. Still yet, a visual representation of a subset of the at least one graph is displayed, the visual representation of the subset of the at least one graph being based on the subset of the plurality of first documents corresponding to each of the plurality of nodes and the plurality of second documents corresponding to each of the plurality of edges.

Claims

1. A computer program product embodied on a non-transitory computer readable medium, comprising:

computer code for storing, in memory of a system, a graph modeling a computer system architecture, the graph having;

(a) a plurality of nodes each representing a different object that is a component within the computer system architecture, each of the nodes including data describing the object represented by the node, the data being associated with a type of the object represented by the node, a location of the object represented by the node, a functionality of the object represented by the node, and ownership of the object represented by the node; and

(b) a plurality of edges connecting the nodes with each of the edges representing a different connection between different pairs of the objects, wherein each of the edges includes data describing the connection represented by the edge, the data indicating a type of the connection represented by the edge and the data being associated with location information;

computer code for translating, by the system, the graph into a set of documents that are each a file in a format common to a search engine of the system and that are each capable of being indexed by the system, the translating including;

generating a plurality of first documents by converting each one of the nodes of the graph into a separate first document having fields that include the data in the node that describes the object represented by the node, and

generating a plurality of second documents by converting each one of the edges of the graph into a separate second document having fields that include the data in the edge that describes the connection represented by the edge;

computer code for automatically indexing, by the system, the plurality of first documents and the plurality of second documents to generate an index that allows the plurality of first documents and the plurality of second documents to be searched utilizing at least one search engine;

computer code for providing, by the system, the graph for display thereof to a user;

computer code for receiving, by the system, user input including a selection of one of the nodes in the graph, the user input indicating a request for child nodes of the selected node;

computer code responsive to the user input for automatically generating, by the system, a search query specifying criteria for the request;

computer code for executing the search query to filter, by the search engine of the system using the index, the plurality of first documents and the plurality of second documents based on the data included therein to generate;

a subset of the plurality of first documents generated for the child nodes to the selected node, and

a subset of the plurality of second documents generated for the edges between the child nodes; and

computer code for generating, by the system for display thereof, a visual representation of a subset of the graph based on the subset of the plurality of first documents and the plurality of second documents, the visual representation of the subset of the graph showing;

a subset of the nodes that correspond to the subset of the plurality of first documents, and

a subset of the edges that correspond to the subset of the plurality of second documents,

with the subset of the nodes being interconnected by the subset of the edges such that the subset of the graph depicts the child nodes to the selected node and the edges connecting the child nodes.

2. The computer program product of claim 1, further comprising computer code for saving the subset of the graph in the memory.

5. The computer program product of claim 1, wherein the graph is accessible to a plurality of users with different roles, for use by each of the users to use search queries to filter the graph to obtain a subset of the graph that is associated with the role of the user, where:

a database administrator filters the graph to view only database related aspects of a runtime environment within the computer system architecture,

a JavaEE administrator filters the graph to focus on application servers and their clusters within the computer system architecture,

a software integration engineer filters the graph to view an integration map between various software modules of the computer system architecture and to receive a logical system view of the computer system architecture, and

a user in an infrastructure group filters the graph to view a representation of a physical deployment within the computer system architecture.

3. A method, comprising:

storing, in memory of a system, a graph modeling a computer system architecture, the graph having;

(a) plurality of nodes each representing a different object that is a component within the computer system architecture, each of the nodes including data describing the object represented by the node, the data being associated with a type of the object represented by the node, a location of the object represented by the node, a functionality of the object represented by the node, and ownership of the object represented by the node; and

(b) a plurality of edges connecting the nodes with each of the edges representing a different connection between different pairs of the objects, wherein each of the edges includes data describing the connection represented by the edge, the data indicating a type of the connection represented by the edge and the data being associated with location information;

translating, by the system, the graph into a set of documents that are each a file in a format common to a search engine of the system and that are each capable of being indexed by the system, the translating including;

generating a plurality of first documents by converting each one of the nodes of the graph into a separate first document having fields that include the data in the node that describes the object represented by the node, and

generating a plurality of second documents by converting each one of the edges of the graph into a separate second document having fields that include the data in the edge that describes the of the connection represented by the edge;

automatically indexing, by the system, the plurality of first documents and the plurality of second documents to generate an index that allows the plurality of first documents and the plurality of second documents to be searched utilizing at least one search engine;

providing, by the system, the graph for display thereof to a user,

receiving, by the system, user input including a selection of one of the nodes in the graph, the user input indicating a request for child nodes of the selected node;

responsive to the user input, automatically generating, by the system, a search query specifying criteria for the request;

executing the search query to filter, by the search engine of the system using the index, the plurality of first documents and the plurality of second documents based on the data included therein to generate;

a subset of the plurality of first documents generated for the child nodes to the selected node, and

a subset of the plurality of second documents generated for the edges between the child nodes; and

generating, by the system for display thereof, a visual representation of a subset of the graph based on the subset of the plurality of first documents and the plurality of second documents, the visual representation of the subset of the graph showing;

a subset of the nodes that correspond to the subset of the plurality of first documents, and

a subset of the edges that correspond to the subset of the plurality of second documents,

with the subset of the nodes being interconnected by the subset of the edges such that the subset of the graph depicts the child nodes to the selected node and the edges connecting the child nodes.

4. A system comprising:

a memory of a computer system; and

one or more processing cores of the computer system coupled to the memory that are each configured to;

store, in the memory of the computer system, a graph modeling a computer system architecture, the graph having;

(a) a plurality of nodes each representing a different object that is a component within the computer system architecture, each of the nodes including data describing the object represented by the node, the data being associated with a type of the object represented by the node, a location of the object represented by the node, a functionality of the object represented by the node, and ownership of the object represented by the node; and

(b) a plurality of edges connecting the nodes with each of the edges representing a different connection between different pairs of the objects, wherein each of the edges includes data describing the connection represented by the edge, the data indicating a type of the connection represented by the edge and the data being associated with location information;

translate, by the computer system, the graph into a set of documents that are each a file in a format common to a search engine of the computer system and that are each capable of being indexed by the computer system, the translating including;

generating a plurality of first documents by converting each one of the nodes of the graph into a separate first document having fields that include the data in the node that describes the object represented by the node, and

generating a plurality of second documents by converting each one of the edges of the graph into a separate second document having fields that include the data in the edge that describes the connection represented by the edge;

automatically index, by the computer system, the plurality of first documents and the plurality of second documents to generate an index that allows the plurality of first documents and the plurality of second documents to be searched utilizing at least one search engine;

provide, by the computer system, the graph for display thereof to a user;

receive, by the computer system, user input including a selection of one of the nodes in the graph, the user input indicating a request for child nodes of the selected node;

responsive to the user input, automatically generate, by the computer system, a search query specifying criteria for the request;

execute the search query to filter, by the search engine of the computer system using the index, the plurality of first documents and the plurality of second documents based on the data included therein to generate;

a subset of the plurality of first documents generated for the child nodes to the selected node, and

a subset of the plurality of second documents generated for the edges between the child nodes; and

generate, by the computer system for display thereof, a visual representation of a subset of the graph based on the subset of the plurality of first documents and the plurality of second documents, the visual representation of the subset of the graph showing;

a subset of the nodes that correspond to the subset of the plurality of first documents, and

a subset of the edges that correspond to the subset of the plurality of second documents,

with the subset of the nodes being interconnected by the subset of the edges such that the subset of the graph depicts the child nodes to the selected node and the edges connecting the child nodes.