KR101310253B1 - Hash data creation method and hash data comparison system and method - Google Patents

Abstract

The present application relates to a hash technique for a data file. The hash data comparison system according to an embodiment of the disclosed technique compares original files with each other using hash data including file information and hash values. do. The hash data comparison system includes a file information generator, a hash generator, and a controller. The file information generation unit generates file information on the original file by checking the property of the original file. The hash generator calculates a hash value by applying a hash function algorithm to at least a portion of the original file. The controller generates parity information by generating hash data of the corresponding original file including the file information and the hash value. According to the disclosed technology of the present application, since it is possible to determine whether the files are different before comparing the hash values for the files, there is no need to compare the entire hash values for the different files, so that the files can be compared more quickly.

Description

Hash data generation method, hash data comparison system and method {HASH DATA CREATION METHOD AND HASH DATA COMPARISON SYSTEM AND METHOD}

The present application relates to a hash technique for a data file, and more specifically, to use a hash data structure that can perform file comparison faster by using the unique characteristic information of the original file together with the hash value. A hash data generation method, hash data comparison system and method.

Data, especially file-to-file comparisons, are used in a variety of operations. For example, it is essentially used in various operations such as checking a file change in an OS or comparing a patch file with an original file to perform a predetermined patch.

As a conventional file comparison technique, a method of comparing an entire file, a method of providing version information to a file and verifying the file based on the file, a method of applying a hash function to the file, and the like are used.

Comparing entire files is not well used because of the large amount of data to compare and overall slowness. The method of comparing files by giving version information to a file has a disadvantage in that the file content and version information may be different if the file version information is not changed even if the file contents are changed, and thus, a proper file comparison cannot be made. .

Therefore, in most cases, a hash function is applied to a file to calculate a hash value, and the calculated hash values are compared to compare the file contents. However, the conventional comparison method using only the hash value has a problem in that a large amount of time is required for computing resources and a corresponding operation to generate a hash value for a large file.

The present application is to provide a hash data structure for file comparison that can easily perform the comparison between files with less resources.

In addition, the present application is to provide a hash data structure generation method and a hash data structure comparison method therefor that allows to compare files faster using a hash data structure for file comparison.

In addition, the present application is to provide a hash comparison system that can efficiently compare files using a hash data structure for file comparison.

Among the embodiments, the hash data structure includes file information about an attribute of the original file consisting of predetermined data bits and a hash value for the original file consisting of specific data bits, and subsequently after the data bits corresponding to the file information. And a data bit corresponding to the hash value.

In one embodiment, the file information may include at least one of a size value of the original file, first partial data including first data of the original file, and second partial data including last data of the original file. have.

In one embodiment, the hash data structure may further include a structure header including structure information for each of the file information and the hash value included in the hash data structure.

In one embodiment, the hash data structure may further include parity information for the hash data structure, and the parity information may include a first parity bit for the file information and a second parity bit for the hash value. have.

Among the embodiments, the hash data generation method relates to a method for generating each hash data for comparison for each original file, the hash data generation method (a) confirms the properties of the original file, the identification Generating file information consisting of predetermined data bits based on the specified attributes, (b) calculating a hash value by applying a hash algorithm to at least a portion of the original file, and (c) the hash to the file information. Successively combining the values to produce hash data.

In an embodiment, the step (a) may include at least one of a size, a name, a format of the original file, first partial data including original data of the original file, and second partial data including final data of the original file. Identifying one and said at least one of a size, a name, a format of said original file, at least one of said first partial data comprising original data of said original file and said second partial data comprising final data of said original file; And generating file information.

In one embodiment, the hash data generation method may further comprise (d) generating a hash parity bit for the hash data.

In an embodiment, the step (d) may include generating a first parity bit for the file information, generating a second parity bit for the hash value, and successively generating the first and second parity bits. Combining to generate the hash parity bits.

Among the embodiments, the hash data generating method relates to a method for generating respective hash data for comparison with respect to each original file, wherein the hash data generating method includes (a) the file information included in the hash data structure. And generating a structure header including structure information for each hash value, (b) identifying an attribute of the original file, and generating file information consisting of predetermined data bits based on the identified attribute; c) calculating a hash value by applying a hash algorithm to at least a portion of the original file, and (d) successively combining the hash value with the file information to generate hash data.

Among the embodiments, the hash data comparison method relates to a hash data comparison method for comparing two original files using hash data including file information and a hash value, wherein the hash data comparison method includes (a) the two Identifying two hash data associated with each of the two original files, (b) comparing two file information included in each of the two data with each other, and (c) if the two file information are the same, And comparing two hash values included in each of the two hash data, and determining the two original files as the same file if they are identical to each other.

In one embodiment, the file information includes at least one of a size, a name, a format of a corresponding original file, first partial data including first data of the corresponding file, and second partial data including last data of the original file. can do.

In an embodiment, the step (b) may include comparing data bits of the two file information with each bit.

In an embodiment, the step (b) may include, for each of the two file informations, first partial data including the size, name, format, original data of the corresponding file included in the corresponding file information, and Identifying at least one of the second partial data including the last data of the original file and the first partial data including the size, name, format, original data of the corresponding original file and the original file of the identified original file; And comparing each of at least one of the second some data comprising the last data of.

Among the embodiments, the hash data comparison method includes a hash data comparison that compares two original files with each other using hash data including file information, a hash value, and a structure header including structure information for each of the file information and the hash value. The hash data comparison method comprises the steps of: (a) comparing the structure headers with respect to the two original files to determine whether they are hash data having the same structure, and (b) if the two structures have the same structure, Comparing file information associated with each of the two original files, and (c) if the file information is identical to each other, comparing hash values associated with each of the original files with each other; And determining the file.

Among the embodiments, the hash data comparison system compares the original files using hash data including file information and hash values. The hash data comparison system includes a file information generator, a hash generator, and a controller. The file information generation unit generates file information on the original file by checking the property of the original file. The hash generator calculates a hash value by applying a hash function algorithm to at least a portion of the original file. The controller generates hash data for the corresponding original file including the file information and the hash value.

In one embodiment, the hash data comparison system may further include a hash file management unit for storing the generated hash data, and maintains information about the original file associated with the stored hash value.

In one embodiment, the controller may compare the file information and the hash value sequentially with respect to each of the first and second source files to determine the sameness.

In an embodiment, the controller may generate a structure header including the file information and identification information about the hash value, and generate the hash data including the structure header, the file information, and the hash value. .

In one embodiment, the control unit sequentially compares the structure header, the file information, and the hash value with respect to each of the first and second source files, so that the first and second source files are the same file if they are all the same. Judging by

In an embodiment, the controller may generate parity bits for the hash data, including parity bits calculated for each of the file information and the hash value.

According to the disclosed technology of the present application, since it is possible to determine whether the files are different before comparing the hash values for the files, there is no need to compare the entire hash values for the different files, so that the files can be compared more quickly.

In addition, according to the disclosed technology of the present application, it is possible to confirm whether the file information and the hash data structure are correctly configured using parity information including parity for file information and parity for hash values.

1 is a reference diagram for explaining an embodiment of a hash data structure according to the disclosed technology.
2 is a reference diagram for explaining another embodiment of a hash data structure according to the disclosed technology.
3 is a reference diagram for explaining another embodiment of a hash data structure according to the disclosed technology.
4 is a schematic diagram illustrating an embodiment of a hash comparison system according to the disclosed technology.
FIG. 5 is a flowchart illustrating an embodiment of a hash data generation method that may be performed in the hash comparison system of FIG. 4.
FIG. 6 is a flowchart illustrating another embodiment of a hash data generation method that may be performed in the hash comparison system of FIG. 4.
7 is a flowchart illustrating an embodiment of a hash data comparison method that may be performed in the hash comparison system of FIG. 4.
8 is a flowchart illustrating another embodiment of a hash data comparison method that may be performed in the hash comparison system of FIG. 4.
9 is a block diagram illustrating another embodiment of a hash comparison system according to the disclosed technology.

The description of the disclosed technique is merely an example for structural or functional explanation and the scope of the disclosed technology should not be construed as being limited by the embodiments described in the text. That is, the embodiments may be variously modified and may have various forms, and thus the scope of the disclosed technology should be understood to include equivalents capable of realizing the technical idea.

Meanwhile, the meaning of the terms described in the present application should be understood as follows.

The terms "first "," second ", and the like are intended to distinguish one element from another, and the scope of the right should not be limited by these terms. For example, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.

It is to be understood that when an element is referred to as being "connected" to another element, it may be directly connected to the other element, but there may be other elements in between. On the other hand, when an element is referred to as being "directly connected" to another element, it should be understood that there are no other elements in between. On the other hand, other expressions describing the relationship between the components, such as "between" and "immediately between" or "neighboring to" and "directly neighboring to", should be interpreted as well.

It should be understood that the singular " include "or" have "are to be construed as including a stated feature, number, step, operation, component, It is to be understood that the combination is intended to specify that it does not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, or combinations thereof.

In each step, the identification code (e.g., a, b, c, etc.) is used for convenience of explanation, the identification code does not describe the order of each step, Unless otherwise stated, it may occur differently from the stated order. That is, each step may occur in the same order as described, may be performed substantially concurrently, or may be performed in reverse order.

All terms used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. Commonly used predefined terms should be interpreted to be consistent with the meanings in the context of the related art and can not be interpreted as having ideal or overly formal meaning unless explicitly defined in the present application.

In the following description, the original file means a file that is a target for applying a hash data structure. The disclosed technique provides a hash data structure with independent values for each source file, as is the general nature of hash values.

1 is a reference diagram for explaining an embodiment of a hash data structure according to the disclosed technology.

Referring to FIG. 1, the hash data structure 100 is composed of file information 110 and a hash value 120. In more detail, the hash data structure 100 may be configured to include bits corresponding to hash values in succession after the data bits for the file information 110 for the original file.

The file information 110 may include a size value 111 of the original file, some data including the first data of the original file (hereinafter, the first partial data) 112, and some data including the last data of the original file (hereinafter, Second partial data) 113. According to an exemplary embodiment, the file information 110 may be configured with at least one of the three types of data 111 to 113 described above.

The file information 110 may be configured to have different lengths in one or a plurality of systems according to an embodiment to be described later. That is, it is not necessarily composed of specific data bits, but may be composed of predetermined data bits according to the settings or needs of the system.

The size value 111 of the original file is data representing the size of the original file.

The first partial data 112 is a part of the original file corresponding to the predetermined length from the first bit of the original file, and the second partial data 113 is a part of the original file corresponding to the predetermined length from the last bit of the original file. to be. Here, the length of the first and second partial data 112, 113 may be determined differently according to the corresponding file comparison system, so the disclosed technique is not limited to this length.

The hash value 120 is data obtained by applying a hash algorithm to the original file. In one embodiment, hash value 120 may be determined with a particular bit. That is, the file information 110 may include an element included therein and the size of the corresponding element, while the hash value 120 may be limited to a specific size (data bit) such as a standardized size. For example, it may be 160 bits for the SHA-0 or SHA-1 algorithm, 256/224 bits for the SHA-256 / 224 algorithm, and 512/384 bits for the SHA-512 / 384 algorithm. In other words, the hash value 110 may be composed of data bits of a specified length even if applied in one or a plurality of systems according to an embodiment. In other words, the hash value is preferably determined according to the standards and can therefore be limited to the size of the specified data bit.

The file information 110 should be compared before the HASH value 120 when comparing files. For example, the file A may be identified by comparing the files A to C using the file information for the file A. For example, the file A may be searched among the files A to C. In this case, since the corresponding file can be found using only the file information 110, it is not necessary to compare hash values with each other, so that a desired file can be found with faster and less resources.

2 is a reference diagram for explaining another embodiment of a hash data structure according to the disclosed technology. The hash data structure shown in FIG. 2 further includes a structure header 130 in the embodiment of FIG.

The structure header 130 includes information about the structure of the file information 110 and the hash value 120. For example, the structure header 130 may include information about the number of bits of the entire file information 110 and the number of bits of the hash value 120.

In one embodiment, the structure header 130 may include information about the hash function that yielded the hash value 120. For example, it may include information about the hash used to calculate the hash value 120, such as SHA-0, SHA-1, and the like.

In one embodiment, the file information 110 may include only at least one of the three pieces of data 111 to 113 shown, and the structure header 130 may provide information about the data included in the file information 110. Can be.

For example, the file size information, the first and second partial data are identified as A, B, and C, respectively, the file size information has a fixed size of 2 bytes, and the structure header 130 is composed of "6AB". lets do it. In this case, "6" of the structure header 130 is the value representing the total number of bytes of the file information 110, and AB is the file information 110 as the file size information 111 and the first partial data 112. Means that it is configured.

2 may apply the disclosed hash data structure 100 even when file information 110 of different lengths is used in one system. That is, the structure header 130 may be used to identify bits for each component of the hash data structure 100, respectively.

3 is a reference diagram for explaining another embodiment of a hash data structure according to the disclosed technology. The hash data structure shown in FIG. 3 further includes parity information 140 in the embodiment of FIG. 1.

Parity information 140 includes parity values for hash data structure 100.

In one embodiment, parity information 140 may be comprised of (i) parity bits for file information 110 and (ii) parity bits for hash value 120. This is because the disclosed technique can complete the comparison using only the file information 110 in comparing the files, and for this purpose, to distinguish the parity values.

The embodiment of FIG. 3 may perform error checking more efficiently and compare files when file transfer or the like occurs.

4 is a schematic diagram illustrating an embodiment of a hash comparison system according to the disclosed technology.

The hash comparison system 200 includes a file information generator 210, a hash generator 220, a hash file manager 230, and a controller 250. In one embodiment, the hash comparison system 200 may further include an original file manager 240.

The file information generator 210 may check the property of the original file and generate file information about the original file. Here, the attributes of the original file may include the size, name, format, a portion of data bits (eg, a predetermined length from the first data bit or the last data bit) of the original file.

According to an embodiment, the file information generator 210 may generate the first and second partial data described above by reading a predetermined length of the first and last bits of the data bits of the original file. Here, the preset length may correspond to the sizes of the first and second partial data of the hash data structure.

The hash generator 220 may generate a hash value by applying a hash function to the original file. The hash generator 220 may use a hash function used in an individual system, or may use a hash function according to a standard, for example, a hash function according to a secure hash algorithm (SHA).

In one embodiment, the hash generator 220 may include a plurality of hash functions to generate a hash value for the original file by using a specific hash function at the request of the controller 250.

In one embodiment, the hash generator 220 may generate a hash value targeting only a part of the original file. For example, when the size of the original file is greater than or equal to a predetermined value, the hash generator 220 may generate a hash value for a part of the original file corresponding to the preset size. For another example, the hash generator 220 may generate a hash value for only a portion of the original file that does not correspond to the first and second partial data.

The hash file manager 230 may manage the original file and a hash file (structure) corresponding thereto. For example, the hash file manager 230 may store a hash file and maintain information (eg, link information) about an original file matching the hash file.

The original file manager 240 may store the original file and maintain a history of each original file. For example, as a result of hash comparison of A file, if the same file is changed, the A file and its hash history can be stored.

The controller 250 may control the overall operation of the hash comparison system 200 to generate a hash data structure or to compare the original files.

In one embodiment, the controller 250 may generate a hash data structure (file) for the original file. In more detail, the controller 250 provides the specific original file to the file information generator 210 and the hash generator 220, and generates a hash data structure using the file information and the hash value provided in response thereto. can do. An embodiment of generating such a hash data structure will be described in more detail with reference to FIGS. 5 to 6 below.

In one embodiment, the controller 250 may compare the two original files with each other using a hash data structure. The hash data structure according to the disclosed technique is divided into file information and hash values, and the original file is compared with each other using this structural feature. In more detail, the controller 250 analyzes the hash data structures of the original files to be compared, and first checks whether the original files are the same files using the file information in the hash data structure. If the same file is confirmed, the controller 250 checks whether the file has the same content by using the hash value among the hash data structures. The disclosed technique first performs a step of checking whether the files are the same file using the file information, and compares the hash values only when it is confirmed that the files are the same.

In one embodiment, when comparing the file information, the controller 250 may compare the data bits constituting the file information for each bit. In another embodiment, the controller 250 may identify each element constituting the file information, and then compare the file information by comparing the identified elements with each other. That is, for each file information, at least one of the size, name, format, first partial data, and second partial data of the corresponding original file included in the file information may be identified, and each identified element may be compared with each other. have.

In one embodiment, the controller 250 may provide the generated hash file and the original file information associated with the hash file manager 230 to manage the hash file. The controller 250 provides the generated hash file to the hash file manager 230 and stores the hash file. The controller 250 receives a hash file corresponding to a specific source file from the hash file manager 230 when another operation request such as hash comparison is received. Certain operations can be performed.

In an embodiment, the controller 250 may control the original file manager 240 to generate a history of the original file. For example, when a patch or the like occurs for the same original file, a patch history may be required. In such a case, when the control unit 250 compares the original files, (i) confirms that they are the same original files using the file information, and (ii) determines that there is a change in the contents using the hash value, The source file manager 240 may provide information on the source file and the hash data structure to generate a history.

In one embodiment, the controller 250 may generate a structure header for the hash data structure. In more detail, when the file information and the hash value are provided from the file information generation unit 210 and the hash generation unit 220, the control unit 250 can identify the file information and the hash value. You can create structure headers. For example, the controller 250 may generate a heading header including information on what elements are included in the file information 110, the data length of each element, the length of a hash value, and the like. In this embodiment, when comparing the hash data structure, the controller 250 first interprets the structure header to distinguish the file information from the hash value, and then confirms whether the two original files to be compared are the same file based on the file information. If the file is identified as being identical, the hash value can be compared to see if the contents have changed.

In one embodiment, the controller 250 may generate and add parity information to the hash data structure. In more detail, the controller 250 may generate a parit bit for file information and a parit bit for a hash value, and generate parity information including two parity bits. Such an embodiment may be applied when a hash data structure is transmitted in different systems, and parity operations are faster when comparing hash data structures by calculating parity bits for file information and hash values of the hash data structure. Can be performed.

FIG. 5 is a flowchart illustrating an embodiment of a hash data generation method that may be performed in the hash comparison system of FIG. 4.

Referring to FIG. 5, the file information generation unit 210 may check a property of an original file under the control of the control unit 250 (step S510). Here, the attribute is data collected for generating file information, and may be a file size, a file name, a file format, first or second partial data, and the like as described above.

The file information generation unit 210 may generate file information based on the identified properties of the original file (step S520). File information is used when comparing hash data to make sure that the two original files being compared are the same file. As described above, the file information may include at least one of a file size, first partial data, and second partial data. It can also include a file name or file type. The file information generator 210 provides the generated file information to the controller 250.

The hash generator 220 may generate a hash value corresponding to the original file under the control of the controller 250 (step S530). In one embodiment, the hash generator 220 may include various hash algorithms, and may generate a hash value for the original file using the hash algorithm requested by the controller 250. In one embodiment, the hash generator 220 may generate a hash value using only a part of the original file under the control of the controller 250. The hash generator 220 provides the generated hash value to the controller 250.

The controller 250 may generate hash data using the file information and the hash value (step S540). The controller 250 may generate hash data by concatenating the data bits corresponding to the hash value consecutively with the data bits corresponding to the file information. In such an embodiment, the controller 250 may know in advance which bits correspond to file information from the first bit. Therefore, when the controller 250 controls the file information generator 210 or the hash generator 220 to generate the file information and the hash value, the controller 250 may request generation including the information on the size of the corresponding data. .

FIG. 6 is a flowchart illustrating another embodiment of a hash data generation method that may be performed in the hash comparison system of FIG. 4. The embodiment of FIG. 6 relates to an embodiment of generating hash data using the above-described structure header. Since the embodiment of FIG. 6 is a step added to the embodiment of FIG. 5, the steps that are the same as or correspond to the embodiment of FIG. 5 will be briefly described.

Referring to FIG. 6, the controller 250 may determine in advance a component to be included in file information (step S610). That is, the controller 250 may predetermine the type of components to be included in the file information, the size of each component, and the like to maintain information on the configuration of the file information. Thereafter, the controller 250 may request the file information generator 210 to generate file information including information on the determined component.

The file information generator 210 may generate file information under the control of the controller 250. That is, the file information generation unit 210 may check the property of the original file (step S610), generate file information using the checked property (step S630), and provide the same to the controller 250.

The hash generator 220 may generate a hash value of the original file under the control of the controller 250 (step S640), and provide the hash value to the controller 250.

The controller 250 may generate a structure header for the file information and the hash value (step S650). As described above, the structure header includes information on the structure of hash data. The use of the structure header is because the disclosed invention distinguishes file information and hash values in hash data and performs mutual comparison. In an embodiment, the controller 250 may generate a structure header before the file information and the hash value are generated. That is, when requesting the generation of the file information and the hash value, when requesting the configuration of the file information and the hash value (for example, the components of the file information and the size of the components, the size of the hash value, etc.), the file information and the hash This is because structure headers can be created without receiving a value. In another embodiment, the controller 250 may receive the file information and the hash value, respectively, and generate a structure header thereof. That is, when the file information generator 210 and the hash generator 220 generate the file information and the hash value by themselves, the file information generator 210 and the hash generator 220 may generate the structure header by receiving them.

When the structure header is generated, the controller 250 may generate hash data based on the structure header, the file information, and the hash value (step S660).

7 is a flowchart illustrating an embodiment of a hash data comparison method that may be performed in the hash comparison system of FIG. 4. The hash data comparison method disclosed in FIG. 7 is an embodiment corresponding to the hash data generation method disclosed in FIG. 5.

Referring to FIG. 7, the controller 250 may select hash data associated with each of two original files to be compared (step S710). In an exemplary embodiment including the hash file manager 230, the controller 250 may request and acquire hash data of two original files to be compared by asking the hash file manager 230.

The controller 250 may check the configuration of the identified two hash data (step S720). That is, the controller 250 may identify which part of the file information and the hash value are each in the hash data.

The controller 250 may first check whether the two original files are the same file by comparing the file information included in the two hash data with each other (step S730). For example, if the file information includes a file name, a file length, etc., the file information can be used to check whether two original files are the same file and then the file contents. That is, the disclosed technology may check whether the two files to be compared are the same object first, and then, if it is determined to be the same object, the comparison may be completed by checking the identity of the contents of each object whether they are the same.

If the file information is the same (step S740, yes), the controller 250 may compare the hash values associated with the two original files with each other (step S750).

If the hash values are also the same (step S760), the two original files may be determined to be the same file (step S770).

If the file information is different from each other (step S740, NO) or if the hash values are different from each other (step S760, NO), the two original files can be determined to be different files.

Among the above-described steps, when comparing the file information or hash values with each other, the controller 250 may perform a comparison by contrasting data bits of corresponding comparison objects. Therefore, when it is determined that the files are different from each other only by the file information, the number of data bits to be compared is significantly reduced. Therefore, in the case where a comparison must be performed in a 1: N relationship, such as an operation of finding the same file as a specific source file among several files, the disclosed technique can perform the comparison very efficiently.

8 is a flowchart illustrating another embodiment of a hash data comparison method that may be performed in the hash comparison system of FIG. 4. The hash data comparison method disclosed in FIG. 8 is an embodiment corresponding to the hash data generation method disclosed in FIG. 8, and the hash data disclosed in FIG. 8 further includes a header structure. Therefore, the steps that are the same as or corresponding to the embodiment disclosed in FIG. 7 in the present embodiment will be briefly described.

Referring to FIG. 8, the controller 250 may select hash data associated with each of the two original files to be compared (step S810).

The controller 250 may check and interpret the structure header with respect to the identified two hash data (step S820). As described above, since the structure header includes the content, the length of the file information included in the hash data, the length of the hash value, and the like, the structure header may be interpreted to distinguish each component of the hash data.

The control unit 250 may compare the header structure of the identified two hash data (step S830, YES), and may distinguish the hash value and the file information included in each hash data when the header structure is the same (step S840). .

The controller 250 may first compare whether the two original files are the same file by comparing the file information included in the two hash data with each other (step S850).

If the file information is the same (step S860, yes), the controller 250 may compare the hash values associated with the two original files with each other (step S870).

If the hash values are also the same (step S880, yes), the two original files may be determined to be the same file (step S890).

If the header structure is different (step S830, NO), the file information is different from each other (step S860, NO), or the hash values are different from each other (step S880, NO), the two original files may be determined as different files. .

The embodiment disclosed in FIG. 8 may distinguish file information and hash values configuring hash data using a header structure. This embodiment can be more efficient in a system that applies file information and hash values differently. In addition, since the sameness of the file may be determined as the header structure itself in step S830, the sameness of the file may be determined more quickly and accurately, so that the comparison may be efficiently performed.

9 is a block diagram illustrating another embodiment of a hash comparison system according to the disclosed technology. The hash comparison system disclosed in FIG. 9 is an embodiment that may be applied when comparing files in a 1: N relationship, and primarily generates only a primary comparison group using only files having the same file information by comparing only file information. This is a system that can compare hash values only for files belonging to the difference comparison group.

Referring to FIG. 9, the hash comparison system 200 may include a file information generator 210, a hash generator 220, a controller 250, and a hash comparer 260. In one embodiment, the hash comparison system 200 may further include at least one of the hash file manager 230 or the original file manager 240. In describing the exemplary embodiment of FIG. 9, the description of the same or corresponding components as the exemplary embodiment of FIG. 4 will be omitted or briefly described.

The controller 250 may select the same file as the original file A with respect to the target file group B. To this end, the controller 250 may select hash data associated with all files included in the target file group B, and select hash data of the original file A to perform mutual comparison. In this comparison, the controller 250 may classify each hash data into a file information and a hash value, and primarily compare only the file information. That is, the controller 250 may compare the file information of the source file A and the file information of the target files included in the target file group B to classify target files having the same file information and generate a primary comparison group. Thereafter, the controller 250 may check the same file by comparing the hash values of the target files included in the primary comparison group with the hash values of the original file A using the hash comparison unit 260.

The hash comparison unit 260 may compare only hash values with each other under the control of the controller 250. In the disclosed example, the hash comparison unit 260 may be separated and performed to compare only hash values, so that the comparison may be performed more efficiently when a search is required in a 1: N relationship.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit and scope of the present invention as set forth in the following claims It can be understood that

Claims (20)

delete delete delete delete In a method for generating respective hash data for comparison for each source file,
(a) checking the attributes of the original file and generating file information consisting of predetermined data bits based on the identified attributes;
(b) calculating a hash value by applying a hash algorithm to at least a portion of the original file; And
(c) generating hash data by continuously combining the hash value with the file information to include parity information.
The method of claim 5, wherein step (a)
Identifying at least one of a size, a name, a format of the original file, first partial data including original data of the original file, and second partial data including final data of the original file;
Generating the file information including at least one of a size, a name, a format of the original file, first partial data including first data of the original file, and second partial data including last data of the original file; Hash data generation method comprising a.
Claim 7 has been abandoned due to the setting registration fee. The method of claim 5, wherein step (c)
(d) generating, as the parity information, a hash parity bit for the hash data.
Claim 8 was abandoned when the registration fee was paid. The method of claim 7, wherein step (d)
Generating a first parity bit for the file information;
Generating a second parity bit for the hash value; And
And generating the hash parity bit by successively combining the first and second parity bits.
In a method for generating respective hash data for comparison for each source file,
(a) generating a structure header including structure information for each of the file information and the hash value included in the structure of the hash data;
(b) checking the attributes of the original file and generating file information consisting of predetermined data bits based on the identified attributes;
(c) calculating a hash value by applying a hash algorithm to at least a portion of the original file; And
(d) generating hash data by successively combining the hash values with the file information;
The file information may include at least one of a size, a name, a format of a corresponding original file, at least one of first partial data including first data of the corresponding file and second partial data including last data of the original file. .
A hash data comparison method for comparing two original files with each other using hash data including file information and a hash value,
(a) identifying two hash data associated with each of the two original files;
(b) comparing two file informations included in each of the two data with each other; And
(c) comparing the two hash values included in each of the two hash data if the two file informations are the same, and determining the two original files as the same file if the two file information are the same. ,
The file information includes a hash data comparison method including at least one of a size, a name, a format of a corresponding original file, first partial data including first data of the corresponding file, and second partial data including last data of the original file. .
delete Claim 12 is abandoned in setting registration fee. The method of claim 10, wherein step (b)
And comparing the data bits of the two file information with each bit.
Claim 13 was abandoned upon payment of a registration fee. The method of claim 10, wherein step (b)
For each of the two file informations, a first portion of data including the size, name and format of the original file included in the file information, first data including the first data of the file, and a second data including the last data of the original file. Identifying at least one of some data; And
Comparing at least one of the size, name, format, first partial data including the first data of the corresponding original file and second partial data including the last data of the corresponding original file, respectively; Hash data comparison method, characterized in that.
A hash data comparison method for comparing two source files with each other using hash data including file information, a hash value, and a structure header including structure information about each of the file information and the hash value,
(a) comparing the structure headers with respect to the two original files to determine whether they are hash data having the same structure;
(b) comparing file information associated with each of the two original files, if they have the same structure;
(c) comparing the hash values associated with the original files with each other if the file information is identical to each other, and determining the two original files as the same file if the file information is identical with each other;
The file information includes a hash data comparison method including at least one of a size, a name, a format of a corresponding original file, first partial data including first data of the corresponding file, and second partial data including last data of the original file. .
In the hash data comparison system for comparing the original files using the hash data including the file information and the hash value,
A file information generation unit which checks attributes of each of the original files and generates file information on each of the original files;
A hash generation unit configured to calculate a hash value by applying a hash function algorithm to at least a portion of each of the original files;
It includes a control unit for generating hash data for the original file including the file information and the hash value,
And the control unit compares the file information and the hash value with respect to each of the original files to determine identity.
Claim 16 has been abandoned due to the setting registration fee. 16. The system of claim 15, wherein the hash data comparison system is
And a hash file manager which stores the generated hash data and maintains information on the original file associated with the stored hash value.
delete Claim 18 has been abandoned due to the setting registration fee. The method of claim 15, wherein the control unit
And generating a structure header including the file information and identification information about the hash value, and generating the hash data including the structure header, the file information, and the hash value.
Claim 19 is abandoned in setting registration fee. The method of claim 18, wherein the control unit
And sequentially comparing the structure header, the file information, and the hash value with respect to each of the original files, and determining the original files as the same file if they are all identical.
Claim 20 has been abandoned due to the setting registration fee. The method of claim 15, wherein the control unit
And a parity bit for the hash data including parity bits calculated for each of the file information and the hash value.

Images