International Business Machines Corporation

Huawei Technologies Co., Limited

Huawei Cloud Computing Technologies Co., Ltd.

University of Toronto

Huawei Technologies Canada Co., Ltd.

Tencent Technology (shenzhen) Company Limited

Chong Chen

Qi Wang

Lei Guo

Shutao Yuan

Fang Liu

Michael Spriggs

Zhaohui Ding

Jin Chen

Alexandre Depoutovitch

Per-Ake Larson

Zhe Jin

Jason T S Lam

Chun Liang Yuan

Xiaodi Ke

Ajith Shanmuganathan

Sam Sanjabi

Jack Hon Wai Ng

Zhenhua Hu

Jie Zhu

Baochun Li

Shu Lin

Li Chen

Zhao Xing

Daesuk Kang

Shuhao Liu

Jason Lam

Chen Chen

Xun Xue

Robin Grosman

Zhenquan Wu

Xingxing Dai

Shane Anthony Bergsma

Xiu Qiao Li

Reza Pournaghi

Timothy James Zeyl

Lingyun Song

Rongsong Shen

Anxue Du

Lianqiang Wang

Wei Pei

Wang Qi

Jack Ng

Chunsheng Sun

Mao Tang

Qi Cheng

Hongyang Hu

Yanping Meng

Jason TS Lam

A method of incorporating a bloom filter (BF) into cost-based bottom-up query optimization includes: receiving a query including a request to join at least two data tables that include a first data table and a second data table; generating, in response to the request, at least two query plans that includes a first query plan including subplans to: create the BF based on the second data table, apply the BF to the first data table for filtering data of the first data table before the first data table is joined with another data table, and join the first data table with the another data table; submitting the at least two query plans to a cost-based bottom-up optimizer to obtain a target query plan; and providing, as a response to the received query, a set of data that is retrieved from a data retrieval system by executing the target query plan.

Method of incorporating bloom filter into cost-based bottom-up query optimization and computing device

A method of managing locks in a database is performed by a row lock manager of a database master. The method includes receiving, from a transaction executing on the database master, a row lock request for a row in the database. The row lock request includes a page in the database where the row is located. The row lock request also includes a row lock mode of sufficient strength to perform the transaction. Then, sending, to a page lock manager, a request for a covering lock of the page. The request specifies a page lock mode of sufficient strength to satisfy the row lock mode. Also, receiving, from the page lock manager, a grant of the page lock. The page lock includes information on row locks of rows located in the page. Then, granting, to the transaction, the row lock.

Method and apparatus for fine-grained hierarchical locking in a multi-master database system

A method of managing load in a database system includes receiving, by a compute node, from a page store, a log writing quota. Then, requesting, by a transaction of the compute node, a lock of a page to be modified by the transaction where the page is part of the page store including a plurality of pages and the transaction is configured to write a data amount to a log. Also, granting, by a lock manager of the compute node, the lock and determining, by the compute node, that the data amount exceeds the log writing quota. Furthermore, releasing, by the transaction, the lock, and throttling, by the compute node, the transaction until a criteria is fulfilled. Then, reacquiring, by the transaction, in response to the criteria being fulfilled, the lock, and writing, by the compute node, the data amount to the log.

Methods and apparatus using locks to throttle a distributed cloud database workload

A logical clock is implemented in networked nodes. Messages between nodes can include either a scalar timestamp or a vector timestamp. The scalar timestamp leads to an overhead reduction, and nodes can select whether to send a scalar or vector timestamp depending on requirements. Message recipients update their logical clock vector differently depending on whether the scalar or vector timestamp is received. Applications to multi-master databases are also provided. The clock conforms to Lamport clock requirements when the scalar timestamp is sent, and conforms to both Lamport and vector clock requirements when the vector timestamp is sent.

Vector-scalar logical clock and associated method, apparatus and system

The present disclosure provides a method of reading data maintained in a tree data structure, such as B+ tree, using near data processing (NDP) in a cloud native database. According to embodiments, a desired LSN will be used in NDP page reads on the master computing node (e.g. master SQL node). When the master computing node (e.g. master SQL node) reads the regular page, the maximum desired LSN (e.g. the latest page version number) for that regular page will be used. Embodiments use features of the desired LSN and page locking, wherein correct versions of pages can be obtained by using the desired LSN associated with a page, in combination with page locking, and can enable the reading of a consistent tree structure and achieve good read/write concurrency.

Method and apparatus for reading data maintained in a tree data structure

Methods, processing units, and computer-readable media in a cloud-based database are described. Redo log records are applied to a page at a database replica only when an updated version of the page is requested at the database replica. A log cache may be used by a replica node of the database to track recent redo log records applicable to a given page. The recent redo log records stored in the log cache may be applied to update the page on-demand when an updated version of the page is requested. By applying only the redo log records applicable to pages that are currently being requested, processing resources may be used only to generate pages that are currently required. Methods for registering redo log records into the log cache by the master or replica server are also described.

Method, apparatus and medium for data synchronization between cloud database nodes

Methods and systems are described for managing a shared database. One or more processing nodes may access a shared database. A common log node may manage the shared database. The common log node may validate database operations requested by the one or more processing nodes. During validation, the common log node may detect conflicts that occur between database operations requested by the one or more processing nodes.

Systems and methods for managing a shared database

Methods and apparatuses in a cloud-based database management system are described. Data in a database are stored in a plurality of pages in a page store of the database. A plurality of redo log records are received to be applied to the database. The redo log records within a predefined boundary are parsed to determine, for each given redo log record, a corresponding page to which the given log record is to be applied. The redo log records are reordered by corresponding page. The reordered redo log records are stored to be applied to the page store of the database.

Methods and apparatuses for generating redo records for cloud-based database

Methods and systems of managing a resource in a distributed resource management system can include: receiving a resource request by at least one processor in the distributed resource management system, the resource request identifying a requested resource type corresponding to at least one of: a class identifier identifying a resource class assigned to a composite resource, and a class identifier identifying at least one additional resource associated with the composite resource; determining availability of the requested resource type; and scheduling a workload associated with the resource request for execution based on the determination.

System and method for resource management

According to one aspect of the present disclosure, a technique for job distribution within a grid environment includes receiving jobs at a submission cluster for distribution of the jobs to one or more execution clusters where each of the execution clusters has one or more execution hosts and maintains a pending job queue. A resource capacity corresponding to each respective execution cluster is determined, and resource requirements for the jobs is determined. A length of the pending job queue indicating a quantity of pending jobs to maintain in the pending job queue for the respective execution cluster is dynamically calculated and periodically adjusted based on the resource capacity and the resource requirements of the respective execution clusters. The jobs are allocated to the respective execution clusters according to the length of the pending job queue of the respective execution clusters.

Job distribution within a grid environment

This application provides a data communications system and method. The system includes a first chassis and a second chassis. The first chassis includes a first high-performance switching module and a first low-performance switching module. The second chassis includes a second high-performance switching module and a second low-performance switching module. The first high-performance switching module is connected to the second low-performance switching module. The first low-performance switching module is connected to the second high-performance switching module. The first high-performance switching module is configured to connect to a third low-performance switching module in a third chassis that is to be added to the communications system. The second high-performance switching module is configured to connect to a fourth low-performance switching module in the third chassis that is to be added to the communications system. During capacity expansion, there is no need to change cables between deployed chassis.

Data communications system and method

A technique for job distribution within a grid environment includes receiving jobs at a submission cluster for distribution of the jobs to at least one of a plurality of execution clusters where each execution cluster includes one or more execution hosts. Resource attributes are determined corresponding to each execution host of the execution clusters. Resource requirements are determined for the job and candidate execution clusters are identified for processing the job based on the resource attributes of the execution hosts and the resource requirements of the job. An optimum execution cluster is selected from the candidate execution clusters for allocating the job thereto for execution of the job based on a weighting factor applied to select resources of the respective execution clusters.

Job distribution within a grid environment using clusters of execution hosts

Embodiments of the present invention disclose an information identification code-based information authentication method, a terminal, and a computer storage medium. The method includes: generating an information identification code, the information identification code carrying a first identifier used for representing a user identity and a second identifier used for representing a generation time of the information identification code; and initiating, by a first terminal, or receiving, from the first terminal, a first request according to the information identification code, to request a second terminal to perform identity authentication on the first terminal to satisfy a target requirement.

Information identification code-based information authentication method and terminal

A method includes receiving an indication of a change to a page of a database and adding a new log record corresponding to the page to a common log comprising log records, the new log record describing the change made to the page and assigned a distinct version number. The method further includes synchronously writing the new log record to each log store replica in a set of log store replicas, and asynchronously writing the new log record to all page store replicas for the page to update the page that is stored on each of the page store replicas, where each store replica for the page serves reads for the page. In response to receiving, from a predetermined number of the page store replicas, an acknowledgement of the writing of the log record, discarding the new log record from the common log.

System and method for replicating data in distributed database systems

A method for managing file system replication can include: collecting event data associated with file system events, each of the file system events indicative of a modification of at least one file at a first file system location; for each of the file system events, generating at least one file system action to apply the modification of the at least one file at the first file system location to at least one corresponding file at a second file system location; storing the at least one generated file system action in an action buffer; identifying dependencies between file system actions in the action buffer; and scheduling the file system actions in the action buffer for execution based on the dependencies.

Systems, devices and methods for managing file system replication

Growing community of inventors

Richmond Hill, Canada

Chong Chen