中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

5 records (took 0.012 seconds)

    METHOD FOR OPTIMIZING INDEX, MASTER DATABASE NODE AND SUBSCRIBER DATABASE NODE
    1.
    发明申请
    METHOD FOR OPTIMIZING INDEX, MASTER DATABASE NODE AND SUBSCRIBER DATABASE NODE 审中-公开
    优化索引，主数据库节点和订阅者数据库节点的方法

    公开(公告)号：US20160259692A1

    公开(公告)日：2016-09-08

    申请号：US15158279

    申请日：2016-05-18

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Prasanna Venkatesh RAMAMURTHI ,  Vamsi KRISHNA ,  Mahesh Kumar BEHERA

    IPC: G06F11/14 ,  G06F17/30

    CPC classification number: G06F11/1451 ,  G06F17/30312 ,  G06F17/30336 ,  G06F17/30368 ,  G06F17/30575 ,  G06F2201/80

    Abstract: A method, a master database node and a subscriber database node for optimizing index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

    Abstract translation: 一种方法，主数据库节点和用户数据库节点，用于优化索引。 优化索引的方法包括：当主数据库节点添加索引时，由主数据库节点检查索引的角色信息是否匹配主数据库节点的角色信息; 当索引的角色信息与主数据库节点的角色信息匹配时，通过使用索引更新数据库信息。 在本发明中，主数据库节点和用户数据库节点中的不必要索引减少，同时保持模式相同。 此外，减少了从主数据库节点发送到订户数据库节点的不必要的日志。

    PARALLEL MERGE SORTING
    2.
    发明申请
    PARALLEL MERGE SORTING 审中-公开

    公开(公告)号：US20170083286A1

    公开(公告)日：2017-03-23

    申请号：US15365463

    申请日：2016-11-30

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Mahesh Kumar BEHERA ,  Prasanna Venkatesh RAMAMURTHI ,  Antoni WOLSKI

    IPC: G06F7/36 ,  G06F3/06

    Abstract: The invention relates to a sorting method (1100), the sorting method comprising: sorting (1101) the distributed input data locally per processing node (701, 702) by deploying first processes on the processing nodes (701, 702) to produce a plurality of sorted lists on the local memory partitions (401, 402, 403, 404) of the processing nodes (701, 702); creating (1102) a sequence of range blocks (703, 704, 713, 714) on the local memory partitions of the processing nodes (701, 702), copying (1103) the plurality of sorted lists to the sequence of range blocks (703, 704, 713, 714); and reading (1105) the sorted elements from the sequence of range blocks (703, 704, 713, 714) sequentially with respect to their range to obtain the sorted input data.

    DATA LOCKING METHOD BASED ON ALTERNATING ROW AND COLUMN LOCKS
    4.
    发明申请
    DATA LOCKING METHOD BASED ON ALTERNATING ROW AND COLUMN LOCKS 审中-公开

    公开(公告)号：US20200050597A1

    公开(公告)日：2020-02-13

    申请号：US16659226

    申请日：2019-10-21

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Kalyan SIVAKUMAR ,  Antoni WOLSKI ,  Mahesh Kumar BEHERA

    IPC: G06F16/23 ,  G06F16/22 ,  G06F9/54

    Abstract: Device for executing an operation on a database, the device comprising a C-queue configured to store a plurality of column-oriented operations, an R-queue configured to store a plurality of row-oriented operations, a scheduler configured to assign the operation to the C-queue or the R-queue based on whether the operation is row-oriented, a timing unit configured to alternate between C-type time slots and R-type time slots, an execution unit configured to execute operations from the C-queue in C-type time slots and/or operations from the R-queue in R-type time slots.

Patent Agency Ranking