Supporting graph data structure transformations in graphs generated from a query to event data

    公开(公告)号:US11269876B1

    公开(公告)日:2022-03-08

    申请号:US16864029

    申请日:2020-04-30

    Applicant: Splunk Inc.

    Abstract: Systems and methods are disclosed for supporting transformations of a graph generated from a query to event data. The event data may be unstructured event data, from which instances of a journey can be identified that represent sequences of related events describing actions performed in a computing environment. When evaluating journey instances, it can be helpful to visualize the instances as a graph. Depending on the instances viewed, a user may desire different modifications to the graph. While such modifications can be made when initially building instances from the unstructured event data, this can limit reuse of the resulting instances (since the modification would also be present when evaluating other subsets). To address this, embodiments of the present disclosure enable graph modifications to be applied to subsets of journey instances after building those instances from unstructured event data, increasing reuse of instances built from a query against the unstructured data.

    Supporting graph data structure transformations in graphs generated from a query to event data

    公开(公告)号:US11625394B1

    公开(公告)日:2023-04-11

    申请号:US17653626

    申请日:2022-03-04

    Applicant: Splunk Inc.

    Abstract: Systems and methods are disclosed for supporting transformations of a graph generated from a query to event data. The event data may be unstructured event data, from which instances of a journey can be identified that represent sequences of related events describing actions performed in a computing environment. When evaluating journey instances, it can be helpful to visualize the instances as a graph. Depending on the instances viewed, a user may desire different modifications to the graph. While such modifications can be made when initially building instances from the unstructured event data, this can limit reuse of the resulting instances (since the modification would also be present when evaluating other subsets). To address this, embodiments of the present disclosure enable graph modifications to be applied to subsets of journey instances after building those instances from unstructured event data, increasing reuse of instances built from a query against the unstructured data.

    Supporting graph data structure transformations in graphs generated from a query to event data

    公开(公告)号:US12001426B1

    公开(公告)日:2024-06-04

    申请号:US18295567

    申请日:2023-04-04

    Applicant: Splunk Inc.

    CPC classification number: G06F16/24526 G06F8/77 G06F16/212

    Abstract: Systems and methods are disclosed for supporting transformations of a graph generated from a query to event data. The event data may be unstructured event data, from which instances of a journey can be identified that represent sequences of related events describing actions performed in a computing environment. When evaluating journey instances, it can be helpful to visualize the instances as a graph. Depending on the instances viewed, a user may desire different modifications to the graph. While such modifications can be made when initially building instances from the unstructured event data, this can limit reuse of the resulting instances (since the modification would also be present when evaluating other subsets). To address this, embodiments of the present disclosure enable graph modifications to be applied to subsets of journey instances after building those instances from unstructured event data, increasing reuse of instances built from a query against the unstructured data.

    Collapsing nodes within a journey model

    公开(公告)号:US11809447B1

    公开(公告)日:2023-11-07

    申请号:US16863757

    申请日:2020-04-30

    Applicant: Splunk Inc.

    CPC classification number: G06F16/26 G06F16/283

    Abstract: A system can collapse steps into an aggregate step to simplify analysis while maintaining underlying data that forms each of the steps collapsed into the aggregate step. The steps may or may not be related in a sequence or grouping of steps. The aggregate step may be a new step that comprises the data of the individual steps used to form the aggregate step. Alternatively, the aggregate step may be a virtual step that may reference or link to the steps used to form the aggregate step, but may not include the data itself. By forming aggregate steps, filtering and notification generation can be simplified. Further, extraneous data can be collapsed into a single aggregate step, which can be particularly advantageously when analyzing large data sets.

Patent Agency Ranking