会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 81. 发明授权
    • Generating query suggestions
    • 生成查询建议
    • US08639679B1
    • 2014-01-28
    • US13102013
    • 2011-05-05
    • Xin Zhou
    • Xin Zhou
    • G06F7/00G06F17/30
    • G06F17/3097
    • Methods, systems, apparatus, including computer program products, for generating search query suggestions. In one aspect, a method includes receiving a partial search query entered by a user through a user interface of a client device, generating a set of predicted complete queries, wherein at least a subset of the predicted complete queries are queries associated with the user, identifying one or more of the set of complete queries as being selectable suggestions to the partial search query for display in the user interface of the client for possible selection by the user.
    • 方法,系统,设备,包括计算机程序产品,用于生成搜索查询建议。 一方面,一种方法包括:接收由用户通过客户端设备的用户界面输入的部分搜索查询,生成一组预测的完整查询,其中所述预测完成查询的至少一个子集是与用户相关联的查询, 将所述一组完整查询中的一个或多个识别为对所述部分搜索查询的可选建议,以在所述客户端的用户界面中显示以供用户选择。
    • 82. 发明授权
    • System, method, and computer-readable medium for dynamic detection and management of data skew in parallel join operations
    • 用于动态检测和管理并行连接操作中数据偏移的系统,方法和计算机可读介质
    • US08510280B2
    • 2013-08-13
    • US12494366
    • 2009-06-30
    • Yu XuOlli Pekka KostamaaXin Zhou
    • Yu XuOlli Pekka KostamaaXin Zhou
    • G06F17/00
    • G06F17/30498
    • A system, method, and computer-readable medium for dynamic detection and management of data skew in parallel join operations are provided. Rows allocated to processing modules involved in a join operation are redistributed among the processing modules by a hash redistribution of the join attributes. Receipt by a processing module of an excessive number of redistributed rows having a skewed value on the join attribute is detected by a processing module which notifies other processing modules of the skewed value. Processing modules then terminate redistribution of rows having a join attribute value matching the skewed value and either store such rows locally or duplicate the rows. The processing module that has received an excessive number of redistributed rows removes rows having a skewed value of the join attribute from a redistribution spool allocated thereto and duplicates the rows to each of the processing modules. The join operation is completed by performing a local join at each processing module and merging the results of the local join operations.
    • 提供了一种用于并行连接操作中的数据偏移的动态检测和管理的系统,方法和计算机可读介质。 通过连接属性的哈希再分配,分配给处理模块中涉及的连接操作的行在处理模块之间重新分配。 由处理模块对连接属性具有偏斜值的过多重新分配行的处理模块进行检测,该处理模块向其他处理模块通知偏斜值。 然后,处理模块终止具有与偏斜值匹配的连接属性值的行的重新分配,并且在本地存储这些行或复制行。 已经接收到过多数量的再分配行的处理模块从分配给其的再分配假脱机移除具有连接属性的偏斜值的行,并将行复制到每个处理模块。 通过在每个处理模块执行本地连接并合并本地连接操作的结果来完成连接操作。
    • 87. 发明授权
    • Parallel algorithm to implement temporal aggregate queries
    • 并行算法实现时间聚合查询
    • US08301652B2
    • 2012-10-30
    • US12203180
    • 2008-09-03
    • Xin Zhou
    • Xin Zhou
    • G06F17/30
    • G06F17/30551
    • A method executed by a plurality of processors in a database system to implement temporal aggregate queries. The database system has a temporal table. A plurality of consecutive temporal partitions are defined and allocated to the respective processors. A query is received to aggregate at least one attribute of the temporal table. In response to the query, a plurality of timestamps are identified in the temporal table, the respective timestamps are allocated to the respective temporal partitions, the value changes in the at least one attribute at the plural timestamps are computed within each partition using the respective processors to which each partition is allocated, and the value changes within each partition are aggregated using the respective processors to which each partition is allocated to produce an aggregate value for the query.
    • 由数据库系统中的多个处理器执行的方法来实现时间聚合查询。 数据库系统有一个时间表。 多个连续的时间分区被定义并分配给各个处理器。 接收到一个查询以聚合时间表的至少一个属性。 响应于该查询,在时间表中识别多个时间戳,将各个时间戳分配给各个时间分区,使用各个处理器在每个分区内计算多个时间戳的至少一个属性中的值变化 分配每个分区的每个分区,并且使用分配给每个分区的相应处理器来聚合每个分区内的值更改,以产生查询的聚合值。
    • 88. 发明申请
    • GENERATING RELATED INPUT SUGGESTIONS
    • 产生相关输入建议
    • US20120259829A1
    • 2012-10-11
    • US13517241
    • 2009-12-30
    • Xin Zhou
    • Xin Zhou
    • G06F17/30
    • G06F16/24534G06F16/9535
    • Methods, systems, and apparatus, including computer program products, for generating search query suggestions. In one aspect, a method includes receiving query and label data, the data including a plurality of queries and, for each query, specifying one or more labels associated with the query, where the queries are n grams submitted by users of a search engine and the labels identify a category or topic in which an associated query belongs; generating a suggestion resource, including: identifying unique labels in the query and label data; and for each unique label: indexing the unique label; identifying in the query and label data, each query associated with the unique label; and associating, in the suggestion resource, the identified queries with the unique label; and storing the suggestion resource in a computer readable medium.
    • 用于生成搜索查询建议的方法,系统和设备,包括计算机程序产品。 在一个方面,一种方法包括接收查询和标签数据,所述数据包括多个查询,并且对于每个查询,指定与查询相关联的一个或多个标签,其中查询是由搜索引擎的用户提交的n克, 标签标识相关联的查询所属的类别或主题; 生成建议资源,包括:在查询和标签数据中识别唯一标签; 并为每个独特的标签:索引独特的标签; 在查询和标签数据中识别每个查询与唯一标签相关联; 并在建议资源中将所识别的查询与唯一标签相关联; 以及将所述建议资源存储在计算机可读介质中。
    • 90. 发明授权
    • System, method, and computer-readable medium for reducing row redistribution costs for parallel join operations
    • 系统,方法和计算机可读介质,用于减少并行连接操作的行再分配成本
    • US08150836B2
    • 2012-04-03
    • US12193814
    • 2008-08-19
    • Yu XuOlli Pekka KostamaaXin Zhou
    • Yu XuOlli Pekka KostamaaXin Zhou
    • G06F17/30
    • G06F17/30466G06F17/30445
    • A system, method, and computer-readable medium for optimizing execution of a join operation in a parallel processing system are provided. A plurality of processing nodes that have at least one row of one or more tables involved in a join operation are identified. For each of the processing nodes, respective counts of rows that would be redistributed to each of the processing nodes based on join attributes of the rows are determined. A redistribution matrix is calculated from the counts of rows of each of the processing nodes. An optimized redistribution matrix is generated from the redistribution matrix, wherein the optimized redistribution matrix provides a minimization of rows to be redistributed among the nodes to execute the join operation.
    • 提供了一种用于优化并行处理系统中的连接操作的执行的系统,方法和计算机可读介质。 识别在连接操作中具有至少一行一个或多个表的多个处理节点。 对于每个处理节点,确定将基于行的连接属性重新分配给每个处理节点的行的相应计数。 从每个处理节点的行数计算再分配矩阵。 从再分配矩阵生成优化的再分配矩阵,其中优化的再分配矩阵提供在节点之间重新分布的行的最小化以执行连接操作。