CN108829932A - Interest matching method, device, computer equipment and storage medium - Google Patents

Abstract

The present application relates to an interest matching method, device, computer equipment and storage medium. The method includes: obtaining the boundary parameters of the first area and the second area to be matched, respectively sorting the boundary parameters according to the preset sorting rules, obtaining parameter lists respectively, and according to the numerical value of each boundary parameter in the parameter list and the corresponding sorting position, determine the first mapping interval corresponding to the upper and lower bound parameters of the first area parameter list in the second area parameter list, and determine the corresponding first mapping interval of the upper and lower bound parameters in the second area parameter list in the first area parameter list The second mapping interval, according to the first mapping interval and the second mapping interval, determine the interest matching result between the first area and the second area. By sorting the parameters to improve the accuracy of the matching results, and by mapping the results to determine the matching results of interest, the length or number of the list to be sorted is significantly reduced, the sorting overhead is reduced, and the amount of data processing is reduced, thereby improving the matching efficiency.

Description

Interest matching method, device, computer equipment and storage medium

technical field

The present application relates to the technical field of data processing, in particular to an interest matching method, device, computer equipment and storage medium.

Background technique

In distributed simulation, publish/subscribe based communication will generate a large number of irrelevant data transfers, thereby degrading the performance of the simulation run. The HLA (High Level Architecture) standard provides data distribution management services to filter unnecessary data transmission and reduce communication overhead between federations. Data producers use the data distribution management service to maintain the attributes of the data they send (publication area), while data consumers can use the data distribution management service to specify their data requirements (subscription area). Then, the runtime support environment distributes the producer's data to the data consumer according to the interest matching relationship of these regions. Therefore, interest matching plays a key role in data distribution management.

However, the traditional methods of interest matching are mainly realized by means of region-based and grid-based methods. While achieving the results of interest matching, there is a problem of low matching efficiency.

Contents of the invention

Based on this, it is necessary to provide an interest matching method, device, computer equipment and storage medium capable of improving the efficiency of interest matching for the technical problem of low efficiency of interest matching.

A method for interest matching, the method comprising:

Obtain boundary parameters of the first area to be matched and the second area, where the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein the first area is a publishing area and the second area is a subscription area , or the first area is a subscription area and the second area is a publishing area;

Sorting the boundary parameters of the first area and the second area respectively according to a preset sorting rule to obtain a first area parameter list and a second area parameter list, the preset sorting rule includes sorting the lower bound parameters according to the numerical value Sort or sort the upper bound parameters according to their numerical value;

According to the numerical value and the corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list, determine the upper bound parameter and the lower bound parameter of the first area parameter list in the second area parameter list The corresponding first mapping interval in the first area parameter list, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list;

Determine an interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval.

In one of the embodiments, the upper bound parameter and the lower bound of the first area parameter list are determined according to the numerical value and the corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list The first mapping interval corresponding to the parameter in the second area parameter list, and determining the second mapping interval corresponding to the upper bound parameter and lower bound parameter of the second area parameter list in the first area parameter list include:

determining a boundary parameter list of the second area to be mapped according to the sorting boundary determined in the preset sorting rule;

According to the numerical value of the parameter, the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area is determined through alternate comparison and binary search;

Similarly, the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list is determined.

In one of the embodiments, when the preset sorting rule is to sort the lower bound parameters in ascending order, the boundary parameter list of the second area to be mapped is a lower bound list, and according to the numerical value of the parameters, through alternate comparison and binary search Determining the first mapping interval corresponding to the upper bound parameter and lower bound parameter in the first area parameter list in the boundary parameter list of the second area includes:

By alternately comparing the lower bound parameters in the first area parameter list with the lower bound parameters in the second area parameter list, it is determined that the lower bound parameter in the first area parameter list is the first in the lower bound list in the second area. Mapping position; the first mapping position is a position corresponding to a parameter whose value in the lower bound list of the second area is not less than the lower bound parameter in the first area parameter list;

Using the first mapping position as a starting point, determine a second mapping position of the upper bound parameter in the first area parameter list in the lower bound list of the second area through binary search;

According to the first mapping position and the second mapping position, determine a first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area.

In one of the embodiments, the determining the interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval includes:

generating a coverage information matrix according to the first mapping interval and the second mapping interval;

According to the coverage information matrix, an interest matching result between the first area and the second area is obtained.

In one of the embodiments, the generating a coverage information matrix according to the first mapping interval and the second mapping interval includes:

determining the number of rows and columns of the coverage information matrix according to the number of boundary parameters between the first area and the second area;

Obtain an id (identification, identity) parameter list corresponding to the first mapping interval and the second mapping interval, and determine each component element of the coverage information matrix according to the id parameter list;

A coverage information matrix is generated according to the number of rows and columns of the coverage information matrix and each component element of the coverage information matrix.

In one of the embodiments, the obtaining the id parameter list corresponding to the first mapping interval and the second mapping interval, and determining each component element of the coverage information matrix according to the id parameter list includes:

Obtain an initialized coverage information matrix and an id parameter list corresponding to the first mapping interval and the second mapping interval;

Updating corresponding elements of the first mapping interval in the initialized coverage information matrix to preset values according to the first mapping interval and the corresponding id parameter list;

According to the second mapping interval and the corresponding id parameter list, update the corresponding elements in the second mapping interval in the updated coverage information matrix to the preset values, so as to determine the constituent elements of the coverage information matrix.

In one of the embodiments, the obtaining the interest matching result between the first area and the second area according to the coverage information matrix includes:

The constituent elements of the coverage information matrix of each dimension are obtained respectively, and the interest matching results of the first region and the second region are determined according to the same constituent elements of the coverage information matrix of each dimension.

An interest matching device, the device comprising:

The boundary parameter acquisition module is used to acquire the boundary parameters of the first area to be matched and the second area, and the boundary parameters include a one-to-one corresponding upper bound parameter and lower bound parameter, wherein the first area is a published area and the The second area is a subscription area, or the first area is a subscription area and the second area is a publication area;

A parameter sorting processing module, configured to sort the boundary parameters of the first region and the second region respectively according to a preset sorting rule, and obtain a first region parameter list and a second region parameter list, and the preset sorting rule includes Sort the lower bound parameters according to the numerical value or sort the upper bound parameters according to the numerical value;

A mapping interval determination module, configured to determine the upper bound parameter and the lower bound parameter of the first area parameter list according to the numerical value of each boundary parameter in the first area parameter list and the second area parameter list and the corresponding sorting position. The corresponding first mapping interval in the second area parameter list, and determine the second mapping interval corresponding to the upper bound parameter and lower bound parameter of the second area parameter list in the first area parameter list;

An interest matching result determining module, configured to determine an interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval.

A computer device includes a memory and a processor, the memory stores a computer program, and the processor performs the following steps when executing the computer program.

Obtain boundary parameters of the first area to be matched and the second area, where the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein the first area is a publishing area and the second area is a subscription area , or the first area is a subscription area and the second area is a publishing area;

Sorting the boundary parameters of the first area and the second area respectively according to a preset sorting rule to obtain a first area parameter list and a second area parameter list, the preset sorting rule includes sorting the lower bound parameters according to the numerical value Sort or sort the upper bound parameters according to their numerical value;

According to the numerical value and the corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list, determine the upper bound parameter and the lower bound parameter of the first area parameter list in the second area parameter list The corresponding first mapping interval in the first area parameter list, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list;

Determine an interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval.

A computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the following steps are realized.

Obtain boundary parameters of the first area to be matched and the second area, where the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein the first area is a publishing area and the second area is a subscription area , or the first area is a subscription area and the second area is a publishing area;

Sorting the boundary parameters of the first area and the second area respectively according to a preset sorting rule to obtain a first area parameter list and a second area parameter list, the preset sorting rule includes sorting the lower bound parameters according to the numerical value Sort or sort the upper bound parameters according to their numerical value;

According to the numerical value and the corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list, determine the upper bound parameter and the lower bound parameter of the first area parameter list in the second area parameter list The corresponding first mapping interval in the first area parameter list, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list;

Determine an interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval.

The above interest matching method, device, computer equipment, and storage medium obtain the boundary parameters of the first region to be matched and the second region, and sort the lower bound parameters according to the numerical value or sort the upper bound parameters according to the numerical value. The parameters are sorted, and according to the numerical value and location of the parameters in the parameter list, determine the mapping interval of the upper bound parameter and lower bound parameter of the first area parameter list in the second area parameter list, and the upper bound parameter of the second area parameter list In the second mapping interval corresponding to the lower bound parameter in the first area parameter list, the accuracy of the matching result is improved by sorting the parameters, and the matching result of the interest is determined by the mapping result of the first area parameter and the second area parameter, which significantly reduces waiting times. The length or number of the sorted list reduces sorting overhead, reduces the amount of data processing, and thus improves matching efficiency.

Description of drawings

FIG. 1 is a schematic flow diagram of an interest matching method in an embodiment of the present application;

FIG. 2 is a schematic flow diagram of an interest matching method in another embodiment of the present application;

FIG. 3 is a schematic flow diagram of an interest matching method in another embodiment of the present application;

FIG. 4 is a schematic flow chart of step S750 of the interest matching method in an embodiment of the present application;

FIG. 5 is a schematic diagram of the classification principle of the interest matching method in an application example of the present application;

FIG. 6 is a schematic diagram of a parameter sorting list of an interest matching method in an application example of the present application;

Fig. 7 is a schematic diagram of the parameter mapping position of the interest matching method in an application example of the present application;

FIG. 8 is a structural block diagram of an interest matching device in an embodiment of the present application;

FIG. 9 is an internal structure diagram of a computer device in an embodiment of the present application.

Detailed ways

In order to make the purpose, technical solution and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present application, and are not intended to limit the present application.

The distributed interactive simulation environment is the product of the combination of simulation technology and network technology. It is formed by interconnecting simulation devices scattered in various places through LAN or WAN. Due to the superiority and practicability of the distributed interactive simulation technology itself, it has been promoted from the application research and development in the military field to non-military fields such as education, medical treatment, and commerce. With the expansion of simulation scale and improvement of simulation accuracy, the data flow of simulation network is expanding day by day. In distributed simulation, publish/subscribe based communication will generate a large number of irrelevant data transfers, thereby degrading the performance of the simulation run. The HLA standard provides Data Distribution Management (DDM for short) service to filter unnecessary data transmission and reduce communication overhead between federations. Data producers use DDM services to maintain the attributes of the data they send (publishing areas), while data consumers can use DDM services to specify their data requirements (ordering areas). Then, RTI (Run-Time Infrastructure, running support environment) distributes the producer's data to the data consumer according to the interest matching relationship of these areas. Therefore, interest matching plays a key role in data distribution management. Without an interest matching mechanism, a large amount of unnecessary data distribution will be generated, which will seriously degrade the simulation running performance. However, without efficient interest-matching algorithms, simulation runtime performance will suffer as well.

In one embodiment, as shown in FIG. 1 , an interest matching method is provided, which includes:

Step S100, obtain the boundary parameters of the first area and the second area to be matched, the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein, the first area is the publishing area and the second area is the subscription area, or the second area One area is the subscription area and the second area is the publishing area.

In the federated simulation, the area refers to the restricted range of data received and data that can be sent. Federation members can declare their interests to RTI through the area definition, including the data they want to receive and the data that can be sent. The area includes the publishing area and the ordering area. The ordering area expresses the data requirements of ordering federation members by defining the path space coordinate interval. The publishing area maintains the attributes of the sent data by defining the path space coordinate interval. The first area can refer to the ordering area or Refers to the release area. Since the order area and the release area are areas to be matched, when the first area is the release area, the second area is the order area, and when the first area is the order area, the second area is the release area. Both the first area and the second area are composed of several parameters, including a lower bound parameter corresponding to the minimum value and an upper bound parameter corresponding to the maximum value. It can be understood that the first area is not limited to one area, and is a general term for the same type of area (subscription or release). The first area may include several sub-areas of the same type, and the upper bound parameter and the lower bound parameter of the same sub-area correspond one-to-one.

Step S300, respectively sort the boundary parameters of the first area and the second area according to the preset sorting rules, and obtain the first area parameter list and the second area parameter list. The preset sorting rules include sorting the lower bound parameters according to the numerical value Or sort the upper bound parameters according to their numerical value.

The first area includes several sub-areas, and each sub-area includes an upper bound parameter and a lower bound parameter. Through the preset sorting rules, such as sorting the boundary parameters of the first area and the second area according to the numerical value of the lower bound parameter, because There is a one-to-one correspondence between the upper bound parameters and the lower bound parameters. When the lower bound parameters are sorted according to the numerical value, the upper bound area is also rearranged accordingly to obtain the parameter list. The parameter list includes the lower parameter list in ascending or descending order and the corresponding upper parameters. Similarly, the upper bound parameters can be sorted in ascending or descending order to obtain the first area parameter list and the second area parameter list.

Step S500, according to the numerical value and the corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list, determine the corresponding upper bound parameter and lower bound parameter in the first area parameter list in the second area parameter list The first mapping interval, and determining the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list.

The mapping interval refers to the interval formed by the mapping positions of the upper and lower bound parameters in the corresponding parameter list to be mapped. For example, to map the upper and lower bound parameters of the first area to the parameter list of the second area, the method for determining the mapping interval is: The mapping position of the upper bound parameter of a region is the position corresponding to the largest parameter not smaller than the upper bound parameter in the parameter list to be mapped in the second region, and the mapping position of the lower bound parameter of the first region is greater than Or equal to the position corresponding to the minimum parameter of the lower bound parameter, and the mapping positions of the upper and lower parameters constitute the mapping interval.

Step S700, according to the first mapping interval and the second mapping interval, determine the interest matching result between the first area and the second area.

According to the judgment conditions, in order to obtain the matching information, the core work is to determine the lower bounds of the announced areas included in each ordered area and the lower bounds of the ordered areas included in each announced area, that is, the corresponding mapping interval. Through the first mapping interval and the second mapping interval, it can be judged whether the two regions overlap, so as to obtain the interest matching result.

The above interest matching method obtains the boundary parameters of the first area and the second area to be matched, and sorts the parameters by sorting the lower bound parameters according to the numerical value or sorting the upper bound parameters according to the numerical value, and sorts the parameters according to the parameter list The numerical value and location of the parameter determine the mapping interval of the upper bound parameter and lower bound parameter of the first area parameter list in the second area parameter list, and the upper bound parameter and lower bound parameter of the second area parameter list are in the first area parameter In the second mapping interval corresponding to the list, the accuracy of the matching result is improved by sorting the parameters, and the matching result of the interest is determined by the mapping result of the first area parameter and the second area parameter, which significantly reduces the length or number of the list to be sorted, and reduces Sorting overhead reduces the amount of data processing, thereby improving matching efficiency.

As shown in Figure 2, in one embodiment, step S500 includes:

Step S520, according to the sorting boundaries determined in the preset sorting rules, determine the boundary parameter list of the second area to be mapped.

The sorting rules include sorting the lower bound parameters in ascending or descending order, or sorting the upper bound parameters in ascending or descending order. According to the determined sorting rules, it can be determined whether the sorting boundary is the upper bound or the lower bound. The sorting boundary is the same as the boundary corresponding to the boundary parameter list to be mapped, and when the sorting boundary is an upper bound, the boundary parameter list to be mapped is an upper bound list.

Step S540, according to the numerical value of the parameter, determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the second area boundary parameter list through alternate comparison and binary search.

Similarly, the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list is determined.

Binary search, also known as binary search, is a more efficient search method. Binary search requires that the linear table must adopt a sequential storage structure, and the elements in the table are arranged in order according to the keywords. Assuming that the lower bound list of the second area to be mapped is The elements are arranged in ascending order, and the parameter value recorded in the middle position of the lower bound list is compared with the upper bound parameter value of the first area. If the two are equal, the corresponding position of the parameter list value is the mapping position of the upper bound parameter. If the parameter If the list value is greater than the upper limit value and the adjacent parameter list value of the parameter list value is smaller than the upper limit value, then the corresponding position of the adjacent parameter list value is the mapping position of the upper parameter, and the search is successful; otherwise, the intermediate position record will be The table is divided into two sub-tables, front and back. If the parameter value recorded in the middle position is greater than the upper bound parameter value, the previous sub-table is further searched, otherwise, the latter sub-table is further searched, and the above process is repeated until a record satisfying the condition is found.

In one embodiment, when the preset sorting rule is to sort the lower bound parameters in ascending order, the list of bounding parameters of the second region to be mapped is a lower bound list, and step S540 includes:

By alternately comparing the lower bound parameter in the first area parameter list with the lower bound parameter in the second area parameter list, determine the first mapping position of the lower bound parameter in the first area parameter list in the lower bound list of the second area, the first mapping The position is the position corresponding to the parameter whose value in the lower bound list of the second area is not less than the lower bound parameter in the parameter list of the first area.

Starting from the first mapping position, determine the second mapping position of the upper bound parameter in the parameter list of the first area in the lower bound list of the second area through binary search, and the second mapping position is the value in the lower bound list of the second area The corresponding position of the parameter not greater than the upper bound parameter in the parameter list of the first area.

According to the first mapping position and the second mapping position, determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area.

In one embodiment, according to different preset sorting rules, the methods for determining the first mapping position and the second mapping position are respectively:

When the default sorting rule is to sort lower bound parameters in descending order, and the bound parameter list of the second area to be mapped is a lower bound list:

By alternately comparing the lower bound parameters in the first area parameter list and the lower bound parameters in the second area parameter list, it is determined that the corresponding position of the parameter whose value in the lower bound list of the second area is not greater than the lower bound parameter in the first area parameter list is the first Mapping position: starting from the first mapping position, through binary search, it is determined that the corresponding position of the parameter whose value in the lower bound list of the second area is not less than the upper bound parameter in the parameter list of the first area is set as the second mapping position.

When the default sorting rule is to sort the upper bound parameters in ascending order, and the bound parameter list of the second area to be mapped is the upper bound list:

By alternately comparing the upper bound parameter in the first area parameter list with the upper bound parameter in the second area parameter list, determine the parameter corresponding to the parameter whose value in the upper bound list of the second area is not smaller than the upper bound parameter in the first area parameter list The position is the first mapping position; starting from the first mapping position, through binary search, it is determined that the corresponding position of the parameter whose value in the upper bound list of the second area is not greater than the lower bound parameter in the first area parameter list is set as the second mapping position.

When the default sorting rule is to sort the upper bound parameters in descending order, and the bound parameter list of the second area to be mapped is the upper bound list:

By alternately comparing the upper bound parameter in the first area parameter list with the upper bound parameter in the second area parameter list, determine the parameter corresponding to the parameter whose value in the upper bound list of the second area is not greater than the upper bound parameter in the first area parameter list The position is the first mapping position; starting from the first mapping position, through binary search, it is determined that the corresponding position of the parameter whose value in the upper bound list of the second area is not less than the lower bound parameter in the first area parameter list is set as the second mapping position.

In an application example, for the convenience of understanding, the two areas are respectively named as the publishing area U and the subscription area S, wherein the range of the area U is [U _LB (lower bound), U _UB (upper bound)], and the range of S is [S _LB , S _UB ]. As shown in Figure 5, when U overlaps S, there are four cases in total. It is found that these four cases can be further divided into two cases, one is that the lower bound of U is located in region S, and the other is that the lower bound of S is located in U. According to in-depth research, two mutually exclusive sufficient and necessary conditions are provided to judge the overlapping relationship of regions:

U _LB ∈ [S _LB , S _UB ) (1)

S _LB ∈ [U _LB , U _UB ) (2)

Since the two conditions are mutually exclusive, only one of the conditions needs to be met to judge the overlapping relationship.

For the convenience of description, the lower bound of the subscription area is marked as SL, the upper bound of the ordered area is marked as SU, the published area is marked as U, the lower bound of the public area is marked as UL, and the upper bound of the public area is marked as UU. Assuming that U contains a set of order area lower bounds {SL _i , SL _i+1 , SL _i+2 , ..., SL _i+k }, the values i and i+k respectively represent the mapping of the upper and lower bounds of U to the SL list Introducing two parameters to indicate the corresponding position of the mapping interval, the lower bound of the comparison index (CIL) and the upper bound of the comparison index (CIU), which respectively represent the positions where the upper and lower bounds of U are mapped to the SL list, that is, the first mapping position and the second mapping position, i and i+k here. As shown in FIG. 7 , the CIL and CIU of the area [UL ₀ , UU ₀ ] are 2 and 5, respectively, and similarly, the CIL and CIU of the interval [SL ₀ , SU ₀ ] are 0 and 1, respectively. Therefore, the areas [SL ₂ , SU ₂ ], [SL ₃ , SU ₃ ], [SL ₄ , SU ₄ ] and [SL ₅ , SU ₅ ] have overlapping parameters with [UL ₀ , UU ₀ ), while [UL ₀ , UU ₀ ) and [UL ₁ , UU ₁ ) have overlapping parameters with [SL ₀ , SU ₀ ). When the CIL and CIU values of all announced and subscribed areas are obtained, the matching relationship of all areas on this dimension can be obtained. In the process of calculating the CIL and CIU values of each announced and ordered area, given that the lists SL and UL have Sorting, the CIL value is easily obtained by alternately comparing the value in SL with the value in UL. When calculating the CIU value, if the upper limit of the area is compared with the value in SL or UL one by one, calculating the CIU value of N areas will generate O(N ² ) computational complexity in the worst case. Since the SL and UL lists are sorted, binary search can efficiently locate the CIU value. Considering that the CIL value of the area has been determined, as the lower limit value of the area increases, the corresponding CIL value will also increase accordingly, so the search range will become smaller, and the computational complexity of obtaining the CIU of a single area is theoretically less than O( logN). Even in the worst case, the computational complexity of computing a single CIU value is O(logN).

As shown in FIG. 2, in one embodiment, step S700 includes step S720 and step S780.

Step S720, generating a coverage information matrix according to the first mapping interval and the second mapping interval.

The first mapping interval and the second mapping interval are used to determine whether two areas overlap, and the first mapping interval and the second mapping interval can determine the composition of the coverage information matrix.

As shown in FIG. 3 , in one embodiment, step S720 includes step S730 , step S750 and step S770 .

Step S730: Determine the number of rows and columns of the coverage information matrix according to the number of boundary parameters between the first area and the second area.

The first area can be composed of multiple publishing areas or multiple ordering areas. For the convenience of description, multiple independent publishing areas or ordering areas of the first area are referred to as sub-areas. Regions are independent entities. Each sub-area includes an upper bound parameter and a lower bound parameter, and the number of the upper bound parameter or the lower bound parameter is the number of sub-areas in the first area. Similarly, the number of sub-areas in the second area can be determined to cover the information matrix. The number of rows and columns is the same as the number of sub-regions in the first region and the second region. According to the number of boundary parameters between the first region and the second region, the number of rows and columns of the coverage information matrix is determined. Each element of the matrix is the first Overlapping information of a region and a second region.

In step S750, the id parameter list corresponding to the first mapping interval and the second mapping interval is obtained, and each component element of the coverage information matrix is determined according to the id parameter list.

The first mapping interval is the interval formed by the corresponding mapping positions of the upper bound parameter and the lower bound parameter of the first area parameter list in the second area parameter list, that is, the sub-area corresponding to this interval in the second area parameter list, and the first area The subregions where the upper and lower bound parameters of the parameter list overlap. The id parameter list is an auxiliary list used to store the corresponding id corresponding to each parameter in the first area and the id corresponding to each parameter in the second area. Each area corresponds to an id identifier to distinguish, and the coverage information matrix can be determined through the id parameter list The position of each component element of .

As shown in Figure 4, in one embodiment, step S750 includes:

Step S752, obtaining an initialized coverage information matrix and an id parameter list corresponding to the first mapping interval and the second mapping interval.

The initialized coverage information matrix means to initialize all the elements of the matrix, wherein the information corresponding to the initialized elements is that the parameters of the first area and the second area do not overlap. In an embodiment, "1" or "0" may be used to indicate overlapping or non-overlapping, or "true" or "false" may be used to indicate overlapping or non-overlapping.

Step S754, according to the first mapping interval and the corresponding id parameter list, update the corresponding elements of the first mapping interval in the initialized coverage information matrix to preset values.

Step S756, according to the second mapping interval and the corresponding id parameter list, update the corresponding elements in the updated coverage information matrix in the second mapping interval to preset values, so as to determine the constituent elements of the coverage information matrix.

In an application example, the number of the first area is M, the number of the second area is N, the M*N bit matrix is used to store the coverage information, and the matrix element value represents the coverage relationship between the first area and the second area , using "true" or "false" to indicate overlapping or non-overlapping, and each element of the initialized matrix is "false". The first mapping interval indicates the mapping position of each sub-area of the first area in the second area. For example, the mapping interval of the mapping position of the fifth sub-area of the first area in the second area is [4,8], then M* The elements corresponding to the fourth column to the eighth column of the fifth row of the N matrix are updated to "true". Similarly, the parameters of each row of the M*N matrix can be updated. The second mapping interval indicates the mapping position of each sub-area of the second area in the first area. Similarly, each column parameter of the M*N matrix can be updated, because the determined first mapping interval and the second mapping interval are judged There are two mutually exclusive sufficient and necessary conditions for the overlapping of the first area and the second area, so the second assignment of the coverage information unit according to the first mapping interval and the second mapping interval can determine the elements of the coverage information matrix, so that Get interest matching results.

Step S770, generating a coverage information matrix according to the number of rows and columns of the coverage information matrix and each component element of the coverage information matrix.

According to the number of rows and columns of the matrix, the basic composition of the matrix can be determined, each component element of the matrix can be obtained, and the initialized elements can be assigned and updated to generate the required coverage information matrix.

Step S780, according to the coverage information matrix, the interest matching result between the first area and the second area is obtained.

The coverage information matrix can intuitively record and characterize the interest matching results of the first area and the second area. Just by looking up the elements in the matrix, you can judge whether the sub-areas of the first area and the second area overlap, and get the interest matching results.

As shown in FIG. 3 , in one embodiment, step S780 includes step S790, respectively obtaining the constituent elements of the coverage information matrix of each dimension, and determining the first area and the second area according to the same constituent elements of the coverage information matrix of each dimension interest matching results.

In the application process, interest matching includes information of multiple dimensions, and the method of interest matching in each dimension is the same. By determining the intersection of elements in the same matrix position in multiple dimensions, the first area and the second area under multi-dimensionality can be judged The interest matching result of , that is, the interest matching result of the announcement area and the subscription area.

The interest matching algorithm proposed in this application adopts two mutually exclusive area overlap judgment conditions as the sufficient and necessary conditions for judging the matching relationship between the announcement area and the subscription area, aiming at reducing sorting overhead, avoiding unnecessary bit operations, and avoiding The overhead generated by filtering incorrect matches is only two lists of boundary values of length N to be sorted, which can significantly reduce the length or number of lists to be sorted. Moreover, two mutually exclusive judging conditions are used as the judging condition for the overlapping of two regions. If one of them is met, it can be determined that the two regions overlap, and the interest matching is successful. According to these two judging conditions, through binary search, the announcement can be obtained more quickly. The matching relationship between order areas does not need to rely on bit array operations.

In an application example, the subscription area is denoted as S, and the release area is denoted as U. By sorting the lower bound parameters in ascending order to obtain the interest matching results of the release area and the order area as an example, for illustration: for each dimension of the interest space, get For the boundary parameters of all announced areas and order areas, the lower bound parameters of all announced areas are sorted in ascending order, and the lower bound parameters of all ordered areas are sorted in ascending order, and four lists of boundary values can be obtained, as shown in Figure 6, which are SL , SU, UL, UU, where SL refers to the lower bound list of the subscription area in ascending order, the SU list stores the corresponding upper bound parameters of the subscription area, similarly, UL and UU are used to store the lower bound parameters and upper bound parameters of all published areas Boundary parameters. In addition, there are two auxiliary lists for storing corresponding publishing area ids and ordering area ids. Use the binary search method to find the comparison index upper bound (CIU) and comparison index lower bound (CIL) of each announcement area and order area, respectively, indicating that the upper and lower bounds of the announcement area or order area are mapped to the SL list or UL list As shown in Figure 7, taking the mapping of the upper and lower boundary parameters of the published area to the SL list as an example, first compare the UL and SL alternately, and quickly obtain the positions in which all the values in the UL list are mapped to the SL list. It is found that the mapping position corresponding to UL ₀ is SL ₂ . In the process of mapping [UU ₀ , UL ₀ ] to the SL list, you only need to use the binary search method to find the mapping position corresponding to UU _0. Since UU ₀ is greater than UL ₀ , the search range of UU ₀ is [[SL ₂ , SL _n ]. The binary search method is used to improve the search efficiency. By first obtaining the mapping position of UL ₀ on the SL, and then searching for the mapping position of UU ₀ on the SL, the search range is reduced and the search efficiency is further improved. The search result is CIU and CIL (first mapped location and second mapped location). By mapping each upper and lower boundary parameter of the announcement area to the SL list, and mapping each upper and lower boundary parameter of the subscription area to the UL list, the CIL and CIU of each announcement area and subscription area are obtained. The number of areas, build M*N coverage information matrix, M represents the number of sub-areas in the announcement area, N represents the number of sub-areas in the order area, each announcement sub-area corresponds to a row, each order sub-area corresponds to a column, and the matrix elements represent The coverage relationship between the announced and ordered areas, false means that the areas do not overlap, true means that the areas overlap, and all elements of the matrix are initialized to false. When the published area overlaps with an ordered area, the corresponding bit is set to true for storing matching information. For each published region and subscribed region, assign true to the corresponding position in the bit matrix according to their CIL and CIU values. By performing the above operations on each dimension, the final coverage information matrix can be obtained, and the interest matching result can be determined.

It should be understood that although the various steps in the flow charts of FIGS. 1-4 are displayed sequentially as indicated by the arrows, these steps are not necessarily executed sequentially in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least some of the steps in Figures 1-4 may include a plurality of sub-steps or stages, these sub-steps or stages are not necessarily performed at the same time, but may be performed at different times, these sub-steps or stages The order of execution is not necessarily performed sequentially, but may be performed alternately or alternately with at least a part of other steps or sub-steps or stages of other steps.

In one embodiment, as shown in FIG. 8 , an interest matching device is provided, which includes:

The boundary parameter acquisition module 100 is used to acquire the boundary parameters of the first area and the second area to be matched, and the boundary parameters include one-to-one corresponding upper bound parameter and lower bound parameter, wherein, the first area is the published area and the second area is The subscription area, or the first area is the subscription area and the second area is the publication area.

The parameter sorting processing module 300 is configured to sort the boundary parameters of the first area and the second area respectively according to preset sorting rules, and obtain the first area parameter list and the second area parameter list. The preset sorting rules include Sort the lower bound parameters or sort the upper bound parameters by numerical magnitude.

The mapping interval determination module 500 is configured to determine the upper bound parameter and the lower bound parameter of the first area parameter list in the second area according to the numerical value of each boundary parameter in the first area parameter list and the second area parameter list and the corresponding sorting position. The corresponding first mapping interval in the parameter list, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter in the second area parameter list in the first area parameter list.

The interest matching result determining module 700 is configured to determine the interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval.

In one embodiment, the mapping interval determination module 500 also includes:

The first mapping interval determination unit is configured to determine the boundary parameter list of the second area to be mapped according to the sorting boundary determined in the preset sorting rule, and determine the first area parameter list through alternate comparison and binary search according to the numerical value of the parameter. The upper bound parameter and the lower bound parameter in are in the first mapping interval corresponding to the bound parameter list of the second area.

The second mapping interval determination unit is configured to determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list.

In one embodiment, when the preset sorting rule is to sort the lower bound parameters in ascending order, the bound parameter list of the second area to be mapped is a lower bound list, and the first mapping interval determination unit includes:

The first mapping position determining subunit, by alternately comparing the lower bound parameter in the first area parameter list and the lower bound parameter in the second area parameter list, determines that the lower bound parameter in the first area parameter list is in the lower bound list of the second area The first mapping position, the first mapping position is the position corresponding to the parameter whose value in the lower bound list of the second area is not less than the lower bound parameter in the first area parameter list.

The second mapping position determining subunit is configured to determine the second mapping position of the upper bound parameter in the first area parameter list in the lower bound list of the second area by binary search starting from the first mapping position.

The first mapping interval determination subunit is configured to determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area according to the first mapping position and the second mapping position .

In one embodiment, the interest matching result determination module 700 includes:

a coverage information matrix generating unit, configured to generate a coverage information matrix according to the first mapping interval and the second mapping interval;

The interest matching result obtaining unit is configured to obtain the interest matching result between the first area and the second area according to the coverage information matrix.

In one embodiment, the coverage information matrix generation unit includes:

The number of rows and the number of columns of the matrix determine the subunit, which is used to determine the number of rows and the number of columns of the coverage information matrix according to the number of boundary parameters between the first area and the second area;

Each constituent element of the matrix determines a subunit, which is used to obtain an id parameter list corresponding to the first mapping interval and the second mapping interval, and determine each constituent element of the coverage information matrix according to the id parameter list;

The coverage information matrix generating subunit is configured to generate the coverage information matrix according to the number of rows and columns of the coverage information matrix and each component element of the coverage information matrix.

In one embodiment, each component element of the matrix determines a subunit, which is used to also obtain the initialized coverage information matrix and the id parameter list corresponding to the first mapping interval and the second mapping interval, according to the first mapping interval and the corresponding id parameter List, update the corresponding elements of the first mapping interval in the initialized coverage information matrix to preset values and the corresponding id parameter list, and update the corresponding elements of the second mapping interval in the updated coverage information matrix according to the second mapping interval as Preset values to determine the constituent elements of the coverage information matrix.

In one embodiment, the interest matching result acquisition unit is further configured to respectively acquire the constituent elements of the coverage information matrix of each dimension, and determine the interest matching between the first region and the second region according to the same constituent elements of the coverage information matrix of each dimension result.

The above interest matching device obtains the boundary parameters of the first region to be matched and the second region, and sorts the parameters by sorting the lower bound parameters according to the numerical value or sorting the upper bound parameters according to the numerical value, and sorts the parameters according to the parameter list The numerical value and location of the parameter determine the mapping interval of the upper bound parameter and lower bound parameter of the first area parameter list in the second area parameter list, and the upper bound parameter and lower bound parameter of the second area parameter list are in the first area parameter In the second mapping interval corresponding to the list, the accuracy of the matching result is improved by sorting the parameters, and the matching result of the interest is determined by the mapping result of the first area parameter and the second area parameter, which significantly reduces the length or number of the list to be sorted, and reduces Sorting overhead reduces the amount of data processing, thereby improving matching efficiency.

For the specific limitations of the interest matching device, please refer to the above definition of the interest matching method, which will not be repeated here. Each module in the above-mentioned interest matching device can be fully or partially realized by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, and can also be stored in the memory of the computer device in the form of software, so that the processor can invoke and execute the corresponding operations of the above-mentioned modules.

In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure may be as shown in FIG. 9 . The computer device includes a processor, a memory, a network interface, a display screen and an input device connected through a system bus. Wherein, the processor of the computer device is used to provide calculation and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal via a network connection. The computer program implements an interest matching method when executed by a processor. The display screen of the computer device may be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device may be a touch layer covered on the display screen, or a button, a trackball or a touch pad provided on the casing of the computer device , and can also be an external keyboard, touchpad, or mouse.

Those skilled in the art can understand that the structure shown in FIG. 9 is only a block diagram of a part of the structure related to the solution of this application, and does not constitute a limitation on the computer equipment on which the solution of this application is applied. The specific computer equipment can be More or fewer components than shown in the figures may be included, or some components may be combined, or have a different arrangement of components.

In one embodiment, a computer device is provided, including a memory, a processor, and a computer program stored on the memory and operable on the processor. When the processor executes the computer program, the following steps are implemented:

Obtain the boundary parameters of the first area and the second area to be matched, the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein, the first area is the publishing area and the second area is the subscription area, or the first area is Subscription area and the second area is the published area;

According to the preset sorting rules, the boundary parameters of the first area and the second area are respectively sorted to obtain the parameter list of the first area and the parameter list of the second area. The preset sorting rules include sorting the lower bound parameters according to the numerical value or Size sorts the upper bound parameter;

According to the numerical value of each boundary parameter in the first area parameter list and the second area parameter list and the corresponding sorting position, determine the first mapping corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the second area parameter list interval, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list;

According to the first mapping interval and the second mapping interval, an interest matching result between the first area and the second area is determined.

In one embodiment, the following steps are also implemented when the processor executes the computer program:

Determine the boundary parameter list of the second area to be mapped according to the sorting boundaries determined in the preset sorting rules;

According to the numerical value of the parameter, determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the boundary parameter list of the second area in the first area parameter list through alternate comparison and binary search;

Similarly, the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list is determined.

In one embodiment, when the preset sorting rule is to sort the lower bound parameters in ascending order, the boundary parameter list of the second area to be mapped is a lower bound list, and the processor also implements the following steps when executing the computer program:

Determine the first mapping position of the lower bound parameter in the first area parameter list in the lower bound list of the second area by alternately comparing the lower bound parameter in the first area parameter list with the lower bound parameter in the second area parameter list, the first mapping position It is the corresponding position of the parameter whose value in the lower bound list of the second area is not less than the lower bound parameter in the parameter list of the first area;

Taking the first mapping position as a starting point, through binary search, determine the second mapping position of the upper bound parameter in the first area parameter list in the lower bound list of the second area;

According to the first mapping position and the second mapping position, determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area.

In one embodiment, the following steps are also implemented when the processor executes the computer program:

generating a coverage information matrix according to the first mapping interval and the second mapping interval;

According to the coverage information matrix, an interest matching result between the first area and the second area is obtained.

In one embodiment, the following steps are also implemented when the processor executes the computer program:

Determine the number of rows and columns of the coverage information matrix according to the number of boundary parameters between the first area and the second area;

Obtain the id parameter list corresponding to the first mapping interval and the second mapping interval, and determine each component element of the coverage information matrix according to the id parameter list;

A coverage information matrix is generated according to the number of rows and columns of the coverage information matrix and each component element of the coverage information matrix.

In one embodiment, the following steps are also implemented when the processor executes the computer program:

Obtain the initialized coverage information matrix and the id parameter list corresponding to the first mapping interval and the second mapping interval;

Updating corresponding elements of the first mapping interval in the initialized coverage information matrix to preset values according to the first mapping interval and the corresponding id parameter list;

According to the second mapping interval and the corresponding id parameter list, the corresponding elements in the updated coverage information matrix in the second mapping interval are updated to preset values, so as to determine the constituent elements of the coverage information matrix.

In one embodiment, the following steps are also implemented when the processor executes the computer program:

The constituent elements of the coverage information matrix of each dimension are obtained respectively, and the interest matching results of the first region and the second region are determined according to the same constituent elements of the coverage information matrix of each dimension.

The above computer equipment for implementing the interest matching method obtains the boundary parameters of the first region to be matched and the second region, and sorts the lower bound parameters according to the numerical value or sorts the upper bound parameters according to the numerical value. Sorting, according to the numerical value and location of the parameters in the parameter list, determine the mapping interval of the upper bound parameter and lower bound parameter of the first area parameter list in the second area parameter list, and the upper bound parameter and lower bound of the second area parameter list The parameter is in the second mapping interval corresponding to the parameter list of the first area. By sorting the parameters, the accuracy of the matching result is improved, and the matching result of the interest is determined by the mapping result of the first area parameter and the second area parameter, which significantly reduces the list to be sorted The length or number of data can reduce the overhead of sorting, reduce the amount of data processing, and thus improve the matching efficiency.

In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

Obtain the boundary parameters of the first area and the second area to be matched, the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein, the first area is the publishing area and the second area is the subscription area, or the first area is Subscription area and the second area is the published area;

According to the preset sorting rules, the boundary parameters of the first area and the second area are respectively sorted to obtain the parameter list of the first area and the parameter list of the second area. The preset sorting rules include sorting the lower bound parameters according to the numerical value or Size sorts the upper bound parameter;

According to the numerical value of each boundary parameter in the first area parameter list and the second area parameter list and the corresponding sorting position, determine the first mapping corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the second area parameter list interval, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list;

According to the first mapping interval and the second mapping interval, an interest matching result between the first area and the second area is determined.

In one embodiment, when the computer program is executed by the processor, the following steps are also implemented:

Determine the boundary parameter list of the second area to be mapped according to the sorting boundaries determined in the preset sorting rules;

According to the numerical value of the parameter, determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the boundary parameter list of the second area in the first area parameter list through alternate comparison and binary search;

Similarly, the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list is determined.

In one embodiment, when the preset sorting rule is to sort the lower bound parameters in ascending order, the boundary parameter list of the second region to be mapped is a lower bound list, and the computer program is executed by the processor to further implement the following steps:

By alternately comparing the lower bound parameter in the first area parameter list with the lower bound parameter in the second area parameter list, determine the first mapping position of the lower bound parameter in the first area parameter list in the lower bound list of the second area, the first mapping The position corresponds to the parameter whose value in the lower bound list of the second area is not less than the lower bound parameter in the parameter list of the first area;

Taking the first mapping position as a starting point, through binary search, determine the second mapping position of the upper bound parameter in the first area parameter list in the lower bound list of the second area;

According to the first mapping position and the second mapping position, determine the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area.

In one embodiment, when the computer program is executed by the processor, the following steps are also implemented:

generating a coverage information matrix according to the first mapping interval and the second mapping interval;

According to the coverage information matrix, an interest matching result between the first area and the second area is obtained.

In one embodiment, when the computer program is executed by the processor, the following steps are also implemented:

Determine the number of rows and columns of the coverage information matrix according to the number of boundary parameters between the first area and the second area;

Obtain the id parameter list corresponding to the first mapping interval and the second mapping interval, and determine each component element of the coverage information matrix according to the id parameter list;

A coverage information matrix is generated according to the number of rows and columns of the coverage information matrix and each component element of the coverage information matrix.

In one embodiment, when the computer program is executed by the processor, the following steps are also implemented:

Obtain the initialized coverage information matrix and the id parameter list corresponding to the first mapping interval and the second mapping interval;

Updating corresponding elements of the first mapping interval in the initialized coverage information matrix to preset values according to the first mapping interval and the corresponding id parameter list;

According to the second mapping interval and the corresponding id parameter list, the corresponding elements in the updated coverage information matrix in the second mapping interval are updated to preset values, so as to determine the constituent elements of the coverage information matrix.

In one embodiment, when the computer program is executed by the processor, the following steps are also implemented:

The constituent elements of the coverage information matrix of each dimension are obtained respectively, and the interest matching results of the first region and the second region are determined according to the same constituent elements of the coverage information matrix of each dimension.

The above-mentioned storage medium used to implement the interest matching method obtains the boundary parameters of the first region to be matched and the second region, and sorts the lower bound parameters according to the numerical value or sorts the upper bound parameters according to the numerical value. Sorting, according to the numerical value and location of the parameters in the parameter list, determine the mapping interval of the upper bound parameter and lower bound parameter of the first area parameter list in the second area parameter list, and the upper bound parameter and lower bound of the second area parameter list The parameter is in the second mapping interval corresponding to the parameter list of the first area. By sorting the parameters, the accuracy of the matching result is improved, and the matching result of the interest is determined by the mapping result of the first area parameter and the second area parameter, which significantly reduces the list to be sorted The length or number of data can reduce the overhead of sorting, reduce the amount of data processing, and thus improve the matching efficiency.

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be implemented through computer programs to instruct related hardware. The computer programs can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it may include the procedures of the embodiments of the above-mentioned methods. Wherein, any references to memory, storage, database or other media used in the various embodiments provided in the present application may include non-volatile and/or volatile memory. Nonvolatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Chain Synchlink DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

The technical features of the above embodiments can be combined arbitrarily. To make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be It is considered to be within the range described in this specification.

The above examples only express several implementation modes of the present application, and the description thereof is relatively specific and detailed, but should not be construed as limiting the scope of the patent for the invention. It should be noted that those skilled in the art can make several modifications and improvements without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the scope of protection of the patent application should be based on the appended claims.

Claims (10)

1. An interest matching method, characterized in that the method comprises: Obtain boundary parameters of the first area to be matched and the second area, where the boundary parameters include one-to-one corresponding upper bound parameters and lower bound parameters, wherein the first area is a publishing area and the second area is a subscription area , or the first area is a subscription area and the second area is a publishing area; Sorting the boundary parameters of the first area and the second area respectively according to a preset sorting rule to obtain a first area parameter list and a second area parameter list, the preset sorting rule includes sorting the lower bound parameters according to the numerical value Sort or sort the upper bound parameters according to their numerical value; According to the numerical value and the corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list, determine the upper bound parameter and the lower bound parameter of the first area parameter list in the second area parameter list The corresponding first mapping interval in the first area parameter list, and determine the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list; Determine an interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval. 2. The interest matching method according to claim 1, characterized in that, according to the numerical value and corresponding sorting position of each boundary parameter in the first area parameter list and the second area parameter list, determine the first The upper bound parameter and the lower bound parameter of an area parameter list are in the first mapping interval corresponding to the second area parameter list, and the upper bound parameter and the lower bound parameter of the second area parameter list are determined in the first area parameter list The corresponding second mapping interval in the list includes: determining a boundary parameter list of the second area to be mapped according to the sorting boundary determined in the preset sorting rule; According to the numerical value of the parameter, the first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area is determined through alternate comparison and binary search; Similarly, the second mapping interval corresponding to the upper bound parameter and the lower bound parameter of the second area parameter list in the first area parameter list is determined. 3. The interest matching method according to claim 2, wherein when the preset sorting rule is to sort the lower bound parameters in ascending order, the boundary parameter list of the second area to be mapped is a lower bound list, and the parameter according to The value of the upper bound parameter and the lower bound parameter in the first area parameter list are determined by alternate comparison and binary search, and the corresponding first mapping interval in the boundary parameter list of the second area includes: By alternately comparing the lower bound parameters in the first area parameter list with the lower bound parameters in the second area parameter list, it is determined that the lower bound parameter in the first area parameter list is the first in the lower bound list in the second area. Mapping position, the first mapping position is the position corresponding to the parameter whose value in the lower bound list of the second area is not less than the lower bound parameter in the parameter list of the first area; Using the first mapping position as a starting point, determine a second mapping position of the upper bound parameter in the first area parameter list in the lower bound list of the second area through binary search; According to the first mapping position and the second mapping position, determine a first mapping interval corresponding to the upper bound parameter and the lower bound parameter in the first area parameter list in the boundary parameter list of the second area. 4. The interest matching method according to claim 1, wherein the interest matching result between the first area and the second area is determined according to the first mapping interval and the second mapping interval include: generating a coverage information matrix according to the first mapping interval and the second mapping interval; According to the coverage information matrix, an interest matching result between the first area and the second area is obtained. 5. The interest matching method according to claim 4, wherein said generating a coverage information matrix according to said first mapping interval and said second mapping interval comprises: determining the number of rows and columns of the coverage information matrix according to the number of boundary parameters between the first area and the second area; Obtain an id parameter list corresponding to the first mapping interval and the second mapping interval, and determine each component element of the coverage information matrix according to the id parameter list; A coverage information matrix is generated according to the number of rows and columns of the coverage information matrix and each component element of the coverage information matrix. 6. The interest matching method according to claim 5, wherein the acquisition of the id parameter list corresponding to the first mapping interval and the second mapping interval determines the coverage information according to the id parameter list The elements of the matrix include: Obtain an initialized coverage information matrix and an id parameter list corresponding to the first mapping interval and the second mapping interval; Updating corresponding elements of the first mapping interval in the initialized coverage information matrix to preset values according to the first mapping interval and the corresponding id parameter list; According to the second mapping interval and the corresponding id parameter list, update the corresponding elements in the second mapping interval in the updated coverage information matrix to the preset values, so as to determine the constituent elements of the coverage information matrix. 7. The interest matching method according to claim 4, wherein the obtaining the interest matching result of the first area and the second area according to the coverage information matrix comprises: The constituent elements of the coverage information matrix of each dimension are obtained respectively, and the interest matching results of the first region and the second region are determined according to the same constituent elements of the coverage information matrix of each dimension. 8. An interest matching device, characterized in that the device comprises: The boundary parameter acquisition module is used to acquire the boundary parameters of the first area to be matched and the second area, and the boundary parameters include a one-to-one corresponding upper bound parameter and lower bound parameter, wherein the first area is a published area and the The second area is a subscription area, or the first area is a subscription area and the second area is a publication area; A parameter sorting processing module, configured to sort the boundary parameters of the first region and the second region respectively according to a preset sorting rule, and obtain a first region parameter list and a second region parameter list, and the preset sorting rule includes Sort the lower bound parameters according to the numerical value or sort the upper bound parameters according to the numerical value; A mapping interval determination module, configured to determine the upper bound parameter and the lower bound parameter of the first area parameter list according to the numerical value of each boundary parameter in the first area parameter list and the second area parameter list and the corresponding sorting position. The corresponding first mapping interval in the second area parameter list, and determine the second mapping interval corresponding to the upper bound parameter and lower bound parameter of the second area parameter list in the first area parameter list; An interest matching result determining module, configured to determine an interest matching result between the first area and the second area according to the first mapping interval and the second mapping interval. 9. A computer device, comprising a memory and a processor, the memory stores a computer program, wherein the steps of the method according to any one of claims 1 to 7 are realized when the processor executes the computer program . 10. A computer-readable storage medium, on which a computer program is stored, characterized in that, when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.