摘要:
The use of the known feature amounts results in a low level of accuracy in finding similar files. To deal with this problem, the similar file determination process of this invention involves dividing a file, while at the same time changing a file dividing condition, and repeating this dividing operation until the total number of divided pieces of data exceeds a predetermined number. For each of the divided pieces of data thus obtained a hash value is calculated and all the hash values are output.
摘要:
Method of dividing data to be stored in storage device into data fragments; recording the data by using configurations of divided data fragments; judging whether identical data fragments exist in data fragments; when it is judged that identical data fragments exist, storing one of the identical data fragments in storage area of the storage device, and generating and recording data-fragment attribute information indicating an attribute unique to the data fragment stored; upon receipt of request to read data stored in the storage area of the storage device, acquiring the configurations of the data fragments forming the read-target data, reading the corresponding data fragments from the storage area of the storage device, and restoring the data; acquiring and coupling the recorded data fragments to generate concatenation target data targeted for judgment on whether chunk concatenation is possible or not, and detecting whether the concatenation target data has a repeated data pattern
摘要:
Provided is an information processing apparatus 10 that executes a step of referring to a system list 115, retained in a storage unit, storing ID utilization status of each of other apparatuses when an ID change request is received by an input unit or a communication unit, to identify an other apparatus utilizing an ID to be changed indicated by the ID change request, a step of distributing change information relating to the ID to be changed indicated by the ID change request to the identified separate apparatus, and a step of referring to a business task database 113, retained in the storage unit, managing IDs of human resources, assets, and information allocated to business tasks, and identifying the ID to be changed indicated by the ID change request to make a change relating to the corresponding ID.
摘要:
Method of dividing data to be stored in storage device into data fragments; recording the data by using configurations of divided data fragments; judging whether identical data fragments exist in data fragments; when it is judged that identical data fragments exist, storing one of the identical data fragments in storage area of the storage device, and generating and recording data-fragment attribute information indicating an attribute unique to the data fragment stored; upon receipt of request to read data stored in the storage area of the storage device, acquiring the configurations of the data fragments forming the read-target data, reading the corresponding data fragments from the storage area of the storage device, and restoring the data; acquiring and coupling the recorded data fragments to generate concatenation target data targeted for judgment on whether chunk concatenation is possible or not, and detecting whether the concatenation target data has a repeated data pattern.
摘要:
In search that uses searchable code, the search query and the secure index is collated in round-robins fashion, registering the required secure index and a characteristic quantity of deposited data in a database server to realize the searchable code. The server uses the characteristic quantity to perform clustering on the secure index. For search, collation is first performed only for representative data of a cluster. For a hit, the collation priority is raised for all the data included in the cluster. When there is no hit, the priority is lowered. After calculating the priority, collation is performed sequentially for all the data on the basis of the priority.
摘要:
The present invention makes it possible to verify definition information and data in a remote environment while properly protecting confidential data definition information using encryption and the like. The present invention comprises: a step for hiding in an individual manner definition information, such as a word or partial character string representing confidential information, using encryption, hashing, or the like; a step for extracting and hiding in an individual manner a word, partial character string or other such element from data to be controlled; a step for transmitting the hidden element to a server; and a step for verifying, in a hidden manner as-is, the hidden definition information and the hidden element, and deciding whether information matching the definition information is included in the data to be controlled.
摘要:
In search that uses searchable code, the search query and the secure index is collated in round-robins fashion, registering the required secure index and a characteristic quantity of deposited data in a database server to realize the searchable code. The server uses the characteristic quantity to perform clustering on the secure index. For search, collation is first performed only for representative data of a cluster. For a hit, the collation priority is raised for all the data included in the cluster. When there is no hit, the priority is lowered. After calculating the priority, collation is performed sequentially for all the data on the basis of the priority.