Processing a data stream
    61.
    发明授权
    Processing a data stream 有权
    处理数据流

    公开(公告)号:US09405801B2

    公开(公告)日:2016-08-02

    申请号:US12703574

    申请日:2010-02-10

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30516

    摘要: Methods, database management systems (“DBMS”) and computer-readable media are provided for processing unbounded stream data using a traditional DBMS. Execution of a query that includes a data stream as a data source may be initiated. Tuples may be processed in accordance with the query as the tuples are received through the data stream until an indication is received that execution of the query should cease.

    摘要翻译: 提供方法,数据库管理系统(“DBMS”)和计算机可读介质用于使用传统的DBMS来处理无界流数据。 可以启动包括数据流作为数据源的查询的执行。 可以根据查询来处理元组,因为通过数据流接收元组,直到接收到指示才能停止查询的执行。

    Continuous querying of a data stream
    63.
    发明授权
    Continuous querying of a data stream 有权
    连续查询数据流

    公开(公告)号:US09195708B2

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

    申请号:US13878473

    申请日:2010-10-14

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30424 G06F17/30516

    摘要: In continuous querying of a data stream, a query including query cycles can be initialized (310) on a query engine to analyze the data stream for desired information. The data stream can be processed (320) as segments, where a size of the segments is based on a user-defined parameter. The query cycles can be synchronized (330) with the segments of the data stream. A first segment can be analyzed (340) by performing the query on the first segment to obtain a first result. A query state of the query can be persisted (350) and the query operation can be rewound to begin a new query cycle. A second segment can be analyzed (360) in the new query cycle by performing the query on the second segment based on the first result.

    摘要翻译: 在数据流的连续查询中,可以在查询引擎上初始化包括查询循环的查询(310),以分析所需信息的数据流。 可以将数据流处理(320)作为段,其中段的大小基于用户定义的参数。 查询周期可以与数据流的段同步(330)。 可以通过对第一段执行查询来获得第一结果来分析第一段(340)。 查询的查询状态可以被持久化(350),并且查询操作可以被倒退以开始一个新的查询周期。 可以在新的查询周期中通过基于第一个结果对第二个分段执行查询来分析(360)第二分段。

    Network balancing procedure that includes redistributing flows on arcs incident on a batch of vertices
    64.
    发明授权
    Network balancing procedure that includes redistributing flows on arcs incident on a batch of vertices 有权
    网络平衡过程,包括重新分布在一组顶点上的弧上的流

    公开(公告)号:US09003419B2

    公开(公告)日:2015-04-07

    申请号:US12512246

    申请日:2009-07-30

    IPC分类号: G06F9/46 H04L12/803

    CPC分类号: H04L47/125

    摘要: A representation of a flow network having vertices connected by arcs is provided. The vertices include a first set of vertices that provide flow to a second set of vertices over arcs connecting the first set and second set of vertices. A balancing procedure in the network is performed that includes redistributing flows on arcs incident on the second set of vertices. The balancing procedure includes selecting a batch of the vertices in the second set, and redistributing flows on arcs incident on the selected batch of vertices. The selecting and redistributing are repeated for other batches of vertices in the second set.

    摘要翻译: 提供了具有由弧连接的顶点的流网络的表示。 顶点包括第一组顶点,其在连接第一组和第二组顶点的弧上提供流向第二组顶点的流。 执行网络中的平衡过程,其包括重新分布入射在第二组顶点的弧上的流。 平衡过程包括选择第二组中的一批顶点,并重新分布入侵在所选批次顶点上的圆弧上的流。 对第二组中的其他批次的顶点重复选择和重新分配。

    Hierarchical cluster determination based on subgraph density
    65.
    发明授权
    Hierarchical cluster determination based on subgraph density 有权
    基于子图密度的分层聚类确定

    公开(公告)号:US08971665B2

    公开(公告)日:2015-03-03

    申请号:US13562598

    申请日:2012-07-31

    申请人: Bin Zhang Meichun Hsu

    发明人: Bin Zhang Meichun Hsu

    IPC分类号: G06K9/36 G06F7/00

    CPC分类号: G06K9/6219

    摘要: Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters.

    摘要翻译: 确定曲线图的发光子图。 该图包括互连顶点的顶点和边。 每个边缘连接两个顶点并具有重量。 顶点和边缘形成子图,最密集子图确定为密度大于阈值的子图。 根据最密集的子图确定层次结构级别的群集。 每个群集包括一组顶点和一组图的边。 每个级别对应于簇的不同密度。 层次结构从集群的最密集级别排列到集群的最低密度级别。

    Coordination of tasks executed by a plurality of threads using two synchronization primitive calls
    66.
    发明授权
    Coordination of tasks executed by a plurality of threads using two synchronization primitive calls 有权
    使用两个同步原语调用协调由多个线程执行的任务

    公开(公告)号:US08904406B2

    公开(公告)日:2014-12-02

    申请号:US12512256

    申请日:2009-07-30

    申请人: Bin Zhang Meichun Hsu

    发明人: Bin Zhang Meichun Hsu

    IPC分类号: G06F9/46 G06F9/52

    CPC分类号: G06F9/52 G06F9/522

    摘要: To coordinate tasks executed by a plurality of threads that each includes plural task sections, a call of a mark primitive to mark a first point after a first of the plural task sections is provided. Also, a call of a second primitive is provided to indicate that a second of the plural task sections is not allowed to begin until after the plurality of threads have each reached the first point.

    摘要翻译: 为了协调由包括多个任务部分的多个线程执行的任务,提供了在多个任务部分中的第一个之后标记第一点的标记原语的调用。 此外,提供第二原语的调用以指示在多个线程各自到达第一点之后,多个任务部分中的第二个不允许开始。

    Multi-input, multi-output-per-input user-defined-function-based database operations
    67.
    发明授权
    Multi-input, multi-output-per-input user-defined-function-based database operations 有权
    多输入,多输出输入的基于用户定义功能的数据库操作

    公开(公告)号:US08805870B2

    公开(公告)日:2014-08-12

    申请号:US13192373

    申请日:2011-07-27

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30415

    摘要: The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs.

    摘要翻译: 当前的应用公开了一种数据库管理系统,其提供多输入多输出用户定义的基于功能的操作。 数据库管理系统包括至少一个处理器和电子存储器,数据库查询处理器,其在由存储在计算机可读存储器中的计算机指令控制的计算机处理器上执行,其对多输入多输出 - 每个输入用户定义的功能,在每次呼叫中传送下一个输入到多输入多输出用户定义函数,以及多输入多输出用户定义函数, 定义的功能,在由存储在计算机可读存储器中的计算机指令控制的计算机处理器上执行,其使用三个不同的存储器缓冲器,其内容维持三个不同的时间段,以计算并返回到数据库查询处理器 多个输出响应多个输入中的至少一个。

    Hierarchical cluster determination based on subgraph density
    68.
    发明申请
    Hierarchical cluster determination based on subgraph density 有权
    基于子图密度的分层聚类确定

    公开(公告)号:US20140037227A1

    公开(公告)日:2014-02-06

    申请号:US13562598

    申请日:2012-07-31

    申请人: Bin Zhang Meichun Hsu

    发明人: Bin Zhang Meichun Hsu

    IPC分类号: G06K9/36

    CPC分类号: G06K9/6219

    摘要: Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters.

    摘要翻译: 确定曲线图的发光子图。 该图包括互连顶点的顶点和边。 每个边缘连接两个顶点并具有重量。 顶点和边缘形成子图,最密集子图确定为密度大于阈值的子图。 根据最密集的子图确定层次结构级别的群集。 每个群集包括一组顶点和一组图的边。 每个级别对应于簇的不同密度。 层次结构从集群的最密集级别排列到集群的最低密度级别。

    BAYESIAN NETWORKS OF CONTINUOUS QUERIES
    69.
    发明申请
    BAYESIAN NETWORKS OF CONTINUOUS QUERIES 审中-公开
    贝叶斯网络的连续查询

    公开(公告)号:US20130290368A1

    公开(公告)日:2013-10-31

    申请号:US13458955

    申请日:2012-04-27

    IPC分类号: G06F17/30

    摘要: Nodes of a Bayesian network can be respectively associated with continuous queries. In response to a result of one of the continuous query changing, the continuous queries that are associated with nodes in the Bayesian network that are descendant of a node associated with the changed continuous query are evaluated.

    摘要翻译: 贝叶斯网络的节点可以分别与连续查询相关联。 响应于连续查询改变之一的结果,评估与作为改变的连续查询相关联的节点的后代的贝叶斯网络中的节点的连续查询。

    Spatial querying in a data warehouse
    70.
    发明授权
    Spatial querying in a data warehouse 有权
    数据仓库中的空间查询

    公开(公告)号:US08396883B2

    公开(公告)日:2013-03-12

    申请号:US12994314

    申请日:2008-06-23

    IPC分类号: G06F7/00 G06F17/30

    摘要: A data warehouse that operates to receive a spatial query and return a spatial result for the spatial query, the data warehouse comprises a regular database operating to receive and process a regular query and return a query result in response to the regular query. The data warehouse also comprises an interface layer implemented external to the regular database and operating to intercept the spatial query and translate the spatial query into the regular query for processing by the regular database. The regular database includes at least one spatial index that is accessed by the interface layer to translate the spatial query into the regular query for processing by the regular database.

    摘要翻译: 操作用于接收空间查询并返回空间查询的空间结果的数据仓库,数据仓库包括操作以接收和处理常规查询并响应于常规查询返回查询结果的常规数据库。 数据仓库还包括在常规数据库外部实现的接口层,并操作以拦截空间查询,并将空间查询转换为常规查询以供常规数据库处理。 常规数据库包括至少一个由接口层访问的空间索引,以将空间查询转换成常规查询以供常规数据库处理。