PERIODIC GENERATION OF INTERMEDIATE SUMMARIES TO FACILITATE REPORT ACCELERATION

    公开(公告)号:US20190042610A1

    公开(公告)日:2019-02-07

    申请号:US16155746

    申请日:2018-10-09

    Applicant: Splunk Inc.

    Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

    REPORT ACCELERATION USING INTERMEDIATE RESULTS IN A DISTRIBUTED INDEXER SYSTEM FOR SEARCHING EVENTS
    2.
    发明申请
    REPORT ACCELERATION USING INTERMEDIATE RESULTS IN A DISTRIBUTED INDEXER SYSTEM FOR SEARCHING EVENTS 有权
    使用分布式索引系统进行中间结果的报告加速搜索活动

    公开(公告)号:US20140149423A1

    公开(公告)日:2014-05-29

    申请号:US14168738

    申请日:2014-01-30

    Applicant: SPLUNK INC.

    Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

    Abstract translation: 一种用于管理基于多个事件划分的数据集的搜索的方法和系统。 可以分析搜索查询的结构以确定对数据集执行的逻辑计算动作是否可减少。 分析每个分区中的数据以确定分区中的数据的至少一部分是否可缩减。 响应于随后或重复出现的搜索请求,可以针对每个分区聚合可缩减数据和可缩减搜索计算的中间摘要。 接下来,可以基于聚合中间摘要,聚合可缩减搜索计算以及排列在用于数据集的多个分区中的至少一个分区中的adhoc不可还原数据的查询中的至少一个来生成搜索结果。

Patent Agency Ranking