Report acceleration using intermediate summaries
AssigneeSplunk Inc.
InventorsStephen P. Sorkin, Steve Yu Zhang, Ledion Bitincka
Life of this patent
Estimating the term…
Loading patent…
AssigneeSplunk Inc.
InventorsStephen P. Sorkin, Steve Yu Zhang, Ledion Bitincka
Estimating the term…
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.
A method, comprising:
A method, comprising:
An apparatus, comprising:
An apparatus, comprising:
A non-transitory computer-readable medium storing one or more sequences of instructions, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform:
A non-transitory computer-readable medium storing one or more sequences of instructions, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform:
Dependencies are inferred from the claim text.