中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.014 seconds)

    SUPPLEMENTING A HIGH PERFORMANCE ANALYTICS STORE WITH EVALUATION OF INDIVIDUAL EVENTS TO RESPOND TO AN EVENT QUERY
    2.
    发明申请
    SUPPLEMENTING A HIGH PERFORMANCE ANALYTICS STORE WITH EVALUATION OF INDIVIDUAL EVENTS TO RESPOND TO AN EVENT QUERY 有权
    在评估个人活动以响应事件查询的情况下对高性能分析存储进行补充

    公开(公告)号：US20140214888A1

    公开(公告)日：2014-07-31

    申请号：US14170159

    申请日：2014-01-31

    Applicant: SPLUNK INC.

    Inventor： David Ryan MARQUARDT ,  Stephen Phillip SORKIN ,  Steve Yu ZHANG

    IPC: G06F17/30

    CPC classification number: G06F17/30321 ,  G06F17/30 ,  G06F17/30457 ,  G06F17/30477 ,  G06F17/30554 ,  G06F17/30595 ,  G06F17/30864

    Abstract: Embodiments are directed are towards the transparent summarization of events. Queries directed towards summarizing and reporting on event records may be received at a search head. Search heads may be associated with one more indexers containing event records. The search head may forward the query to the indexers the can resolve the query for concurrent execution. If a query is a collection query, indexers may generate summarization information based on event records located on the indexers. Event record fields included in the summarization information may be determined based on terms included in the collection query. If a query is a stats query, each indexer may generate a partial result set from previously generated summarization information, returning the partial result sets to the search head. Collection queries may be saved and scheduled to run and periodically update the summarization information.

    Abstract translation: 实施例针对事件的透明总结。 可以在搜索头收到针对事件记录的总结和报告的查询。 搜索头可能与一个包含事件记录的索引器相关联。 搜索头可以将查询转发给索引器，可以解析用于并发执行的查询。 如果查询是集合查询，则索引器可以基于位于索引器上的事件记录生成摘要信息。 包含在汇总信息中的事件记录字段可以基于收集查询中包含的项来确定。 如果查询是统计查询，则每个索引器可以从先前生成的摘要信息生成部分结果集，将部分结果集返回到搜索头。 收集查询可以保存并计划运行，并定期更新摘要信息。

    PERIODIC GENERATION OF INTERMEDIATE SUMMARIES TO FACILITATE REPORT ACCELERATION
    3.
    发明申请
    PERIODIC GENERATION OF INTERMEDIATE SUMMARIES TO FACILITATE REPORT ACCELERATION 审中-公开

    公开(公告)号：US20190042610A1

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

    申请号：US16155746

    申请日：2018-10-09

    Applicant: Splunk Inc.

    Inventor： Stephen Phillip SORKIN ,  Steve Yu ZHANG ,  Ledion BITINCKA

    IPC: G06F17/30

    CPC classification number: G06F16/2228 ,  G06F16/245 ,  G06F16/248 ,  G06F16/278 ,  G06F16/901

    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.

    SCALABLE INTERACTIVE DISPLAY OF DISTRIBUTED DATA
    4.
    发明申请
    SCALABLE INTERACTIVE DISPLAY OF DISTRIBUTED DATA 有权
    分布式数据的可扩展交互显示

    公开(公告)号：US20140136529A1

    公开(公告)日：2014-05-15

    申请号：US14158421

    申请日：2014-01-17

    Applicant: Splunk Inc.

    Inventor： Steve Yu ZHANG ,  Stephen Phillip SORKIN

    IPC: G06F17/30

    CPC classification number: G06F17/3053 ,  G06F17/30194 ,  G06F17/30312 ,  G06F17/30353 ,  G06F17/30386 ,  G06F17/30477 ,  G06F17/30483 ,  G06F17/30486 ,  G06F17/30528 ,  G06F17/30545 ,  G06F17/30551 ,  G06F17/30554 ,  G06F17/30675 ,  G06F17/30864 ,  G06F17/30867 ,  G06F17/30973 ,  G06F17/30991 ,  H04L41/0604 ,  H04L41/22 ,  H04L67/1097

    Abstract: A method, system, and processor-readable storage medium are directed towards generating a report derived from data, such as event data, stored on a plurality of distributed nodes. In one embodiment the analysis is generated using a “divide and conquer” algorithm, such that each distributed node analyzes locally stored event data while an aggregating node combines these analysis results to generate the report. In one embodiment, each distributed node also transmits a list of event data references associated with the analysis result to the aggregating node. The aggregating node may then generate a global ordered list of data references based on the list of event data references received from each distributed node. Subsequently, in response to a user selection of a range of global event data, the report may dynamically retrieve event data from one or more distributed nodes for display according to the global order.

    Abstract translation: 方法，系统和处理器可读存储介质被引导为生成从存储在多个分布式节点上的诸如事件数据的数据导出的报告。 在一个实施例中，使用“分割和征服”算法生成分析，使得每个分布式节点分析本地存储的事件数据，而聚合节点组合这些分析结果以生成报告。 在一个实施例中，每个分布式节点还将与分析结果相关联的事件数据引用的列表发送到聚合节点。 然后，聚合节点可以基于从每个分布式节点接收的事件数据参考的列表来生成数据引用的全局有序列表。 随后，响应于用户选择一系列全局事件数据，报告可以动态地从一个或多个分布式节点检索事件数据，以便根据全局顺序进行显示。

    Search Query Processing Using Operational Parameters
    5.
    发明申请
    Search Query Processing Using Operational Parameters 审中-公开
    使用操作参数搜索查询处理

    公开(公告)号：US20150339351A1

    公开(公告)日：2015-11-26

    申请号：US14815980

    申请日：2015-08-01

    Applicant: Splunk Inc.

    Inventor： Erik M. SWAN ,  R. David CARASSO ,  Robin Kumar DAS ,  Rory GREENE ,  Bradley HALL ,  Nicholas Christian MEALY ,  Brian Philip MURPHY ,  Stephen Phillip SORKIN ,  Andre David STECHERT ,  Michael Joseph BAUM

    IPC: G06F17/30

    Abstract: Methods and apparatus consistent with the invention provide the ability to search and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search.

    Abstract translation: 与本发明一致的方法和装置提供了基于搜索搜索和呈现时间序列数据的能力。 时间序列数据是在一个或多个通常连续的流中发生的时间戳记录的序列，表示某种类型的活动。 在一个实施例中，时间序列数据被组织成具有归一化时间戳的离散事件，并且事件由时间和关键字索引。 完全或部分地基于搜索时计算的时间索引机制，关键字索引机制或统计索引，检索相关的事件信息。

    GENERATION OF A DATA MODEL APPLIED TO QUERIES
    7.
    发明申请
    GENERATION OF A DATA MODEL APPLIED TO QUERIES 审中-公开
    适用于查询的数据模型的生成

    公开(公告)号：US20150142847A1

    公开(公告)日：2015-05-21

    申请号：US14611232

    申请日：2015-01-31

    Applicant: Splunk Inc.

    Inventor： Alice Emily NEELS ,  Archana Sulochana GANAPATHI ,  Marc Robichaud ,  Stephen Phillip SORKIN ,  Steve Yu ZHANG

    IPC: G06F17/30 ,  G06F17/24

    CPC classification number: G06F17/30395 ,  G06F3/0482 ,  G06F17/248 ,  G06F17/30283 ,  G06F17/30424 ,  G06F17/30528 ,  G06F17/30554 ,  G06F17/30867

    Abstract: Embodiments include generating data models that may give semantic meaning for unstructured or structured data that may include data generated and/or received by search engines, including a time series engine. A method includes generating a data model for data stored in a repository. Generating the data model includes generating an initial query string, executing the initial query string on the data, generating an initial result set based on the initial query string being executed on the data, determining one or more candidate fields from one or results of the initial result set, generating a candidate data model based on the one or more candidate fields, iteratively modifying the candidate data model until the candidate data model models the data, and using the candidate data model as the data model.

    Abstract translation: 实施例包括生成可以给非结构化或结构化数据赋予语义意义的数据模型，其可以包括由搜索引擎（包括时间序列引擎）生成和/或接收的数据。 一种方法包括为存储在存储库中的数据生成数据模型。 生成数据模型包括生成初始查询字符串，对数据执行初始查询字符串，基于对数据执行的初始查询字符串生成初始结果集，从一个或多个初始查询字符串的结果确定一个或多个候选字段 生成基于一个或多个候选字段的候选数据模型，迭代地修改候选数据模型，直到候选数据模型对数据建模，并使用候选数据模型作为数据模型。

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

    公开(公告)号：US20140149423A1

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

    申请号：US14168738

    申请日：2014-01-30

    Applicant: SPLUNK INC.

    Inventor： Stephen Phillip SORKIN ,  Steve Yu ZHANG ,  Ledion BITINCKA

    IPC: G06F17/30

    CPC classification number: G06F17/30321 ,  G06F17/30424 ,  G06F17/30554 ,  G06F17/30584 ,  G06F17/30946

    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