Graph-based query composition

Patent metadata

Field	Value
Publication number	US-11637849-B1
Application number	US-202117510179-A
Country	US
Kind code	B1
Filing date	Oct 25, 2021
Priority date	Nov 27, 2017
Publication date	Apr 25, 2023
Grant date	Apr 25, 2023

Abstract

In some embodiments, a request to filter information associated with activities within a network environment is received in response to a user interaction with a graph that comprises a plurality of nodes. At least one node included in the graph is associated with an activity within a network environment. As one example, the request to filter is triggered by a user interaction with a visual representation of at least a portion of the graph. As another example, the request to filter is triggered by a user interaction with a query field. In response to receiving the filter request, a query is generated based on a join using a query service.

First claim

What is claimed is:

1. A method, comprising:
receiving, in response to a user interaction with a graph that comprises a plurality of nodes, wherein at least one node included in the graph is associated with an activity within a network environment, a request to filter information associated with activities within the network environment; and
in response to receiving the filter request, generating a query based on a join using a query service, wherein the join defines a group of filter keys of a same key type, wherein the join is performed across network and configuration queries.

2. The method of claim 1 , wherein the request to filter information is received in response to a user selection of a visual representation of at least a portion of the graph.

3. The method of claim 1 , wherein the request to filter information is received in response to a user interaction with a query field.

4. The method of claim 1 , further comprising:
performing the generated query against a database.

5. The method of claim 1 , wherein the join is also performed across event queries.

6. The method of claim 1 , wherein the query service dynamically translates the user interactions into one or more queries.

7. The method of claim 1 , wherein instances of the same type of filter key are formed as an implicit join group.

8. The method of claim 1 , wherein the same instance of a filter key can participate in different implicit join groups.

9. The method of claim 1 , wherein the request is associated with target information useable to generate or update a visualization of at least a portion of the graph.

10. A computer program product embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving, in response to a user interaction with a graph that comprises a plurality of nodes, wherein at least one node included in the graph is associated with an activity within a network environment, a request to filter information associated with activities within the network environment; and
in response to receiving the filter request, generating a query based on a join using a query service, wherein the join defines a group of filter keys of a same key type, wherein the join is performed across network and configuration queries.

11. The computer program product of claim 10 , wherein the request to filter information is received in response to a user selection of a visual representation of at least a portion of the graph.

12. The computer program product of claim 10 , wherein the request to filter information is received in response to a user interaction with a query field.

13. The computer program product of claim 10 , wherein the join request is also performed across event queries.

14. The computer program product of claim 10 , wherein the query service dynamically translates the user interactions into one or more queries.

15. The computer program product of claim 10 , wherein instances of the same type of filter key are formed as an implicit join group.

16. The computer program product of claim 10 , wherein the same instance of a filter key can participate in different implicit join groups.

17. The computer program product of claim 10 , wherein the request is associated with target information useable to generate or update a visualization of at least a portion of the graph.

18. A system, comprising:
a processor; and
a memory coupled to the processor and configured to provide the processor with instructions to:
receive, in response to a user interaction with a graph that comprises a plurality of nodes, wherein at least one node included in the graph is associated with an activity within a network environment, a request to filter information associated with activities within the network environment; and
in response to receiving the filter request, generate a query based on a join using a query service, wherein the join defines a group of filter keys of a same key type, wherein the join is performed across network and configuration queries.

19. The system of claim 18 , wherein the request to filter information is received in response to a user selection of a visual representation of at least a portion of the graph.

20. The system of claim 18 , wherein the request to filter information is received in response to a user interaction with a query field.

Assignees

• Lacework Inc

Inventors

• Chen Yijou
• Kalra Sanjay
• Kapoor Vikram

Classifications

• H04L67/306 Primary

  User profiles · CPC title

• H04L43/045

  for graphical visualisation of monitoring data · CPC title

• H04L43/06

  Generation of reports · CPC title

• G06F16/9024

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

• G06F16/9537

  Spatial or temporal dependent retrieval, e.g. spatiotemporal queries · CPC title