# US 2015/0312334 A1 · Distributed database, method of sharing data, program storing medium, and apparatus for a distributed database

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

- Number: US 2015/0312334 A1
- Document ID: US20150312334A1
- Status: Published application
- Kind: A1
- Application number: 14/633,233
- Filed: 2015-02-27
- Published: 2015-10-29
- Earliest claimed: 2014-04-24
- Assignees: Casio Computer Co., Ltd.
- Applicants: Casio Computer Co., Ltd.
- Inventors: Hideyuki Toriumi
- Web page: https://patentgrep.com/patent/US20150312334A1

## CPC

- H04L 67/1059: {Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups}
- H04L 43/0817: by checking functioning
- H04L 67/104: Peer-to-peer [P2P] networks
- H04M 3/51: Centralised call answering arrangements requiring operator intervention {, e.g. call or contact centers for telemarketing}
- H04L 67/108: {characterised by resources being split in blocks or fragments}
- H04M 2203/402: Agent or workforce management
- H04M 2203/558: Databases
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)

## Abstract

A distributed database of a peer-to-peer network is provided. In the network, a group is composed of plural nodes, and the nodes in the group each have CPU and a state list memory. CPU of each node sends other node a request for information to obtain and store node-state information. The node-state information is delivered through a prescribed route among the nodes in the group. When the number of nodes participating in the group increases more than a prescribed number, the participating nodes are separated into plural groups.

## Claims

### Claim 1

A distributed database of a peer-to-peer network in which a group is composed of plural nodes, wherein
the plural nodes in the group each have CPU and a state list memory;
the state list memory stores node-state information which CPU of one of the plural nodes has obtained from other node by sending a request for information;
CPU of each of the plural nodes delivers the node-state information through a prescribed route among the nodes in the group; and
when the number of nodes participating in the group increases more than a prescribed number, the participating nodes are separated into plural groups.

### Claim 2 (depends on 1)

The distributed database according to claim 1, wherein
when the node-state information has been shared among all the nodes within the group, then CPU of the node in the group sends a request for node-state information to a node in other group.

### Claim 3 (depends on 1)

The distributed database according to claim 1, wherein
CPU of the node sends other node a request for information of a life/death state.

### Claim 4 (depends on 3)

The distributed database according to claim 3, wherein
when CPU of the node has received information of a death state from the other node, then said other node is deleted from the group.

### Claim 5 (depends on 1)

The distributed database according to claim 1, wherein
CPU of the node sends other node a request for information of a remaining capacity of the state list memory or information of performance of other node.

### Claim 6

A method of sharing data in a distributed database of a peer-to-peer network which is composed of plural nodes, the method comprising:
a first process of registering plural nodes in a group;
a second process of delivering information through a prescribed route within the group, whereby the information is obtained and shared among the plural nodes in the group; and
a third process of separating the nodes into plural groups, when the number of nodes participating in the group has increased more than a prescribed number.

### Claim 7 (depends on 6)

The method of sharing data in a distributed database of a peer-to-peer network according to claim 6, wherein
the first process comprises:
a process (1) which registers the nodes in the group, and gives an identification number to each of the nodes in the group while registering the total number N of nodes in the group, whereby each node is identified in the group by the identification number given to said node;
a process (2) which renews list-information of the nodes in the order in which the nodes are registered in the group, wherein all the nodes each have the list-information indicating a state of the node in the group, and makes the last registered node link with the first registered node to obtain the list-information of said first registered node; and
a process (3) which delivers the renewed list-information to all the nodes in the group.

### Claim 8 (depends on 6)

The method of sharing data in a distributed database of a peer-to-peer network according to claim 6, wherein
the second process comprises:
a process (4) in which a node [N] in the group sends a node [N+1] a request for information together with the list-information of the node [N];
a process (5) in which the node [N+1] sends back the node [N] a response including the list-information obtained from the node [N] in addition to the list-information of the node [N+1];
a process (6) in which the node [N] adds the response obtained from the node [N+1] to the list-information of the node [N];
a process (7) in which the node [N] performs the process (5) in response to a request from a node [N−1] to send back a response to the node [N−1]; and
a process which returns to the process (4).

### Claim 9 (depends on 6)

The method of sharing data in a distributed database of a peer-to-peer network according to claim 6, wherein
the third process comprises:
a process (9) which increases the participating nodes and separates the participating nodes into two groups, a first group and a second group, when the number N of the participating nodes reaches an upper limit number M, whereby the nodes from the node [1] to the node [M/2] are included in the first group and the nodes from the node [M/2+1] to the node [M] are included in the second group;
a process (10) which makes the node [M/2] interconnect with the node [1] and the node [M] interconnect with the node [M/2+1]; and
a process (11) which makes the node in one of the groups interconnect with other node in the other group, when information has been shared among all the nodes in said one of the groups.

### Claim 10 (depends on 8)

The method of sharing data in a distributed database of a peer-to-peer network according to claim 8, wherein
the second process further comprises:
a process (12) in which a node [x] sends a request to a following node in connection order, when the node [x] receives no response more than K times in the process (7) or when the node [x] receives an abnormal response.

### Claim 11

A non-transitory computer-readable storage medium with an executable program stored thereon, wherein the program is for sharing information in a distributed database of a peer-to-peer network composed of plural nodes, each node having a computer, and instructs the computer of a node [N] to perform the following processes:
a process which registers plural nodes in a group;
a process which sends a node [N+1] a request for information together with list-information of the node [N], wherein the list-information of the node [N] indicates a state of the node [N];
a process which receives a response from the node [N+1], wherein the response contains the list-information of the node [N] added with the list-information of the node [N+1];
a process which adds the information received from the node [N+1] to the list-information of the node [N];
a process which sends back a response to a node [N−1] in response to a request from the node [N−1], wherein the response contains the list-information sent from the node [N−1] added with the list-information of the node [N]; and
a process which separates participating nodes into plural groups when the number of participating nodes has increased more than a prescribed number.

### Claim 12

An apparatus for sharing information in a distributed database of a peer-to-peer network composed of plural nodes, wherein a node [N] among the plural nodes has a computer which performs the following processes:
a process which registers plural nodes in a group;
a process which sends a node [N+1] a request for information together with list-information of the node [N], wherein the list-information of the node [N] indicates a state of the node [N];
a process which receives a response from the node [N+1], wherein the response contains the list-information of the node [N] added with the list-information of the node [N+1];
a process which adds the information sent from the node [N+1] to the list-information of the node [N];
a process which sends back a response to a node [N−1] in response to a request from the node [N−1], wherein the response contains the list-information sent from the node [N−1] added with the list-information of the node [N]; and
a process which separates participating nodes into plural groups when the number of participating nodes has increased more than a prescribed number.