会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • User defined data partitioning (UDP)—grouping of data based on computation model
    • 用户定义的数据分区(UDP) - 基于计算模型的数据分组
    • US08904381B2
    • 2014-12-02
    • US12358995
    • 2009-01-23
    • Qiming ChenMeichun Hsu
    • Qiming ChenMeichun Hsu
    • G06F17/30G06F9/50
    • G06F17/30339G06F9/5066G06F17/30584Y10S707/968
    • Methods, systems, and computer program products are provided for generating application-aware data partitioning to support parallel computing. A label for a user defined data partitioning (UDP) key is generated by a labeling process to configure data partitions of original data. The UDP is labeled by the labeling process to include at least one key property excluded from the original data. The data partitions are evenly distributed to co-locate and balance the data partitions and corresponding computations performed by computational servers. A data record of the data partitions is retrieved by performing an all-node parallel search of the computational servers using the UDP key.
    • 提供了方法,系统和计算机程序产品,用于生成应用感知数据分区以支持并行计算。 用户定义的数据分区(UDP)密钥的标签由标记过程生成,以配置原始数据的数据分区。 UDP由标记过程标记,以包含从原始数据中排除的至少一个密钥属性。 数据分区均匀分布,以共同定位和平衡数据分区和计算服务器执行的相应计算。 通过使用UDP密钥执行计算服务器的全部节点并行搜索来检索数据分区的数据记录。
    • 9. 发明申请
    • Deriving a Nested Chain of Densest Subgraphs from a Graph
    • 从图中衍生出一个嵌套的致密子图链
    • US20130226840A1
    • 2013-08-29
    • US13406843
    • 2012-02-28
    • Bin ZhangMeichun Hsu
    • Bin ZhangMeichun Hsu
    • G06F15/18
    • G06F17/30958
    • A nested chain of densest subgraphs is derived by a computer from a given graph that has multiple vertices and edges. The two ends of each edge are assigned with respective incident weights, and each vertex is given a vertex weight. A weight balancing process is carried out by the computer to iteratively go through the edges to adjust the incident weights of each edge and the vertex weights of the vertices connected by that edge to reduce a difference between the vertex weights of the two vertices. After the balancing, the vertex weights are put in an ordered sequence according to their values, and a nested chain of densest subgraphs is derived from the ordered sequence.
    • 密集子图的嵌套链由计算机从具有多个顶点和边的给定图导出。 每个边缘的两端被分配有相应的事件权重,并且每个顶点被赋予顶点权重。 计算机进行权重平衡处理,以迭代地遍历边缘,以调整每个边缘的入射权重和由该边连接的顶点的顶点权重,以减少两个顶点的顶点权重之间的差异。 在平衡之后,顶点权重根据它们的值被置于有序序列中,并且从有序序列导出嵌套的密集子图链。
    • 10. 发明申请
    • System and Method for Querying a Data Stream
    • 用于查询数据流的系统和方法
    • US20130191370A1
    • 2013-07-25
    • US13825019
    • 2010-10-11
    • Qiming ChenMeichun Hsu
    • Qiming ChenMeichun Hsu
    • G06F17/30
    • G06F16/24542G06F16/24568
    • There is provided a method (200) for querying a data stream. The method includes receiving a query plan based on a query specifying the data stream and a window. The method (200) further includes receiving one or more stream elements from the data stream during the window. Additionally, the method (200) includes applying the query to the one or more stream elements by passing the one or more stream elements from a scan operator at a leaf of the query plan to an upper layer of the query plan on a tuple-by-tuple basis. The method (200) also includes committing a result of the query based on the one or more stream elements.
    • 提供了一种用于查询数据流的方法(200)。 该方法包括基于指定数据流和窗口的查询来接收查询计划。 方法(200)还包括在窗口期间从数据流接收一个或多个流元素。 另外,方法(200)包括通过将来自查询计划的叶的扫描运算符的一个或多个流元素传递到元组的查询计划的上层来将查询应用于一个或多个流元素 元组基础 所述方法(200)还包括基于所述一个或多个流元素提交所述查询的结果。