KR101738415B1 - Data storage apparatus and method for storing a message dispersedly - Google Patents

Abstract

Disclosed are a data storage device and method for distributing a message dispersedly. In a method for dispersedly storing a plurality of messages in a plurality of data stores, even if only a minimum number of data stores are selected and accessed after dispersedly distributing the plurality of messages by utilizing only a minimum number of data stores, it is possible to load all of the plurality of messages. So, it is possible to provide a technique for enabling data to be quickly loaded from the plurality of data stores while preventing data loss for the plurality of messages. The data storage device includes a message distribution part and a data storage part.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data storage apparatus,

The present invention relates to a technique for distributing and storing a plurality of messages in a plurality of data stores so as to facilitate recovery of data when data loss occurs.

Recently, as the spread of the Internet becomes active, a variety of Internet service providers are emerging. These Internet service providers provide e-mail services, or provide various services such as blogs, cafes, and cloud data storage services.

Especially, as the popularity of social network services has increased recently, a lot of Internet service providers providing social network services are also increasing in number.

These Internet service providers need to store a large amount of data uploaded from a large number of client terminals in their own data storage to provide an e-mail service, a blog, a cafe, a cloud service, a social network service, If it is lost in the store, it is trying to prevent loss of data because it does not provide normal service to customers.

One such effort is introducing a way to back up user messages that need to be stored in a data store to multiple data stores. Such a data backup method is one of the most ideal methods for coping with data loss in that the original message can be replaced by using a backup message even if the original message is lost.

In this way, when one original message is stored in a plurality of data stores at a plurality of times, when a data load command for the original message is applied, Since the message corresponding to the original message is immediately loaded from the data storage, it is possible to provide a faster speed of data loading than a method of storing the original message in one data storage.

However, in the existing data backup method, only a method of distributing a copy message for an original message to a plurality of data stores is adopted, and therefore, from the viewpoint of Internet service providers who need to store a large number of messages in a data store, A problem may arise in that a large amount of data storage capacity is required because copy messages for each of a plurality of messages are generated and distributedly stored in the respective data stores.

Accordingly, in a method of distributing a plurality of messages to a plurality of data stores, a method of distributing a plurality of messages using only a minimum number of data stores and selecting and accessing only a minimum data store among the data stores There is a need for research on a technique for preventing data loss for the plurality of messages and enabling quick data loading from the data stores by loading all of the plurality of messages.

A method for distributing a plurality of messages to a plurality of data stores, the method comprising: distributing the plurality of messages using only a minimum of data stores, selecting only a minimum data store among the data stores, So that the plurality of messages can be loaded so as to prevent data loss for the plurality of messages and to enable fast data loading from the data stores.

A data storage device capable of distributing messages according to an exemplary embodiment of the present invention includes a plurality of message distribution groups corresponding to a plurality of data stores and a plurality of message distribution groups corresponding to the plurality of message distribution groups, A message distribution unit for distributing a plurality of messages to be stored to a predetermined number of distributed messages; a message distribution unit for distributing messages distributed to the plurality of message distribution groups; and messages allocated to each of the plurality of message distribution groups And a data storage unit for separately storing the plurality of message distribution groups in a data repository corresponding to each message distribution group among the plurality of data repositories.

Also, a data storage method capable of distributing a message according to an exemplary embodiment of the present invention includes generating a plurality of message distribution groups corresponding to a plurality of data stores, A plurality of messages distributed to a plurality of message distribution groups are distributed to a predetermined number of messages; messages distributedly distributed to the plurality of message distribution groups may overlap each other; and messages allocated to each of the plurality of message distribution groups And separately storing the plurality of message distribution groups in a data repository corresponding to each message distribution group among the plurality of data repositories.

A method for distributing a plurality of messages to a plurality of data stores, the method comprising: distributing the plurality of messages using only a minimum of data stores, selecting only a minimum data store among the data stores, A plurality of messages can be loaded so as to prevent data loss for the plurality of messages and to provide a technique for enabling fast data loading from data stores.

FIG. 1 is a diagram illustrating a structure of a data storage device capable of distributing a message according to an embodiment of the present invention.
FIG. 2 is a view for explaining a data storage device capable of distributing messages according to an embodiment of the present invention.
3 is a flowchart illustrating a data storage method capable of distributing a message according to an embodiment of the present invention.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the invention is not intended to be limited to the particular embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention. Like reference numerals are used for like elements in describing each drawing.

It is to be understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, . On the other hand, when an element is referred to as being "directly connected" or "directly connected" to another element, it should be understood that there are no other elements in between.

The terminology used in this application is used only to describe a specific embodiment and is not intended to limit the invention. The singular expressions include plural expressions unless the context clearly dictates otherwise. In the present application, the terms "comprises" or "having" and the like are used to specify that there is a feature, a number, a step, an operation, an element, a component or a combination thereof described in the specification, But do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, or combinations thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as either ideal or overly formal in the sense of the present application Do not.

Hereinafter, embodiments according to the present invention will be described in detail with reference to the accompanying drawings.

FIG. 1 is a diagram illustrating a structure of a data storage device capable of distributing a message according to an embodiment of the present invention.

Referring to FIG. 1, a data storage device 110 capable of distributing messages according to an embodiment of the present invention includes a message distribution unit 111 and a data storage unit 112.

The message distribution unit 111 generates a plurality of message distribution groups corresponding to the plurality of data stores 101, 102 and 103, and a plurality of data stores 101, 102, and 103 for the plurality of message distribution groups. 103 by a predetermined number of times.

At this time, messages distributedly allocated to the plurality of message distribution groups may overlap each other.

Here, a message refers to a kind of data symbol to be stored in a plurality of data stores 101, 102, and 103, wherein the plurality of messages are different data symbols.

The data storage unit 112 stores messages allocated to each of the plurality of message distribution groups corresponding to each message distribution group among the plurality of data stores 101, Store it separately in the data store.

In this case, according to an embodiment of the present invention, the message distribution unit 111 may include a sequence generation unit 113, a sequence matching unit 114, and a distribution assignment unit 115.

When the number of the plurality of messages is N (where N is a natural number satisfying the condition of N = 2 ^k -1 and k is a natural number of 2 or more), the sequence generation unit 113 generates N 1's and 0's N " sequences composed of code values of "n "

Here, the m-sequence is a kind of pseudo random noise (PN) code, and is a sequence composed of code values of "1" and "0".

을 2^k개의 원소로 구성된 유한체라 하고

를 그 확장체 상의 한 원시원(primitive element)이라 할 때, m-시퀀스는

상에서

로의 선형 함수

의 값이 t가 0부터 2^k-1까지 변할 때 갖는 값으로 정의되거나,

를 생성하는

를 근으로 갖는 원시 다항식(primitive polynomial) "

"가 있을 때 선형 피드백 시프트 레지스터(linear feedback shift register)를 사용해서, 모두 0이 아닌 초기 값으로부터 시작해서 2^k-1 클럭동안 출력되는 데이터로 정의될 수 있다.

Is a finite element consisting of 2 ^k elements

Is a primitive element on the extension, the m-sequence is

On

Linear function to

Is defined as a value when t changes from 0 to 2 ^k -1,

To generate

Primitive polynomial "with < RTI ID = 0.0 >

"Can be defined as data output starting at a non-zero initial value for 2 ^k -1 clocks, using a linear feedback shift register.

개로 일정하며, 서로 다른 k-1개의 m-시퀀스에 대해 "OR"연산을 수행하게 되면, "OR" 연산이 수행된 결과 값에서 존재하는 "1"의 코드 값의 개수는 항상 N-1개가 되고, "0"의 코드 값의 개수는 항상 1개가 되는 특징을 가지고 있다.m- sequence is N = 2 in other words, N = 2 ^k -1 of "1" and the code consisting of a code value of "0" having a length of ^k -1, when N number of sequences is generated, each m- m- The number of code values of "1" existing in the sequence is always

The number of code values of "1" existing in the result of performing the "OR" operation is always N-1 when the " OR "operation is performed on k- , And the number of code values of "0" is always one.

The sequence matching unit 114 generates N message distribution groups, and matches the N m-sequences one by one with respect to each of the N plurality of message distribution groups.

개씩 분산 할당한다.For each of the N number of message distribution groups, the distribution assignment unit 115 assigns the plurality of message distribution groups to each of the N number of message distribution groups based on N code values constituting an m- Messages

Respectively.

In this case, according to an embodiment of the present invention, the message distribution unit 111 may further include an index assigning unit 116 for assigning index values associated with the order information to each of the plurality of messages.

At this time, the distribution assigning unit 115 assigns, to each of the N plurality of message distribution groups, an arrangement order of N code values constituting an m-sequence matched to each of the N plurality of message distribution groups, And compare the index values assigned to each of the plurality of messages, and distribute the plurality of messages based on code values of an array order matching an index value assigned to the plurality of messages.

개씩 존재하는 "1"의 코드 값을 확인한 후 상기 복수의 메시지들 중 상기 "1"의 코드 값에 대한 배열 순서와 일치하는 인덱스 값이 할당되어 있는

개의 메시지들을 할당할 수 있다.In this case, according to an embodiment of the present invention, the distribution assigning unit 115 constructs an m-sequence matched to each of the N plurality of message distribution groups, for each of the N plurality of message distribution groups Of the N code values

Quot; 1 "existing in the message list, and then an index value that matches the code order of the code value of" 1 "among the plurality of messages is allocated

Lt; / RTI > messages.

According to an embodiment of the present invention, the data storage device 110 capable of distributing a message may further include a storage message extractor 117, a residual message extractor 118, and a data loader 119 have.

The stored message extracting unit 117 extracts a plurality of messages stored in the plurality of data stores 101, 102, and 103 after the plurality of messages are distributed and stored, (K-1) of the plurality of data stores (101, 102, 103) randomly based on the k-1 data stores, Lt; / RTI >

The remaining message extracting unit 118 compares the index value assigned to the extracted plurality of stored messages with the index value of the plurality of messages and stores the index value in the extracted plurality of stored messages And extracts the remaining message from any one of the plurality of data stores 101, 102, 103 in which the remaining message is stored.

The data loading unit 119 loads the extracted plurality of stored messages and the extracted residual message as data according to a load command for the plurality of messages.

Hereinafter, the operation of the data storage device 110 capable of storing and distributing messages according to the present invention will be described in detail with reference to FIG.

FIG. 2 is a view for explaining a data storage device 110 capable of distributing messages according to an embodiment of the present invention.

First, a plurality of data stores 101, 102 and 103 are connected to the data storage 1 211, the data storage 2 221, the data storage 3 231, the data storage 4 241, , The data storage 5 (251), the data storage 6 (261) and the data storage 7 (271) It is assumed that the number of messages is 7.

At this time, the index assigning unit 116 included in the message distributing unit 111 may assign an index value associated with the order information to the seven messages. When the index assigning unit 116 assigns the seven messages M ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ ", the seven messages can be expressed as" m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ ".

Since the number of the plurality of messages is assumed to be seven, the sequence generation unit 113 can generate seven m-sequences composed of seven code values of "1" and "0".

In this case, the m-sequence is a pseudorandom noise code composed of N = 2 ^k -1 code values. In this embodiment, since N is assumed to be 7, k can be 3.

을 2^k개의 원소로 구성된 유한체라 하고

를 그 확장체 상의 한 원시원이라 할 때,

상에서

로의 선형 함수

의 값이 t가 0부터 2^k-1까지 변할 때 갖는 값을 상기 m-시퀀스로 생성할 수 있거나,

를 생성하는

를 근으로 갖는 원시 다항식 "

"가 있을 때 선형 피드백 시프트 레지스터를 사용해서, 모두 0이 아닌 초기 값으로부터 시작해서 2^k-1 클럭동안 출력되는 데이터를 상기 m-시퀀스로 생성할 수 있다.At this time, the sequence generator 113, as described above,

Is a finite element consisting of 2 ^k elements

Is an origin on the extension,

On

Linear function to

Can be generated with the m-sequence when the value of t changes from 0 to 2 < ^{RTI ID =} 0.0 > ^k- 1,

To generate

Quot; primitive polynomial "

&Quot;, it is possible to generate data in the m-sequence that is output for 2 ^k -1 clocks starting from a non-zero initial value, all using a linear feedback shift register.

As a result of generating 7 m-sequences in the sequence generation unit 113, the 7 m-sequences are 1001011 (212), 0010111 (222), 0101110 (232), 1011100 (242), 0111001 (252), 1110010 (262), 1100101 (272).

개의 "1"의 코드 값을 갖게 되는데, 본 실시예에서 N은 7로 가정하였기 때문에 7개의 m-시퀀스들(212, 222, 232, 242, 252, 262, 272) 각각에 포함된 "1"의 코드 값은 항상 4개이다.This m-sequence is, as described above,

1 "included in each of the seven m-sequences 212, 222, 232, 242, 252, 262 and 272 because N is assumed to be 7 in this embodiment. The code value is always four.

If the m-sequence performs an "OR" logical operation between k-1 different m-sequences, the code value of "1" included in the result of the logical operation is always N-1, Of the seven m-sequences 212, 222, 232, 242, 252, 262, and 272 because N is 7 and k is 3 since the code value of the m- When the "OR" logical operation is performed between the m-sequences, the code value of "1" included in the operation result value is always 6, and the code value of "0 "

When the seven m-sequences 212, 222, 232, 242, 252, 262, and 272 are generated, the sequence matching unit 114 stores the data mapped to the data stores 1 to 7 (211, 221, 231, 241, 251, 233, 243, 253, 263, 273 corresponding to the message distribution groups 213, 223, 233, 243, 253, 262, 272 can be matched one by one for each of the m-sequences 261, 263, 273.

In this regard, the sequence matching unit 114 may match 1001011 (212) to the message distribution group 1 (213), 0010111 (222) to the message distribution group 2 (223) Match 0101110 (232) to message distribution group 3 233, match 1011100 (242) to message distribution group 4 (243), match message distribution group 5 (253 And can match 1110010 (262) for message distribution group 6 (263) and 1100101 (272) for message distribution group 7 (273) .

Then, for each of the seven message distribution groups 213, 223, 233, 243, 253, 263 and 273, the distribution assignment unit 115 assigns seven message distribution groups 213, 223, 233, 243, M ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ , m ₂ , m ₃ , m ₄ , Quot ;, and the distribution assignment unit 115 assigns 7 code values constituting the m-sequence matched to each of the 7 message distribution groups 213, 223, 233, 243, 253, 263, in the arrangement order and seven message _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" and then compares the index value is assigned to each of the seven messages "m _1, m _{2, m 3, m 4,} m 5, m 6, m 7 " seven messages on the basis of the code values of the collating sequence matching the index values assigned to _{the" m 1, m 2, m} 3, m 4 , m ₅ , m ₆ , m ₇ "are divided into seven message distribution groups 213, 223, 233, 243, 253, 263, and 273, respectively.

At this time, the distribution assigning unit 115 assigns four of the seven code values constituting the m-sequence matched to the seven message distribution groups 213, 223, 233, 243, 253, 263, and 273 "1" of the seven message after checking the code value _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" index matching the collation order for the code value of "1" The four messages to which the value is assigned can be allocated to the seven message distribution groups 213, 223, 233, 243, 253, 263, and 273.

In relation to this, the distribution allocator 115 allocates seven messages for each of the seven message distribution groups 213, 223, 233, 243, 253, 263, and 273, "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ "are distributed according to each message distribution group.

First, since the m-sequence 1001011 (212) is matched with respect to the message distribution group 1 (213), the distribution assignment unit 115 checks the code value of "1" from the 1001011 (212) _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 "from" 1 "to four messages the message distribution group with the index value to correspond with the arrangement order of the code value is assigned in the 1 ( 213).

2, since the code value of "1" is arranged at positions 1, 4, 6 and 7 in the 1001011 (212) M ₁ , m ₄ , m ₆ , m ₇ "to which the index values corresponding to the positions 1, 4, 6, 7 are assigned to the first 213.

Since the m-sequence 0010111 (222) is matched with respect to the message distribution group 223, the distribution assignment unit 115 checks the code value of "1 " from 0010111 (222) (4) in which an index value corresponding to the code order value of "1" among the m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " 223).

2, since the code values of "1" are arranged at positions 3, 5, 6 and 7, the distribution assigning unit 115 assigns the code value of & M ₃ , m ₅ , m ₆ , m ₇ "to which the index values corresponding to the positions 3, 5, 6, 7 are assigned to the second 223.

Since the m-sequence of 0101110 (232) is matched with respect to the message distribution group 3 233, the distribution assignment unit 115 checks the code value of "1 " from the 0101110 (232) _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 "from" 1 "code value for message four messages, which is an index value assigned to match the arrangement order of the distribution group 3 ( 233).

2, since the code value of "1" is arranged at positions 2, 4, 5 and 6 in the 0101110232, M ₂ , m ₄ , m ₅ , m ₆ "to which the index values corresponding to the positions 2, 4, 5, and 6 are assigned to the third 233.

Since the m-sequence 1011100 (242) is matched with respect to the message distribution group 4 (243), the distribution assignment unit 115 checks the code value of "1" from the 1011100 (242) _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 "from" 1 "code value of four messages the message distribution group that is the index value assigned to match the arrangement order of the four ( 243).

2, since the code values of "1" are arranged at positions 1, 3, 4 and 5 in 1011100242, M ₁ , m ₃ , m ₄ , and m ₅ "to which index values corresponding to positions 1, 3, 4, and 5 are assigned to the 4 (243)

Since the m-sequence 0111001 (252) is matched with respect to the message distribution group 5 253, the distribution assignment unit 115 checks the code value of "1 " from 0111001 (252) _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 "from" 1 "of the code value of four messages the message distribution group that is the index value assigned to match the arrangement order of the 5 ( 253).

2, since the code value of "1" is arranged at positions 2, 3, 4 and 7 in the 0111001 (252) M ₂ , m ₃ , m ₄ , m ₇ "to which the index values corresponding to the positions 2, 3, 4, and 7 are assigned to 5 (253).

Since the m-sequence of 1110010 (262) is matched with respect to the message distribution group 6 (263), the distribution assignment unit 115 checks the code value of "1 " from 1110010 (262) _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 "from" 1 "code value distributed group of four messages, which is assigned an index value to correspond with the arrangement order message for the 6 ( 263).

2, since the code value of "1" is arranged at positions 1, 2, 3 and 6 in the 111001026, M ₁ , m ₂ , m ₃ , m ₆ "to which index values corresponding to positions 1, 2, 3, and 6 are assigned to 6 (263).

Since the m-sequence 1100101 (272) is matched with respect to the message distribution group 7 (273), the distribution assignment unit 115 checks the code value of "1" from 1100101 (272) _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 "from" 1 "of the code value of four messages the message distribution group that is the index value assigned to match the arrangement order of the 7 ( 273).

2, since the code value of "1" is arranged at positions 1, 2, 5 and 7 in the 1100101 272, M ₁ , m ₂ , m ₅ , m ₇ "to which index values corresponding to positions 1, 2, 5, and 7 are assigned to 7 (273)

Thus, the seven messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " are all seven message distribution groups 213, 223, 233, 243, 253, 263, The data storage unit 112 stores the four messages allocated to the seven message distribution groups 213, 223, 233, 243, 253, 263, and 273 in seven A message storage group corresponding to each message distribution group among the data storage groups 1 to 7 (211, 221, 231, 241, 251, 261, 271) for the message distribution groups 213, 223, 233, 243, 253, 263, Can be stored separately.

The data storage unit 112 stores four messages "m ₁ , m ₄ , m ₆ , m ₇ " assigned to the message distribution group 1 213 in the data store 1 211, which is the corresponding data store, Lt; / RTI >

The data storage unit 112 stores the four messages "m ₃ , m ₅ , m ₆ , m ₇ " assigned to the message distribution group 2 223 in the data store 2 221 as the corresponding data store Can be stored.

The data storage unit 112 stores the four messages "m ₂ , m ₄ , m ₅ , m ₆ " assigned to the message distribution group 3 233 in the data store 3 231 corresponding to the data store Can be stored.

The data storage unit 112 stores four messages "m ₁ , m ₃ , m ₄ , m ₅ " assigned to the message distribution group 4 243 in the data store 4 241 corresponding to the data store Can be stored.

The data storage unit 112 stores the four messages "m ₂ , m ₃ , m ₄ , m ₇ " assigned to the message distribution group 5 (253) in the data store 5 (251) Can be stored.

The data storage unit 112 stores the four messages "m ₁ , m ₂ , m ₃ , m ₆ " assigned to the message distribution group 6 263 in the data store 6 261 corresponding to the data store Can be stored.

Lastly, the data storage unit 112 stores the four messages "m ₁ , m ₂ , m ₅ , m ₇ " assigned to the message distribution group 7 273 in the data store 7 271, which is the corresponding data store, Lt; / RTI >

The seven messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " are stored in the data stores 1 to 7 (211, 221, 231, 241, 251, 261, 271) M ₄ , m ₅ , m ₆ , m ₇ ", the seven messages" m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " _{m 1, m 2, m 3} , m 4, m 5, m 6, m 7 " when performing a data load on a data storage 1-7 (211, 221, 231, 241, 251, 261, 271) then access any two data storage only in the two when the data extracting store only those messages stored in the seven messages, which are _{"m 1, m 2, m} 3, m 4, m 5, m 6 , m ₇ "are all extracted.

Because the seven messages "m ₁ , m ₂ , m ₁ " are stored in the data storage 1 to 7 (211, 221, 231, 241, 251, 261, 271) m ₃ , m ₄ , m ₅ , m ₆ , m ₇ "are distributed and stored, and when an" OR "logic operation is performed between any two m-sequences of the seven m- , All of the four messages are extracted from any two random data stores among the data stores 1 to 7 (211, 221, 231, 241, 251, 261, and 271) , At least six messages among the seven messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " are obtained.

Therefore, the seven messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " are stored in the data stores 1 to 7 211, 221, 231, 241, 251, 261, 271 ) distributed stored in a, which are of the seven messages after complete when the load instruction for the _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" is applied, the data store 1-7 (211 , 6, and 7 can be quickly loaded by randomly selecting only two data stores having the lowest data traffic among the data stores, 221, 231, 241, 251, 261, and 271, M ₁ , m ₂ , m ₃ , and m ₃ are extracted from the data storage in which the remaining one message among the first to seventh messages (211, 221, 231, 241, 251, 261, m ₄ , m ₅ , m ₆ , m ₇ ".

In this regard, the stored message extracting unit 117 extracts the seven messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₁ , m ₂ , m _5, m _6, m ₇ "When the dispersion after stored, the which are seven _{messages" m 1, m 2, m} 3, m 4, m 5, m 6, m 7 applied with a load instruction for ", the Randomly selects two data stores out of the data stores 1-7 (211, 221, 231, 241, 251, 261, 271) based on the load command, and selects one of the two data stores It is possible to extract the four stored messages stored in the storage unit.

The remaining message extracting unit 118 extracts the index values assigned to the stored messages extracted from the two data stores and the seven messages' m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , to m _6, m ₇ "the seven messages, which are compared to the index value assigned to _{the" m 1, m 2, m} 3, m 4, m 5, m 6, m 7 " the extracted stored messages of If there is a remaining message that is not included in the message, it is determined from the data storage 1 to 7 (211, 221, 231, 241, 251, 261, 271) Can be extracted.

Then, the data loading unit 119 stores the extracted stored messages and the extracted remaining messages in the seven messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " Can be loaded into the data according to the load command for the < / RTI >

In this regard, if the two randomly selected data stores are referred to as data storage 2 (221) and data storage 5 (251), the storage message extracting unit 117 extracts "m ₃ , m ₅ , m ₆ , m ₇ "from the data storage 5 (251) and extract" m ₂ , m ₃ , m ₄ , m ₇ "from the data storage 5 251.

M ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ "can be extracted from the data storage 2 221 and the data storage 5 251 have.

At this time, the remaining message extraction unit 118, which are of the seven message _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" the index value assigned to and the extracted "m _{2 , m 3, m 4, m} 5, m 6, m 7 " , which are of the seven messages are the index values are compared with each other, which is assigned to _{the" m 1, m 2, m} 3, m 4, m 5, m 6, m ₄ , m ₅ , m ₆ , m ₇ "among the extracted messages" m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ ".

In connection, in the present embodiment, the "m _1" since the remaining messages of the residual message extraction unit 118 is the data store 1 ~ 7 (211, 221, 231, 241, 251, 261, 271) "m 1" M1 "can be extracted from any one of the stored data stores.

For example, the residual message extractor 118 may extract "m ₁ " from the data store 4 (241).

_{Thus, "m 2, m 3,} m 4, m 5, m 6, m 7" and when "m _1" extraction is completed, data load unit 119 _{"m 2, m 3, m} 4, m ₅ , m ₆ , m ₇ "and" m ₁ "as the data according to the load command for the seven messages" m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ " M ₁ , m ₂ , m ₃ , m _{4 (} m ₁ , m ₂ , m ₃ , m ₄₎ can be obtained by accessing only three data stores out of the data stores 1 to 7 (211, 221, 231, 241, 251, 261, , m ₅ , m ₆ , m ₇ "can be loaded.

Further, according to one embodiment of the invention, the message distribution storing the data storage device 110, which are of the seven message _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" Of the data stores 1 to 7 (211, 221, 231, 241, 251, 261, and 271) by distributing and storing four data in the data stores 1 to 7 (211, 221, 231, 241, 251, 261, Even if there is an error in the plurality of data stores and data loss occurs in the messages stored in the data stores, only two of the data stores 1 to 7 (211, 221, 231, 241, 251, 261, and the number of data the which are seven messages from the storage only to pull restore all of the at least six messages of the _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7", from the three data storage are the messages which are seven _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" the method can be restored, the data loss occurs largely avoided hadeora It can be restored to all of the data at least from the remaining resources.

2, when the N (N = 2 ^k -1) messages are dispersedly stored in a plurality of data stores 101, 102, and 103, when performing message load or restoration at a later time, An embodiment has been described in which N-1 messages can be recovered from k-1 data stores of a plurality of data stores 101, 102, 103.

In this regard, according to another embodiment of the present invention, the data storage device 110 capable of distributing messages can store N-1 (N-1) messages, not N, to be stored in the plurality of data stores 101, In a personal case, it also includes a configuration capable of restoring all N-1 input messages from k-1 of the plurality of data stores 101, 102, 103 when performing message load or restoration at a later time Hereinafter, this will be described in detail.

First, the data storage device 110 capable of storing and distributing messages according to the present invention may further include a dummy message generating unit 120.

The dummy message generator 120 generates one dummy message by logically operating all of the N-1 input messages when the data distribution storage command for N-1 input messages is applied, The input messages and the one dummy message are composed of the N plurality of messages used in the embodiment described above with reference to FIG.

In this case, according to an embodiment of the present invention, the dummy message generator 120 may generate the one dummy message by performing a logic operation to 'XOR' all the N-1 input messages.

2, the message distributing unit 111 distributes the N messages to the N number of message distribution groups (N), and transmits the N messages to the N distributed message groups And the data storage unit 112 distributes messages allocated to the N plurality of message distribution groups to the plurality of data stores 101, 102, 103 ) Can be stored separately in the data repository corresponding to each message distribution group.

In this case, according to an embodiment of the present invention, the storage message extractor 117 may store the N-1 input messages in a plurality of data stores 101, 102, and 103 together with the dummy message, (K-1) data stores among a plurality of data stores (101, 102, 103) are randomly selected based on the load command when a load command for N-1 input messages is applied, From the plurality of data stores, a plurality of stored messages stored in each of the k-1 data stores.

In this case, according to an embodiment of the present invention, the data storage device 110 capable of distributing a message may store an index value assigned to the extracted plurality of stored messages and an index assigned to the N-1 input messages And if it is determined that there is a remaining message that is not included in the extracted plurality of stored messages among the N-1 input messages, And a residual message estimating unit 121 estimating the residual message by performing an inverse operation.

At this time, the data loading unit 119 may load the extracted plurality of stored messages and the estimated remaining message as data according to a load command for the N-1 input messages.

Hereinafter, an operation of the data storage device 110 capable of distributing messages in a case where the number of input messages to be stored in the plurality of data stores 101, 102, and 103 is N-1 is described with reference to FIG. 2 Will be described in more detail.

First, assume that the number of input messages to be stored in the data repositories 1 to 7 (211, 221, 231, 241, 251, 261, and 271) is six.

At this time, the index assigning unit 116 may assign an index value associated with the order information to the six input messages. The index assigning unit 116 assigns index information related to the six input messages in order from 1 to 6 M ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ ", the six input messages can be expressed as" m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ ".

At this time, the dummy message generator 120 which includes the six input message _{"m 1, m 2, m} 3, m 4, m 5, m 6" to the both do the "XOR" logical operation in sequence "m ₇ "≪ / RTI >

M ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ , m ₇ , and so on. The data storage device 110, named as examples who explained with using the second prior to treatment with the 7 _{message, "m 1, m 2,} m 3, m 4, m 5, m 6, m 7" of the data store, the message 1 and 7 (211, 221, 231, 241, 251, 261, 271).

That is, the message distribution storing the data storage device 110 is _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" of the six input messages and one pile comprising a message Four messages are distributed and distributed in seven message distribution groups 213, 223, 233, 243, 253, 263, and 273 based on the m-sequence, and then the data stores 1 to 7 (211, 221, 231 , 241, 251, 261, 271).

Message distributed storage is a data storage device 110 is _{"m 1, m 2, m} 3, m 4, m 5, m 6, m 7" of the six input messages and one dummy message data storage 1 M ₂ , m ₃ , m ₄ , m ₅ , m ₆ , and m (m ₁ , m ₂ , m ₃ , m ₄ , ₇ "are distributed and stored in the data repositories 1 to 7 (211, 221, 231, 241, 251, 261, and 271), and therefore detailed description thereof will be omitted.

_{Thus, "m 1, m 2,} m 3, m 4, m 5, m 6, m 7" to the six input message and the one dummy message data store 1-7 (211, 221, 231, 241 of M ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ "after the distributed storage is completed in the storage messages 251, 261, The extracting unit 117 randomly selects two data stores out of the data stores 1 to 7 (211, 221, 231, 241, 251, 261 and 271) based on the load command, And may extract a plurality of stored messages stored in each of the two data stores.

Assuming that the stored message extractor 117 selects the data storage 2 221 and the data storage 6 261 among the data storage 1 to 7 (211, 221, 231, 241, 251, 261, and 271) , The storage message extracting unit 117 can extract "m ₃ , m ₅ , m ₆ , m ₇ " from the data storage 2 221 and extract "m ₁ , m ₂ , m ₃ , m ₆ "can be extracted.

Because of this, after all, stored message extraction unit 117 is a data store 2 221 and data store 6 from the _{(261) "m 1, m} 2, m 3, m 5, m 6, m 7" to be extracted have.

At this time, the remaining message guess unit 121 the extracted _{"m 1, m 2, m} 3, m 5, m 6, m 7" , which are the index value and the six input message that is assigned to the "m _1, m _{2, m 3, m 4,} m 5, m 6 " , which are the six input message by comparing the index value assigned to _{the" m 1, m 2, m} 3, m 4, m 5, m 6 " of the It is possible to check whether there is a residual message not included in the extracted "m ₁ , m ₂ , m ₃ , m ₅ , m ₆ , m ₇ ".

In the present embodiment, it can be confirmed that the residual message estimating unit 121 does not include "m ₄ " in the extracted "m ₁ , m ₂ , m ₃ , m ₅ , m ₆ , m ₇ ".

At this time, the remaining message guess portion 121 the dummy messages for the order to guess the "m _4" is the residual _{message, "m 1, m 2,} m 3, m 5, m 6, m 7"" m ₇ are the "who perform in order to generate" XOR "by performing the inverse operation of the logical operation, wherein the residual message" m ₄ "can guess.

That is, the dummy message of "m _7" is because it is _{"m 1 XOR m 2 XOR m} 3 XOR m 4 XOR m 5 XOR m 6" is calculated in the generated _{message, "m 1, m 2,} m 3, m 5 , m ₆ , m ₇ "are known, the remaining message" m ₄ "can be calculated by performing an inverse operation on the logical operation that was calculated to generate the dummy message" m ₇ " The message estimating unit 121 calculates the difference between the inverse of the "XOR" logical operation performed to generate the dummy message "m ₇ " for "m ₁ , m ₂ , m ₃ , m ₅ , m ₆ , m ₇ " by carrying out the operation, it can be a guess of the residual message "m _4".

After that, the data load unit 119 is extracted from the data store 2 221 and data store _{6 (261) "m 1,} m 2, m 3, m 5, m 6" and the inferred "m _4" Can be loaded into the data according to the load command for the six input messages "m ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ ".

As a result, the data storage device 110 capable of distributing messages according to the present invention can store seven message distribution groups 213, 223, 233, 243, 253, and 263 based on seven m- And 273 are distributed and stored in the data stores 1 to 7 (211, 221, 231, 241, 251, 261 and 271), the data stores 1 to 7 (211, 221, 231, 241, 251, 261, and 271, it is possible to extract at least six messages out of the seven messages on the basis of the characteristics of the m-sequence. Therefore, when the input data to be stored is 6 In the personal case, the six input data are logically operated to generate one piece of dummy data into seven pieces of data, and the seven pieces of data are stored in the data stores 1 to 7 (211, 221, 231, 241, 251, 261, 271 ) To store data in the later data stores 1 to 7 (211, 221, 231, 241, 251 , 261, and 271, and if there are remaining data that can not be included in the input data among the six extracted messages, It is possible to infer by performing an inverse operation on the logic operation based on the dummy data and load all the six input data only by accessing the minimum data storage.

Further, according to one embodiment of the invention, which are messages distributed storage is a data storage device 110 includes the six input message _{"m 1, m 2, m} 3, m 4, m 5, m 6" and the one dummy message is "m _7" to the data store 1-7 (211, 221, 231, 241, 251, 261, 271), by storing to 4 per dispersed in, a data store 1-7 (211, 221, 231, 231, 241, and 241 even if data loss occurs in the messages stored in the corresponding data stores due to an error in the plurality of data stores among the data stores 1 to 7 (211, 221, 231, 241, M ₁ , m ₂ , m ₃ , m ₄ , m ₅ , m ₆ ", which are the above six input messages, can be restored from only two of the data storage devices 251, 261, It is possible to restore all the input data from the minimum remaining resources.

3 is a flowchart illustrating a data storage method capable of distributing a message according to an embodiment of the present invention.

In step S310, a plurality of message distribution groups corresponding to the plurality of data stores are created, and a plurality of messages to be stored in the plurality of data stores are distributedly allocated to the plurality of message distribution groups by a predetermined number .

Here, messages distributedly allocated to the plurality of message distribution groups may overlap each other.

In step S320, the messages allocated to the plurality of message distribution groups are separately stored in the plurality of message distribution groups in the data storage corresponding to each message distribution group among the plurality of data stores.

개씩 분산 할당하는 단계를 포함할 수 있다.According to an embodiment of the present invention, in step S310, when the number of the plurality of messages is N (N is a natural number satisfying a condition of N = 2 ^k- 1 and k is a natural number of 2 or more) Generating N number of m-sequences each consisting of N "1" and "0" code values, generating N pieces of the plurality of message distribution groups, and for each of the N number of message distribution groups, For each of the N plurality of message distribution groups, for each of the N number of message distribution groups based on N code values constituting an m-sequence matched to each of the N plurality of message distribution groups, The plurality of messages

And distributing each of the plurality of data.

According to an embodiment of the present invention, the step S310 may further include the step of assigning an index value associated with the order information to each of the plurality of messages.

개씩 분산 할당하는 단계는 상기 N개의 복수의 메시지 분산 그룹들 각각에 대해, 상기 N개의 복수의 메시지 분산 그룹들 각각에 매칭되어 있는 m-시퀀스를 구성하는 N개의 코드 값의 배열 순서와 상기 복수의 메시지들 각각에 할당되어 있는 인덱스 값을 비교한 후 상기 복수의 메시지들에 할당되어 있는 인덱스 값과 일치하는 배열 순서의 코드 값에 기초하여 상기 복수의 메시지들을 분산 할당할 수 있다.At this time,

Wherein each of the N number of message distribution groups includes an N number of code value constructing an m-sequence matched with each of the N number of message distribution groups, And distributes the plurality of messages based on a code value of an array order that matches an index value assigned to the plurality of messages after comparing the index values assigned to the messages.

개씩 분산 할당하는 단계는 상기 N개의 복수의 메시지 분산 그룹들 각각에 대해, 상기 N개의 복수의 메시지 분산 그룹들 각각에 매칭되어 있는 m-시퀀스를 구성하는 N개의 코드 값 중

개씩 존재하는 "1"의 코드 값을 확인한 후 상기 복수의 메시지들 중 상기 "1"의 코드 값에 대한 배열 순서와 일치하는 인덱스 값이 할당되어 있는

개의 메시지들을 할당할 수 있다.At this time, according to an embodiment of the present invention,

Wherein each of the N number of message distribution groups includes at least one of N code values constituting an m-sequence matched to each of the N plurality of message distribution groups,

Quot; 1 "existing in the message list, and then an index value that matches the code order of the code value of" 1 "among the plurality of messages is allocated

Lt; / RTI > messages.

According to another aspect of the present invention, there is provided a data storage method capable of distributing a message, wherein when the load command for the plurality of messages is applied after the plurality of messages are distributed to the plurality of data stores, Randomly selecting k-1 data stores of the plurality of data stores based on the load command, selecting a plurality of k-1 data stores stored in each of the k-1 data stores from the k-1 data stores, Comparing the index value assigned to the extracted plurality of stored messages with the index value of the plurality of messages to determine whether the plurality of stored messages are not included in the extracted plurality of stored messages If it is determined that a residual message is present, the remaining one of the plurality of data stores Extracting the residual message from any one of the stored data stores and loading the extracted plurality of stored messages and the extracted residual message with data according to a load command for the plurality of messages .

According to an embodiment of the present invention, when the data distribution storage command for N-1 input messages is applied prior to step S310, Generating a single dummy message by logically computing all of the messages, and constructing the N-1 input messages and the one dummy message into the N plurality of messages.

According to an embodiment of the present invention, there is provided a data storage method capable of distributing a message, wherein the N-1 input messages are distributed to the plurality of data stores together with the dummy message, Selecting one of the k-1 data stores out of the plurality of data stores based on the load command when the load command for the input messages is granted, Extracting a plurality of stored messages stored in each of the data stores, comparing an index value assigned to the extracted plurality of stored messages with an index value assigned to the N-1 input messages, If it is determined that there is a remaining message that is not included in the extracted plurality of stored messages, Performing an inverse operation based on the logical operation on a plurality of stored stored messages to infer the residual message and transmitting the extracted plurality of stored messages and the estimated residual message to the N-1 input messages To the data according to the load instruction for the load instruction.

Hereinabove, a data storage method capable of distributing a message according to an embodiment of the present invention has been described with reference to FIG. Here, the data storage method capable of distributing a message according to an embodiment of the present invention can correspond to the configuration of the operation of the data storage device 110 capable of storing and distributing messages described with reference to FIG. 1 and FIG. 2, A detailed description thereof will be omitted.

A data storage method capable of distributing a message according to an embodiment of the present invention can be realized by a computer program stored in a storage medium for execution through a combination with a computer.

In addition, a data storage method capable of storing distributed messages according to an embodiment of the present invention may be implemented in a form of a program command that can be executed through various computer means and recorded in a computer readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions recorded on the medium may be those specially designed and configured for the present invention or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

As described above, the present invention has been described with reference to particular embodiments, such as specific constituent elements, and limited embodiments and drawings. However, it should be understood that the present invention is not limited to the above- And various modifications and changes may be made thereto by those skilled in the art to which the present invention pertains.

Accordingly, the spirit of the present invention should not be construed as being limited to the embodiments described, and all of the equivalents or equivalents of the claims, as well as the following claims, belong to the scope of the present invention .

101, 102, 103: a plurality of data stores
110: Data storage device capable of distributing messages
111: message distribution unit 112: data storage unit
113: Sequence generation unit 114: Sequence matching unit
115: distribution allocation unit 116: index allocation unit
117: stored message extracting unit 118: residual message extracting unit
119: Data loading unit 120: Dummy message generating unit
121: Residual message guessing part

Claims (16)

A plurality of message distribution groups corresponding to a plurality of data stores, and distributing a predetermined number of a plurality of messages to be stored in the plurality of data stores for the plurality of message distribution groups, The messages distributed to the message distribution groups may be overlapped with each other; And
A data storage unit for separating messages allocated to each of the plurality of message distribution groups into a plurality of data distribution groups corresponding to the plurality of message distribution groups,
Lt; / RTI >
The message distributor
When the number of the plurality of messages is N (N is a natural number satisfying a condition of N = 2 ^k -1 and k is a natural number of 2 or more), m A sequence generator for generating N sequences;
A sequence matching unit for generating N message distribution groups and matching the N m-sequences one by one for each of the N plurality of message distribution groups;
An index assigning unit for assigning an index value associated with the order information to each of the plurality of messages; And
For each of the N plurality of message distribution groups, an arrangement order of N code values constituting an m-sequence matched to each of the N plurality of message distribution groups, and an allocation order of N code values allocated to each of the plurality of messages And comparing the index values of the plurality of messages with the index values of the plurality of messages,

A distributed allocation unit
/ RTI >
The dispersion allocator
For each of the N plurality of message distribution groups, among N code values constituting an m-sequence matched to each of the N plurality of message distribution groups

Quot; 1 "existing in the message list, and then an index value that matches the code order of the code value of" 1 "among the plurality of messages is allocated

A message storage device capable of storing distributed messages. delete delete delete The method according to claim 1,
Wherein when a load command is applied to the plurality of messages after the plurality of messages are dispersedly stored in the plurality of data stores, k-1 data among the plurality of data stores based on the load command A storage message extractor for randomly selecting the stores and extracting a plurality of stored messages stored in each of the k-1 data stores from the k-1 data stores;
And comparing the index value assigned to the extracted plurality of stored messages with the index value of the plurality of messages to determine that there is a remaining message that is not included in the extracted plurality of stored messages A remaining message extracting unit for extracting the remaining message from any one of the plurality of data stores and storing the remaining messages; And
A data load unit for loading the extracted plurality of stored messages and the extracted residual message into data according to a load command for the plurality of messages,
And a data storage device capable of storing distributed messages. The method according to claim 1,
The method of claim 1, further comprising: generating a dummy message by logically operating all of the N-1 input messages when a data distribution store command for N-1 input messages is applied, A dummy message generation unit configured to generate one dummy message with the N number of messages,
And a data storage device capable of storing distributed messages. The method according to claim 6,
Wherein when a load command for the N-1 input messages is applied after the N-1 input messages are distributed to the plurality of data stores along with the dummy message, Randomly selecting k-1 data stores from among a plurality of data stores, extracting a stored message from the k-1 data stores to extract a plurality of stored messages stored in each of the k-1 data stores, part;
The index value assigned to the extracted plurality of stored messages is compared with the index value assigned to the N-1 input messages, and included in the extracted plurality of stored messages among the N-1 input messages A residual message estimator for estimating the residual message by performing an inverse operation based on the logical operation on the extracted plurality of stored messages if it is determined that a remaining message is not present; And
A data loading unit for loading the extracted plurality of stored messages and the estimated residual message into data according to a load instruction for the N-1 input messages,
And a data storage device capable of storing distributed messages. A plurality of message distribution groups corresponding to a plurality of data stores, and distributing a predetermined number of a plurality of messages to be stored in the plurality of data stores for the plurality of message distribution groups, The messages distributed over the message distribution groups may overlap each other; And
Separating messages assigned to each of the plurality of message distribution groups into a plurality of message distribution groups and storing the messages in a data storage corresponding to each message distribution group among the plurality of data stores,
Lt; / RTI >
The step of distributing and allocating as many as the predetermined number
When the number of the plurality of messages is N (N is a natural number satisfying a condition of N = 2 ^k -1 and k is a natural number of 2 or more), m - generating N sequences;
Generating N of the plurality of message distribution groups, and matching the N m-sequences one by one for each of the N plurality of message distribution groups;
Assigning an index value associated with the order information to each of the plurality of messages; And
For each of the N plurality of message distribution groups, an arrangement order of N code values constituting an m-sequence matched to each of the N plurality of message distribution groups, and an allocation order of N code values allocated to each of the plurality of messages And comparing the index values of the plurality of messages with the index values of the plurality of messages,

Distributed allocation
/ RTI >
remind

The steps of distributing
For each of the N plurality of message distribution groups, among N code values constituting an m-sequence matched to each of the N plurality of message distribution groups

Quot; 1 "existing in the message list, and then an index value that matches the code order of the code value of" 1 "among the plurality of messages is allocated

A method of storing data capable of distributing a message allocating a plurality of messages. delete delete delete 9. The method of claim 8,
Wherein when a load command is applied to the plurality of messages after the plurality of messages are dispersedly stored in the plurality of data stores, k-1 data among the plurality of data stores based on the load command Randomly selecting repositories and extracting a plurality of stored messages stored in each of said k-1 data stores from said k-1 data stores;
And comparing the index value assigned to the extracted plurality of stored messages with the index value of the plurality of messages to determine that there is a remaining message that is not included in the extracted plurality of stored messages Extracting the remaining message from any one of the plurality of data stores and storing the remaining message; And
Loading the extracted plurality of stored messages and the extracted residual message into data according to a load command for the plurality of messages
And storing the message in a storage medium. 9. The method of claim 8,
The method of claim 1, further comprising: generating a dummy message by logically operating all of the N-1 input messages when a data distribution store command for N-1 input messages is applied, Configuring one dummy message as the N plurality of messages
And storing the message in a storage medium. 14. The method of claim 13,
Wherein when a load command for the N-1 input messages is applied after the N-1 input messages are distributed to the plurality of data stores along with the dummy message, Randomly selecting k-1 data stores among a plurality of data stores, extracting a plurality of stored messages stored in each of the k-1 data stores from the k-1 data stores,
The index value assigned to the extracted plurality of stored messages is compared with the index value assigned to the N-1 input messages, and included in the extracted plurality of stored messages among the N-1 input messages Performing a reverse operation based on the logical operation on the extracted plurality of stored messages to infer the residual message if it is determined that a remaining message is not present; And
Loading the extracted plurality of stored messages and the estimated remaining message as data according to a load command for the N-1 input messages
And storing the message in a storage medium. A computer-readable recording medium recording a program for performing the method of any one of claims 8, 12, 13, and 14. A computer program stored in a storage medium for executing the method of any one of claims 8, 12, 13 or 14 in combination with a computer.

Images