Live topological query

Patent metadata

Field	Value
Publication number	US-9922133-B2
Application number	US-201213448173-A
Country	US
Kind code	B2
Filing date	Apr 16, 2012
Priority date	Apr 16, 2012
Publication date	Mar 20, 2018
Grant date	Mar 20, 2018

Abstract

A method for performing a live topological query includes, with a querying application, using a query graph to create a live topological query result from a database storing a full structure graph while not storing an entirety of the query result in a cache memory. The method further includes, in response to detecting a change within full structure graph, performing a calculation to determine whether the change is relevant to the query result, and notifying the querying application of a relevant change to the query result without relying on a fully cached copy of the query result.

First claim

What is claimed is:

1. A live topological query method performed by a physical computing system, the method comprising:
with a querying application, using a query graph to create a live topological query result from a database storing a full structure graph while not storing an entirety of said query result in a cache memory;
storing a first query result portion of said query result in said cache memory, and not storing a second query result portion of said query result in said cache memory, wherein said first query result portion relates to a first node in said query graph, and said second query result portion relates to a second, different node in said query graph;
in response to detecting a change within said full structure graph, performing a calculation, based on said first query result portion stored in said cache memory and said second query result portion not stored in said cache memory, to determine whether said change is relevant to said query result;
notifying said querying application of a relevant change to said query result without relying on a fully cached copy of said query result; and
sorting nodes of said query graph into an order of said nodes, wherein performing said calculation comprises performing calculations in an order that corresponds to said order of said nodes, wherein sorting said nodes of said query graph comprises placing said first node before said second node in said order of said nodes.

2. The method of claim 1 , wherein notifying said querying application comprises publishing changes relevant to said query result to a plurality of listeners.

3. The method of claim 2 , wherein said plurality of listeners are to receive notifications for respective different types of changes within said full structure graph such that calculations associated with changes for said plurality of listeners can be performed without relying on a previous query result in said cache memory, wherein a first listener of said plurality of listeners listens for first type changes, and a second listener of said plurality of listeners listens for second type changes different from said first type changes.

4. The method of claim 1 , wherein said query graph is a first query graph, the method further comprising:
creating a second live topological query result in response to a second query graph, and
determining whether said change is relevant to said second query graph, said determining whether said change is relevant to said second query graph is performed with an overhead below a predefined threshold without relying on any result stored in said cache memory.

5. The method of claim 4 , wherein said first query graph is of a structure such that said calculation to determine whether said change is relevant to said first query graph involves a processing overhead complexity above said predefined threshold, and said processing overhead complexity is reduced by caching a subset of nodes within said query result for said first query graph.

6. The method of claim 1 , wherein said full structure graph represents an Information Technology (IT) infrastructure in graph form.

7. The method of claim 6 , further comprising, sorting a number of changes detected within said IT infrastructure from a top to a bottom of said query graph.

8. A computing system comprising:
at least one processor;
a non-transitory storage medium communicatively coupled to the at least one processor, the non-transitory storage medium comprising computer executable code that, when executed by the at least one processor, causes the at least one processor to:
use a query graph to create a live topological query result from a database representing a full structure graph while not storing an entirety of said query result in a cache memory;
store a first query result portion of said query result in said cache memory, and not store a second query result portion of said query result in said cache memory, wherein said first query result portion relates to a first node in said query graph, and said second query result portion relates to a second, different node in said query graph;
in response to detecting a change within said full structure graph, perform a calculation, based on said first query result portion stored in said cache memory and said second query result portion not stored in said cache memory, to determine whether said change is relevant to said query result;
notify a querying application of a relevant change to said query result without relying on a fully cached copy of said query result; and
sort nodes of said query graph into an order of said nodes, wherein performing said calculation comprises performing calculations in an order that corresponds to said order of said nodes, wherein sorting said nodes of said query graph comprises placing said first node before said second node in said order of said nodes.

9. The computing system of claim 8 , wherein said notifying of said querying application comprises publishing changes relevant to said query result to a plurality of listeners.

10. The computing system of claim 9 , wherein said plurality of listeners are to receive notifications for respective different types of changes within said full structure graph such that calculations associated with changes for said plurality of listeners can be performed without relying on a previous query result in said cache memory, wherein a first listener of said plurality of listeners is to listen for first type changes, and a second listener of said plurality of listeners is to listen for second type changes different from said first type changes.

11. The computing system of claim 8 , wherein said query graph is first query graph, wherein the computer executable code when executed causes the at least one processor to:
create a second live topological query result in response to a second query graph, and
determine whether said change is relevant to said second query graph, said determining whether said change is relevant to said second query graph can be performed with an overhead below a predefined threshold without relying on any result stored in said cache memory.

12. The computing system of claim 11 , wherein said first query graph is of a structure such that said calculation to determine whether said change is relevant to said first query graph involves a processing overhead complexity above said predefined threshold, and said processing overhead complexity can be reduced by caching a subset of nodes within said query result for said first query graph.

13. The computing system of claim 8 , wherein said full structure graph represents an Information Technology (IT) infrastructure.

14. A non-transitory computer readable storage medium having computer readable code embodied therewith, said computer readable program code upon execution causing a computing system to:
use a query graph to create a live topological query result from a database representing an Information Technology (IT) infrastructure in graph form while not storing an entirety of said query result in a cache memory;
define a first node in said query graph as a key node for which a query result portion is to be cached;
define a second node in said query graph as a non-cached node for which a query result portion is not to be cached;
store a first query result portion of said query result including said query result portion for said key node of said query graph in said cache memory, and not store a second query result portion of said query result including said query result portion for said non-cached node of said query graph in said cache memory;
perform a calculation, based on said first query result portion

Assignees

• Atedgi Einat
• Sityon Arik
• Regev Eyal
• Entit Software Llc

Inventors

• Atedgi Einat
• Sityon Arik
• Regev Eyal

Classifications

• G06F16/9024 Primary

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F17/30958 Primary

  Physics · mapped topic