| 摘要 |
PROBLEM TO BE SOLVED: To reduce a storage capacity for data storage and to speed up a retrieval operation. SOLUTION: Input data are divided into unit data by an input processing part 21 and an address is acquired from a leaf storage part 31 storing the unit data beforehand and stored in a temporary storage part A33. A storage processing part 22 acquires two addresses from the temporary storage part A33, obtains a hash value, stores it in a storage area corresponding to the hash value of a node storage part 32, stores the address of node data storing the two addresses in the temporary storage part B34, abandons contents of the temporary storage part A33 when all the addresses inside the temporary storage part A33 are processed, copies the contents of the temporary storage part B34 to the temporary storage part A33, abandons the contents of the temporary storage part B34, acquires new two addresses and repeats the operations. A storage processing is ended when the address of the node data stored in the temporary storage part A33 finally becomes one.
|
