TWI398780B - Efficient signature-based strategy for inexact information filtering - Google Patents

Description

Valid signature method for inexact information filtering

The present invention relates to an effective signature method for information filtering, and more particularly to an effective signature method for inexact information filtering.

In the prior art, among the methods for supporting inexact filtering, the most commonly used method is to segment the data group and establish a corresponding index through the different items of each user signature. Filter out user data that does not meet the query criteria. However, because this kind of regional division is not stable, at the same time, this method only captures a different item between each user signature, and the filtering effect is very poor for queries with a large number of items. of.

Figure 1 shows a schematic diagram of a conventional comparison of user signatures and data indexing. The conventional filtering method first calculates an overall data signature based on an item signature of a plurality of items of information. Wherein, if the query item input by the user is the same as the original signature of the query item after the data signature and the gate operation, the query item is determined to be suitable information data.

For example, the signatures of the query items Animation, Comic, and Game are (110000), (100100), and (100010), respectively, and the signatures are ORed (OR) to calculate an overall data signature (110110), wherein The signatures of the query items Animation, Comic, and Game are the same as the original signatures after the data signature and AND operation, and the query items are judged to be suitable information data.

However, if a query item is the corresponding signature of Movie (110100), it is the same as the original signature of the query item after the data signature (110110) and the gate operation, and the query item should be suitable information. Data, but because the overall data signature is poorly defined (the signature of the Movie is not defined), it causes a false drop in filtering information data.

Therefore, it is necessary to provide an innovative and progressive non-exact information filtering effective signature method to solve the above problems.

The present invention provides an effective signature method for inexact information filtering, which is used to filter a plurality of qualified information profiles in a plurality of information profiles, each of which has a data signature. The data signature has a set number of bits, and the bits of the data signature have corresponding serial numbers, each of the bits having one of the first characters or a second character of the two bits, the query The project has a query signature. The method comprises the following steps: (a) calculating a first identification bit number according to the number of the first character and the intermediate value of one of the data signatures in the same serial number sign, And the first identification bit number is recorded in an identification unit; (b) the information data is classified into a first information data group and a second information data group according to the first identification bit number, wherein the first The data signature of each information data in an information data group corresponds to the first character of the first identification bit number, and the data signature of each information data in the second information data group corresponds to the first a bit identifying the bit number is the second character; (c) calculating a plurality of lower order new bits according to the bits other than the first identifying bit number and repeating steps (a) and (b) The first identification bit number is recorded in the corresponding identification unit, and the first information data group and the second information data group are respectively classified according to the new first identification bit number of the upper stage until the first after the discrimination Information Data Group and second information data Groups include only one information data, in accordance with that corresponding forensic identification unit to establish a tree (ID-tree); and (d) computing eligibility of forensic data according to the tree information and the query signature.

The effective signature method of the inexact information filtering of the present invention does not divide the data group (the information data) in a regional manner, but uses the signature strategy to adopt a global basis according to each item (each information data). The number of occurrences of the entire data group is divided, and the data group is divided into two sub-clusters (the first information data group and the second information data group) and the forensic tree is established accordingly. According to the established ID-tree indexing method, the user signature is stored, and the established index is used to quickly process a large amount of user data, which is an efficient indexing and query method, thereby reducing information filtering. The time it takes.

The present invention provides an effective signature method for inexact information filtering, which is used to filter a plurality of qualified information profiles in a plurality of information profiles, each of which has a data signature. The data signature has a set number of bits, and the bits of the data signature have corresponding serial numbers, and each bit has one of the first characters or a second character of the two bits.

The query item has a query signature, the query signature has the set number of bits, and the bits of the query item have a serial number relative to the data signature, each of the query items The element has the first character or the second character. In this embodiment, the first character is 1 and the second character is 0.

FIG. 2 is a diagram showing the relationship between the data signature of the information data of the present invention and the query signature of the query item. The data signature is included in the query signature. For example, the query signature Query of the query item is {A, B, C, D, E}, and the data signature P1 is {A, C, E}, data. The signature P2 is {B, D, G}, the data signature P1 is included in the query signature Query, and the data signature P1 is a filtering condition that conforms to the query signature Query, and the data signature P2 is not included in the query signature. Query, the data signature P2 does not meet the filtering criteria of the query signature Query.

3 is a flow chart showing an effective signature method of the inexact information filtering of the present invention. First, referring to step S1, calculating a first identification bit number according to the number of the first character and the intermediate value of one of the data signatures in the same serial number bit, and calculating the first identification bit number, and The first identification bit number is recorded in an identification unit. In this embodiment, step S1 includes the following steps: Step S11, calculating, by the data signature, a plurality of differences between the number of the first character and the intermediate value in the same serial number bit; and step S12, according to step S12 The corresponding serial number of the minimum of the differences, the corresponding serial number is defined as the first identification bit serial number. Wherein, in step S12, if there is a plurality of minimum values among the differences, the corresponding sequence number defining one of the minimum values of the differences is the first identification bit number.

Referring to step S2, the information data is divided into a first information data group and a second information data group according to the first identification bit number, wherein the data signature of each information data in the first information data group corresponds to the The bit of the first identification bit number is the first character, and the data signature of each information data of the second information data group corresponds to the bit of the first identification bit number being the second character .

Referring to step S3, according to the bit other than the first identification bit number (no data, N/A) and repeating steps S1 and S2, the plurality of new first identification bit numbers of the lower order are calculated and recorded in the corresponding identification. In the unit, and according to the new first identification bit number of the upper stage, the corresponding first information data group and the second information data group are divided into the first information data group and the second information data group. An information data is included, and an identification tree (1 bit) is established according to the corresponding identification units.

Referring to step S4, the appropriate information data is calculated according to the forensic tree and the query signature. In this embodiment, in step S4, the first identification bit number of each step of the forensic tree is compared with the equal sign of the query to calculate the appropriate information data.

An embodiment of establishing the forensic tree in the effective signature method of the inexact information filtering of the present invention will be described in detail with reference to FIGS. 4 to 8. Referring first to FIG. 4 and FIG. 5, in this embodiment, there are 9 data signatures (P1-P9, N=9, where N represents the number of data signatures), and the number of setting bits of the data signature is 10 Bit (D={1,2,3,4,5,6,7,8,9,10}), the query item is {1,2,3,5,8}, and the query signature is defined as ( 1110100100). Wherein, the number of occurrences of the same number (Item ID) of the data signature is 1 (the first character) is recorded in the I_C field, for example, the character of the first serial number is 1 and there are P1, P2, and P6. , P7, P8, P9, a total of 6 data signatures; the difference between the number of 1s with the same serial number of the data signature and the intermediate value of the data signature number N (N*1/2) The value (MD=∣I_C-(1/2)N∣) is recorded in the MD field. For example, the data signature (P1) with Item ID is 1, and the difference MD is: ∣6-(1/2)* 9∣=1.5.

Next, the item ID number corresponding to the smallest difference in the selected MD field is the first identification bit number. The minimum difference is located at the item ID number of 3, 4, 6, 7, and 8. In this embodiment, the item ID number is selected as the first identification bit number, and is recorded in the corresponding identification unit. .

Referring to FIG. 6, according to the first identification bit number (3), the information data of the third character is 1 is divided into a first information data group (P4, P5, P7, P8), and the third bit is The information data whose character is 0 (second character) is divided into a second information data group (P1, P2, P3, P6, P9).

Referring to FIG. 7, the selected item ID number is repeated as the first identification bit number according to the bit other than the first identification bit number (3) (ie, according to the first, second, and fourth to tenth bits). And the step of distinguishing the information data into the first information data group and the second information data group according to the first identification bit number until the differentiated first information data group and the second information data group only include one information data And according to the corresponding identification unit (first identification bit number) to establish a forensic tree (as shown in FIG. 8).

The forensic tree of the present invention can correspond to a common binary tree, wherein the highest-order identification unit can be regarded as the root node of the binary tree, and all the identification units below the highest-order identification unit can be regarded as the child nodes of the binary tree.

After the forensic tree is established, the first identification bit number of each step in the forensic tree is compared from top to bottom, and the bit of the query signature relative to each sequence first identification bit number is compared, if the bit is 1 (first character) goes to the right for the next order comparison. If the bit is 0 (second character), go to the left for the next order comparison, complete the query signature and the identification tree. After the comparison, you can get the appropriate information data.

The process of querying the query items {1, 2, 3, 5, 8} and information data using the forensic tree is described in detail with reference to FIG. 8, wherein the query signature is defined as (1110100100). First, the query signature corresponds to the highest-order identification bit number (3), the character number is (1), the corresponding left-side identification character is (0), and the right-side identification character is (1), so go to the right The next identification bit number (4) is performed for the next order comparison; the query signature corresponds to the identification bit number (4), the number of the character is (0), and the corresponding left identification character is (0), The right recognition character is (1), so go to the left to the next identification bit number (2) for the next order comparison; the query signature corresponds to the identification bit number (2) the number of characters is (1) ), the corresponding left-side recognition character is (0), and the right-side identification character is (1), so go to the right to the next identification bit number (9) for the next-order comparison; finally, the query signature corresponds accordingly In the last-order identification bit number (9), the character number is (0), the corresponding left-side identification character is (0), and the right-side identification character is (1), so go to the left to a single corresponding information data. P9 (If the filtering method of the prior art is applied, the final result is a plurality of suitable information data).

It should be emphasized that in the effective signature method of the inexact information filtering of the present invention, the forensic tree (one element) can be further extended to a multi-bit forensic tree with multi-bit filtering, wherein the query signature Compared with the data signature, each time the multi-bit comparison method is used, the information data can be accurately filtered. In this embodiment, the data signatures P1-P9 with the number of bits D being 10 bits and the query items being {1, 2, 3, 5, 8} are also illustrated as an example, wherein the query signature is defined as (1110100100). ).

Referring to FIG. 8 , FIG. 9 and FIG. 10 to FIG. 20 , according to the identification unit of the highest level of the forensic tree (the first identification bit number is 3), the forensic tree is defined as a left part and a right part (as shown in FIG. 8 is defined by a dotted line), and a plurality of initial indicator modules 51 and a plurality of identification unit index modules 52 (refer to FIG. 10) are defined. Each initial index module 51 includes an initial identification signature recording unit (I_key) 511. And an initial joint indicator unit (U_key) 512, the data signature of each of the lowest order information data in the forensic tree is recorded in the corresponding initial identification signature record unit 511, and the initial joint indicator unit 512 is initially empty. Information (null). Each identification unit indicator module 52 includes an identification bit number indicator unit (key_set) 521, a joint indicator unit 522, an identification signature recording unit 523, and a second identification bit comparison unit 524.

In the method for establishing the multi-bit forensic tree of the present invention, after the one-bit forensic tree is established in step S3 of FIG. 3, the following steps are further included. Referring to step S31 and FIG. 11, the initial identification signature (ie, data signatures P4, P5) of the second lowest partial second initial identification signature recording unit 511 is mutually exclusive or gated (XOR) operation to calculate one. The bit number group (7, 9) is identified and recorded in the corresponding identification unit 53 and the identification bit number index unit 521 of the corresponding identification unit index module 52. The identification bit number group of the order includes the first identification bit number (7) and a second identification bit number (9).

Referring to step S32 and FIG. 12, the identification bit number group (7, 9) and the joint indicator unit 522 are combined (the initial value is null) to form a new identification bit number group (7, 9). And record it in the joint indicator unit 522 of the corresponding identification unit indicator module.

Referring to step S33 and FIG. 13, the initial identification signature recording units 511 ((0101010110) and (0101011100)) corresponding to the data signatures P4 and P5 are ANDed to calculate an identification signature ( 0101010100), and record it in the identification signature record unit (I_key) 523 of the corresponding identification unit indicator module 52.

Referring to step S34 and FIG. 14, the characters corresponding to the first and second identification bit numbers (7, 9) of the P4 and P5 data signatures are defined as identification characters, and are recorded in the corresponding identification. The unit indicator module 52 bis identifies the bit alignment record unit 524. In the present embodiment, the identification character with respect to the data signature P4 is (01), and the identification character with respect to the data signature P5 is (10).

Referring to step S35 and FIG. 15, steps S31 to S34 are repeated to calculate a new identification bit number group (2, 6, 9) and identification mark of the same-order identification unit (corresponding to the data signatures P7 and P8) in the left part. Chapter (1000001100) and identification characters are recorded in the corresponding identification unit 54, the identification bit number index unit 551 of the corresponding identification unit index module 55, the joint indicator unit 552, the identification signature recording unit 553, and the second identification. The bit alignment is recorded in unit 554. In the present embodiment, the identification character with respect to the data signature P7 is (001), and the identification character with respect to the data signature P8 is (110).

Referring to step S36 and FIG. 16, the new identification bit number groups (7, 9) and (2, 6, 9) of the same lower order in the left part are combined to form a union identification bit number group (2, 6, 7, 9), and record it in the joint indicator unit 562 of the upper-level corresponding identification unit indicator module 56.

Referring to step S37 and FIG. 17, the left portion is identified with respect to the second upper-order identification signature recording unit 523 of the same upper-order identification unit 57 (corresponding identification signature) Mutual exclusion or gate operation for (0101010100) and (1000001100), the operation result is (1101011000), and the set of bit numbers (1, 2, 4, 6, 7) in which 1 is found in the result of the operation is obtained. Excluding the values of the lower-order union identification bit number group groups (2, 6, 7, 9) to form an upper-order identification bit number group group (1, 4), and recording the corresponding identification unit 57 and the identification bit number indicator unit 561 of the corresponding identification unit indicator module 56.

Referring to step S38 and FIG. 17 and FIG. 18, the combination identifying the bit number index unit 561 and the joint indicator unit 562, and recording the operation result to the joint indicator unit 562, that is, the union identification bit number group ( 2, 6, 7, 9) and the value of the upper-order identification bit number group (1, 4) to form an upper-order union identification bit number group (1, 2, 4, 6, 7, 9 And record it in the joint indicator unit 562 of the corresponding identification unit indicator module 56.

Referring to step S39 and FIG. 18, the left portion is performed with respect to the second lower-order identification signature recording unit 523 and the identification signature recording unit 553 (ie, identification signatures (0101010100) and (1000001100)) of the same upper-order identification unit 57. And the gate operation to calculate an upper-level identification signature (the operation result is (0000000100)), and record it in the identification signature recording unit 563 of the corresponding identification unit indicator module 56.

Referring to step S40 and FIG. 19, the identifiers of the two lower-order identification signatures (0101010100) and (1000001100) corresponding to the position number of the upper-order identification bit number group (1, 4) are defined as upper-level identification characters. And recording it in the upper recognition bit comparison record unit 564 of the corresponding identification unit indicator module 56. In this embodiment, the identification character relative to the lower-level identification signature (0101010100) is (01), and the identification signature relative to the lower stage is The identification character of (1000001100) is (10).

It should be noted that if the forensic tree is a more-order binary tree, a step S41 is performed, and steps S36 to S40 are repeated to calculate the same upper-order identification unit of the other lower-order identification tags in the left part. The combination identification bit number group group, the upper level combination identification bit number group group, the upper order identification signature and the upper order recognition character are respectively recorded in the combination of the corresponding identification unit and the corresponding identification unit indicator module The indicator unit, the identification bit number indicator unit, the identification signature record unit, and the second identification bit comparison record unit.

Referring to step S42 and FIG. 20, using the manner of steps S31 to S41 (if needed), the identification bit number group, the union identification bit number group group, the identification signature and the recognition character of each step of the right part are calculated, and They are respectively recorded in the corresponding order identification unit, the identification bit number index unit of the corresponding order identification unit indicator module, the joint indicator unit, the identification signature record unit and the second identification bit comparison record unit. The calculation methods in steps S31 to S41 have been described in detail above, and are not described herein again.

Referring to step S43 and FIG. 20, finally, according to the left part and the highest order identification bit number group, the joint identification bit number group and the identification signature of the right part, the highest level of the multi-bit identification tree is calculated and recorded. The bit number group (3, 8) and the recognition characters (01) and (10) are identified to complete the multi-bit forensic tree.

Referring to Fig. 21, step S43 in the present embodiment further includes the following steps. Step S431, the left side part and the highest order identification bit number group of the right part are combined to form a joint identification bit number group group, and recorded in the joint indicator unit of the corresponding identification unit indicator module (comparable Refer to step S32 And the description of Figure 12).

Step S432, performing a mutual exclusion or gate operation on the identification stamp of the highest order of the left part and the right part, and performing a mutually exclusive or gate operation on the identification signature to obtain a set of serial numbers of the first character. Excluding the value of the left-most part and the highest-order combination identification bit number group of the right part to form the identification bit number group group, and record the identification bit number indicator unit of the corresponding identification unit indicator module ( Reference may be made to the description of steps S37 and 17).

Step S433, the values of the combination of the left-most part and the highest-order combination identification bit number group and the identification bit number group are combined to form a highest-order union identification bit number group of the multi-bit identification tree. And record it in the joint indicator unit of the corresponding highest-order identification unit indicator module (refer to the description of steps S38, 17 and 18).

Step S434, the identification mark of the leftmost part and the highest order of the right part, corresponding to the left part and the character of the serial number position in the highest order identification bit number group of the right part, is defined as the multi-bit forensic tree The uppermost level identifies the character and records it in the identification bit comparison record unit of the corresponding identification unit indicator module (refer to the description of step S40 and FIG. 19), so that each level of the multi-bit identification tree has The identification bit of the order recognition character is compared to the record unit (which can be regarded as the root node and each step child node).

An effective signature method for inexact information filtering of the present invention will be described in detail with reference to FIG. In this embodiment, the data signatures P1-P9 with the number of bits D being 10 bits and the query items being {1, 2, 3, 5, 8} are also illustrated as an example, wherein the query signature is Sig (D). , Q _doc ) indicates and defines its value as (1110100100).

After the multi-intelligence tree is established, that is, from the top to the bottom according to the identification bit number group of each step in the multi-identification tree (including the first identification bit number and the at least one second identification bit number), according to the identification bits of each step The serial number of the meta-group and the identification character are compared to the signature and information data of the query. Wherein, if one or more of the relative recognition characters are 1, but the identification character is not equal to the character in the query signature relative to the serial number position of the identification bit number group, the next order comparison is not performed. After completing the comparison of the query signature with the various levels of the multi-bit forensic tree, an appropriate information data can be obtained.

The process of using the multi-bit forensic tree to perform the query signature and information data comparison is described in detail below. First, the query signature corresponding to the highest-order identification bit number group (3, 8) serial number is (11), and the corresponding left identification character is (01), and the left identification character (01) is The second character of 1 is the same as the character of the corresponding position of the query signature, so the next order is compared; the corresponding right recognized character is (10), and the right recognized character (10) is 1 The first character is the same as the character at the corresponding position of the query signature, so the next order is compared.

Then, the query signature corresponds to the second order (the highest order of the left part), the character number of the identification bit number group (1, 4) is (10), and the corresponding second-order left identification character is (01) The second character of the second-order left-side identification character (01) is different from the character of the corresponding position of the query signature, so the next-order comparison is not performed, and the second-order right identification word is The first character in the element (10) is the same as the character in the corresponding position of the query signature, so the next order is compared.

Then, the query signature corresponds to the second order (the highest order of the right part), the identification bit number group (4), the serial number of the character is (0), and the corresponding second-order left identification character is (0), The second-order left-side recognition character is not 1, so the next-order comparison is performed, and the second-order right-side recognition character is 1, which is different from the character at the corresponding position of the query signature, so the next-order is not performed. Comparison.

Then, the query signature corresponds to the third order (the second order of the left part), and the character number of the identification bit number group (2, 6, 9) is (100), and the corresponding third-order left identification character is (001), the third character of the third-order left-side identification character (001) is different from the character of the corresponding position of the query signature, so the next-order comparison is not performed, and the third-order The first and second character characters of the right side recognition character (110) are different from the characters of the corresponding position of the query signature, so the next order comparison is not performed.

Then, the query signature corresponds to the third order (the second order of the right part), and the character number of the identification bit number group (2, 5, 6) is (110), and the corresponding third-order left identification character is (011), the third character of the third-order left-side identification character (011) is different from the character of the corresponding position of the query signature, so the next-order comparison is not performed, and the third-order The first character of the right recognizing character (100) of 1 is the same as the character of the corresponding position of the query signature, so the next order comparison is performed.

Finally, the query signature corresponds to the fourth order (the third order of the right part, the last stage of the embodiment), and the character number of the digit number group (9, 10) is (00), corresponding to the fourth The left-side recognition character is (00), and the fourth-order left-side recognition character is not 1, so it goes to the left to a single corresponding information data P9 (if a filtering method of the prior art is applied, the final result is a plurality of Qualified information data), the first and second character characters of the fourth-order right-side recognition character (11) are different from the characters at the corresponding positions of the query signature, so the next-order comparison is not performed. .

By using the multi-bit forensic tree of the invention, the multi-bit comparison can be performed in the same order (secondary) comparison, which not only accelerates the process of the query signature and the information data comparison, but also reduces the filtered information. The amount of data has better filtering accuracy and efficiency.

The effective signature method of the inexact information filtering of the present invention does not divide the data group (the information data) in a regional manner, but uses the signature strategy to adopt a global basis according to each item (each information data). The number of occurrences of the entire data group is divided, and the data group is divided into two sub-clusters (the first information data group and the second information data group) and the forensic tree is established accordingly. According to the established ID-tree indexing method, the user signature is stored, and the established index is used to quickly process a large amount of user data, which is an efficient indexing and query method, thereby reducing information filtering. The time it takes. For example, information filtering is performed on the data transmitted by the Internet, and all the non-compliant users are quickly and directly filtered by using an index built in advance for the user's signature.

In practical applications, the method of the present invention can be applied to an Internet database: a database website located on the World Wide Web (WWW), through which information filtering technology can be actively transmitted to interested users, or to research Media group broadcasters can reduce the time it takes to find objects they send on the media through the information filtering techniques of the present invention.

The above embodiments are merely illustrative of the principles and effects of the invention and are not intended to limit the invention. Therefore, those skilled in the art can make modifications and changes to the above embodiments without departing from the spirit of the invention. The scope of the invention should be as set forth in the appended claims.

51. . . Initial indicator module

52. . . Identification unit indicator module

53, 54, . . Lower recognition unit

55. . . Identification unit indicator module

56. . . Identification unit indicator module

57. . . Upper recognition unit

511. . . Initial identification signature record unit

512. . . Initial joint indicator unit

521. . . Identification bit number indicator unit

522. . . Joint indicator unit

523. . . Identification signature unit

524. . . Identification bit alignment unit

551. . . Identification bit number indicator unit

552. . . Joint indicator unit

553. . . Identification signature unit

554. . . Identification bit alignment unit

561. . . Identification bit number indicator unit

562. . . Joint indicator unit

563. . . Identification signature unit

564. . . Identification bit alignment unit

Figure 1 shows a schematic diagram of a conventional comparison of user signatures and data indexing;

2 is a diagram showing the relationship between the data signature of the information data of the present invention and the query signature of the query item;

3 is a flow chart showing an effective signature method of the inaccurate information filtering of the present invention;

4 to 8 are schematic diagrams showing the process of establishing a forensic tree according to the present invention;

FIG. 9 is a flowchart of the present invention for establishing a multi-bit forensic tree according to the forensic tree; FIG.

10 to 20 are schematic diagrams showing the process of establishing the multi-bit forensic tree of the present invention; and

FIG. 21 is a flow chart showing the calculation of the identification bit number group and the identification character corresponding to the highest order identification unit of the multi-bit identification tree.

(no component symbol description)

Claims (8)

An effective signature method for filtering non-precise information, which is used to filter a plurality of qualified information profiles in a plurality of information profiles, each of which has a data signature (signature), the data The signature has a set number of bits, and the bits of the data signature have corresponding serial numbers, each of the bits has one of the first characters or a second character of the two bits, and the query item has a Querying the signature, if the data signature is included in the query signature, the information data conforms to the filtering condition of the query item, and the method includes the following steps: (a) signing the same serial number bit according to the data signature An intermediate value of the number of the first character and the number of the data signatures is calculated, a first identification bit number is calculated, and the first identification bit number is recorded in a recognition unit, wherein the intermediate value As one and a half of the number of data signatures, the identification unit is a root node of an ID-tree; (b) distinguishing the information data into a first information data group and one according to the first identification bit number Second Information Data Group The data signature of each information data in the first information data group corresponding to the first identification bit number is the first character, and the data information of each information data in the second information data group The bit corresponding to the first identification bit number is the second character; (c) calculating the plurality of bits according to the bit corresponding to the first identification bit number and repeating steps (a) and (b) a new first identification bit number of the lower order and recorded in the corresponding identification unit, wherein the corresponding identification unit is The child node of the forensic tree, and the first information data group and the second information data group corresponding to the lower first order according to the new first identification bit number of the upper level, until the first information data group and the second information data group are distinguished Include only one piece of information data, based on the respective identification units to establish the forensic tree; and (d) calculate appropriate information data based on the forensic tree and the query signature. The method of claim 1, wherein the first character is 1 and the second character is 0. The method of claim 1, wherein the step (a) comprises the steps of: (a1) calculating a plurality of differences between the number of the first character and the intermediate value in the same number of bits; and (a2) The corresponding serial number is defined as the first identification bit number according to the corresponding sequence number of the minimum of the equal differences. The method of claim 3, wherein in step (a2), if the difference has a plurality of minimum values, the corresponding sequence number defining one of the minimum values is the first identification bit. Serial number. The method of claim 1, wherein the query signature has the set number of bits, and the bits of the query signature have a serial number relative to the data signature of the data signature, each of the query signatures The bit has the first character or the second character, and in step (d), the first identification bit number of each step of the forensic tree is compared with the bit of the query signature to calculate the eligibility Information data. The method of claim 1, wherein a left part and a right part are defined according to the highest order identification unit of the forensic tree, and a plurality of initial fingers are defined a standard module and a plurality of identification unit indicator modules, each initial indicator module includes an initial identification signature recording unit, each identification unit indicator module includes an identification bit number indicator unit, a joint indicator unit, and an identification The signature record unit and the second identification bit comparison record unit, wherein the data signature of each of the lowest order information data in the forensic tree is respectively recorded in the corresponding initial identification signature record unit, and after step (c), the following includes Step: (c1) performing a mutual exclusion or gate (XOR) operation on the lowest-order second identification signature of the left part to calculate a recognition bit number group, and recording the same in the corresponding identification unit and the corresponding identification unit indicator module. The identification bit number indicator unit, wherein the identification bit number group of the order includes the first identification bit number and the at least one second identification bit number; (c2) combining the identification bit number group and the joint indicator The value of the unit is formed to form a new identification bit number group, and is recorded in the joint indicator unit of the corresponding identification unit indicator module; (c3) the lowest order second initial identification of the left part Performing an AND operation to calculate an identification signature and record it in the identification signature record unit of the corresponding identification unit indicator module; (c4) corresponding to the first identification bit of the two initial data signatures The character number and the character of the second identification bit number position are defined as the recognition character, and are recorded in the second identification bit comparison record unit of the corresponding identification unit indicator module; (c5) repeating step (c1) to (c4), calculate the other same order in the left part The new identification bit number group, the identification signature and the recognition character are recorded in the corresponding identification unit, the identification bit number indicator unit of the corresponding identification unit indicator module, the joint indicator unit, the identification signature record unit and Second identifying the bit alignment record unit; (c6) combining the new identification bit number group of the same lower order two identification unit in the left part to form a union identification bit number group group, and recording the corresponding identification a joint indicator unit of the unit indicator module; (c7) mutually exclusive or gate operation of the left portion with respect to the second lower-order identification signature of the same upper-order identification unit, and mutually exclusive or gate the identification signatures The set of serial numbers of the first character appears in the result of the operation, and the values of the set of the identification bit of the lower order are excluded to form an upper-order identification bit number group, and the record is recorded in the corresponding identification. a unit and a corresponding identification unit indicator module identification bit number indicator unit; (c8) a combination of the union identification bit number group and the upper-order identification bit number group value to form an upper-order joint recognition Bit The group is recorded in the joint indicator unit of the corresponding identification unit indicator module; (c9) the left part is compared with the second lower-order identification signature of the same upper-order identification unit to perform a gate operation to calculate an upper order Identifying the signature and recording it in the identification and signature unit of the corresponding identification unit indicator module; (c10) defining the character of the second-order identification signature corresponding to the position of the upper-order identification bit number group as the upper-level identification character, and recording the character in the upper-level identification of the corresponding recognition unit indicator module The bit alignment comparison unit; (c11) repeating steps (c6) to (c10), calculating the union identification bit number group of the same upper-order identification unit of the other lower-order identification signatures in the left part, and the upper order The association identifies the bit number group, the upper-level identification signature and the upper-level identification character, and records them in the corresponding identification unit, the joint indicator unit of the corresponding identification unit indicator module, the identification bit number indicator unit, and the identification sign. a recording unit and a second identification bit comparison unit; (c12) calculating the identification bit number group, the union identification bit number group, and the identification of each of the right part of the right part by using the methods in steps (c1) to (c11) Signature and identification characters, and record them in the corresponding level identification unit, the identification unit number indicator unit of the corresponding level identification unit indicator module, the joint indicator unit, the identification signature record unit and the second identification bit comparison record. unit; (c13) calculating and recording the identification bit number group and the identification word of the highest order of the forensic tree according to the identification block number group, the joint identification bit number group group and the identification signature of the highest part of the left part and the right part. yuan. The method of claim 6, wherein the step (c13) comprises the steps of: (c131) combining the left part and the highest order identification bit number group of the right part to form a union identification bit number group, and its Recording in the corresponding indicator unit of the corresponding identification unit indicator module; (c132) mutually exclusive or gate operation of the identification mark of the leftmost part and the highest part of the right part, and mutually exclusive or gate operation of the identification signatures A set of serial numbers of the first character appears in the obtained result, and the values of the left-most part and the highest-order union identification bit number group of the right part are excluded to form the identification bit number group, and the corresponding number is recorded and recorded in the corresponding Identifying a unit number indicator unit of the unit indicator module; (c133) combining the left part and the highest order joint identification bit number group of the right part and the value of the identification bit number group to form the highest order Collecting the identification bit number group and recording it in the joint indicator unit of the corresponding highest-order identification unit indicator module; and (c134) identifying the left part and the highest-order identification of the right part, corresponding to the left part And the character of the serial number position in the highest-order identification bit number group of the right part is defined as the highest-order identification character, and is recorded in the identification bit ratio of the corresponding identification unit indicator module. Record unit. The method of claim 6, wherein in step (d), the value of the digit sequence group and the identification digits of each order are identified according to the order of the forensic tree, and the query is signed and the forensic tree is filtered to filter out the eligibility. Information data.