TW201319929A - Hash data structure for file comparison and hash comparison system and method using the same - Google Patents

Abstract

The present invention relates to a hash technology related to data files. A hash data comparison system according to an embodiment compares source files with each other using hash data including file information and a hash value. The hash data comparison system includes a file information generation unit, a hash generation unit, and a control unit. The file information generation unit checks an attribute of each source file and generates file information about the source file. The hash generation unit calculates a hash value by applying a hash function algorithm to at least part of the source file. The control unit generates hash data for the corresponding source file including the file information and the hash value. Accordingly, the present invention is advantageous in that there is no need to compare all hash values among different files, thus comparing more rapidly files.

Description

Hash data structure for file comparison and hash comparison system and method using same

In summary, the present invention relates to a hash technique for data archives, and more particularly to a hash data structure and a hash comparison system and method using the hash data structure, using the original archive The unique feature information of the (source file) is combined with the hash value to make file comparisons more quickly.

Comparisons between data segments, especially between archives, have been used in a variety of different jobs. For example, such file comparisons have basically been used in a variety of different ways in this way, such as checking for differences between files or for patch files in an Operating System (OS). ) is compared to an original file to perform a predetermined patch.

The traditional file comparison technique that has been adopted includes a method of comparing all files, a method of distributing version information to a file, checking a file according to the version information, a hash function for the file, and then comparing the files, and many more.

The method of comparing all files is not often used because the amount of data to be compared is large and the speed of comparison is slow. The disadvantage of assigning version information to files and comparing files is that if the contents of the file are changed, the file content may not conform to the version information, unless the file version information changes, so the file comparison cannot be performed correctly due to such errors. .

Therefore, in most cases, it is by applying a hash letter to the file. The hash value is calculated as a number to compare the calculated hash values to compare the contents of the file. However, this traditional comparison method using only hash values is problematic. The problem is that when the size of the file is extremely large, more computing resources are needed to generate hash values, and the corresponding operations are performed. Time also increases.

Accordingly, the present invention has been borne in mind with the foregoing problems with the prior art, and it is an object of the present invention to provide a hash data structure that enables easy comparison between files with a small amount of resources.

Another object of the present invention is to provide a hash data structure generating method and a hash data structure comparing method thereof, which can quickly compare files between files by using a hash data structure required for file comparison.

Still another object of the present invention is to provide a hash comparison system capable of efficiently performing comparison between files by utilizing a hash data structure required for file comparison.

According to a feature of the present invention, in order to achieve the above object, a hash data structure is provided, comprising: file information composed of predetermined data bits and related to an attribute of an original file, and comprising a predetermined data bit and Corresponding to a hash value of the original file, wherein the hash data structure includes a data bit corresponding to the hash value, located after the data bit corresponding to the file information.

In an embodiment, the file information may include a size value of the original file, and the first page containing the first data of the original file. At least one of the departmental information and the second partial material containing the last information of the original file.

In an embodiment, the hash data structure may further include a structure header, and the structure header includes structural information about respective file information and hash values included in the hash data structure.

In an embodiment, the hash data structure may additionally include parity information about the hash data structure, wherein the parity information includes a first parity bit for the file information and for the One of the column values is the second co-bit.

According to another feature of the present invention, in order to achieve the above object, a method for generating a hash data for generating each piece of hash data to be compared with an original file is provided, comprising: (a) checking one attribute of each original file and Generating file information consisting of predetermined data bits based on the attributes being inspected, (b) applying a hash algorithm to at least a portion of the original file to calculate a hash value, and (c) by sequentially The hash value is linked to the file information to generate hash data.

In one embodiment, (a) may include checking a size of the original file, a name, and a format, including the first partial data of the first data of the original file, and including the last data of the original file. At least one of the second partial material, and generating the size, the name, and the format of the original file, the first partial data including the first data of the original file, and the original file The file information of at least one of the second partial materials of the last data.

In an embodiment, the above hash data generating method may additionally Including (d) generating a hash co-located bit for the hash data.

In an embodiment, (d) may include generating a first co-located bit for the file information, generating a second co-located bit for the hash value, and sequentially connecting the first and second co-located bits by sequentially The bit is generated to produce the hash co-located bit.

According to still another feature of the present invention, in order to achieve the above object, a method for generating a hash data for generating each piece of hash data to be compared with an original file is provided, comprising: (a) generating a structure header, the structure label The header contains structural information about the file information and a hash value contained in a hashed data structure, (b) checks one attribute of each original file, and generates a predetermined data bit based on the checked attribute. The archive information, (c) generates a hash data by applying a hash algorithm to at least a portion of the original file to calculate a hash value, and (d) by sequentially linking the hash value to the file information.

According to still another feature of the present invention, in order to achieve the above object, a method for comparing hash data is provided for comparing two original files with each other by using hash data including file information and a hash value, the method comprising (a ) examining the two pieces of hash information associated with the two original files, (b) comparing the two pieces of file information contained in the two pieces of hashed information with each other, and (c) if the information of the two pieces of files is identical, Then, the two hash values included in the two pieces of hash data are compared with each other, and if the two hash values are identical, it is determined that the two original files are the same file.

In an embodiment, the file information may include a size corresponding to one of the original files, a name and a format, and the most At least one of the first partial data of the preceding data and the second partial data of the last data of the original file.

In an embodiment, (b) may include comparing individual data bits constituting the two pieces of file information with each other.

In an embodiment, (b) may include, for each of the two pieces of file information, each identifying a size, a name, and a format of one of the original files included in the corresponding file information, including the At least one of the first partial data of the first data of the original file and the second partial data of the last data of the original file, and the size, the name, the name of the original file that has been identified Comparing the two pieces of file information with each other, the format, the first partial data including the first data of the original file, and the second partial data including the last data of the original file .

According to still another feature of the present invention, in order to achieve the above object, a method for comparing hash data is provided for utilizing file information, a hash value, and one of structural information including the file information and the hash value. The hash data of the structure header compares the two original files with each other, and the method comprises (a) comparing the structure headers of the two original files with each other, and determining whether the plurality of original files have the same structure, (b) If it is determined that the plurality of pieces of hash data have the same structure, the plurality of pieces of file information respectively associated with the two original files are compared with each other, and (c) if the plurality of pieces of file information are identical, respectively, the two originals are associated The hash values of the files are compared with each other, and if the hash values are identical, it is determined that the two original files are the same file.

According to still another feature of the present invention, in order to achieve the above object, a hash data comparison system is provided for comparing original files with each other by using hash data including file information and a hash value, the system including a file information Generating units, configured to examine an attribute of each of the original files and to generate file information about the original file, a hash generating unit configured to apply a hash function algorithm to at least a portion of the original file A hash value is calculated, and a control unit is grouped to generate hash data corresponding to the original file, including file information and hash values.

In one embodiment, the hash data comparison system described above may further comprise a hash file management unit configured to store the hash data generated by the storage and to maintain information related to the original file of the associated stored hash value.

In an embodiment, the control unit may determine the similarity between the first and second original files by sequentially comparing the plurality of file information and the hash value of the first and second original files.

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

In an embodiment, the control unit may sequentially compare the structure header, the plurality of file information, and the hash value of the first and second original files, and then if the structure headers of the first and second original files, If the file information and the hash value are identical, it is determined that the first and second original files are the same file.

In an embodiment, the control unit may generate a parity bit for the hash data, including a parity bit calculated separately for the file information and the hash value.

The technology disclosed in the present invention is only for the purpose of illustrating a structure or a functional description, and the scope of the disclosed technology should not be construed as being limited to the embodiments described in the specification. In other words, the embodiments can be modified in various different forms and can have various forms, and the scope of the disclosed technology should be understood to include equivalents capable of achieving the technical spirit of the present invention.

Also, the meaning of the terms mentioned in this specification should be understood as follows.

Terms such as "first" and "second" are used to distinguish one component from another, and the scope of the invention should not be limited to such terms. For example, a first component can be referred to as a second component, and a second component can be similarly referred to as a first component.

Throughout the specification, it should be understood that an expression indicating that a first component "connects" to a second component can include wherein the first component is coupled to the second component by some other component interposed therebetween. Situation, and where the first component is "directly connected" to the second component. In contrast, it should be understood that a description of a first component "directly connected" to a second component means that no component is interposed between the first component and the second component. Also, other expressions describing the relationship between components, that is, "between" and "directly between" or "adjacent" and "directly adjacent", should be interpreted in a similar manner.

It is to be understood that the singular forms "a" In the present specification, it should be understood that terms such as "including" or "having" are used merely to indicate their characteristic features and numbers. The subject matter, steps, operations, components, components, or combinations thereof are not intended to exclude the possibility that one or more other features, numbers, steps, operations, components, components, or combinations thereof will be present or added.

The use of reference symbols (e.g., a, b, c, etc.) in the individual steps is for illustrative purposes only and does not represent an order of individual steps, and unless the context clearly dictates the specific order of the steps, Individual steps may be performed in an order different from that described in the specification. In other words, the steps may be performed in the same order as described in the specification, or substantially simultaneously, or in the reverse order.

Unless otherwise defined, all terms including technical or scientific terms used herein have the same meaning as commonly understood by those skilled in the art. Terms that are the same as defined in the general use of the dictionary should be interpreted as having the same meaning as the related art, and should not be interpreted as having an ideal or too formal meaning unless explicitly defined in the specification. .

In the following description, the term "original file" refers to an archive that will serve as a target for the application of a hashed data structure. The present invention proposes a hash data structure that similarly has independent values for the typical characteristics of hash values for each original file.

1 is a schematic diagram showing an embodiment of a hash data structure in accordance with the present invention.

Referring to FIG. 1, a hash data structure 100 includes file information 110 and a hash value 120. In more detail, the hash data structure 100 can be grouped to contain bits corresponding to the hash value, located in an original file archive. After the information bit of 110.

The file information 110 may include the file size value 111 of the original file, the local data 112 including the first data of the original file (hereinafter referred to as "the first partial data"), and the local data 113 including the last data of the original file (this article). Hereinafter referred to as "second partial data"). According to an embodiment, the archive information 110 may be composed of at least one of the three types of materials 111 to 113 described above.

The archive information 110 can be grouped into different lengths in one or more systems in accordance with the embodiments to be described below. In other words, the file information 110 does not have to be composed of specific data bits, but can be composed of data bits corresponding to a predetermined length depending on the settings of the system or as needed.

The original file size value 111 represents the size of the original file.

The first partial data 112 corresponds to a portion of the original file of a predetermined length from the first bit of the original file, and the second partial data 113 corresponds to a predetermined time from the last bit of the original file. The part of the original file of length. In this case, the lengths of the first and second partial data 112 and 113 may be determined differently depending on a corresponding file comparison system, and the invention is not limited to the lengths.

The hash value 120 is obtained by applying a hash algorithm to the original file. In an embodiment, the hash value 120 can be set to a particular bit. In other words, the archive information 110 is grouped such that the elements contained therein and the length of the elements can be changed, and the hash value 120 can be limited to a specific length (data bit), such as a standardization. length. For example, in the case of the SHA-0 or SHA-1 algorithm, the hash value 120 can have 160 bits, and in the case of the SHA-256/224 algorithm, the hash value can have 256. /224 bits, and in the case of the SHA-512/384 algorithm, the hash value can have 512/384 bits. In other words, even if the hash value 120 is applied to one or more systems depending on the embodiment, it can be constructed of a particular length of data bits. That is, since the preferred embodiment of the hash value is determined by the standard, it can be limited to a data bit of a particular length.

When comparing files, the file information 110 must be compared before the hash value 120. For example, when it wants to search for the file A among the files A to C, this example is explained as follows. The files A to C are compared with each other using the file information about the file A, so that the file A can be recognized. In this case, since only the file information 110 can be used to find the corresponding file, it is not necessary to compare the hash values with each other, so that a small amount of resources can be utilized to quickly find an expected file.

Figure 2 is a schematic diagram showing another embodiment of a hashed data structure in accordance with the present invention. In contrast to the embodiment of FIG. 1, the hash data structure shown in FIG. 2 further includes a structure header 130.

The structure header 130 contains information about the structure of the archive information 110 and a hash value 120. For example, the structure header 130 may contain information regarding the total number of bits of the archive information 110 and the total number of bits of the hash value 120.

In an embodiment, the structure header 130 may contain information about Calculate the information of the hash function of one of the hash values 120. For example, structure header 130 may contain information about a hash function used to calculate a corresponding hash value 120, such as SHA-0 or SHA-1.

In an embodiment, the archive information 110 may only include at least one of the three materials 111 to 113 displayed in the schema, and the structure header 130 may provide information about the materials included in the archive information 110.

For example, assume that the file size information and the first and second partial data are identified by A, B, and C, respectively, the file size information has a fixed size of two bytes, and the structure header 130 is composed of "6AB". In this case, "6" in the structure header 130 is a value indicating the total number of bytes of the file information 110, and "AB" indicates that the file information 110 is from the file size information 111 and the first partial data 112. Composition.

In the embodiment of FIG. 2, the disclosed hash data structure 100 can also be applied to situations where file information 110 having different lengths is used by a single system. In other words, the reason why the elements of the elements of the hash data structure 100 can be individually identified by the structure header 130.

Figure 3 is a schematic diagram showing still another embodiment of a hash data structure in accordance with the present invention. In contrast to the embodiment of FIG. 1, the hash data structure shown in FIG. 3 additionally includes parity information 140.

The parity information 140 includes one of the hash data structures 100.

In one embodiment, the parity information 140 can include (i) one of the parity bits for the archive information 110 and (ii) one of the parity bits for a hash value 120. The purpose is to identify individual parity values, as the invention When comparing files, the comparison can be done using only file information 110.

The embodiment of Figure 3 can perform error checking and compare files with each other more efficiently when file transfers or the like occur.

4 is a configuration diagram showing an embodiment of a hash comparison system in accordance with the present invention.

A hash comparison system 200 includes a file information generation unit 210, a hash generation unit 220, a hash file management unit 230, and a control unit 250. In an embodiment, the hash comparison system 200 can further include an original file management unit 240.

The file information generating unit 210 can check the attributes of the original file and generate file information about the original file. Here, the attributes of each original file may include the size, name, format, and local data bits of the original file (for example, data within a certain length from the first data bit or the last data bit), and many more.

In an embodiment, the file information generating unit 210 can read the data bit of the original file by presetting the length of the first and last bits from the original file data bit to generate the first And the second partial data. In this case, the preset length may correspond to the length of the first and second partial data of a corresponding hash data structure.

The hash generation unit 220 can generate a hash value by applying a hash function to each original file. The hash generation unit 220 may employ a hash function used by an individual system or according to a standard, for example, a hash function according to a Secure Hash Algorithm (SHA).

In one embodiment, the hash generation unit 220 has a complex hash function and is capable of generating a hash value for the original file using a particular hash function in response to a request from the control unit 250.

In an embodiment, the hash generation unit 220 may generate a hash value only for a portion of the original file. For example, when the size of the original file is equal to or greater than a predetermined value, the hash generation unit 220 may generate a hash value for a portion of the original file corresponding to a predetermined size. In another embodiment, the hash generation unit 220 may also generate a hash value only for the remainder of the original file other than the first and second partial data.

The hash file management unit 230 can manage the original file and the hash file (structure) corresponding thereto. For example, the hash file management unit 230 stores the hash file and maintains information about the original file that matches the corresponding hash file (eg, link information or the like).

The original file management unit 240 can store the original file and keep a history of each original file. For example, if it is determined that file A is changed by performing a hash comparison for file A, the corresponding file A and its history can be stored in the original file management unit 240.

The control unit 250 can generate a hash data structure or compare the original files with each other by controlling the overall operation of the hash comparison system 200.

In an embodiment, control unit 250 may generate a hash data structure (archive) for each original file. In more detail, the control unit 250 can provide a specific original file to both the archive information generating unit 210 and the hash generating unit 220, and utilize the original file that has been targeted for the particular file. The received file information and a hash value result in a hashed data structure. An embodiment relating to the generation of a hash data structure will be described in detail with reference to FIGS. 5 and 6.

In an embodiment, control unit 250 may utilize the hash data structure to compare the two original files to each other. The hash data structure in accordance with the present invention is divided into archive information and a hash value, and the original files are compared with each other using this structural property. In more detail, the control unit 250 analyzes the hash data structure of the original files to be compared with each other, and determines whether the original files are the same file by using the file information of the hash data structure. If it is determined that the original files are the same file, the control unit 250 checks whether the original files have the same content by using the hash value of the hash data structure. The present invention first uses the file information to perform the step of determining whether the file is the same file, and then performs the step of comparing the hash values only when the file is determined to be the same file, thereby performing the comparison action more quickly.

In an embodiment, when the plurality of pieces of file information are compared with each other, the control unit 250 may compare the individual data bits constituting the plurality of pieces of file information with each other. In another embodiment, the control unit 250 may identify individual elements constituting the plurality of pieces of archive information, and may compare the plurality of pieces of file information by comparing the identified elements with each other. In other words, for each piece of file information, it identifies at least one of the size, name, format, first partial data, and second partial data of the original file included in the corresponding file information, and is identified. Elements can be compared to other segments of the file information.

In an embodiment, the control unit 250 can provide the generated hash file and the original file information associated therewith to the hash file management unit 230 so that the hash file can be managed. The control unit 250 provides the generated hash file to the hash file management unit 230 so that the hash file is stored in the hash file management unit 230. Upon receiving a request for another action, such as a hash comparison, control unit 250 may retrieve a hash file corresponding to one of the particular original files from hash file management unit 230 such that a predetermined operation is performed.

In an embodiment, control unit 250 may control original archive management unit 240 such that a history of the original archive is generated. For example, when a patch or similar item appears for the same original file, a history of that patch may be required. In the case of this example, control unit 250(i) uses the archive information and determines that the original file is the same original file by comparing the original file, and (ii) if it uses a hash value to determine the file content If there is a difference between them, the related information of the original file and the related information of the hashed data structure are supplied to the original file management unit 240, so that the history can be generated.

In an embodiment, control unit 250 may generate a structure header for each hash data structure. In more detail, when the file information generating unit 210 and the hash generating unit 220 respectively provide the file information and a hash value, the control unit 250 may generate a structure header for the hash data structure, so that the file information and the hash are made. The value is recognized. For example, the control unit 250 can generate a structure header that includes the length of the data indicating the elements included in the archive information 110, the individual elements, and The length of the hash value, and other information. In this embodiment, when the hash data structures are compared with each other, the control unit 250 first analyzes the structure headers to identify the file information and the hash value, and then determines whether the two original files to be compared are the same according to the file information. Archives. If it is determined that the original files are the same file, the control unit 250 can determine whether the content of the file has changed by comparing the hash values of each other.

In an embodiment, control unit 250 can generate co-located information and add it to each hash data structure. In more detail, the control unit 250 can generate a parity bit for the file information and generate a parity bit for a hash value, and can generate the parity information including the two parity bits. This embodiment is applicable to situations where transmission of a hashed data structure or similar action occurs between different systems. It calculates the parity bits for the file information and the hash value of the hash data structure, respectively, so that when the hash data structures are compared with each other, a parity operation can be performed more quickly.

Figure 5 is a flow chart showing one embodiment of a hash data generation method that can be performed by the hash comparison system of Figure 4.

Referring to FIG. 5, at step S510, the archive information generating unit 210 may check the attributes of each original file under the control of the control unit 250. In this case, the attribute is collected to generate a piece of information for the archive information, and may be a file size, a file name, a file format, first or second partial material, or the like, as previously described.

At step S520, the file information generating unit 210 may generate the file information according to the attributes of the original file checked. The file information is used to determine the two original files to be compared after the plurality of hash data are compared with each other. Whether the case is the same file. As described above, the file information may include at least one of a file size, a first partial profile, and a second partial profile. Alternatively, the file information may contain a file name or a file format. The file information generating unit 210 supplies the generated file information to the control unit 250.

In step S530, the hash generation unit 220 may generate a hash value corresponding to one of each original file under the control of the control unit 250. In an embodiment, the hash generation unit 220 can have a variety of different hash algorithms and can generate a hash value for the original file using the hash algorithm requested by the control unit 250. In one embodiment, the hash generation unit 220 can generate a hash value using only a portion of the original file under the control of the control unit 250. The hash generation unit 220 supplies the generated hash value to the control unit 250.

In step S540, the control unit 250 can generate hash data using the archive information and the hash value. The control unit 250 may generate hash data by sequentially linking the data bit corresponding to the hash value to the data bit corresponding to the file information. In this embodiment, the control unit 250 can know in advance that the range of file information coverage is from the first bit to which bit. Therefore, when the control unit 250 performs control such that the archive information generating unit 210 and the hash generating unit 220 generate the archive information and the hash value, it can issue the request for the generation of the archive information and the hash value, including the length of the relevant data. Information.

Figure 6 is a flow chart showing another embodiment of a method of generating hash data that can be performed by the hash comparison system of Figure 4. The embodiment of Figure 6 relates to a method in which hash data is generated using the above-described structure header. Example. The embodiment of Fig. 6 is obtained by adding a specific step to the embodiment of Fig. 5, so that the same or similar steps as those of the embodiment of Fig. 5 will be briefly passed.

Referring to FIG. 6, at step S610, the control unit 250 may determine in advance elements included in the archive information. In other words, the control unit 250 can determine in advance the type of the element included in the archive information, the length of the element, and the like, and retain information on the configuration of the file information. Thereafter, the control unit 250 may request the file information generating unit 210 to generate file information containing information about the determined elements.

The file information generating unit 210 can generate file information under the control of the control unit 250. In other words, the file information generating unit 210 may check the attributes of each of the original files in step S620, generate the file information using the checked attributes in step S630, and provide the file information to the control unit 250.

In step S640, the hash generation unit 220 may generate a hash value for the original file under the control of the control unit 250, and provide the hash value to the control unit 250.

In step S650, the control unit 250 may generate a structure header for the file information and the hash value. As mentioned earlier, the structure header can contain information about the structure of the hashed data. The reason for using the structure header is that the present invention separates the file information from a hash value and the hash data, and then compares the file information with the hash value. In one embodiment, control unit 250 may generate a structure header prior to file information and hash value generation. In other words, this action is possible because when requesting file information and When the hash value is generated, the configuration of the file information and the hash value is also requested (for example, the element of the file information, the length of the element, the length of a hash value, etc.), even if the structure header has not been received yet. File information and hash values can also be generated. In another embodiment, control unit 250 may individually receive the archive information and the hash value and then generate a structural header for it. In other words, when the file information generating unit 210 and the hash generating unit 220 respectively generate the file information and a hash value, the control unit 250 can separately receive the file information and the hash value and can generate a structure header.

Once the structure header has been generated, at step S660, control unit 250 can generate hash data based on the structure header, archive information, and hash value.

Figure 7 is a flow chart showing one embodiment of a method of comparing hash data that can be performed by the hash comparison system of Figure 4. The hash data comparison method shown in Fig. 7 is an embodiment corresponding to the hash data generating method shown in Fig. 5.

Referring to FIG. 7, in step S710, the control unit 250 may select a plurality of pieces of hash data respectively associated with the original files to be compared. In the case of an embodiment including the hash file management unit 230, the control unit 250 may request the hash data from the hash file management unit 230 for the two original files to be compared, and obtain the hash from the hash file management unit 230. List of materials.

At step S720, the control unit 250 can verify the configuration of the selected hash data of the two segments. In other words, the control unit 250 can separately verify which portion of each piece of hash data corresponds to the file information and the hash value.

In step S730, the control unit 250 can compare the plurality of pieces of file information included in the two pieces of hash data with each other, and then determine whether the two original files are the same file. For example, when the file information includes a file name, a file length, and the like, the file information can be used to determine whether the two original files are the same file, and then the file content can be determined. The invention is used for determining whether the two files to be compared are the same object and then determining the identity of the objects, and if the files are determined to be the same object, determining the similarity of the contents of the objects according to whether the contents of the two objects are identical. To complete the comparison.

In step S740, if the two pieces of file information are identical (ie, "yes"), then in step S750, the control unit 250 may compare the hash values of the associated two original files with each other.

In step S760, if the hash values are also identical (i.e., "yes"), then in step S770, it can be determined that the two original files are the same file.

In step S740, if the plurality of pieces of file information are different from each other (ie, the case of "No"), or if the hash values are different from each other (ie, the case of "No"), then in step S771, It is determined that the two original files are different files.

In the above steps, when the plurality of pieces of file information or hash values are compared with each other, the control unit 250 can perform comparison by checking the data bits of the corresponding objects to be compared. Therefore, if it uses only the archive information to determine that the original file is a different file, the number of data bits is significantly reduced. Therefore, the present invention can efficiently compare when it is necessary to compare a 1:N relationship, such as from a complex file. The act of finding the same file as a particular original file.

Figure 8 is a flow chart showing another embodiment of a method of comparing hash data that can be performed by the hash comparison system of Figure 4. The hash data comparison method shown in FIG. 8 is an embodiment corresponding to the hash data generating method shown in FIG. 6, wherein the hash data shown in FIG. 8 further includes a structure header. Therefore, in the present embodiment, the same or similar steps as those of the embodiment shown in Fig. 7 will be briefly taken.

Referring to FIG. 8, in step S810, the control unit 250 may select a plurality of pieces of hash data respectively associated with the original files to be compared.

In step S820, the control unit 250 may check the structure headers of the two selected pieces of hash data, and then analyze the structure headers. As described above, since each structure header includes the content and length of the file information included in the corresponding hash data, the length of a hash value, and the like, the control unit 250 can analyze the structure label. The header identifies individual elements of the hashed material.

The control unit 250 compares the structure headers of the two pieces of hash data with each other, and if the structure headers are identical (in the case of "Yes" at step S830), it may be identified in step S840 that the segments are included in each segment. Multiple file information and hash values in the hashed data.

In step S850, the control unit 250 can compare the plurality of pieces of file information included in the two pieces of hash data with each other, and then determine whether the two original files are the same file.

In step S860, if the plurality of file information is identical (ie, "yes"), then in step S870, the control unit 250 may compare the hash values of the respective associated original files with each other.

In step S880, if the hash values are identical (i.e., "yes"), then in step S890, it may be determined that the two original files are the same file.

If in step S830, the structural headers are different from each other (ie, the case of "No"), if in step S860, the plurality of file profiles are different from each other (ie, "No"), or if in step S880, If the hash values are different from each other (i.e., the case of "No"), then in step S891, it is possible to determine that the two original files are different files.

The embodiment shown in Figure 8 can utilize the structure header to identify the archive information and hash values that make up the hash material. This embodiment can be more efficient in systems where multiple pieces of file information and hash values are applied in different ways. In addition, in step S830, since the identity of the file can be determined by using the structure header itself, the determination of the identity of the file can be made more rapid and accurate, so that the comparison can be performed efficiently.

Figure 9 is a configuration diagram showing another embodiment of a hash comparison system in accordance with the present invention. The hash comparison system shown in Fig. 9 is an embodiment that can be applied to the case where files are compared with each other in a 1:N relationship. The system is configured to first compare only a plurality of pieces of file information with each other, generate a first comparison group using files having the same file information, and only hash values of files belonging to the first comparison group to each other. Comparison.

Referring to FIG. 9, the hash comparison system 200 includes a file information generating unit 210, a hash generating unit 220, a control unit 250, and a hash comparing unit 260. In an embodiment, the hash comparison system 200 can further include a file management unit 230 and an original file management unit 240. At least one of them. Among the description of the embodiment shown in Fig. 9, the description of the components identical or similar to those of the embodiment of Fig. 4 will be omitted or briefly taken.

The control unit 250 can select a file identical to the original file A from the target file group B. In this regard, the control unit 250 can select to associate the plurality of pieces of hash data of all the files included in the target file group B, select the hash data of the original file A, and compare the selected plurality of pieces of hash data with each other. In the comparison, the control unit 250 may divide each piece of hash data into file information and a hash value, and first compare only the plurality of pieces of file information with each other. In other words, the control unit 250 can compare the file information of the original file A with the plurality of file information of the target file included in the target file group B, classify the target files having the same file information, and then generate a first comparison. Group. Thereafter, the control unit 250 may use the hash comparison unit 260 to compare the hash value of the target file included in the first comparison group with the hash value of the original file A, and then determine the same file.

The hash comparison unit 260 can only compare the hash values to each other under the control of the control unit 250. In the disclosed embodiment, the hash comparison unit 260 is configured to compare only the hash values, thereby performing the comparison more efficiently in the case where a search is required among a 1:N relationship.

According to the technique disclosed in the present invention, whether files are different from each other can be determined before the hash values of the files are compared with each other, so that it is not necessary to compare all hash values of different files, thereby obtaining a more rapid The advantage of comparing files to each other.

In addition, the technique disclosed in the present invention has the advantage that whether the file information and a hash data structure have been correctly configured can utilize the information of the parity of the co-located information of the file information and the parity of a hash value. Verification.

While the preferred embodiments of the present invention have been disclosed herein for illustrative purposes, it will be appreciated by those skilled in the art that various modifications, additions and substitutions are possible, and without departing from the scope of the invention disclosed in the scope of the claims. And spirit.

100‧‧‧Hash data structure

110‧‧‧File Information

111‧‧‧File size values

112‧‧‧ first partial data

113‧‧‧Second partial data

120‧‧‧Hash values

130‧‧‧Structure header

140‧‧‧Same Information

200‧‧‧Hash comparison system

210‧‧‧File Information Generation Unit

220‧‧‧Hash Generation Unit

230‧‧‧Hash archive management unit

240‧‧‧Original File Management Unit

250‧‧‧Control unit

260‧‧‧Hash comparison unit

S510-S540‧‧‧Steps

S610-S660‧‧‧Steps

S710-S771‧‧‧Steps

S810-S891‧‧‧Steps

The above and other objects, features and advantages of the present invention will become more <RTIgt; understood</RTI> <RTIgt; 2 is a schematic diagram showing another embodiment of a hash data structure according to the present invention; and FIG. 3 is a schematic diagram showing a further embodiment of a hash data structure according to the present invention. FIG. 4 is a configuration diagram showing an embodiment of a hash comparison system according to the present invention; FIG. 5 is a flow chart showing that one of the hash data generations can be performed by the hash comparison system of FIG. One embodiment of the method; FIG. 6 is a flow chart showing another embodiment of a method of generating hash data that can be performed by the hash comparison system of FIG. 4; Figure 7 is a flow chart showing one embodiment of a hash data comparison method that can be performed by the hash comparison system of Figure 4; Figure 8 is a flow chart showing the execution of the hash comparison system of Figure 4 Another embodiment of a hash data comparison method; and FIG. 9 is a configuration diagram showing another embodiment of a hash comparison system in accordance with the present invention.

S510-S540‧‧‧Steps

Claims (14)

A method for generating a hash data for generating each piece of hash data to be compared with an original file, comprising: (a) checking an attribute of each original file and generating a predetermined data bit according to the attribute being checked File information; (b) calculating a hash value by applying a hash algorithm to at least a portion of the original file; and (c) generating a hash by sequentially linking the hash value to the file information data. The method for generating hash data according to item 1 of the patent application, wherein (a) comprises: checking a size of the original file, a name, and a format, a first partial data including the first data of the original file, And at least one of the second partial material including the last data of the original file; and generating the first size, the name, and the format including the original file, the first portion of the original file Partial information, and file information of at least one of the second partial data including the last data of the original file. For example, the method for generating hash data according to item 1 of the patent application scope further includes (d) generating a hash co-located bit for the hash data. For example, the method for generating hash data according to item 3 of the patent application scope, wherein (d) comprises: generating a first parity bit for the file information; Generating a second parity bit for the hash value; and generating the hash parity bit by sequentially joining the first and second parity bits. A method for comparing hash data using a hash data containing file information and hash values to compare two original files with each other, comprising: (a) examining two pieces of hash data respectively associated with the two original files; (b) including The two pieces of file information in the two paragraphs of the hash information are compared with each other; and (c) if the two pieces of file information are identical, the two hash values included in the two pieces of hash data are mutually Comparing, and if the two hash values are identical, it is determined that the two original files are the same file. The method for comparing hash data according to item 5 of the patent application scope, wherein the file information includes a size corresponding to one of the original files, a name and a format, a first partial data including the first data of the original file, and the inclusion At least one of the second partial data of the last data of the original file. For example, in the method of comparing the hash data of item 6 of the patent application, (b) includes comparing the individual data bits constituting the information of the two sections of the file with each other. For example, in the comparison method of the hash data of the sixth application scope of the patent application, wherein (b) includes: identifying, for each of the two pieces of file information, a size, a name of one of the original files included in the corresponding file information. And a format, a first partial material containing the first data of the original file, and the original At least one of the second partial data of the last data of the initial file; and the size, the name, and the format of the original file that has been identified, and the first data including the original file At least one of the partial data and the second partial data including the last data of the original file compares the two pieces of file information with each other. A hash data comparison system using hash data including file information and hash values to compare original files with each other, comprising: a file information generating unit configured to check an attribute of each original file and generate related information Archive information of the original file; a hash generating unit configured to calculate a hash value by applying a hash function algorithm to at least a portion of the original file; and a control unit grouped to correspond to the corresponding original file Generates hash data, including file information and hash values. For example, the hash data comparison system of claim 9 includes a hash file management unit that is configured to store the hash data generated by the storage and to maintain information about the original file associated with the stored hash value. For example, the hash data comparison system of claim 9 wherein the control unit determines the similarity of the first and second original files by sequentially comparing the plurality of file information and the hash value of the first and second original files. Sex. For example, in the hash data comparison system of claim 9, wherein the control unit generates a structural header including one of identification information about the file information and the hash value, and generates the hash data, including the structure header, File information, and hash values. For example, the hash data comparison system of claim 12, wherein the control unit sequentially compares the structure header, the plurality of file information, and the hash value of the first and second original files, and then the first and second If the structure header, file information, and hash value of the original file are identical, it is determined that the first and second original files are the same file. For example, in the hash data comparison system of claim 9, wherein the control unit generates a parity bit for the hash data, and includes a parity bit calculated separately for the file information and the hash value.