利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

56 条记录 (耗时 0.032 秒)

    NESTED COMPLEX SEQUENCE PATTERN QUERIES OVER EVENT STREAMS
    1.
    发明申请
    NESTED COMPLEX SEQUENCE PATTERN QUERIES OVER EVENT STREAMS 有权
    基于事件流的NESTED复杂序列模式查询

    公开(公告)号：US20130066855A1

    公开(公告)日：2013-03-14

    申请号：US13431773

    申请日：2012-03-27

    申请人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke Angelika Rundensteiner ,  Medhabi Ray

    发明人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke Angelika Rundensteiner ,  Medhabi Ray

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30477 ,  G06F17/30864

    摘要： A method of evaluating nested complex sequence pattern queries includes obtaining events from an event stream and evaluating the events within a first window using an outer query to produce outer partial results. The method also includes determining a more stringent window constraint, the more stringent window constraint comprising a subset of the window constraint corresponding to events that produces the outer partial results and passing the more stringent window constraint to an inner query nested within the outer query. A complex event processing system is also provided.

    摘要翻译： 评估嵌套复杂序列模式查询的方法包括从事件流获取事件并且使用外部查询来评估第一窗口内的事件以产生外部部分结果。 该方法还包括确定更严格的窗口约束，更严格的窗口约束包括对应于产生外部部分结果的事件的窗口约束的子集，并将更严格的窗口约束传递给嵌套在外部查询内的内部查询。 还提供了一个复杂的事件处理系统。

    Nested complex sequence pattern queries over event streams
    2.
    发明授权
    Nested complex sequence pattern queries over event streams 有权
    嵌套复杂序列模式查询事件流

    公开(公告)号：US09298773B2

    公开(公告)日：2016-03-29

    申请号：US13431773

    申请日：2012-03-27

    申请人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke Angelika Rundensteiner ,  Medhabi Ray

    发明人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke Angelika Rundensteiner ,  Medhabi Ray

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30477 ,  G06F17/30864

    摘要： A method of evaluating nested complex sequence pattern queries includes obtaining events from an event stream and evaluating the events within a first window using an outer query to produce outer partial results. The method also includes determining a more stringent window constraint, the more stringent window constraint comprising a subset of the window constraint corresponding to events that produces the outer partial results and passing the more stringent window constraint to an inner query nested within the outer query. A complex event processing system is also provided.

    摘要翻译： 评估嵌套复杂序列模式查询的方法包括从事件流获取事件并且使用外部查询来评估第一窗口内的事件以产生外部部分结果。 该方法还包括确定更严格的窗口约束，更严格的窗口约束包括对应于产生外部部分结果的事件的窗口约束的子集，并将更严格的窗口约束传递给嵌套在外部查询内的内部查询。 还提供了一个复杂的事件处理系统。

    Determining an execution ordering
    5.
    发明授权
    Determining an execution ordering 有权
    确定执行顺序

    公开(公告)号：US09305058B2

    公开(公告)日：2016-04-05

    申请号：US13285785

    申请日：2011-10-31

    申请人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke A. Rundensteiner

    发明人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke A. Rundensteiner

    IPC分类号： G06F17/00 ,  G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30498 ,  G06F17/30516

    摘要： There is provided a computer-implemented method of determining an execution ordering. An exemplary method comprises generating a directed graph based on a hierarchy. The hierarchy includes a plurality of pattern queries. The method also includes determining a minimum spanning tree of the directed graph. The method further includes determining an execution order of the pattern queries based on the minimum spanning tree.

    摘要翻译： 提供了一种用于确定执行顺序的计算机实现的方法。 一种示例性方法包括基于层次来生成有向图。 层次结构包括多个模式查询。 该方法还包括确定有向图的最小生成树。 该方法还包括基于最小生成树确定模式查询的执行顺序。

    DETERMINING AN EXECUTION ORDERING
    6.
    发明申请
    DETERMINING AN EXECUTION ORDERING 有权
    确定执行订单

    公开(公告)号：US20130110820A1

    公开(公告)日：2013-05-02

    申请号：US13285785

    申请日：2011-10-31

    申请人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke A. Rundensteiner

    发明人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta ,  Mo Liu ,  Elke A. Rundensteiner

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30498 ,  G06F17/30516

    摘要： There is provided a computer-implemented method of determining an execution ordering. An exemplary method comprises generating a directed graph based on a hierarchy. The hierarchy includes a plurality of pattern queries. The method also includes determining a minimum spanning tree of the directed graph. The method further includes determining an execution order of the pattern queries based on the minimum spanning tree.

    摘要翻译： 提供了一种用于确定执行顺序的计算机实现的方法。 一种示例性方法包括基于层次来生成有向图。 层次结构包括多个模式查询。 该方法还包括确定有向图的最小生成树。 该方法还包括基于最小生成树确定模式查询的执行顺序。

    Outlier data point detection
    9.
    发明授权
    Outlier data point detection 有权
    异常数据点检测

    公开(公告)号：US09195713B2

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

    申请号：US12614432

    申请日：2009-11-08

    申请人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta

    发明人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta

    IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F17/30

    CPC分类号： G06F17/30516

    摘要： New data points are added to a streaming window of data points and existing data points are removed from the window over time. Each data point has a value for each of one or more dimensions. Each time a given new data point is added to the window or a given existing data point is removed from the window, one or more outlier detection data structures are updated. Each outlier detection data structure encompasses the data points within the streaming window for a corresponding dimension. The outlier detection data structures are used to detect outlier data points within the window over selected one or more dimensions.

    摘要翻译： 新的数据点被添加到数据点的流窗口中，并且现有的数据点随着时间从窗口中移除。 每个数据点具有一个或多个维度中的每一个的值。 每当将给定的新数据点添加到窗口或者从窗口中移除给定的现有数据点时，将更新一个或多个异常值检测数据结构。 每个异常值检测数据结构包含用于相应维度的流窗口内的数据点。 异常值检测数据结构用于在所选择的一个或多个维度上检测窗口内的异常值数据点。

    System and method for modifying scheduling of queries in response to the balancing average stretch and maximum stretch of scheduled queries
    10.
    发明授权
    System and method for modifying scheduling of queries in response to the balancing average stretch and maximum stretch of scheduled queries 有权
    响应于平均平均拉伸和调度查询的最大拉伸来修改查询调度的系统和方法

    公开(公告)号：US08365174B2

    公开(公告)日：2013-01-29

    申请号：US12251272

    申请日：2008-10-14

    申请人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta

    发明人： Chetan Kumar Gupta ,  Song Wang ,  Abhay Mehta

    IPC分类号： G06F9/46 ,  G06F17/30

    CPC分类号： G06F9/4881 ,  G06F17/30463 ,  G06F17/30545

    摘要： A mixed workload scheduler and operating method efficiently handle diverse queries ranging from short less-intensive queries to long resource-intensive queries. A scheduler is configured for scheduling mixed workloads and comprises an analyzer and a schedule controller. The analyzer detects execution time and wait time of a plurality of queries and balances average stretch and maximum stretch of scheduled queries wherein query stretch is defined as a ratio of a sum of wait time and execution time to execution time of a query. The schedule controller modifies scheduling of queries according to service level differentiation.

    摘要翻译： 混合的工作负载调度程序和操作方法可以有效地处理从较少密集型查询到长资源密集型查询的各种查询。 调度器被配置用于调度混合工作负载并且包括分析器和调度控制器。 分析器检测多个查询的执行时间和等待时间，并且将查询延伸定义为等待时间和执行时间之和与查询的执行时间的比率的预定查询的平均拉伸和最大拉伸。 调度控制器根据服务水平差异来修改查询的调度。