# US 2022/0286498 A1 · Service request message sending method, distributed database architecture and computer readable storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0286498 A1
- Document ID: US20220286498A1
- Status: Published application
- Kind: A1
- Application number: 17/628,775
- Filed: 2020-06-08
- Published: 2022-09-08
- Earliest claimed: 2019-07-29
- Assignees: Zte Corporation
- Applicants: ZTE Corporation
- Inventors: Jian SUI; Qinyuan LU; Lingdong ZHANG; Wenwen JING
- Web page: https://patentgrep.com/patent/US20220286498A1

## CPC

- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- H04L 67/1008: based on parameters of servers, e.g. available memory or workload (monitoring of computer activity G06F11/30)
- H04L 67/1012: based on compliance of requirements or conditions with available server resources
- H04L 67/1029: using data related to the state of servers by a load balancer
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A service request message sending method, a distributed database architecture and a computer readable storage medium are disclosed. The method includes: receiving (S101) a service request message, and sending (S102) the service request message to a corresponding storage unit through N tiers of computing nodes, where N is an integer greater than or equal to 2, and the closer the tier is to the storage unit, the larger the number of computing nodes in that tier is.

## Claims

### Claim 1

A method for sending service request message applied to a distributed database, comprising:
receiving a service request message; and
sending the service request message to a corresponding storage unit through N tiers of computing nodes, wherein N is an integer greater than or equal to 2, and the closer the tier is to the storage unit, the larger the number of computing nodes in that tier is.

### Claim 2 (depends on 1)

The method for sending service request message of claim 1, before sending the service request message to a corresponding storage unit through N tiers of computing nodes, further comprising:
dividing a storage cluster into at least two storage units each containing at least one storage node.

### Claim 3 (depends on 2)

The method for sending service request message of claim 2, wherein the computing nodes closest to the storage unit are bottom-tier computing nodes configured to manage and maintain all storage nodes in the storage unit connected to the bottom-tier computing nodes.

### Claim 4 (depends on 3)

The method for sending service request message of claim 3, wherein the computing nodes in other tiers other than the bottom-tier computing nodes enable a function of load balancing.

### Claim 5 (depends on 1)

The method for sending service request message of claim 1, wherein the computing nodes in the N tiers adopt a same distribution policy or different distribution policies.

### Claim 6 (depends on 5)

The method for sending service request message of claim 5, wherein the distribution policy includes at least one of hash distribution policy, range distribution policy, list distribution policy and duplicate distribution policy.

### Claim 7

A distributed database architecture, comprising:
N tiers of computing nodes, wherein N is an integer greater than or equal to 2, and the closer the tier is to the storage unit, the larger the number of computing nodes in that tier is; and
at least one storage unit, wherein a service request message is sent to the corresponding storage unit through the N tiers of compute nodes in response to receipt of the service request message.

### Claim 8 (depends on 7)

The distributed database architecture of claim 7, further comprising at least two storage units each containing at least one storage node.

### Claim 9 (depends on 8)

The distributed database architecture of claim 8, wherein the computing nodes closest to the storage unit are bottom-tier computing nodes configured to manage and maintain all storage nodes in the storage unit connected to the bottom-tier computing nodes.

### Claim 10 (depends on 9)

The distributed database architecture of claim 9, wherein the computing nodes in other tiers other than the bottom-tier computing nodes enable a function of load balancing.

### Claim 11

A non-transitory computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform a method for sending service request message comprising the following steps:
receiving a service request message; and
sending the service request message to a corresponding storage unit through N tiers of computing nodes, wherein N is an integer greater than or equal to 2, and the closer the tier is to the storage unit, the larger the number of computing nodes in that tier is.

### Claim 12 (depends on 2)

The method for sending service request message of claim 2, wherein the computing nodes in the N tiers adopt a same distribution policy or different distribution policies.

### Claim 13 (depends on 3)

The method for sending service request message of claim 3, wherein the computing nodes in the N tiers adopt a same distribution policy or different distribution policies.

### Claim 14 (depends on 4)

The method for sending service request message of claim 4, wherein the computing nodes in the N tiers adopt a same distribution policy or different distribution policies.

### Claim 15 (depends on 12)

The method for sending service request message of claim 12, wherein the distribution policy includes at least one of hash distribution policy, range distribution policy, list distribution policy and duplicate distribution policy.

### Claim 16 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein before sending the service request message to a corresponding storage unit through N tiers of computing nodes, further comprising:
dividing a storage cluster into at least two storage units each containing at least one storage node.

### Claim 17 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein the computing nodes closest to the storage unit are bottom-tier computing nodes configured to manage and maintain all storage nodes in the storage unit connected to the bottom-tier computing nodes.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the computing nodes in other tiers other than the bottom-tier computing nodes enable a function of load balancing.

### Claim 19 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the computing nodes in the N tiers adopt a same distribution policy or different distribution policies.

### Claim 20 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein the computing nodes in the N tiers adopt a same distribution policy or different distribution policies.
