公开(公告)号：US11182353B2

公开(公告)日：2021-11-23

申请号：US16458684

申请日：2019-07-01

Applicant: Huawei Technologies Co., Ltd.

Inventor： Shanshan Ying ,  Junhua Zhu

IPC: G06F16/21 ,  G06F16/2455 ,  G06F16/242

Abstract: A method includes receiving an execution request, where the execution request is used to request to execute a task including at least two stored procedures, requesting at least two threads, and dispatching each stored procedure in the task to one of the at least two threads for execution, receiving Structured Query Language (SQL) statements sent by the at least two threads when the at least two threads execute the stored procedures included in the task, and grouping and caching the received SQL statements based on a same access characteristic, and for an SQL statement cache group that satisfies a preset trigger condition, calling an SQL statement execution engine to execute an SQL statement in the SQL statement cache group.

公开(公告)号：US20170060773A1

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

申请号：US15348056

申请日：2016-11-10

Applicant: HUAWEI TECHNOLOGIES CO.,LTD.

Inventor： Junhua Zhu

IPC: G06F12/123 ,  G06F12/02 ,  G06F12/0871

CPC classification number: G06F12/123 ,  G06F12/0246 ,  G06F12/0871 ,  G06F12/121 ,  G06F2212/214 ,  G06F2212/222 ,  G06F2212/502 ,  G06F2212/604 ,  G06F2212/7204

Abstract: Embodiments of the present invention disclose a method and apparatus of cache management for a non-volatile storage device. The method embodiment includes: determining a size relationship between a capacity sum of a clean page subpool and a dirty page subpool and a cache capacity; determining, when the capacity sum is equal to the cache capacity, whether identification information of a to-be-accessed page is in a history list of clean pages or a history list of dirty pages; and when it is determined that the identification information of the to-be-accessed page is in the history list of clean pages, adding a first adjustment value to a clean page subpool capacity threshold; and when the identification information of the to-be-accessed page is in the history list of dirty pages, subtracting a second adjustment value from the clean page subpool capacity threshold.

Abstract translation: 本发明的实施例公开了一种用于非易失性存储设备的高速缓存管理的方法和装置。 方法实施例包括：确定清洁页面子站和脏页面子空间的容量和与高速缓存容量之间的大小关系; 当容量和等于高速缓存容量时，确定待访问页面的识别信息是否在干净页面的历史列表或脏页面的历史列表中; 并且当确定要访问页面的识别信息在清洁页面的历史列表中时，将第一调整值添加到清洁页面子库容量阈值; 并且当待访问页面的识别信息在脏页面的历史列表中时，从清洁页面子库容量阈值减去第二调整值。

公开(公告)号：US20240095241A1

公开(公告)日：2024-03-21

申请号：US18520221

申请日：2023-11-27

Applicant: HUAWEI TECHNOLOGIES CO., LTD. ,  Fudan University

Inventor： Weiguo Zheng ,  Yuejia Zhang ,  Junhua Zhu

IPC: G06F16/2453 ,  G06F16/2455 ,  G06F16/901

CPC classification number: G06F16/24532 ,  G06F16/24554 ,  G06F16/9024 ,  G06F16/9027

Abstract: Embodiments of this disclosure provide a data search method and apparatus, and an electronic device. The method includes obtaining a search request, where the search request includes a query graph formed by a plurality of nodes and a plurality of edges between the plurality of nodes, each node represents an object, and each edge represents an association relationship between objects; determining a plurality of query subgraphs based on the query graph, where each query subgraph includes a group of nodes in the plurality of nodes and edges between the group of nodes, and the plurality of query subgraphs have at least one same node in the plurality of nodes; searching a target data graph in parallel for data subgraphs that respectively match the plurality of query subgraphs; and merging the data subgraphs that respectively match the plurality of query subgraphs, to determine a search result that matches the query graph.

公开(公告)号：US09524245B2

公开(公告)日：2016-12-20

申请号：US14546797

申请日：2014-11-18

Applicant: Huawei Technologies Co., Ltd.

Inventor： Junhua Zhu

IPC: G06F12/08 ,  G06F12/02 ,  G06F12/12

CPC classification number: G06F12/123 ,  G06F12/0246 ,  G06F12/0871 ,  G06F12/121 ,  G06F2212/214 ,  G06F2212/222 ,  G06F2212/502 ,  G06F2212/604 ,  G06F2212/7204

Abstract: Embodiments of the present invention disclose a method and apparatus of cache management for a non-volatile storage device. The method embodiment includes: determining a size relationship between a capacity sum of a clean page subpool and a dirty page subpool and a cache capacity; determining, when the capacity sum is equal to the cache capacity, whether identification information of a to-be-accessed page is in a history list of clean pages or a history list of dirty pages; and when it is determined that the identification information of the to-be-accessed page is in the history list of clean pages, adding a first adjustment value to a clean page subpool capacity threshold; and when the identification information of the to-be-accessed page is in the history list of dirty pages, subtracting a second adjustment value from the clean page subpool capacity threshold.

Abstract translation: 本发明的实施例公开了一种用于非易失性存储设备的高速缓存管理的方法和装置。 方法实施例包括：确定清洁页面子站和脏页面子空间的容量和与高速缓存容量之间的大小关系; 当容量和等于高速缓存容量时，确定待访问页面的识别信息是否在干净页面的历史列表或脏页面的历史列表中; 并且当确定要访问页面的识别信息在清洁页面的历史列表中时，将第一调整值添加到清洁页面子库容量阈值; 并且当待访问页面的识别信息在脏页面的历史列表中时，从清洁页面子库容量阈值减去第二调整值。

公开(公告)号：US20160321109A1

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

申请号：US15208510

申请日：2016-07-12

Applicant: Huawei Technologies Co., Ltd.

Inventor： Guangwu He ,  Junhua Zhu

IPC: G06F9/50 ,  H04L29/08

CPC classification number: G06F9/5027 ,  H04L67/1008

Abstract: A resource management method and apparatus are provided. The resource management method includes: selecting, by a resource manager RM, according to a type and a quantity of application masters AMs that need to be started in advance, resources from resources registered by a node manager, encapsulating the resources into multiple containers matching the AMs, and starting the AMs in the matching containers; and when the RM receives a job submitted by a client, checking, in the AMs according to information about the job, whether there is a matching AM to be used to execute the job, and if there is a matching AM, submitting the job to the matching AM for execution. Such that, when a client submits a job, the job can be submitted to an AM that has been started in advance for execution, thereby reducing latency resulting from resource allocation and AM startup.

Abstract translation: 提供了一种资源管理方法和装置。 资源管理方法包括：由资源管理器RM根据预先启动的应用程序主机AM的类型和数量来选择来自节点管理器注册的资源的资源，将资源封装到与 AM，并在匹配的容器中启动AM; 当RM接收到客户提交的作业时，根据有关作业的信息在AM中检查是否存在用于执行作业的匹配的AM，并且如果存在匹配的AM，则将作业提交到 匹配AM执行。 这样，当客户端提交作业时，可以将作业提交给提前启动的AM进行执行，从而减少资源分配和AM启动造成的延迟。

公开(公告)号：US11093522B2

公开(公告)日：2021-08-17

申请号：US16165596

申请日：2018-10-19

Applicant: Huawei Technologies Co., Ltd.

Inventor： Guoping Wang ,  Junhua Zhu

IPC: G06F16/00 ,  G06F16/27 ,  G06F16/18 ,  G06F16/23

Abstract: A database replication method and apparatus for a distributed system are provided and relate to the database field. The method includes: receiving by a coordination server, a timestamp of a multi-partition transaction newly added to a first partition of a secondary cluster; determining, by the coordination server, a target timestamp for the first partition based on the received timestamp of the newly added multi-partition transaction and a stored multi-partition transaction timestamp of each partition of the secondary cluster; and sending, by the coordination server, the target timestamp to the first partition, so that the first partition executes a replication log in the first partition based on the target timestamp. In this way, the corresponding partition can execute, without waiting, a multi-partition transaction that is present in all the partitions but has not been executed, thereby avoiding data inconsistency and increasing replication efficiency.

公开(公告)号：US10664445B2

公开(公告)日：2020-05-26

申请号：US15044273

申请日：2016-02-16

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yong Li ,  Junhua Zhu

IPC: G06F16/17 ,  G06F16/174 ,  G06F16/2455 ,  G06F16/16

Abstract: A Bloom filter generation method and apparatus is presented, where the method includes acquiring to-be-combined files, when a quantity of deletion records in the to-be-combined files falls within a false positive permission range, acquiring a Bloom filter of each to-be-combined file, where capacities of Bloom filters of different to-be-combined files are the same, and performing a bitwise OR operation on bit values at same locations in Bloom filters of the different to-be-combined files, in order to obtain a target Bloom filter and use the target Bloom filter as a Bloom filter of a combined file obtained by combining the different to-be-combined files, and hence an amount of calculation processing in Bloom filter generation is reduced, a system resource is reduced, and resource overheads are reduced.

公开(公告)号：US20190057142A1

公开(公告)日：2019-02-21

申请号：US16165596

申请日：2018-10-19

Applicant: Huawei Technologies Co., Ltd.

Inventor： Guoping Wang ,  Junhua Zhu

IPC: G06F17/30

Abstract: A database replication method and apparatus for a distributed system are provided and relate to the database field. The method includes: receiving by a coordination server, a timestamp of a multi-partition transaction newly added to a first partition of a secondary cluster; determining, by the coordination server, a target timestamp for the first partition based on the received timestamp of the newly added multi-partition transaction and a stored multi-partition transaction timestamp of each partition of the secondary cluster; and sending, by the coordination server, the target timestamp to the first partition, so that the first partition executes a replication log in the first partition based on the target timestamp. In this way, the corresponding partition can execute, without waiting, a multi-partition transaction that is present in all the partitions but has not been executed, thereby avoiding data inconsistency and increasing replication efficiency.

公开(公告)号：US09727487B2

公开(公告)日：2017-08-08

申请号：US15348056

申请日：2016-11-10

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Junhua Zhu

IPC: G06F12/02 ,  G06F12/123 ,  G06F12/0871 ,  G06F12/121

CPC classification number: G06F12/123 ,  G06F12/0246 ,  G06F12/0871 ,  G06F12/121 ,  G06F2212/214 ,  G06F2212/222 ,  G06F2212/502 ,  G06F2212/604 ,  G06F2212/7204

Abstract: Embodiments of the present invention disclose a method and apparatus of cache management for a non-volatile storage device. The method embodiment includes: determining a size relationship between a capacity sum of a clean page subpool and a dirty page subpool and a cache capacity; determining, when the capacity sum is equal to the cache capacity, whether identification information of a to-be-accessed page is in a history list of clean pages or a history list of dirty pages; and when it is determined that the identification information of the to-be-accessed page is in the history list of clean pages, adding a first adjustment value to a clean page subpool capacity threshold; and when the identification information of the to-be-accessed page is in the history list of dirty pages, subtracting a second adjustment value from the clean page subpool capacity threshold.

公开(公告)号：US20160162506A1

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

申请号：US15044273

申请日：2016-02-16

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yong Li ,  Junhua Zhu

IPC: G06F17/30

CPC classification number: G06F16/1744 ,  G06F16/16 ,  G06F16/24558

Abstract: A Bloom filter generation method and apparatus is presented, where the method includes acquiring to-be-combined files, when a quantity of deletion records in the to-be-combined files falls within a false positive permission range, acquiring a Bloom filter of each to-be-combined file, where capacities of Bloom filters of different to-be-combined files are the same, and performing a bitwise OR operation on bit values at same locations in Bloom filters of the different to-be-combined files, in order to obtain a target Bloom filter and use the target Bloom filter as a Bloom filter of a combined file obtained by combining the different to-be-combined files, and hence an amount of calculation processing in Bloom filter generation is reduced, a system resource is reduced, and resource overheads are reduced.

Abstract translation: 提出了一种布鲁姆过滤器生成方法和装置，其中，当待组合文件中的删除记录的数量落在假肯定许可范围内时，该方法包括获取待组合的文件，获取每个 要组合的文件，其中不同的组合文件的Bloom过滤器的容量是相同的，并且对不同的待组合文件的Bloom过滤器中的相同位置的位值执行按位OR运算， 为了获得目标Bloom过滤器并使用目标Bloom过滤器作为通过组合不同的待组合文件获得的组合文件的布隆过滤器，因此减少了布隆过滤器生成中的计算处理量，系统资源 减少了资源开销。