Extensible query interface for dynamic data compositions and filter applications
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 an implicit join using a query service.
1. A system, comprising:
a processor configured 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 an implicit join using a query service, wherein generating the query includes generating a join graph, and wherein the join graph comprises a list of join links; and
a memory coupled to the processor and configured to provide the processor with instructions.
2. The system of claim 1 wherein the request to filter information is received in response to a user clicking on a visual representation of at least a portion of the graph.
3. The system of claim 1 wherein the request to filter information is received in response to a user interaction with a query field.
4. The system of claim 1 wherein the processor is further configured to perform the generated query against a database.
5. The system of claim 1 wherein a given join link maintains a reverse map from an entity to a filter key.
6. The system of claim 1 wherein generating the query includes finding a join path and wherein finding the join path includes performing a traversal.
7. The system of claim 6 wherein the traversal comprises a breadth first traversal.
8. The system of claim 6 wherein the traversal is performed using a priority order list of join links for all entities sharing an implicit join group.
9. The system of claim 6 wherein the traversal is stopped when a node is reached which has at least one local filter.
10. The system of claim 1 wherein generating the query includes selecting a shortest path included in a set of join paths.
11. The system of claim 1 wherein the request is associated with target information needed to generate or update a visualization of at least a portion of the graph.
12. 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 an implicit join using a query service, wherein generating the query includes generating a join graph, and wherein the join graph comprises a list of join links.
13. The method of claim 12 wherein the request to filter information is received in response to a user clicking on a visual representation of at least a portion of the graph.
14. The method of claim 12 wherein the request to filter information is received in response to a user interaction with a query field.
15. The method of claim 12 wherein generating the query includes finding a join path and wherein finding the join path includes performing a traversal.
16. The method of claim 12 wherein the generated query is performed against a database.
17. The method of claim 12 wherein a given join link maintains a reverse map from an entity to a filter key.
18. The method of claim 15 wherein the traversal comprises a breadth first traversal.
19. The method of claim 15 wherein the traversal is performed using a priority order list of join links for all entities sharing an implicit join group.
20. The method of claim 15 wherein the traversal is stopped when a node is reached which has at least one local filter.
21. The method of claim 12 wherein the request is associated with target information needed to generate or update a visualization of at least a portion of the graph.
22. A computer program product embodied in a tangible 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 an implicit join using a query service, wherein generating the query includes generating a join graph, and wherein the join graph comprises a list of join links.