JP7119324B2 - Information processing device and information processing program - Google Patents

Description

The present invention relates to an information processing device and an information processing program.

In Patent Document 1, a plurality of personal computers that are used by individuals are used to share data, and the problem is to increase the availability and reliability of the shared data. , the node confirmation unit transmits a node confirmation request to another node, the node confirmation unit receives a node confirmation response message including information indicating availability from the node confirmation response message transmission unit of the other node, and the distributed storage setting unit determines a parameter according to the contents of the node acknowledgment message, and the distributed storage unit divides the shared data into N, stores the shared data in an M-fold distributed manner to the N nodes whose availability has been confirmed, and divides It is disclosed that a data collection unit selectively collects N pieces of the N pieces of divided data, and a data restoration unit combines the collected N pieces of divided data to restore the original data.

In Patent Document 2, at least one first server that controls storage operations of data to be stored in a plurality of storage devices, and a plurality of second servers that constitute the plurality of storage devices, are distributed and stored in the plurality of storage devices, and other storage target data having the same data contents as the storage target data already stored in the storage device are stored in the storage device and a data storage control unit that removes redundant storage by referring to storage target data already stored in the storage device as the other storage target data, and the data storage control unit divides the storage target data. A plurality of consecutive block data in the storage target data are stored in a specific storage device among the plurality of storage devices, and feature data based on the data contents of the block data and the specific storage device of the block data. stored as a storage position identification table in the specific storage device in association with storage position information representing the storage position in the The feature data of the block data is associated with the feature data and stored as a storage device identification table, and the storage device specification table is referenced based on the feature data of the block data obtained by dividing the storage target data to be newly stored to refer to the block data. specifying the specific storage device in which the storage location identification table containing the characteristic data of is stored, and transferring the storage location identification table from the second server, which is the specific storage device, to the first server Determining whether or not block data obtained by dividing the storage target data to be newly stored is already stored in the storage device based on the storage position identification table read from the second server and read from the first server. A storage system is disclosed that performs:

JP 2009-037318 A Japanese Patent No. 5500257

Data is divided and distributed and stored in a plurality of interconnected information processing apparatuses. If the own information processing apparatus stores the data whose usage frequency is decreasing as it is, the capacity of the storage device will be pressed.
SUMMARY OF THE INVENTION It is an object of the present invention to provide an information processing apparatus and an information processing program for dividing data whose usage frequency is decreasing and storing the divided data in another information processing apparatus.

The gist of the present invention for achieving this object lies in the following inventions. The "claims" below are the claims as originally filed.
The invention of claim 1 receives a data storage request attached with data and an identifier identifying the data, divides the data, and adds an identifier identifying the divided data to the divided data. , data storage means for storing data in another information processing device; data acquisition means for receiving a data acquisition request with an identifier, constructing original data from divided data, and acquiring the original data; The information processing apparatus comprises storage requesting means for requesting the data storage means to store the data attached with the identifier after a predetermined period has passed since the date and time when the data was acquired.

According to a second aspect of the present invention, the data storage means comprises storage request reception means for receiving the data storage request, division means for dividing data in the data storage request, and a plurality of divided data divided by the division means. and storage control for controlling the identifier in the data storage request to be associated with the plurality of second identifiers and stored in the storage means. 2. The information processing apparatus according to claim 1, further comprising means for adding said second identifier to said divided data and requesting another information processing apparatus to store said data.

The invention according to claim 3 further comprises duplicating means for duplicating the divided data, and the second storage requesting means attaches the second identifier to the divided data duplicated by the duplicating means to obtain another 3. The information processing apparatus according to claim 2, wherein the information processing apparatus is requested to store data.

The invention according to claim 4 is the information processing apparatus according to claim 3, wherein the second storage request means randomly requests another information processing apparatus to store data.

According to the invention of claim 5, when the other information processing device is reliable, the second storage request means issues a data storage request to store the divided data as it is. processing equipment.

The invention according to claim 6 is characterized in that, when the other information processing apparatus is unreliable, the second storage requesting means issues a data storage request to encrypt and store the divided data. is an information processing device.

According to a seventh aspect of the present invention, the data acquisition means includes an acquisition request acceptance means for accepting the data acquisition request, and if there is original data corresponding to the identifier in the data acquisition request, the original data is the information of the requester. If there are a plurality of second identifiers corresponding to the identifier in the data acquisition request and the transmission means for transmitting to the processing device, the other information processing device is requested to acquire the data attached with the second identifiers. acquisition request means; construction means for acquiring divided data corresponding to the second identifier in response to the data acquisition request made by the acquisition request means and constructing original data; and original data constructed by the construction means. second storage control means for controlling data to be stored in a storage means in association with the identifier; and storage of access date and time in association with the identifier in the data acquisition request accepted by the acquisition request acceptance means. 2. The information processing apparatus according to claim 1, further comprising storage means, wherein said transmission means transmits the original data constructed by said construction means to an information processing apparatus that has made a request.

The invention of claim 8 is the information processing apparatus according to claim 7, wherein the constructing means constructs the original data based on the access date and time.

The invention of claim 9 is the information processing apparatus according to claim 8, wherein the construction means constructs the original data in advance based on the access date and time at a time when the frequency of use increases.

According to a tenth aspect of the invention, the storage request means acquires data associated with an identifier whose predetermined period has passed since the access date and time, adds the identifier to the data, and stores the data in the data storage means. 2. The information processing apparatus according to claim 1, wherein the data storage request is made at the same time.

The invention according to claim 11 is the information processing apparatus according to claim 10, wherein the storage requesting means periodically determines whether or not a predetermined period has passed since the access date and time.

According to the invention of claim 12, a computer receives a data storage request attached with an identifier identifying data and the data, divides the data, and stores the divided data with an identifier identifying the divided data. and a data acquisition means for receiving a data acquisition request accompanied by an identifier, constructing original data from the divided data, and acquiring the original data and an information processing program for functioning as a storage requesting means for requesting the data storage means to store data by adding the identifier to data for which a predetermined period has passed since the date and time when the data was acquired. .

According to the information processing apparatus of claim 1, data whose usage frequency is decreasing can be divided and stored in another information processing apparatus.

According to the information processing apparatus of claim 2, data can be divided and stored in another information processing apparatus.

According to the information processing apparatus of claim 3, it is possible to improve the fault tolerance of data.

According to the information processing apparatus of claim 4, it is possible to randomly request another information processing apparatus to store data.

According to the information processing apparatus of claim 5, if the other information processing apparatus is reliable, it is not necessary to perform the decryption process.

According to the information processing apparatus of claim 6, security of divided data can be ensured when other information processing apparatuses are unreliable.

According to the information processing apparatus of claim 7, the original data can be reconstructed from the divided data.

According to the information processing apparatus of claim 8, original data can be constructed in advance.

According to the information processing apparatus of claim 9, the original data can be constructed in advance when the frequency of use increases.

According to the information processing apparatus of claim 10, data that has not been accessed can be divided and stored in another information processing apparatus.

According to the information processing apparatus of claim 11, data that has not been accessed can be divided and stored in another information processing apparatus on a regular basis.

According to the information processing program of claim 12, data whose usage frequency has decreased can be divided and stored in another information processing apparatus.

2 is a conceptual module configuration diagram of a configuration example of the present embodiment; FIG. 1 is an explanatory diagram showing a system configuration example using this embodiment; FIG. 6 is a flow chart showing an example of processing according to the present embodiment; FIG. 9 is an explanatory diagram showing an example data structure of data storage request data; FIG. 4 is an explanatory diagram showing an example of processing according to the present embodiment; FIG. 11 is an explanatory diagram showing an example data structure of a division list; FIG. 9 is an explanatory diagram showing an example data structure of data storage request data; FIG. 4 is an explanatory diagram showing an example of processing according to the present embodiment; 6 is a flow chart showing an example of processing according to the present embodiment; FIG. 4 is an explanatory diagram showing an example of processing according to the present embodiment; 6 is a flow chart showing an example of processing according to the present embodiment; FIG. 9 is an explanatory diagram showing an example data structure of data storage request data; FIG. 4 is an explanatory diagram showing an example data structure of stored data; FIG. 10 is an explanatory diagram showing an example of a data structure of identifier/access date/time correspondence data; 6 is a flow chart showing an example of processing according to the present embodiment; 6 is a flow chart showing an example of processing according to the present embodiment; FIG. 4 is an explanatory diagram showing an example data structure of a log table; FIG. 11 is an explanatory diagram showing an example data structure of a prefetch time table; 6 is a flow chart showing an example of processing according to the present embodiment; 1 is a block diagram showing a hardware configuration example of a computer that implements the embodiment; FIG.

First, before describing the present embodiment, the premise thereof or an information processing apparatus using the present embodiment will be described. Note that this description is intended to facilitate understanding of the present embodiment.
For example, the data size of digital content continues to grow, including high-resolution still images and moving images captured by FullHD, 4K cameras, omnidirectional cameras, and the like. In addition, digital content is often shared by multiple users, and various services have been created as data sharing methods.
How to store and share data efficiently is the issue of data sharing methods. Examples of data sharing methods include (1) a service that stores data on a central server provided by a specific business operator, and (2) the user's device itself that is to be shared is linked as a data storage function that can communicate with each other. There is a system that uses In particular, the latter has been developed as a P2P (Peer to Peer) type distributed data store.

The technique disclosed in Patent Document 1 provides a means for dividing data to be shared into N pieces, distributing the data to N data storage devices capable of communicating with each other, and storing the data in an M-fold manner. As a result, by adjusting the number of divisions, fault tolerance (robustness) is improved, and the capacity required for individual data storage functions is suppressed.
In addition, in the technique disclosed in Patent Document 2, data is divided and stored in a distributed manner, and when the same data content as already stored data to be stored is stored in another storage device, the already stored data is stored. Deduplication is performed by referencing it as other storage target data.
In both cases, when trying to actually use the target digital content, it is necessary to obtain all the divided/distributed data and reconstruct the original digital content.
However, the reconstruction procedure for frequently used digital content has a high overhead and adversely affects performance.

An example of a preferred embodiment for realizing the present invention will be described below with reference to the drawings.
FIG. 1 shows a conceptual module configuration diagram of a configuration example of this embodiment.
A module generally refers to a component such as software (computer program) or hardware that can be logically separated. Therefore, modules in this embodiment refer not only to modules in a computer program, but also to modules in a hardware configuration. Therefore, the present embodiment provides a computer program for functioning as those modules (a program for causing the computer to execute each procedure, a program for causing the computer to function as each means, a program for causing the computer to perform each function It also serves as an explanation of the program, system and method for realizing However, for the convenience of explanation, the terms "stored", "stored", and equivalent terms are used, but when the embodiment is a computer program, these terms are stored in a storage device or stored in a storage device. It means to control to store in the device. Also, modules may correspond to functions one-to-one. may consist of multiple programs. Also, multiple modules may be executed by one computer, and one module may be executed by multiple computers by computers in a distributed or parallel environment. Note that one module may include other modules. Further, hereinafter, "connection" is used not only for physical connection but also for logical connection (data transfer, instruction, reference relationship between data, login, etc.). The term "predetermined" means that it is determined before the target process, and not only before the process according to the present embodiment starts, but also after the process according to the present embodiment starts. Also, if it is before the target process, it is used including the meaning that it is determined according to the situation/state at that time or according to the situation/state up to that time. When there are a plurality of "predetermined values", they may be different values, or two or more values (including, of course, all values) may be the same. Also, the description "if A, do B" is used in the sense of "judge whether it is A, and if it is judged to be A, do B". However, this excludes the case where it is not necessary to judge whether or not it is A. In addition, when things are listed like "A, B, C", etc., unless otherwise specified, it is an exemplary list, and includes cases where only one of them is selected (for example, only A).
In addition, a system or device is configured by connecting a plurality of computers, hardware, devices, etc. by communication means such as a network (including one-to-one correspondence communication connection), or a single computer, hardware, device The case where it is realized by etc. is also included. The terms "apparatus" and "system" are used interchangeably. Of course, "system" does not include what is merely a social "mechanism" (social system) that is an artificial arrangement.
In addition, for each process performed by each module or for each process when multiple processes are performed within a module, the target information is read from the storage device, and after the processing is performed, the processing result is written to the storage device. be. Therefore, the description of reading from the storage device before processing and writing to the storage device after processing may be omitted. Note that the storage device here may include a hard disk, a RAM (Random Access Memory), an external storage medium, a storage device via a communication line, a register in a CPU (Central Processing Unit), and the like.

An information processing apparatus 100 according to the present embodiment stores or requests storage of data (hereinafter also referred to as digital content), and includes a communication module 105, a data storage module 110, It has a data acquisition module 145 , a storage request module 180 and a data storage module 195 .
The type of data to be processed does not matter. For example, it may be a document, an image, audio information, moving image information, or may have a tree structure. For example, with the rise of IoT (Internet of Things) and M2M (Machine to Machine), data is held in a tree structure, but these may be data to be processed.
Further, the data stored in the information processing apparatus 100 by the service user or the data acquired from the information processing apparatus 100 may be biased depending on the service user. In other words, data frequently handled by a specific service user may be data that other service users never handle. Generally, such a situation may occur, and the information processing apparatus 100 is particularly effective in such a situation.

Communication module 105 is connected to data storage module 110 , data acquisition module 145 , and storage request module 180 . The communication module 105 communicates with other information processing apparatuses 100 . For example, a data storage request and a data acquisition request are received from another information processing apparatus 100 and transferred to the data storage module 110 and the data acquisition module 145, respectively. Conversely, it receives a data storage request and a data acquisition request from the data storage module 110 and the data acquisition module 145 respectively, and transmits them to the other information processing apparatus 100 . In addition, it transmits and receives data storage requests, responses to data acquisition requests (information indicating success or failure, data for data acquisition requests, etc.).

The data storage module 110 has a storage request reception module 115, a division module 120, an identifier generation module 125, a storage control (A) module 130, a replication module 135, a storage request processing (A) module 140, and a communication module 105. , is connected to the data storage module 195 . The data storage module 110 receives a data storage request attached with data and an identifier identifying the data, divides the data, attaches an identifier identifying the divided data to the divided data, It has a function of storing in another information processing apparatus 100 .

The storage request reception module 115 receives a data storage request. For example, data storage request data 400, which will be described later, is received.
The splitting module 120 splits the data in the data store request.
The identifier generation module 125 generates a second identifier that identifies the plurality of pieces of divided data divided by the division module 120 . For example, a hash function or the like is used to generate the second identifier from the divided data.
The storage control (A) module 130 associates the identifier in the data storage request with a plurality of second identifiers and controls the data storage module 195 to store them. For example, a split list 600 to be described later is generated and stored in the data storage module 195 .
The replication module 135 replicates the split data. This is to improve fault tolerance. Detailed processing will be described later using examples in FIGS. 9 and 10 .

The storage request processing (A) module 140 attaches the second identifier to the divided data and requests another information processing apparatus 100 to store the data. That is, the divided data are distributed and stored. For example, it generates data storage request data 700 to be described later and transmits it to another information processing apparatus 100 .
Further, the storage request processing (A) module 140 may attach the second identifier to the divided data duplicated by the duplication module 135 and request another information processing apparatus 100 to store the data.
The storage request processing (A) module 140 may randomly request other information processing apparatuses 100 to store data. The information processing apparatus 100 to which the data storage request is made may be determined according to a predetermined order other than random. For example, the information processing apparatuses 100 may be selected in descending order of the number of hops (the number of relay facilities through which the information processing apparatus 100 as a communication partner is reached).
Further, if the other information processing apparatus 100 is reliable, the storage request processing (A) module 140 may issue a data storage request to store the divided data as it is. For example, the judgment as to whether or not ``another information processing device 100 is reliable'' is made by the information processing device 100 connected to the same firewall device 250 (for example, the information processing device 100 in the company), as will be described later. It may be determined that the information processing device 100 outside the firewall device 250 (for example, the information processing device 100 outside the company) is not reliable. Further, a predetermined information processing device 100 may be used as a reliable information processing device 100 .
If the other information processing apparatus 100 is unreliable, the storage request processing (A) module 140 may issue a data storage request to encrypt and store the divided data.

The data acquisition module 145 has an acquisition request reception module 150 , a transmission module 155 , an acquisition request module 160 , a construction module 165 , a storage control (B) module 170 , a storage module 175 , a communication module 105 and a data storage module 195 . is connected with The data acquisition module 145 has a function of receiving a data acquisition request attached with an identifier, constructing original data from divided data, and acquiring the original data.

The acquisition request acceptance module 150 accepts data acquisition requests. For example, it receives data storage request data 1200, which will be described later.
If the original data corresponding to the identifier in the data acquisition request is in the data storage module 195, the transmission module 155 sends the original data to the information processing apparatus 100 that has sent the data acquisition request. ).
Also, if the data storage module 195 does not contain the original data corresponding to the identifier in the data acquisition request, the transmission module 155 stores a plurality of second data corresponding to the identifier in the data acquisition request. If there is an identifier), the original data constructed by the construction module 165 is transmitted to the information processing apparatus 100 of the request source.

If there are a plurality of second identifiers corresponding to the identifier in the data acquisition request, the acquisition request module 160 requests the other information processing apparatus 100 to acquire the data attached with the second identifiers. Then, the divided data is received from the other information processing apparatus 100 as a reply to the data acquisition request.
The construction module 165 acquires the divided data corresponding to the second identifier and constructs the original data in response to the data acquisition request made by the acquisition request module 160 . In other words, the original data is generated from the divided data by performing a process opposite to that of the division module 120 .
Also, the construction module 165 may construct the original data based on the access date and time. It performs a so-called prefetch process, and when the expected access date and time is approaching, the divided data are collected to construct the original data. This will be described later using the examples of FIGS. 16 to 19. FIG.
Also, the building module 165 may build the original data in advance based on the access date and time when the frequency of use increases. In particular, when the frequency of use is high, if prefetch processing is performed, the original data construction processing will be performed in advance, and the original data construction processing will be performed in response to the data acquisition request (after receiving the data acquisition request). (Compared to the case), it will be possible to respond at high speed.

The storage control (B) module 170 controls the data storage module 195 to store the original data constructed by the construction module 165 in association with the identifier. Therefore, after this (and before the processing by the storage request module 180 is performed), the original data corresponding to the identifier is stored in the data storage module 195 .
The storage module 175 stores the access date and time in association with the identifier in the data acquisition request accepted by the acquisition request acceptance module 150 . It stores so-called log information. For example, identifier/access date/time correspondence data 1400 to be described later is generated and stored in the data storage module 195 .

The storage request module 180 has an access date/time determination module 185 and a storage request processing (B) module 190 and is connected to the communication module 105 and data storage module 195 . The storage request module 180 has a function of requesting the data storage module 110 to store data by attaching an identifier to data that has passed a predetermined period from the date and time when the data was acquired.

The storage request module 180 acquires data associated with an identifier whose predetermined period has passed since the access date and time, attaches the identifier to the data, and requests the data storage module 110 to store the data. .
Further, the storage request module 180 may periodically determine whether or not a predetermined period has passed since the access date and time.
The access date/time determination module 185 determines whether or not the access date/time of the original data stored in the data storage module 195 has passed a predetermined period. That is, it is determined whether or not original data that has not been accessed for a while is stored in the data storage module 195 . This determination process may be performed periodically. Also, this determination process may be performed according to the user's operation. Also, this judgment processing may be performed when the capacity of the original data stored in the data storage module 195 is greater than or equal to a predetermined threshold value. Conversely, this determination process may be performed when the capacity of the free area in the data storage module 195 is less than or equal to the predetermined threshold value.
If the access date/time determination module 185 determines that there is data for which a predetermined period has passed since the access date/time, the storage request processing (B) module 190 attaches the data identifier to the data. , the data storage module 110 is requested to store data. In other words, data is divided and distributed. Note that the original data to be deleted may be deleted from the data storage module 195 .

The data storage module 195 is connected with the data storage module 110 , the data acquisition module 145 and the storage request module 180 . The data storage module 195 stores data and the like. For example, stored data 1300 that stores original data or divided data itself, division list 600 that stores identifier groups of divided data, identifier/access date/time correspondence data 1400 as a log, log table 1700, prefetch that stores prefetch activation timing. A time table 1800 and the like are stored.

FIG. 2 is an explanatory diagram showing a system configuration example using this embodiment.
The information processing device 100A, the information processing device 100B, the information processing device 100C, the information processing device 100D, the data storage device 200, and the firewall device 250 are connected via a communication line 290, respectively. The data storage device 200 has an information processing device 100E. The communication line 290 may be wireless, wired, or a combination thereof, and may be, for example, the Internet as a communication infrastructure. Also, the functions of the data storage device 200 may be implemented as a cloud service.
The firewall device 250, the information processing device 100F, the information processing device 100G, the information processing device 100H, and the information processing device 100I are each connected via a communication line. For example, these are connected by an intranet or the like as a communication infrastructure.
Information processing device 100A, information processing device 100B, information processing device 100C, information processing device 100D, data storage device 200, information processing device 100F, information processing device 100G, information processing device 100H, and information processing device 100I are firewalls. A device 250 and a communication line 290 are connected to each other.
For example, data stored in the information processing device 100A is divided and stored in another information processing device 100 (for example, the information processing device 100B, the data storage device 200, etc.).
For example, for the information processing device 100F, the information processing device 100G, the information processing device 100H, and the information processing device 100I, which are protected from the outside world by the firewall device 250, are reliable information processing devices. Therefore, when the information processing device 100F requests the information processing device 100G to store data, the data storage request may be made to store the divided data as it is. Conversely, for the information processing device 100F, the information processing device 100A and the like, which are outside the firewall device 250, are unreliable information processing devices. Therefore, when the information processing device 100F requests the information processing device 100A to store data, the data storage request may be made so as to encrypt and store the divided data. Of course, in this case, the information processing device 100F needs to decrypt the returned data.

In this embodiment, for example, the following processing is performed. In particular, this description (the description in this paragraph) is intended to facilitate understanding of the present embodiment, and is not intended to be used for limited interpretation. In addition, it should not be judged that the invention for which a patent is sought is described in the detailed description of the invention (Article 36, Paragraph 6, Item 1 of the Patent Act) using only this description part. It is natural.
The information processing apparatus 100 relates to a distributed data storage method that reduces data reconstruction costs according to the frequency of use of digital content.
For that purpose, the access history of each data is retained. Then, data whose usage frequency has decreased is divided and stored in a distributed manner, and the original data is used as reference data. It also overwrites the saved data with the reconstructed data.
The information processing apparatus 100 divides the data, distributes and redundantly stores the data in a plurality of interconnected data storage functions (other information processing apparatuses 100). The information processing apparatus 100 performs a data storage method including the following steps (data storage step, data acquisition step, re-division/re-distribution step).
(1) In the data storage step, the following processes are performed.
A data storage request attached with data and an ID is received, an ID (division ID) is generated for each of the divided data obtained by dividing the data into X pieces, and division is made by associating the original ID with the X divided division IDs. The list is saved in a storage area, each of the X divided data is duplicated by Y, and the duplicated divided data are randomly distributed to other Z data storage functions to request data storage.
(2) In the data acquisition step, the following processes are performed.
Receiving a data acquisition request attached with an ID, searching a storage area from the ID, extracting and returning data itself if it exists, and if a split list exists, add an ID included in the split list and store other data. repeats the data acquisition request for, acquires all divided data, reconstructs the data, stores the data in a storage area in association with the ID, stores the access date and time as meta information for the ID, return that data.
(3) In the re-division/re-distribution step, the following processes are performed.
Called periodically within the data storage function to acquire the access date and time for all IDs contained in the storage area. By acquiring data and requesting its own data storage for its ID and its data, it divides and stores it in a distributed manner.
(2-1) Furthermore, the data acquisition step may perform the following processing.
If the area where the data storage function exists is located within a reliable communication line (e.g. LAN (Local Area Network), intranet), the data is stored as is, and if it is located within an unreliable communication line. encrypts and stores data.
(4) Furthermore, the following prefetch step may be added.
From the past access history, if there is a periodicity in the increase and decrease in the frequency of use, such as an increase in the frequency of use during a specific period (including season), the data will be reconstructed in advance according to the period and associated with the ID. to store the data in the storage area.

FIG. 3 is a flow chart showing an example of processing according to this embodiment (mainly the data storage module 110).
In step S302, the storage request reception module 115 receives a data storage request. The request source may be another information processing apparatus 100 , or may be the data storage module 110 or the storage request module 180 in the same information processing apparatus 100 . The data storage request contains at least data and an identifier for identifying the data. The data storage request has the data structure of data storage request data 400, for example. FIG. 4 is an explanatory diagram showing an example data structure of the data storage request data 400. As shown in FIG. The data storage request data 400 is composed of a data storage request column 410 , an identifier A column 420 and a data column 430 . The data storage request field 410 stores an instruction for a data storage request. When the communication module 105 determines that the received data includes the data storage request column 410 , it passes the data storage request data 400 to the storage request reception module 115 . The identifier A column 420 stores the identifier A. This identifier A is generated by the requester. The generation method may be any method as long as it can generate information that can uniquely identify the data in the data column 430 . For example, it may be a hash value for the data in the data column 430 . The data column 430 stores data (original data). This data is distributed and stored.

At step S304, the splitting module 120 splits the data in the data storage request. As shown in the example of FIG. 5, the data in the data column 430 of the data storage request data 400 is divided into a plurality of data (divided data 500, divided data 502, . . . , divided data 598). Any method may be used for division. For example, it may be divided into each predetermined capacity, divided into a predetermined number of divisions, or the division method may be changed according to the data (for example, if it is an image, it may be divided into blocks). (every time, every scene in the case of movies, etc.). Also, if reconstruction is possible, the divided data may be divided without duplication, or may be divided so as to generate duplication.

In step S306, the identifier generation module 125 generates an identifier that identifies the divided data. The generation method may be any method as long as it can generate information that can uniquely identify the divided data. For example, it may be a hash value for divided data.

In step S308, storage control (A) module 130 associates the identifier in the data storage request with the plurality of identifiers generated in step S306, and stores them in data storage module 195. FIG. For example, split list 600 is generated. FIG. 6 is an explanatory diagram showing an example data structure of the division list 600. As shown in FIG. The division list 600 has an identifier A column 610 and a division identifier group column 620 . The identifier A column 610 stores the identifier of the original data (the identifier A in the identifier A column 420 of the data storage request data 400). The division identifier group column 620 stores the identifier group generated in step S306 (divided identifier Bn for identifying each divided data obtained by dividing the data in the data column 430 of the data storage request data 400). That is, from the identifier A, the division identifier B1 and the like can be obtained in order to construct the original data.

In step S310, a data storage request is made to another information processing apparatus 100 by attaching each identifier to the divided data. For example, data storage request data 700 is generated. Data storage request data 700 for the number of divisions is generated. The data storage request data 700 is composed of a data storage request column 710 , a division identifier B column 720 and a division data column 730 . The data storage request data 700 has the same data structure as the data storage request data 400 . The data storage request column 710 stores an instruction for a data storage request. The division identifier B column 720 stores the identifier B. FIG. The division data column 730 stores division data.
For example, as shown in FIG. 8, data storage request data 700 is sent from an information processing device 100a to a plurality of information processing devices 100 (information processing device 100b, information processing device 100c, . . . , information processing device 100z). (data storage request data 700a, data storage request data 700b, . . . , data storage request data 700z) are transmitted.
The information processing apparatus 100 that receives the data storage request data 700 stores each data storage request data 700 . The storage request instruction in the data storage request column 410 and the storage request instruction in the data storage request column 710 may be different. For example, the storage request instruction in the data storage request column 410 may be an instruction meaning distributed storage, and the storage request instruction in the data storage request column 710 may be an instruction meaning storage as it is. . Also, although the storage request instruction in the data storage request column 410 and the storage request instruction in the data storage request column 710 are the same, they are stored separately according to the data capacity in the data column 430 or the divided data column 730. , may be determined whether to store as it is. For example, if the amount of data is greater than or equal to a predetermined threshold, it may be distributed and stored, and if the amount of data is less than or equal to the threshold, it may be stored as it is.

FIG. 9 is a flowchart showing an example of processing according to this embodiment (mainly the data storage module 110). Step S910 is added to the flowchart shown in the example of FIG. 3, and fault tolerance is improved by copying the divided data and distributing and storing it in more information processing apparatuses 100. FIG. The processing from step S902 to step S908 is equivalent to the processing from step S302 to step S308 in the flowchart shown in the example of FIG.

In step S902, the storage request acceptance module 115 accepts a data storage request.
At step S904, the splitting module 120 splits the data in the data storage request.
In step S906, the identifier generation module 125 generates an identifier that identifies the divided data.
In step S908, storage control (A) module 130 associates the identifier in the data storage request with the plurality of identifiers generated in step S906, and stores them in data storage module 195. FIG.

In step S910, the duplication module 135 duplicates the divided data. As shown in the example of FIG. 10, after dividing the data in the data column 430 of the data storage request data 400 into a plurality of data (divided data 500a, divided data 502a, . . . , divided data 598a), duplicate data (divided data 500b , divided data 502b, ..., divided data 598b, ..., divided data 500z, divided data 502z, ..., divided data 598z). Here, each piece of divided data is duplicated by the same number, but each piece of divided data may generate a different number of duplicated data.
In step S912, the storage request processing (A) module 140 attaches the respective identifiers to the copied divided data and requests the other information processing apparatus 100 to store the data. In the flowchart shown in the example of FIG. 3, it becomes possible to distribute and store information to more information processing apparatuses 100 than the processing in step S310.

FIG. 11 is a flow chart showing an example of processing according to this embodiment (mainly the data acquisition module 145).
In step S1102, the acquisition request acceptance module 150 accepts a data acquisition request. The request source may be another information processing apparatus 100 or the data acquisition module 145 in the same information processing apparatus 100 . The data acquisition request contains at least an identifier for identifying data to be acquired. The data acquisition request has, for example, the data structure of data storage request data 1200 . FIG. 12 is an explanatory diagram showing an example data structure of the data storage request data 1200. As shown in FIG. The data storage request data 1200 is composed of a data storage request column 1210 and an identifier column 1220 . The data storage request column 1210 stores an instruction for a data acquisition request. The identifier column 1220 stores identifiers of data to be acquired.

In step S1104, the acquisition request reception module 150 determines whether or not the original data corresponding to the identifier in the data acquisition request exists in the data storage module 195. If there is, the process proceeds to step S1118; goes to step S1106. Here, “otherwise” is the case where the data is stored in the data storage module 195 in the form of the split list 600 . Also, "if there is" means that the identifier and the original data are stored in the data storage module 195 in association with each other. For example, when stored data 1300 is stored. FIG. 13 is an explanatory diagram showing an example data structure of the stored data 1300. As shown in FIG. The stored data 1300 is composed of an identifier column 1310 and an original data column 1320 . The identifier column 1310 stores identifiers of original data in the original data column 1320 . The original data column 1320 stores original data. It should be noted that, for example, when stored in step S1114 as "a case where identifiers and original data are associated and stored in the data storage module 195", prefetch processing according to the flowchart shown in the example of FIG. 19 was performed. Alternatively, the original data is stored as it is without being divided and stored.
Of course, in the process of step S1104, the acquisition request reception module 150 determines whether or not the data storage module 195 contains a plurality of divided identifiers corresponding to the identifier in the data acquisition request. The process may proceed to step S1118, and otherwise to step S1106.

In step S1106, the acquisition request module 160 acquires multiple division identifiers corresponding to the identifiers in the data acquisition request. Specifically, a plurality of division identifiers may be acquired from the division identifier group column 620 of the division list 600 .
In step S<b>1108 , the acquisition request module 160 transmits a data acquisition request to another information processing apparatus 100 . Specifically, a division identifier may be entered in the identifier column 1220 of the data storage request data 1200 and transmitted to the other information processing apparatus 100 .
In step S<b>1110 , the acquisition request module 160 receives divided data as a reply from another information processing apparatus 100 .

In step S1112, the building module 165 builds original data from the divided data. A process opposite to the division process may be performed.
In step S1114, storage control (B) module 170 stores the original data in association with the identifier in the data acquisition request received in step S1102. Since there has been an access, the original data is stored in the data storage module 195 to accommodate the next access. In other words, when there is a next data acquisition request for the same identifier, the judgment is "Yes" in step S1104, and the process of collecting and constructing divided data is unnecessary.

In step S1116, the storage module 175 stores the access date and time in association with the identifier in the data acquisition request received in step S1102. For example, the identifier/access date/time correspondence data 1400 is generated and stored in the data storage module 195 . FIG. 14 is an explanatory diagram showing an example of the data structure of the identifier/access date/time correspondence data 1400. As shown in FIG.
The identifier/access date/time correspondence data 1400a shown in the example of FIG. The identifier column 1410 stores identifiers. The access date and time column 1420 stores the date and time (year, month, day, hour, minute, second, less than a second, or a combination of these) when the data of the identifier was accessed.
The identifier/access date/time correspondence data 1400b shown in the example of FIG. That is, the original data column 1415 is added to the identifier/access date/time correspondence data 1400a. The original data column 1415 stores data corresponding to the identifier. Alternatively, the identifier/access date/time correspondence data 1400b is the stored data 1300 with an access date/time column 1420 added thereto.

In step S1118, the original data is returned, and the process proceeds to step S1116.
In this process, it is not necessary to distinguish whether the data is the original data or the divided data. If so, build the original data. Therefore, even if the identifier of the data acquisition request is the division identifier, the same processing may be performed.

FIG. 15 is a flow chart showing an example of processing according to this embodiment (mainly the storage request module 180).
In step S1502, the access date/time determination module 185 acquires the access date/time. Specifically, for each identifier in the data storage module 195 , the access date/time is obtained from the access date/time column 1420 of the identifier/access date/time correspondence data 1400 .
In step S1504, the access date/time determination module 185 determines whether or not a predetermined period has passed.
In step S1506, the storage request processing (B) module 190 attaches an identifier to the data and requests the data storage module 110 (which may be the data storage module 110 in another information processing apparatus 100) to store the data. conduct. In other words, data that has not been accessed is divided and stored in another information processing apparatus 100 instead of being kept as original data.
In step S1508, it is determined whether or not all original data have been processed. If processed, the process ends (step S1599). Otherwise, the process returns to step S1502.
Note that in step S1506, the data may be deleted after the storage request is made.

FIG. 16 is a flow chart showing an example of processing according to this embodiment (mainly the data acquisition module 145).
In step S1602, the construction module 165 uses, for example, the log table 1700 to identify when the usage frequency increases. FIG. 17 is an explanatory diagram showing an example data structure of the log table 1700. As shown in FIG. The log table 1700 has a log ID column 1710 , an access date/time column 1720 and an identifier column 1730 . The log ID column 1710 stores information (log ID: IDentification) for uniquely identifying a log in this embodiment. The access date and time column 1720 stores the date and time when the data was accessed. The identifier column 1730 stores identifiers of the data.
For example, even if you extract the date and time (day, day of the week, end of the month, beginning of the month, season, etc.) where there are more than a predetermined number of accesses within a predetermined period (one year, one month, one week, etc.) Alternatively, the dates may be sorted in descending order by the number of times of access and dates up to a predetermined order may be extracted. Machine learning may also be used to identify periods of high usage.

In step S1604, the construction module 165 generates, for example, a prefetch time table 1800. FIG. FIG. 18 is an explanatory diagram of an example of the data structure of the prefetch time table 1800. As shown in FIG.
The prefetch time table 1800 has an identifier column 1810 and a prefetch time column 1820 . The identifier column 1810 stores identifiers. The prefetch time column 1820 stores the prefetch time of the data of the identifier. Here, the time of prefetching is the date and time when the process of constructing the original data from the divided data is performed without receiving the data acquisition request. That is, when the prefetch time comes, the process of constructing the original data of the corresponding identifier from the divided data is started.
In step S1606, it is determined whether or not all identifiers have been processed. If processed, the process ends (step S1699), otherwise the process returns to step S1602.

FIG. 19 is a flowchart showing an example of processing according to this embodiment.
In step S1902, the construction module 165 determines whether or not it is time to prefetch. If it is time to prefetch, the process proceeds to step S1904. Otherwise, it waits until time to prefetch. Specifically, the prefetch time in the prefetch time column 1820 of the prefetch time table 1800 may be used.
In step S1904, the construction module 165 determines whether or not the data is divided data. If the data is divided data, the process proceeds to step S1906. Otherwise, the process returns to step S1902.
In step S1906, the acquisition request module 160 transmits a data acquisition request to another information processing apparatus 100 (or acquisition request reception module 150).
In step S1908, the acquisition request module 160 receives the divided data.
In step S1910, construction module 165 constructs original data from the divided data.
In step S1912, storage control (B) module 170 stores the original data in data storage module 195 in association with the identifier. The processing from step S1908 to step S1912 is equivalent to the processing from step S1110 to step S1114 in the flowchart shown in the example of FIG.
Note that when performing the processing shown in the example of FIG. 19, there is no need to perform the processing of step S1116 in the flowchart shown in the example of FIG.

It should be noted that the hardware configuration of the computer on which the program of the present embodiment is executed is, as exemplified in FIG. 20, a general computer, specifically a personal computer, a computer that can serve as a server, and the like. That is, as a specific example, a CPU 2001 is used as a processing unit (calculating unit), and a RAM 2002, ROM 2003, and HD 2004 are used as storage devices. As the HD 2004, for example, a hard disk or SSD (Solid State Drive) may be used. communication module 105, data storage module 110, storage request reception module 115, division module 120, identifier generation module 125, storage control (A) module 130, replication module 135, storage request processing (A) module 140, data acquisition module 145, Acquisition request reception module 150 , transmission module 155 , acquisition request module 160 , construction module 165 , storage control (B) module 170 , storage module 175 , storage request module 180 , access date/time determination module 185 , storage request processing (B) module 190 A CPU 2001 that executes programs such as a RAM 2002 that stores the programs and data, a ROM 2003 that stores programs and the like for starting the computer, and an auxiliary storage device (flash memory) that functions as a data storage module 195.・Based on the user's operation (including motion, voice, line of sight, etc.) for the HD 2004, which is a memory, etc.), keyboard, mouse, touch screen, microphone, camera (including line-of-sight detection camera, etc.), etc. an output device 2005 such as a CRT, a liquid crystal display, or a speaker; a communication line interface 2007 such as a network interface card for connecting to a communication network; A bus 2008 for A plurality of these computers may be connected to each other via a network.

Of the above-described embodiments, with respect to the computer program, a computer program, which is software, is loaded into the system of this hardware configuration, and the software and hardware resources cooperate to perform the above-described embodiment. is realized.
Note that the hardware configuration shown in FIG. 20 shows one configuration example, and the present embodiment is not limited to the configuration shown in FIG. I wish I had. For example, some modules may be configured with dedicated hardware (for example, Application Specific Integrated Circuit: ASIC), etc., and some modules are in an external system and connected via a communication line. Further, a plurality of systems shown in FIG. 20 may be connected to each other by communication lines so as to cooperate with each other. In addition to personal computers, mobile information communication devices (including mobile phones, smartphones, mobile devices, wearable computers, etc.), information appliances, robots, copiers, faxes, scanners, printers, multifunction devices (scanners, printers, It may be incorporated in an image processing apparatus having two or more functions such as a copier, a facsimile machine, or the like.

In addition, in the comparison processing in the description of the above-described embodiments, "greater than", "less than", "greater than", and "less than (less than)" are They may be "greater than", "less than (less than)", "greater than or equal to", and "less than or equal to" respectively.

The program described above may be stored in a recording medium and provided, or the program may be provided by communication means. In that case, for example, the program described above may be regarded as an invention of "a computer-readable recording medium on which the program is recorded."
"Program-recorded computer-readable recording medium" refers to a computer-readable recording medium recording a program, which is used for program installation, execution, program distribution, and the like.
As a recording medium, for example, a digital versatile disc (DVD), which is a standard established by the DVD Forum, "DVD-R, DVD-RW, DVD-RAM, etc." Standard "DVD + R, DVD + RW, etc.", compact disc (CD), read-only memory (CD-ROM), CD recordable (CD-R), CD rewritable (CD-RW), Blu-ray disc ( Blu-ray (registered trademark) Disc), magneto-optical disk (MO), flexible disk (FD), magnetic tape, hard disk, read-only memory (ROM), electrically erasable and rewritable read-only memory (EEPROM (registered trademark) )), flash memory, random access memory (RAM), SD (Secure Digital) memory card, and the like.
Then, the whole or part of the program may be recorded on the recording medium and stored or distributed. By communication, for example, a wired network used for a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), the Internet, an intranet, an extranet, etc., or a wireless communication. It may be transmitted using a transmission medium such as a network or a combination thereof, or may be carried on a carrier wave.
Furthermore, the program may be part or all of another program, or may be recorded on a recording medium together with a separate program. Moreover, it may be divided and recorded on a plurality of recording media. Also, it may be recorded in any form, such as compression or encryption, as long as it can be restored.

DESCRIPTION OF SYMBOLS 100... Information processing apparatus 105... Communication module 110... Data storage module 115... Storage request reception module 120... Division module 125... Identifier generation module 130... Storage control (A) module 135... Replication module 140... Storage request processing (A) module 145 Data acquisition module 150 Acquisition request reception module 155 Transmission module 160 Acquisition request module 165 Construction module 170 Storage control (B) module 175 Storage module 180 Storage request module 185 Access date/time determination module 190 Storage Request processing (B) module 195 Data storage module 200 Data storage device 250 Firewall device 290 Communication line

Claims (9)

An information processing device,
Receiving a data storage request attached with data and an identifier identifying the data, dividing the data, adding an identifier identifying the divided data to the divided data, and sending it to another information processing device data storage means for storing
data acquisition means for receiving a data acquisition request attached with an identifier, constructing original data from the divided data, and acquiring the original data;
The "divided data" used in the process of "constructing the original data from the divided data" in the data acquisition means is obtained from the "other information processing device" in which the data divided by the data storage means is stored. obtained and
The data storage means is
storage request receiving means for receiving the data storage request;
a dividing means for dividing the data in the data storage request;
identifier generating means for generating a second identifier that is an identifier for identifying a plurality of pieces of divided data divided by the dividing means;
storage control means for associating the identifier in the data storage request with the plurality of second identifiers and controlling storage means for storing the identifier;
a storage request means for adding the second identifier to the divided data and requesting another information processing device to store the data;
The storage requesting means makes a data storage request to store the divided data as it is when the other information processing device and the information processing device are protected by the same firewall device. . An information processing device,
Receiving a data storage request attached with data and an identifier identifying the data, dividing the data, adding an identifier identifying the divided data to the divided data, and sending it to another information processing device data storage means for storing
data acquisition means for receiving a data acquisition request attached with an identifier, constructing original data from the divided data, and acquiring the original data;
The "divided data" used in the process of "constructing the original data from the divided data" in the data acquisition means is obtained from the "other information processing device" in which the data divided by the data storage means is stored. obtained and
The data storage means is
storage request receiving means for receiving the data storage request;
a dividing means for dividing the data in the data storage request;
identifier generating means for generating a second identifier that is an identifier for identifying a plurality of pieces of divided data divided by the dividing means;
storage control means for associating the identifier in the data storage request with the plurality of second identifiers and controlling storage means for storing the identifier;
a storage request means for adding the second identifier to the divided data and requesting another information processing device to store the data;
The storage request means requests data storage to store the divided data as it is when the other information processing device and the information processing device are protected by the same firewall device,
The storage request means issues a data storage request to encrypt and store the divided data when the other information processing device exists outside the firewall device protecting the information processing device. Device. further comprising duplicating means for duplicating the divided data;
3. The information processing apparatus according to claim 1, wherein said storage requesting means attaches said second identifier to the divided data duplicated by said duplicating means and requests another information processing apparatus to store said data. 4. The information processing apparatus according to claim 3, wherein said storage request means randomly requests another information processing apparatus to store data. The data acquisition means is
acquisition request acceptance means for accepting the data acquisition request;
If there is original data corresponding to the identifier in the data acquisition request, transmission means for transmitting the original data to the information processing device that is the request source;
when there are a plurality of second identifiers corresponding to the identifiers in the data acquisition request, acquisition request means for making a data acquisition request attached with the second identifiers to another information processing device;
building means for building original data by acquiring divided data corresponding to the second identifier in response to the data acquisition request made by the acquisition requesting means;
a second storage control means for controlling the original data constructed by the construction means to be associated with the identifier and stored in a storage means;
storage means for storing the access date and time in association with the identifier in the data acquisition request accepted by the acquisition request acceptance means;
3. The information processing apparatus according to claim 1, wherein the transmitting means transmits the original data constructed by the constructing means to the information processing apparatus that has requested. The information processing apparatus according to claim 5, wherein said constructing means constructs original data based on said access date and time. 7. The information processing apparatus according to claim 6, wherein the construction means constructs the original data in advance based on the access date and time at a time when the frequency of use increases. A computer, which is an information processing device ,
Receiving a data storage request attached with data and an identifier identifying the data, dividing the data, adding an identifier identifying the divided data to the divided data, and sending it to another information processing device data storage means for storing
functioning as data acquisition means for accepting a data acquisition request with an identifier, constructing original data from the divided data, and acquiring the original data;
The "divided data" used in the process of "constructing the original data from the divided data" in the data acquisition means is obtained from the "other information processing device" in which the data divided by the data storage means is stored. obtained and
The data storage means is
storage request receiving means for receiving the data storage request;
a dividing means for dividing the data in the data storage request;
identifier generating means for generating a second identifier that is an identifier for identifying a plurality of pieces of divided data divided by the dividing means;
storage control means for associating the identifier in the data storage request with the plurality of second identifiers and controlling storage means for storing the identifier;
a storage request means for adding the second identifier to the divided data and requesting another information processing device to store the data;
The storage request means requests data storage to store the divided data as it is when the other information processing device and the information processing device are protected by the same firewall device. Information processing program . A computer, which is an information processing device ,
Receiving a data storage request attached with data and an identifier identifying the data, dividing the data, adding an identifier identifying the divided data to the divided data, and sending it to another information processing device data storage means for storing
functioning as data acquisition means for accepting a data acquisition request with an identifier, constructing original data from the divided data, and acquiring the original data;
The "divided data" used in the process of "constructing the original data from the divided data" in the data acquisition means is obtained from the "other information processing device" in which the data divided by the data storage means is stored. obtained and
The data storage means is
storage request receiving means for receiving the data storage request;
a dividing means for dividing the data in the data storage request;
identifier generating means for generating a second identifier that is an identifier for identifying a plurality of pieces of divided data divided by the dividing means;
storage control means for associating the identifier in the data storage request with the plurality of second identifiers and controlling storage means for storing the identifier;
a storage request means for adding the second identifier to the divided data and requesting another information processing device to store the data;
The storage request means requests data storage to store the divided data as it is when the other information processing device and the information processing device are protected by the same firewall device,
The storage request means issues a data storage request to encrypt and store the divided data when the other information processing device exists outside the firewall device protecting the information processing device. program.

Images