METHOD FOR DISCOVERING A GROUP OF INTERDEPENDENT COMPUTING OBJECTS WITHIN UNDIRECTED GRAPH STRUCTURE IN A COMPUTING ENVIRONMENT CORRESPONDING TO A SET OF KNOWN CONDITIONS

• US 20190311069A1
• Filed: 04/06/2018
• Published: 10/10/2019
• Est. Priority Date: 04/06/2018
• Status: Active Grant

• Current Assignee: Runecast Solutions Limited (Dynatrace, Inc.)
• Original Assignee: Runecast Solutions Limited (Dynatrace, Inc.)
• Inventors: IVANOV, Konstantin, DURIS, Marek, SALI, Aylin, MARKOV, Stanimir, RADU, Ionut
• Granted Patent: US 10,621,234 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/188 Virtual file systems
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/289 Object oriented databases
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/90335 Query processing

Abstract

Various embodiments relate to a method and apparatus for discovering a group of interdependent computing objects within an undirected graph structure of objects in a computing environment, the method comprising the steps of performing object identification, performing relations identification, selecting objects by performing the steps comprising defining required properties, matching the required properties with the properties for each of the objects, dropping the objects which have at least one of the properties which do not match with the required properties, making a selection by performing object intersection on the objects by performing the steps of reading location and the relations for each of the objects, selecting a group including each of the objects in the sets of objects which are identical based on the relations for each of the objects, determining whether each of the objects in the group are related to each of the objects in each of the sets of objects, and determining whether at least one of the objects in each of the sets of objects is related to at least one of the objects in another set of the sets of objects.

Claims

1. A method for discovering a group of interdependent computing objects within an undirected graph structure of objects in a computing environment, the method comprising the steps of:

performing object identification;

performing relations identification;

selecting objects by performing the steps comprising;

defining required properties;

matching the required properties with the properties for each of the objects;

dropping the objects which have at least one of the properties which do not match with the required properties;

making a selection by performing object intersection on the objects by performing the steps of;

reading location and the relations for each of the objects;

selecting a group including each of the objects in the sets of objects which are identical based on the relations for each of the objects;

determining whether each of the objects in the group are related to each of the objects in each of the sets of objects, and

determining whether at least one of the objects in each of the sets of objects is related to at least one of the objects in another set of the sets of objects.

2. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 1, the method comprising the steps of:

performing the object identification by performing the steps comprising;

receiving a search query including objects and operators;

selecting an organization area;

isolating object types for the objects in the search query;

grouping the objects into sets of objects, and

recording properties for each of the objects.

3. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 1, the method comprising the steps of:

performing the relations identification by performing the steps comprising;

recording relatability for each of the object types for the objects, and

recording relations for each of the objects.

4. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 1, the method comprising the steps of:

making a selection by performing object intersection on the objects by performing the steps of;

dropping all of the objects from the group when each of the objects in the group are not related to each of the objects in each of the sets of objects.

5. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 1, the method comprising the steps of:

making a selection by performing object intersection on the objects by performing the steps of;

dropping all of the objects from the group when each of the sets of objects is not related to at least one of the objects in another set of the sets of objects.

6. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 1, the method comprising the steps of:

making a selection by performing object union on the objects by performing the steps of;

reading location and the relations for each of the objects, and

selecting each of the objects that are in each of the sets of objects.

7. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 6, the method comprising the steps of:

making a selection by performing object union on the objects by performing the steps of;

dropping each of the objects that are not in each of the sets of objects.

8. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 1, the method comprising the steps of:

making a selection by performing object combination on the objects by performing the steps of;

reading location and the relations for each of the objects;

selecting each of the objects that are in each of the sets of objects, and

determining whether each of the objects in a first set of objects is related to at least one the objects in a second set of objects.

9. The method for discovering a group of interdependent computing objects within an undirected graph structure of objects in the computing environment of claim 8, the method comprising the steps of:

making a selection by performing object combination on the objects by performing the steps of;

dropping each of the objects in a first set of objects which is not related to at least one the objects in a second set of objects.

10. A non-transitory computer readable medium configured discovering a group of interdependent computing objects within an undirected graph structure in a computing environment, the device comprising:

a memory; and

a processor configured to;

perform object identification by performing the steps comprising;

perform relations identification by performing the steps comprising;

make a selection by performing object intersection on the objects by performing the steps of;

reading location and the relations for each of the objects;

selecting a group including each of the objects in the sets of objects which are identical based on the relations for each of the objects;

determining whether each of the objects in the group are related to each of the objects in each of the sets of objects, and

determining whether at least one of the objects in each of the sets of objects is related to at least one of the objects in another set of the sets of objects.

11. The non-transitory computer readable medium of claim 10, the processor configured to:

perform object identification by performing the steps comprising;

receiving a search query including objects and operators;

selecting an organization area;

isolating object types for the objects in the search query;

grouping the objects into sets of objects, and

recording properties for each of the objects.

12. The non-transitory computer readable medium of claim 10, the processor configured to:

perform relations identification by performing the steps comprising;

recording relatability for each of the object types for the objects;

recording relations for each of the objects.

13. The non-transitory computer readable medium of claim 10, the processor configured to:

make a selection by performing object intersection on the objects by performing the steps of;

dropping all of the objects from the group when each of the objects in the group are not related to each of the objects in each of the sets of objects.

14. The non-transitory computer readable medium of claim 10, the processor configured to:

make a selection by performing object intersection on the objects by performing the steps of;

dropping all of the objects from the group when each of the sets of objects is not related to at least one of the objects in another set of the sets of objects.

15. The non-transitory computer readable medium of claim 10, the processor configured to:

make a selection by performing object intersection on the objects by performing the steps of;

reading location and the relations for each of the objects, and

selecting each of the objects that are in each of the sets of objects.

16. The non-transitory computer readable medium of claim 15, the processor configured to:

make a selection by performing object intersection on the objects by performing the steps of;

dropping each of the objects that are not in each of the sets of objects.

17. The non-transitory computer readable medium of claim 10, the processor configured to:

make a selection by performing object intersection on the objects by performing the steps of;

reading location and the relations for each of the objects;

selecting each of the objects that are in each of the sets of objects, and

determining whether each of the objects in a first set of objects is related to at least one the objects in a second set of objects.

18. The non-transitory computer readable medium of claim 17, the processor configured to:

make a selection by performing object intersection on the objects by performing the steps of;

dropping each of the objects in a first set of objects which is not related to at least one the objects in a second set of objects.