Extensible query interface for dynamic data compositions and filter applications
A request to filter information associated with activities within a network environment is received. As one example, the request to filter is triggered by a user interaction with a 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 constructing a join graph and traversing the join graph to locate a shortest path and wherein generating the query also includes finding a join path; 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 the join graph comprises a list of join links.
6. The system of claim 5 wherein a given join link maintains a reverse map from an entity to a filter key.
7. The system of claim 1 wherein finding the join path includes performing a traversal.
8. The system of claim 7 wherein the traversal comprises a breadth first traversal.
9. The system of claim 7 wherein the traversal is performed using a priority order list of join links for all entities sharing an implicit join group.
10. The system of claim 7 wherein the traversal is stopped when a node is reached which has at least one local filter.
11. The system of claim 1 wherein generating the query includes selecting as the shortest path, a shortest path included in a set of join paths.
12. 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.
13. 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 constructing a join graph and traversing the join graph to locate a shortest path and wherein generating the query also includes finding a join path.
14. The method of claim 13 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.
15. The method of claim 13 wherein generating the query includes selecting a shortest path included in a set of join paths.
16. The method of claim 13 wherein the request to filter information is received in response to a user interaction with a query field.
17. The method of claim 13 further comprising performing the generated query against a database.
18. The method of claim 13 wherein the join graph comprises a list of join links.
19. The method of claim 18 wherein a given join link maintains a reverse map from an entity to a filter key.
20. The method of claim 13 wherein finding the join path includes performing a traversal.
21. The method of claim 20 wherein the traversal comprises a breadth first traversal.
22. The method of claim 21 wherein the traversal is performed using a priority order list of join links for all entities sharing an implicit join group.
23. The method of claim 21 wherein the traversal is stopped when a node is reached which has at least one local filter.
24. The method of claim 13 wherein generating the query includes selecting as the shortest path, a shortest path included in a set of join paths.
25. The method of claim 13 wherein the request is associated with target information needed to generate or update a visualization of at least a portion of the graph.
26. 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 constructing a join graph and traversing the join graph to locate a shortest path and wherein generating the query also includes finding a loin path.