CN108829932A

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

Info

Publication number: CN108829932A
Application number: CN201810492258.6A
Authority: CN
Inventors: 唐文杰; 姚益平; 朱峰; 李田林; 曲庆军; 姚锋; 张孟
Original assignee: National University of Defense Technology
Current assignee: National University of Defense Technology
Priority date: 2018-05-22
Filing date: 2018-05-22
Publication date: 2018-11-16
Anticipated expiration: 2038-05-22
Also published as: CN108829932B

Abstract

The application relates to an interest matching method, an interest matching device, a computer device and a storage medium. The method comprises the following steps: the method comprises the steps of obtaining boundary parameters of a first area and a second area to be matched, sorting the boundary parameters according to a preset sorting rule, obtaining parameter lists respectively, determining a first mapping interval of an upper boundary parameter and a lower boundary parameter of the first area parameter list in the second area parameter list according to the numerical value of each boundary parameter in the parameter lists and the corresponding sorting position, determining a second mapping interval of the upper boundary parameter and the lower boundary parameter of the second area parameter list in the first area parameter list, and determining interest matching results of the first area and the second area according to the first mapping interval and the second mapping interval. The accuracy of the matching result is improved by sorting the parameters, and the interest matching result is judged by the mapping result, so that the length or the number of the list to be sorted is obviously reduced, the sorting overhead is reduced, the data processing capacity is reduced, and the matching efficiency is improved.

Description

Interest matching process, device, computer equipment and storage medium

Technical field

This application involves technical field of data processing, more particularly to a kind of interest matching process, device, computer equipment And storage medium.

Background technique

In distributed emulation, a large amount of incoherent data transmission will be generated based on the communication of announcement/order, to reduce Simulation run performance.HLA (High Level Architecture, High Level Architecture) standard provides data distribution management clothes Business is transmitted to filter unnecessary data, reduces the communication overhead between federation.Data producer utilizes data distribution management service Safeguard that it sends the attribute (announce region) of data, and data consumer can use data distribution management service to specify him Data requirements (order region).Then, run time infrastructure is according to the interest matching relationship in these regions by the producer's Data distribution is to data consumer.Therefore, interest matching plays key effect in data distribution management.

However, traditional interest matching process based on region, based on modes such as grids mainly by realizing, it is emerging realizing While interesting matching result, it there is a problem that matching efficiency is lower.

Summary of the invention

Based on this, it is necessary to which, for the lower technical problem of interest matching efficiency, providing one kind can be improved interest matching Interest matching process, device, computer equipment and the storage medium of efficiency.

A kind of interest matching process, the method includes：

The boundary parameter of first area and second area to be matched is obtained, the boundary parameter includes on one-to-one Boundary's parameter and lower bound parameter, wherein the first area is to announce region and the second area is to order region or described the One region is order region and the second area is to announce region；

According to predetermined order rule, the boundary parameter of the first area and second area is ranked up respectively, is obtained First area parameter list and second area parameter list, the predetermined order rule includes according to numerical values recited to lower bound parameter It is ranked up or upper bound parameter is ranked up according to numerical values recited；

According to the numerical values recited of each boundary parameter in the first area parameter list and second area parameter list and Corresponding sorting position, the upper bound parameter and lower bound parameter for determining the first area parameter list are in the second area parameter Corresponding first mapping range in list, and the upper bound parameter and lower bound parameter that determine the second area parameter list are described Corresponding second mapping range in the parameter list of first area；

According to first mapping range and second mapping range, the first area and the second area are determined Interest matching result.

It is described according to each in the first area parameter list and second area parameter list in one of the embodiments, The numerical values recited of boundary parameter and corresponding sorting position determine the upper bound parameter and lower bound of the first area parameter list Parameter corresponding first mapping range in the second area parameter list, and determine the upper of the second area parameter list Boundary's parameter and lower bound parameter corresponding second mapping range in the first area parameter list includes：

According to the sequence boundary determined in the predetermined order rule, the boundary parameter column of second area to be mapped are determined Table；

According to the numerical values recited of parameter, determined in the first area parameter list by alternately comparing with binary chop Upper bound parameter and lower bound parameter corresponding first mapping range in the boundary parameter list of the second area；

Similarly, the upper bound parameter and lower bound parameter for determining the second area parameter list are arranged in the first area parameter Corresponding second mapping range in table.

In one of the embodiments, when predetermined order rule is to be ranked up according to ascending order to lower bound parameter, wait reflect The boundary parameter list for the second area penetrated is lower bound list, the numerical values recited according to parameter, by alternately comparing and two Divide the upper bound parameter searched determine in the first area parameter list and lower bound parameter in the boundary parameter of the second area Corresponding first mapping range includes in list：

By in the lower bound parameter and the second area parameter list in the alternately first area parameter list Lower bound parameter, determine first the reflecting in the lower bound list of second area of the lower bound parameter in the first area parameter list Penetrate position；First mapping position is that numerical value is arranged not less than the first area parameter in the lower bound list of the second area The parameter corresponding position of lower bound parameter in table；

Using first mapping position as starting point, by binary chop, determine upper in the first area parameter list Second mapping position of boundary's parameter in the lower bound list of second area；

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

It is described according to first mapping range and second mapping range in one of the embodiments, determine institute It states first area and the interest matching result of the second area includes：

According to first mapping range and second mapping range, coverage information matrix is generated；

According to the coverage information matrix, the interest matching result of the first area Yu the second area is obtained.

Described according to first mapping range and second mapping range in one of the embodiments, generation is covered Lid information matrix includes：

According to the boundary parameter quantity of the first area and the second area, the row of the coverage information matrix is determined Several and columns；

Obtain first mapping range corresponding with second mapping range id (identification, identity mark Know) parameter list, each component of the coverage information matrix is determined according to the id parameter list；

It is raw according to the line number of the coverage information matrix and columns and each component of the coverage information matrix At coverage information matrix.

It is described in one of the embodiments, to obtain first mapping range id corresponding with second mapping range Parameter list, each component for determining the coverage information matrix according to the id parameter list include：

Coverage information matrix and first mapping range for obtaining initialization are corresponding with second mapping range Id parameter list；

It, will be in the coverage information matrix of the initialization according to first mapping range and corresponding id parameter list The corresponding element of first mapping range is updated to preset value；

According to second mapping range and corresponding id parameter list, by the coverage information matrix of the update The corresponding element of two mapping ranges is updated to the preset value, with each component of the determination coverage information matrix.

It is described according to the coverage information matrix in one of the embodiments, obtain the first area and described the The interest matching result in two regions includes：

The component of the coverage information matrix of each dimension is obtained respectively, and according to the coverage information matrix of each dimension Same composition element determine the interest matching result of the first area Yu the second area.

A kind of interest coalignment, described device include：

Boundary parameter obtains module, for obtaining the boundary parameter of first area and second area to be matched, the side Boundary's parameter includes one-to-one upper bound parameter and lower bound parameter, wherein the first area is to announce region and described second Region is order region or the first area is order region and the second area is to announce region；

Parameter marshalling processing module, for according to predetermined order rule, respectively to the first area and second area Boundary parameter is ranked up, and obtains first area parameter list and second area parameter list, and the predetermined order rule includes Lower bound parameter is ranked up according to numerical values recited or upper bound parameter is ranked up according to numerical values recited；

Mapping range determining module, for according to each side in the first area parameter list and second area parameter list The numerical values recited of boundary's parameter and corresponding sorting position determine the upper bound parameter and lower bound ginseng of the first area parameter list Number the first mapping range corresponding in the second area parameter list, and determine the upper bound of the second area parameter list Parameter and lower bound parameter corresponding second mapping range in the first area parameter list；

Interest matching result determining module, for determining according to first mapping range and second mapping range The interest matching result of the first area and the second area.

A kind of computer equipment, including memory and processor, the memory are stored with computer program, the processing Following steps when device executes the computer program.

A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor Following steps are realized when row.

Above-mentioned interest matching process, device, computer equipment and storage medium, by obtain first area to be matched with The boundary parameter of second area, and use and lower bound parameter is ranked up according to numerical values recited or the upper bound is joined according to numerical values recited Number, which is ranked up, is ranked up parameter, according to the numerical values recited of parameter in parameter list and position, determines first area Mapping range and second area parameter column of the upper bound parameter and lower bound parameter of parameter list in second area parameter list The upper bound parameter and lower bound parameter of table corresponding second mapping range in the parameter list of first area, by being mentioned to parameter marshalling High matching result accuracy, and determine that interest matches knot with the mapping result of second area parameter by first area parameter Fruit, substantially reduces length or number to sorted lists, reduces sequence expense, reduces data processing amount, to improve With efficiency.

Detailed description of the invention

Fig. 1 is the flow diagram of interest matching process in the application one embodiment；

Fig. 2 is the flow diagram of interest matching process in another embodiment of the application；

Fig. 3 is the flow diagram of interest matching process in another embodiment of the application；

Fig. 4 is the flow diagram of the step S750 of interest matching process in the application one embodiment；

Fig. 5 is the principle of classification schematic diagram of interest matching process in one application example of the application；

Fig. 6 is the parameter marshalling list schematic diagram of interest matching process in one application example of the application；

Fig. 7 is the parameter mapping position schematic diagram of interest matching process in one application example of the application；

Fig. 8 is the structural block diagram of interest coalignment in the application one embodiment；

Fig. 9 is the internal structure chart of computer equipment in the application one embodiment.

Specific embodiment

It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not For limiting the application.

Distributed Interactive Simulation Environment is the product that emulation technology and network technology combine, and the emulation by being dispersed in various regions is set It is standby to be interconnected by local area network or wide area network.Due to the superiority and practicability of Distributed Interactive Simulation itself, at present The non-military field such as education, medical treatment, business is promoted the use of using research and development by military field.With simulation scale expansion and The data traffic of the raising of simulation accuracy, artificial network increasingly expands.In distributed emulation, based on the communication of announcement/order A large amount of incoherent data transmission will be generated, to reduce simulation run performance.HLA standard provides data distribution management (Data Distribution Management, abbreviation DDM) service filters the transmission of unnecessary data, reduce it is federal between communication open Pin.Data producer safeguards that it sends the attribute of data (announcing region) using DDM service, and data consumer can use Their data requirements (order region) is specified in DDM service.Then, RTI (Run-Time Infrastructure, operation branch Pushing out ring border) according to the interest matching relationship in these regions by the data distribution of the producer to data consumer.Therefore, interest matches Key effect is played in data distribution management.Not interested matching mechanisms can generate a large amount of unnecessary data distributions, this will It is serious to reduce simulation run performance.But if without efficient interest matching algorithm, simulation run performance equally also be will receive It influences.

In one embodiment, as shown in Figure 1, providing a kind of interest matching process, method includes：

Step S100, obtains the boundary parameter of first area and second area to be matched, and boundary parameter includes one a pair of The upper bound parameter and lower bound parameter answered, wherein first area is announcement region and second area is to order region or first area For order region and second area is to announce region.

In federation's emulation, region refers to the limitation range of received data with the data that can be sent, and federal member can To define the interest for stating oneself to RTI by region, including the limitation item for the data wishing received data and can sending Part.Region includes announcing region and ordering region, orders region by defining path spacing coordinate section and orders federation to express The data requirements of member announces region by defining path spacing coordinate section to safeguard the attribute for sending data, first area It can refer to order region and may also mean that and announce region, be region to be matched due to ordering region and announcing region, therefore when the One region is that second area is to order region when announcing region, and first area is that second area is to announce region when ordering region. First area and second area have several parameters to constitute, including the corresponding lower bound parameter of minimum value and maximum value it is corresponding on Boundary's parameter.It is appreciated that first area is not limited to a region, it is the general designation of same class region (order or announce), the One region may include several similar subregions, and same sub-regions upper bound parameter and lower bound parameter correspond.

Step S300 is respectively ranked up the boundary parameter of first area and second area according to predetermined order rule, First area parameter list and second area parameter list are obtained, predetermined order rule includes according to numerical values recited to lower bound parameter It is ranked up or upper bound parameter is ranked up according to numerical values recited.

It include several subregions in first area, each subregion includes upper bound parameter and lower bound parameter, by preset Ordering rule is such as ranked up lower bound parameter according to numerical values recited to the boundary parameter of first area and second area respectively, Since upper bound parameter and lower bound parameter correspond, when being ranked up to lower bound parameter according to numerical values recited, upper bound region Correspondence rearranges, and obtains parameter list, parameter list include ascending or descending order arrangement lower parameter list and it is corresponding on Parameter list can similarly be ranked up upper bound parameter according to ascending or descending order, obtain first area parameter list and the secondth area Field parameter list.

Step S500, according to the numerical values recited of each boundary parameter in first area parameter list and second area parameter list And corresponding sorting position, the upper bound parameter and lower bound parameter for determining first area parameter list are in second area parameter list In corresponding first mapping range, and determine second area parameter list upper bound parameter and lower bound parameter in first area parameter Corresponding second mapping range in list.

Mapping range refers to the section that mapping position of the bound parameter in correspondence parameter list to be mapped is constituted, citing For, the bound parameter of first area is mapped to the parameter list of second area, the determination method of mapping range is：First The mapping position of the upper bound parameter in region is to be not less than the maximum parameter of the upper bound parameter in second area parameter list to be mapped Corresponding position, the mapping position of the lower bound parameter of first area are to be greater than or equal to be somebody's turn to do in second area parameter list to be mapped The mapping position of the corresponding position of the minimum parameter of lower bound parameter, upper and lower parameter constitutes mapping range.

Step S700 determines the interest of first area and second area according to the first mapping range and the second mapping range Matching result.

According to decision condition, in order to obtain match information, core work is which public affairs determining each order region contains The lower bound in cloth region and each region of announcing contain the lower bound which orders region, i.e., corresponding mapping range.Pass through One mapping range and the second mapping range, it can be determined that whether two regions are overlapped, to obtain interest matching result.

Above-mentioned interest matching process by obtaining the boundary parameter of first area and second area to be matched, and uses Lower bound parameter is ranked up according to numerical values recited or upper bound parameter is ranked up according to numerical values recited, parameter is ranked up, According to the numerical values recited of parameter in parameter list and position, the upper bound parameter and lower bound ginseng of first area parameter list are determined The upper bound parameter and lower bound parameter of mapping ranges and second area parameter list of the number in second area parameter list are the Corresponding second mapping range in one region parameter list and is passed through by improving matching result accuracy to parameter marshalling The mapping result of first area parameter and second area parameter determines interest matching result, substantially reduces the length to sorted lists Degree or number reduce sequence expense, data processing amount are reduced, to improve matching efficiency.

As shown in Fig. 2, in one embodiment, step S500 includes：

Step S520 determines the boundary of second area to be mapped according to the sequence boundary determined in predetermined order rule Parameter list.

Ordering rule includes being ranked up according to ascending or descending order to lower bound parameter, or join according to ascending or descending order to the upper bound Number is ranked up, and according to determining ordering rule, can determine that sequence boundary is the upper bound or lower bound.Sort boundary with it is to be mapped The corresponding boundary of boundary parameter list is identical, and when boundary of sorting is the upper bound, boundary parameter list to be mapped is upper bound list.

Step S540 determines that first area parameter arranges with binary chop by alternately comparing according to the numerical values recited of parameter Upper bound parameter and lower bound parameter in table corresponding first mapping range in the boundary parameter list of second area.

Similarly, determine that upper bound parameter and the lower bound parameter of second area parameter list are corresponding in the parameter list of first area The second mapping range.

Binary chop is also referred to as binary search, is a kind of higher lookup method of efficiency, and binary search requires linear list necessary Using sequential core-pulling, and element according to keywords ordered arrangement in table, it is assumed that the lower bound list of second area to be mapped Middle element is arranged by ascending order, by the upper bound parameter value ratio of the parameter value of lower bound list middle position record and first area Compared with if the two is equal, which is the upper bound parameter mapping position, if the parameter list value is big It is less than dividing value on this in the adjacent parameter list value of dividing value on this and the parameter list value, then the adjacent parameter list value corresponds to position It is set to parameter mapping position on this, to search successfully；Otherwise it is recorded using middle position and table is divided into former and later two sublists, such as The parameter value of fruit middle position record is greater than the upper bound parameter value, then previous sublist is further searched for, after otherwise further searching for One sublist repeats above procedure, the record until finding the condition of satisfaction.

In one embodiment, to be mapped when predetermined order rule is to be ranked up according to ascending order to lower bound parameter The boundary parameter list of second area is lower bound list, and step S540 includes：

By alternately comparing the lower bound ginseng in lower bound parameter and second area parameter list in the parameter list of first area Number, determines first mapping position of the lower bound parameter in the lower bound list of second area in the parameter list of first area, first Mapping position is the parameter pair that numerical value is not less than the lower bound parameter in the parameter list of first area in the lower bound list of second area Answer position.

Using the first mapping position as starting point, by binary chop, determine that the upper bound parameter in the parameter list of first area exists The second mapping position in the lower bound list of second area, the second mapping position are that numerical value is little in the lower bound list of second area The parameter corresponding position of upper bound parameter in the parameter list of first area.

According to the first mapping position and the second mapping position, upper bound parameter and the lower bound in the parameter list of first area are determined Parameter corresponding first mapping range in the boundary parameter list of second area.

In one embodiment, according to different predetermined order rules, the first mapping position and the second mapping position are really The method of determining is respectively：

When predetermined order rule is to be ranked up according to descending to lower bound parameter, the boundary ginseng of second area to be mapped When ordered series of numbers table is lower bound list：

By alternately comparing the lower bound ginseng in lower bound parameter and second area parameter list in the parameter list of first area Number, the parameter for determining that numerical value is not more than the lower bound parameter in the parameter list of first area in the lower bound list of second area correspond to position It is set to the first mapping position；Using the first mapping position as starting point, by binary chop, number in the lower bound list of second area is determined Parameter corresponding position position second mapping position of the value not less than the upper bound parameter in the parameter list of first area.

When predetermined order rule is to be ranked up according to ascending order to upper bound parameter, the boundary ginseng of second area to be mapped When ordered series of numbers table is upper bound list：

By alternately comparing the upper bound ginseng in upper bound parameter and second area parameter list in the parameter list of first area Number, the parameter for determining that numerical value is not less than the upper bound parameter in the parameter list of first area in the upper bound list of second area correspond to position It is set to the first mapping position；Using the first mapping position as starting point, by binary chop, number in the upper bound list of second area is determined Parameter corresponding position position second mapping position of the value no more than the lower bound parameter in the parameter list of first area.

When predetermined order rule is to be ranked up according to descending to upper bound parameter, the boundary ginseng of second area to be mapped When ordered series of numbers table is upper bound list：

By alternately comparing the upper bound ginseng in upper bound parameter and second area parameter list in the parameter list of first area Number, the parameter for determining that numerical value is not more than the upper bound parameter in the parameter list of first area in the upper bound list of second area correspond to position It is set to the first mapping position；Using the first mapping position as starting point, by binary chop, number in the upper bound list of second area is determined Parameter corresponding position position second mapping position of the value not less than the lower bound parameter in the parameter list of first area.

In an application example, for convenience of understanding, two regions is respectively designated as announcing region U and order region S, Wherein, the range of region U is [U_LB(lower bound), U_UB(upper bound)], the range of S is [S_LB, S_UB].As shown in figure 5, when U is Chong Die with S When, there are four types of situations in total.The study found that these four situations can be further divided into two kinds of situations, one is the lower bounds of U to be located at In the S of region, another kind is that the lower bound of S is located in U.According to further investigation, the abundant necessary condition for providing two mutual exclusions is come Judge the overlapping relation in region：

U_LB∈[S_LB, S_UB) (1)

S_LB∈[U_LB, U_UB) (2)

Since two conditions are mutual exclusions, it is only necessary to meet wherein any one condition, it can for judging that overlapping is closed System.

For convenience of description, it orders region of down bound and is denoted as SL, order region of upper bound and be denoted as SU, announce region and be denoted as U, announce area Domain lower bound is denoted as UL, announces region of upper bound and is denoted as UU.Assuming that U contains one group of order region of down bound { SL_i, SL_i+1, SL_i+2..., SL_i+k, value i and i+k have respectively represented the position being mapped to the dividing value up and down of U in SL list, introduce two parameter expressions and reflect Section corresponding position is penetrated, index lower bound (CIL) is compared and compares the index upper bound (CIU), respectively indicates and maps the dividing value up and down of U Position onto SL list, i.e. the first mapping position and the second mapping position, referred to herein as i and i+k.As shown in fig. 7, region [UL₀, UU₀] CIL and CIU be 2 and 5, equally, section [SL respectively₀, SU₀] CIL and CIU be 0 and 1 respectively.Therefore, region [SL₂, SU₂], [SL₃, SU₃], [SL₄, SU₄] and [SL₅, SU₅] and [UL₀, UU₀) there are Overlapping parameters, and [UL₀, UU₀) and [UL₁, UU₁) and [SL₀, SU₀) there are Overlapping parameters.When obtaining CIL the and CIU value of all announcements and order region, can obtain Matching relationship of all areas on this is one-dimensional is obtained, during calculating CIL the and CIU value of each announcement and order region, It is ranked in view of list SL and UL, by the way that the value in SL can be obtained easily compared with the value in UL carries out alternately CIL value.When calculating CIU value, if by the upper limit in region and the value in SL or UL one by one compared with, calculate the CIU value in N number of region O (N will be generated in worst case²) computation complexity.Since SL and UL list has sequenced sequence, binary chop can effectively be determined CIU value is arrived in position.In view of region CIL value it has been determined that with region of down bound value increase, corresponding CIL value also can be corresponding Ground becomes larger, so search range can become smaller, obtains and is less than O (logN) in the theory of computational complexity of the CIU in single region.Even if In the worst case, the computation complexity for calculating single CIU value is O (logN).

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

Step S720 generates coverage information matrix according to the first mapping range and the second mapping range.

First mapping range and the second mapping range are for judging whether two regions are overlapped, the first mapping range and second Mapping range can determine the composition of coverage information matrix.

As shown in figure 3, step S720 includes step S730, step S750 and step in one of the embodiments, S770。

Step S730 determines the line number of coverage information matrix according to the boundary parameter quantity of first area and second area And columns.

First area can be made of multiple announcement regions or multiple order regions, for convenience of describing, hereinafter referred to as the firstth area Region is ordered as subregion in multiple independent announcement regions in domain, it is emphasized that, each announcement region or order region It is all independent individual.Each subregion includes a upper bound parameter and a lower bound parameter, upper bound parameter or lower bound parameter Quantity is the quantity of the subregion of first area, similarly, it may be determined that the quantity of the subregion of second area, coverage information matrix Line number and columns, it is identical as the subregion quantity of first area and second area, according to the side of first area and second area Boundary's number of parameters determines the line number and columns of coverage information matrix, each element, that is, first area of matrix and the weight of second area Folded information.

Step S750 obtains the first mapping range id parameter list corresponding with the second mapping range, is arranged according to id parameter Table determines each component of coverage information matrix.

The upper bound parameter and lower bound parameter that first mapping range is first area parameter list are in second area parameter list In the section that constitutes of corresponding mapping position, i.e., the corresponding subregion in the section in second area parameter list, with first area The upper bound parameter of parameter list and the subregion where lower bound parameter have lap.Id parameter list is corresponding for storing The auxiliary list of each parameter in first area corresponding id and the corresponding id of each parameter of second area, each region correspond to an id Mark can determine the position of each component of coverage information matrix by id parameter list to distinguish.

As shown in figure 4, step S750 includes in one of the embodiments,：

Step S752, coverage information matrix and the first mapping range for obtaining initialization are corresponding with the second mapping range Id parameter list.

The coverage information matrix of initialization, which refers to, initializes all elements of matrix, wherein the element of initialization Corresponding information is that first area and the parameter of second area be not be overlapped.In embodiment, overlapping can be indicated with " 1 " or " 0 " With it is not be overlapped, or with " true " or " false " indicate overlapping with it is not be overlapped.

Step S754, according to the first mapping range and corresponding id parameter list, by the coverage information matrix of initialization In the corresponding element of the first mapping range be updated to preset value.

Step S756 will be in the coverage information matrix of update according to the second mapping range and corresponding id parameter list The corresponding element of second mapping range is updated to preset value, to determine each component of coverage information matrix.

In an application example, the quantity of first area is M, and the quantity of second area is N, and the bit matrix of M*N is used for Store coverage information, matrix element value indicates the covering relation between first area and second area, using " true " or " false " indicate overlapping with it is not be overlapped, each element of the matrix of initialization is " false ".First mapping range indicates first The all subregion in region second area mapping position, such as first area the 5th sub-regions second area mapping The mapping range of position is [4,8], then the 4th column of the 5th row of M*N matrix to the corresponding element of the 8th column is updated to " true ", Similarly, every a line parameter of M*N matrix can be updated.Second mapping range indicates all subregion of second area first Each column parameter of M*N matrix can be similarly updated by the mapping position in region, due to determining the first mapping range and Second mapping range is two sufficient and necessary conditions for judging the first area mutual exclusion Chong Die with second area, so according to first Mapping range and the second mapping range carry out secondary assignment to coverage information element, that is, can determine each composition of coverage information matrix Element, to obtain interest matching result.

Step S770 is raw according to the line number of coverage information matrix and columns and each component of coverage information matrix At coverage information matrix.

According to the line number and columns of matrix, the basic composition of matrix can be determined, each component of matrix is obtained, to first The element of beginningization carries out assignment update, that is, produces required coverage information matrix.

Step S780 obtains the interest matching result of first area and second area according to coverage information matrix.

Coverage information matrix can intuitively record the interest matching result with characterization first area and second area, only need By searching for component each in matrix, that is, can determine whether first area is be overlapped with all subregion of second area, obtain emerging Interesting matching result.

As shown in figure 3, in one embodiment, step S780 includes step S790, the covering letter of each dimension is obtained respectively The component of matrix is ceased, and first area and the secondth area are determined according to the same composition element of the coverage information matrix of each dimension The interest matching result in domain.

In application process, interest matching includes the information of multiple dimensions, and the interest matching process of every dimension is identical, is led to Cross the intersection for determining the element of same matrix position of multiple dimensions, it can be determined that first area and second area under various dimensions Interest matching result, i.e., announcement region and order region interest matching result.

The interest matching algorithm that the application proposes, and announced using the region of two mutual exclusions overlapping decision condition as judgement Region and order region matching relationship sufficient and necessary condition, it is intended to reduce sequence expense, avoid unnecessary bit manipulation, with And avoid only needing to be ranked up there are two the boundary value list that length is N because filtering expense caused by incorrect matching, it can Length or number with significant reduction to sorted lists.And be overlapped using the decision condition of two mutual exclusions as two regions Decision condition, meets one of them i.e. and can determine two region overlappings, and interest successful match is led to according to the two decision conditions Binary chop is crossed, the matching relationship announced and ordered between region can be obtained more quickly, do not need to be grasped by means of bit array again Make.

It in an application example, orders region and is denoted as S, announce region and be denoted as U, by arranging according to ascending order lower bound parameter For sequence obtains the interest matching result for announcing region and order region, it is illustrated：For space of interest per one-dimensional, acquisition All boundary parameters announced regions and order region, ascending sorts, all are carried out to all lower bound parameters for announcing regions The lower bound parameter for ordering region is ranked up by ascending order, available 4 boundary value lists, as shown in fig. 6, be SL, SU respectively, UL, UU, wherein SL refers to that the lower bound list in the order region by ascending order arrangement, SU list store corresponding order region of upper bound Parameter, similarly, UL and UU are used to store all lower bound parameters and upper bound parameter for announcing region.In addition, there are two auxiliary List is for storing corresponding announcement region id and ordering region id.Using binary chop, each announcement region is found out respectively The upper bound (CIU) is indexed with the comparison for ordering region and compares index lower bound (CIL), and region or order region will be announced by respectively indicating Dividing value up and down be mapped to the position in SL list or UL list, as shown in fig. 7, being mapped to so that region bound parameter will be announced For SL list, UL and SL is subjected to alternately comparison first, SL list can be mapped to the value in all UL lists of quick obtaining In position, find UL₀Corresponding mapping position is SL₂.By [UU₀,UL₀] be mapped in SL list process, it is only necessary to it adopts With binary chop, UU is searched₀When corresponding mapping position, due to UU₀Greater than UL₀, therefore UU₀Seeking scope be [[SL₂, SL_n].It is searched using dichotomy, improves search efficiency, by first obtaining UL₀Mapping position on SL, then search UU₀ Mapping position on SL, reduces seeking scope, further improves search efficiency, and lookup result is CIU and CIL ( One mapping position and the second mapping position).It is mapped in SL list by the way that each bound parameter of region will be announced, and will It orders each bound parameter of region to be mapped in UL list, obtain each announcement region and orders the CIL and CIU in region, According to announcing region and ordering the quantity of region subregion, the coverage information matrix of M*N is constructed, M represents the sub-district for announcing region Domain quantity, N represent the subregion quantity for ordering region, and each announcement subregion corresponds to a line, each order subregion corresponding one Column, matrix element indicates to announce and orders the covering relation between region, and false represents region and is not overlapped, and true represents region Overlapping, all elements of matrix are both initialized to false.When announcement region is Chong Die with an order region, corresponding position It is set as true, for storing match information.Region is announced for each and orders region, according to their CIL and CIU value True is assigned a value of to position corresponding in bit matrix.Aforesaid operations are all carried out to every dimension, final covering letter can be obtained Matrix is ceased, determines interest matching result.

It should be understood that although each step in the flow chart of Fig. 1-4 is successively shown according to the instruction of arrow, These steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly stating otherwise herein, these steps Execution there is no stringent sequences to limit, these steps can execute in other order.Moreover, at least one in Fig. 1-4 Part steps may include that perhaps these sub-steps of multiple stages or stage are not necessarily in synchronization to multiple sub-steps Completion is executed, but can be executed at different times, the execution sequence in these sub-steps or stage is also not necessarily successively It carries out, but can be at least part of the sub-step or stage of other steps or other steps in turn or alternately It executes.

In one embodiment, as shown in figure 8, providing a kind of interest coalignment, device includes：

Boundary parameter obtains module 100, for obtaining the boundary parameter of first area and second area to be matched, boundary Parameter includes one-to-one upper bound parameter and lower bound parameter, wherein first area is announcement region and second area is order Region or first area are order region and second area is to announce region.

Parameter marshalling processing module 300, for regular according to predetermined order, respectively to the side of first area and second area Boundary's parameter is ranked up, and obtains first area parameter list and second area parameter list, predetermined order rule includes according to number Value size is ranked up lower bound parameter or is ranked up according to numerical values recited to upper bound parameter.

Mapping range determining module 500, for according to each side in first area parameter list and second area parameter list The numerical values recited of boundary's parameter and corresponding sorting position determine that the upper bound parameter of first area parameter list and lower bound parameter exist Corresponding first mapping range in second area parameter list, and determine the upper bound parameter and lower bound ginseng of second area parameter list Number the second mapping range corresponding in the parameter list of first area.

Interest matching result determining module 700, for determining the firstth area according to the first mapping range and the second mapping range The interest matching result in domain and second area.

In one embodiment, mapping range determining module 500 further includes：

First mapping range determination unit, for determining to be mapped according to the sequence boundary determined in predetermined order rule The boundary parameter list of second area the firstth area is determined with binary chop by alternately comparing according to the numerical values recited of parameter Upper bound parameter and lower bound parameter in field parameter list corresponding first mapping range in the boundary parameter list of second area.

Second mapping range determination unit, the upper bound parameter and lower bound parameter for determining second area parameter list are Corresponding second mapping range in one region parameter list.

In one embodiment, to be mapped when predetermined order rule is to be ranked up according to ascending order to lower bound parameter The boundary parameter list of second area be lower bound list, the first mapping range determination unit, including：

First mapping position determines subelement, by alternately comparing the lower bound parameter and second in the parameter list of first area Lower bound parameter in region parameter list determines the lower bound parameter in the parameter list of first area in the lower bound list of second area In the first mapping position, the first mapping position be second area lower bound list in numerical value be not less than first area parameter list In lower bound parameter parameter corresponding position.

Second mapping position determines subelement, for by binary chop, determining first using the first mapping position as starting point Second mapping position of the upper bound parameter in the lower bound list of second area in region parameter list.

First mapping range determines subelement, for determining the firstth area according to the first mapping position and the second mapping position Upper bound parameter and lower bound parameter in field parameter list corresponding first mapping range in the boundary parameter list of second area.

In one embodiment, interest matching result determining module 700, including：

Coverage information matrix generation unit, for generating coverage information according to the first mapping range and the second mapping range Matrix；

Interest matching result acquiring unit, for according to coverage information matrix, obtaining the emerging of first area and second area Interesting matching result.

In one embodiment, coverage information matrix generation unit, including：

The line number and columns of matrix determine subelement, for the boundary parameter quantity according to first area and second area, Determine the line number and columns of coverage information matrix；

Each component of matrix determines subelement, for obtaining the first mapping range id corresponding with the second mapping range Parameter list determines each component of coverage information matrix according to id parameter list；

Coverage information matrix generates subelement, for the line number and columns and coverage information according to coverage information matrix Each component of matrix generates coverage information matrix.

In one embodiment, each component of matrix determines subelement, for also obtaining the coverage information of initialization Matrix and the first mapping range id parameter list corresponding with the second mapping range, according to the first mapping range and corresponding The corresponding element of first mapping range in the coverage information matrix of initialization is updated to preset value and correspondence by id parameter list Id parameter list, according to the second mapping range, more by the corresponding element of the second mapping range in the coverage information matrix of update It is newly preset value, to determine each component of coverage information matrix.

In one embodiment, interest matching result acquiring unit is also used to obtain the coverage information square of each dimension respectively The component of battle array, and first area and second area are determined according to the same composition element of the coverage information matrix of each dimension Interest matching result.

Above-mentioned interest coalignment by obtaining the boundary parameter of first area and second area to be matched, and uses Lower bound parameter is ranked up according to numerical values recited or upper bound parameter is ranked up according to numerical values recited, parameter is ranked up, According to the numerical values recited of parameter in parameter list and position, the upper bound parameter and lower bound ginseng of first area parameter list are determined The upper bound parameter and lower bound parameter of mapping ranges and second area parameter list of the number in second area parameter list are the Corresponding second mapping range in one region parameter list and is passed through by improving matching result accuracy to parameter marshalling The mapping result of first area parameter and second area parameter determines interest matching result, substantially reduces the length to sorted lists Degree or number reduce sequence expense, data processing amount are reduced, to improve matching efficiency.

Specific about interest coalignment limits the restriction that may refer to above for interest matching process, herein not It repeats again.Modules in above-mentioned interest coalignment can be realized fully or partially through software, hardware and combinations thereof.On Stating each module can be embedded in the form of hardware or independently of in the processor in computer equipment, can also store in a software form In memory in computer equipment, the corresponding operation of the above modules is executed in order to which processor calls.

In one embodiment, a kind of computer equipment is provided, which can be terminal, internal structure Figure can be as shown in Figure 9.The computer equipment includes processor, the memory, network interface, display connected by system bus Screen and input unit.Wherein, the processor of the computer equipment is for providing calculating and control ability.The computer equipment is deposited Reservoir includes non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system and computer journey Sequence.The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.The calculating The network interface of machine equipment is used to communicate with external terminal by network connection.When the computer program is executed by processor with Realize a kind of interest matching process.The display screen of the computer equipment can be liquid crystal display or electric ink display screen, The input unit of the computer equipment can be the touch layer covered on display screen, be also possible to be arranged on computer equipment shell Key, trace ball or Trackpad, can also be external keyboard, Trackpad or mouse etc..

It will be understood by those skilled in the art that structure shown in Fig. 9, only part relevant to application scheme is tied The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.

In one embodiment, a kind of computer equipment is provided, including memory, processor and storage are on a memory And the computer program that can be run on a processor, processor realize following steps when executing computer program：

The boundary parameter of first area and second area to be matched is obtained, boundary parameter includes one-to-one upper bound ginseng Several and lower bound parameter, wherein first area is announcement region and second area is to order region or first area to order region And second area is to announce region；

According to predetermined order rule, the boundary parameter of first area and second area is ranked up respectively, obtains first Region parameter list and second area parameter list, predetermined order rule includes being ranked up according to numerical values recited to lower bound parameter Or upper bound parameter is ranked up according to numerical values recited；

According to first area parameter list and the numerical values recited of each boundary parameter in second area parameter list and corresponding Sorting position, determine that the upper bound parameter of first area parameter list and lower bound parameter are corresponding in second area parameter list First mapping range, and determine that the upper bound parameter of second area parameter list and lower bound parameter are right in the parameter list of first area The second mapping range answered；

According to the first mapping range and the second mapping range, the interest matching result of first area and second area is determined.

In one embodiment, following steps are also realized when processor executes computer program：

According to the sequence boundary determined in predetermined order rule, the boundary parameter list of second area to be mapped is determined；

According to the numerical values recited of parameter, by alternately comparing the upper bound determined in the parameter list of first area with binary chop Parameter and lower bound parameter corresponding first mapping range in the boundary parameter list of second area；

In one embodiment, to be mapped when predetermined order rule is to be ranked up according to ascending order to lower bound parameter The boundary parameter list of second area is lower bound list, and processor also realizes following steps when executing computer program：

By alternately comparing the lower bound ginseng in lower bound parameter and second area parameter list in the parameter list of first area Number determines first mapping position of the lower bound parameter in the lower bound list of second area in the parameter list of first area, and first reflects It is corresponding not less than the parameter of the lower bound parameter in the parameter list of first area to penetrate numerical value in the lower bound list that position is second area Position；

Using the first mapping position as starting point, by binary chop, determine that the upper bound parameter in the parameter list of first area exists The second mapping position in the lower bound list of second area；

According to the first mapping range and the second mapping range, coverage information matrix is generated；

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

According to the boundary parameter quantity of first area and second area, the line number and columns of coverage information matrix are determined；

The first mapping range id parameter list corresponding with the second mapping range is obtained, is determined and is covered according to id parameter list Each component of information matrix；

According to the line number of coverage information matrix and columns and each component of coverage information matrix, covering letter is generated Cease matrix.

Obtain the coverage information matrix and the first mapping range id parameter column corresponding with the second mapping range of initialization Table；

According to the first mapping range and corresponding id parameter list, by the first mapping in the coverage information matrix of initialization The corresponding element in section is updated to preset value；

According to the second mapping range and corresponding id parameter list, by the second map section in the coverage information matrix of update Between corresponding element be updated to preset value, to determine each component of coverage information matrix.

The component of the coverage information matrix of each dimension, and the phase of the coverage information matrix according to each dimension are obtained respectively The interest matching result of first area and second area is determined with component.

The above-mentioned computer equipment for realizing interest matching process, by obtaining first area and the secondth area to be matched The boundary parameter in domain, and use and lower bound parameter is ranked up according to numerical values recited or upper bound parameter is carried out according to numerical values recited Sequence is ranked up parameter, according to the numerical values recited of parameter in parameter list and position, determines that first area parameter arranges Mapping range and second area parameter list of the upper bound parameter and lower bound parameter of table in second area parameter list it is upper Boundary's parameter and lower bound parameter corresponding second mapping range in the parameter list of first area are matched by improving to parameter marshalling As a result accuracy, and interest matching result is determined by the mapping result of first area parameter and second area parameter, it shows The length or number reduced to sorted lists is write, sequence expense is reduced, reduces data processing amount, to improve matching effect Rate.

In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated Machine program realizes following steps when being executed by processor：

In one embodiment, following steps are also realized when computer program is executed by processor：

In one embodiment, to be mapped when predetermined order rule is to be ranked up according to ascending order to lower bound parameter The boundary parameter list of second area is lower bound list, and following steps are also realized when computer program is executed by processor：

By alternately comparing the lower bound ginseng in lower bound parameter and second area parameter list in the parameter list of first area Number, determines first mapping position of the lower bound parameter in the lower bound list of second area in the parameter list of first area, first Mapping position is the parameter pair that numerical value is not less than the lower bound parameter in the parameter list of first area in the lower bound list of second area Answer position；

The above-mentioned storage medium for realizing interest matching process, by obtaining first area and second area to be matched Boundary parameter, and using being ranked up according to numerical values recited to lower bound parameter or arrange according to numerical values recited upper bound parameter Ordered pair parameter is ranked up, and according to the numerical values recited of parameter in parameter list and position, determines first area parameter list Mapping range and second area parameter list in second area parameter list of upper bound parameter and lower bound parameter the upper bound Parameter and lower bound parameter corresponding second mapping range in the parameter list of first area, by improving matching knot to parameter marshalling Fruit accuracy, and interest matching result is determined by the mapping result of first area parameter and second area parameter, significantly The length or number to sorted lists are reduced, sequence expense is reduced, data processing amount is reduced, to improve matching efficiency.

Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with Relevant hardware is instructed to complete by computer program, computer program can be stored in a non-volatile computer and can be read In storage medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the application To any reference of memory, storage, database or other media used in provided each embodiment, may each comprise non- Volatibility and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM (PROM), Electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include arbitrary access Memory (RAM) or external cache.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), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) directly RAM (RDRAM), straight Connect memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..

Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance Shield all should be considered as described in this specification.

Above embodiments only express the several embodiments of the application, and the description thereof is more specific and detailed, but can not Therefore it is construed as limiting the scope of the patent.It should be pointed out that for those of ordinary skill in the art, Under the premise of not departing from the application design, various modifications and improvements can be made, these belong to the protection scope of the application. Therefore, the scope of protection shall be subject to the appended claims for the application patent.

Claims

1. a kind of interest matching process, which is characterized in that the method includes：

The boundary parameter of first area and second area to be matched is obtained, the boundary parameter includes one-to-one upper bound ginseng Several and lower bound parameter, wherein the first area is announcement region and the second area is to order region or firstth area Domain is order region and the second area is to announce region；

According to predetermined order rule, the boundary parameter of the first area and second area is ranked up respectively, obtains first Region parameter list and second area parameter list, the predetermined order rule include carrying out according to numerical values recited to lower bound parameter Sequence is ranked up upper bound parameter according to numerical values recited；

According to the first area parameter list and the numerical values recited of each boundary parameter in second area parameter list and corresponding Sorting position, the upper bound parameter and lower bound parameter for determining the first area parameter list are in the second area parameter list In corresponding first mapping range, and the upper bound parameter and lower bound parameter that determine the second area parameter list are described first Corresponding second mapping range in region parameter list；

According to first mapping range and second mapping range, the emerging of the first area and the second area is determined Interesting matching result.

2. interest matching process according to claim 1, which is characterized in that described according to the first area parameter list With the numerical values recited of boundary parameter each in second area parameter list and corresponding sorting position, the first area ginseng is determined The upper bound parameter and lower bound parameter of ordered series of numbers table corresponding first mapping range in the second area parameter list, and determine institute State upper bound parameter and lower bound parameter corresponding second mapping in the first area parameter list of second area parameter list Section includes：

According to the sequence boundary determined in the predetermined order rule, the boundary parameter list of second area to be mapped is determined；

According to the numerical values recited of parameter, by alternately comparing the upper bound determined in the first area parameter list with binary chop Parameter and lower bound parameter corresponding first mapping range in the boundary parameter list of the second area；

Similarly, the upper bound parameter and lower bound parameter for determining the second area parameter list are in the first area parameter list Corresponding second mapping range.

3. interest matching process according to claim 2, which is characterized in that when predetermined order rule be according to ascending order under When boundary's parameter is ranked up, the boundary parameter list of second area to be mapped is lower bound list, the numerical value according to parameter Size determines upper bound parameter in the first area parameter list and lower bound parameter in institute by alternately comparing with binary chop Stating corresponding first mapping range in the boundary parameter list of second area includes：

Under replacing in lower bound parameter and the second area parameter list in the first area parameter list Boundary's parameter determines first mapped bits of the lower bound parameter in the lower bound list of second area in the first area parameter list It sets, first mapping position is that numerical value is not less than in the first area parameter list in the lower bound list of the second area Lower bound parameter parameter corresponding position；

Using first mapping position as starting point, by binary chop, the upper bound ginseng in the first area parameter list is determined Second mapping position of the number in the lower bound list of second area；

According to first mapping position and second mapping position, the upper bound ginseng in the first area parameter list is determined Several and lower bound parameter corresponding first mapping range in the boundary parameter list of the second area.

4. interest matching process according to claim 1, which is characterized in that described according to first mapping range and institute The second mapping range is stated, the first area is determined and the interest matching result of the second area includes：

5. interest matching process according to claim 4, which is characterized in that described according to first mapping range and institute The second mapping range is stated, generating coverage information matrix includes：

According to the boundary parameter quantity of the first area and the second area, determine the coverage information matrix line number and Columns；

First mapping range id parameter list corresponding with second mapping range is obtained, according to the id parameter list Determine each component of the coverage information matrix；

It is covered according to the line number of the coverage information matrix and columns and each component of the coverage information matrix, generation Lid information matrix.

6. interest matching process according to claim 5, which is characterized in that described to obtain first mapping range and institute The corresponding id parameter list of the second mapping range is stated, each composition of the coverage information matrix is determined according to the id parameter list Element, including：

Obtain the coverage information matrix and first mapping range id ginseng corresponding with second mapping range of initialization Ordered series of numbers table；

It, will be first in the coverage information matrix of the initialization according to first mapping range and corresponding id parameter list The corresponding element of mapping range is updated to preset value；

According to second mapping range and corresponding id parameter list, in the coverage information matrix of the update second is reflected The corresponding element for penetrating section is updated to the preset value, with each component of the determination coverage information matrix.

7. interest matching process according to claim 4, which is characterized in that it is described according to the coverage information matrix, it obtains It obtains the first area and the interest matching result of the second area includes：

The component of the coverage information matrix of each dimension, and the phase of the coverage information matrix according to each dimension are obtained respectively The interest matching result of the first area Yu the second area is determined with component.

8. a kind of interest coalignment, which is characterized in that described device includes：

Boundary parameter obtains module, for obtaining the boundary parameter of first area and second area to be matched, the boundary ginseng Number includes one-to-one upper bound parameter and lower bound parameter, wherein the first area is to announce region and the second area For order region or the first area be order region and the second area is to announce region；

Parameter marshalling processing module, for regular according to predetermined order, respectively to the boundary of the first area and second area Parameter is ranked up, and obtains first area parameter list and second area parameter list, the predetermined order rule include according to Numerical values recited is ranked up lower bound parameter or is ranked up according to numerical values recited to upper bound parameter；

Mapping range determining module, for being joined according to boundary each in the first area parameter list and second area parameter list Several numerical values reciteds and corresponding sorting position determine that the upper bound parameter of the first area parameter list and lower bound parameter exist Corresponding first mapping range in the second area parameter list, and determine the upper bound parameter of the second area parameter list With lower bound parameter in the first area parameter list corresponding second mapping range；

Interest matching result determining module, described in determining according to first mapping range and second mapping range The interest matching result of first area and the second area.

9. a kind of computer equipment, including memory and processor, the memory are stored with computer program, feature exists In the step of processor realizes any one of claims 1 to 7 the method when executing the computer program.

10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program The step of method described in any one of claims 1 to 7 is realized when being executed by processor.