WO2008080309A1

WO2008080309A1 - A method for sorting the search results and an information search system

Info

Publication number: WO2008080309A1
Application number: PCT/CN2007/070328
Authority: WO
Inventors: Hongxi Liu
Original assignee: Huawei Technologies Co., Ltd.
Priority date: 2006-11-30
Filing date: 2007-07-25
Publication date: 2008-07-10
Also published as: BRPI0719366A2; CN1964403A; MX2009005662A

Abstract

A method for sorting the search results and an information search system are disclosed which relate to the computer technique field. The method for sorting the search results includes: searching the search information database according to the search condition to determine the records meeting the search condition; randomly determining the record which is in the first location of the displayed search results according to the corresponding priorities of the records meeting the search condition and determining the sort locations of other records meeting the search condition in the displayed search results. The present invention realizes determining the record which is in the first location in the displayed search results according to the registered priorities of the records and making the record which will be displayed in the first location of the search results unpredictable.

Description

Query result sorting method and information query system The application claims the priority of the Chinese patent application filed on November 30, 2006, the Chinese Patent Office, the application number is 200610160844.8, and the invention name is "query result sorting method and information query system". The entire contents are incorporated herein by reference. Technical field

The present invention relates to computer technology, and in particular, to a query result sorting method and an information query system. Background technique

With the development of computer information technology, the application of query-based basic services is more and more extensive. For example: number inquiry, convenience service inquiry, web website address inquiry and so on. In the case where the user cannot accurately provide the requested unit name, the search engine performs a query based on the keyword requested by the user, and provides the information of the unit registered as the corresponding keyword to the user to provide the value-added service for the registration unit.

With the combination of telecommunication services and computer information technology, the basic services based on query are more and more widely applied to telecommunication services. The typical application is that the user dials the information desk to query the information content on the communication terminal side, and the phone is accessed. The operator performs the manual service, and the user queries the information about some uncertain specific units through the operator. The attendant inputs the query condition query information query system according to the user request, and the information inquiry system queries the information database according to the query condition to obtain the information that meets the user requirements. The user information is preferentially selected to the user, and the user obtains the contact information of the unit according to the provided information, and can contact the related service according to the contact information.

The difference between the information inquiry system conducted by telephone voice and other inquiry systems is mainly as follows: The information based on telephone voice query is provided to the inquirer by the operator selection, and the queryer cannot preview the result returned by the query that meets the query condition, and the attendant accelerates The speed of the query generally provides the first information of the query result to the queryer, so the ordering of the displayed query results, especially the first order, is particularly important in the information query system conducted by telephone voice. In the information inquiry system, when the registration unit registers the unit information, the priority value is simultaneously registered, so that the unit having the larger priority value is arranged in the first position of the query result. In the prior art, the query result is generally displayed in a rolling arrangement based on the priority value. Specifically, for example, the two units have registered a certain keyword (set to X), and the priority values of the two units are 2, 3, respectively, when the attendant should request the user. When the keyword X is queried, the search engine obtains the unit that matches the keyword, Β, and selects the unit record ranked in the first place according to the priority values 2 and 3 registered by the unit, 假设, in the first query, Arrange the unit Α in the first place, and count the number of times the units A and B are ranked in the first position (1 time, 0 times); in the second query of the same keyword, continue the unit according to the statistical result and the priority value relationship. A is ranked in the first place, and the number of times the statistical units A and B are ranked in the first place (2 times, 0 times); in the third query of the same keyword, the unit B is arranged in the first place, and the statistical units A and B are arranged in The number of first place (2 times, 1 time); In the fourth and fifth query of the same keyword, continue to rank unit B in the first place until the statistical units A and B are ranked in the first place (2 times, 3 times) ), then the same in the future When the keyword is queried, the unit A is ranked first, and so on. According to the statistics, the number of times the units are ranked in the first place determines which unit should be ranked first.

It can be seen from the above that the technical scheme of displaying the query result based on the rolling arrangement of the priority values, the user can predict the sorting rule of the query result of a certain keyword according to the result of multiple queries, and is easily vulnerable to malicious access. In the simplest example, assume that both C and D units have registered a certain keyword (set to S, C, and D. The priority values of the two units are 1 and 1. respectively. Suppose, the user searches for the keyword S. After that, the unit C is ranked in the first place, and the operator recommends the information of the unit C ranked in the first place to the user. The user can contact the unit C according to the provided information, and the unit C can calculate the priority according to the priority value registered by the unit. It is predicted that the next time the keyword S query occurs, the unit ranked first in the query result will never be this unit. If the C unit increases the number of times it is recommended in order to combat the opponent unit D, then the C unit can be used as a normal user. The access system queries the keyword S. Obviously, the system query result list will display the unit D in the first place, and the system automatically adds the queried record to the C unit; in the next real user query, the C unit information is again arranged. In the first place, the operator continues to recommend the C unit information to the user.

It can be seen from the above that since the C unit performs malicious query according to the predicted sorting rule, the number of times the unit is queried by the real user is greatly increased, and the opponent unit D is queried by the real user. The number is greatly reduced, and it cannot even be queried by real users. Therefore, there is a loophole in the scheme, and the service provided under the condition of malicious inquiry (whether it is a malicious inquiry, the operator and the information inquiry system is difficult to know or block) is unfair.

In addition, the technical solution for displaying the query result based on the rolling arrangement of the priority values determines that each time the unit in the first position of the query result is arranged, it needs to be determined according to the records of the previous statistics in the first place, and therefore, when the information is When the records of the units that register the same query conditions are queried in the system, the records of the newly added units cannot be effective in real time. Only after each new registration of one unit, the information inquiry system can follow the original registration unit and the newly added unit after zeroing the previous history of all the units with the same registration conditions as the newly added unit. The priority values are sorted so that the record of the newly added unit takes effect. Since each additional unit is added, it is necessary to zero the history of the first unit in a statistical unit, thereby causing inconvenience to the direct user (accommodator) of the inquiry system. Summary of the invention

The invention provides a method for sorting query results, realizing the query record, determining the record which will be arranged in the first place of the query result to be displayed according to the priority value of the record registration, and making the record which should be ranked first in the displayed query result. not predictable.

The present invention provides a method for sorting query results, which is characterized in that it comprises:

Query the information database according to the query conditions to determine the records that meet the query conditions;

Determining, according to the determined priority value corresponding to the record, a record ranked first in the query result to be displayed;

Determine the sort position of other records that match the query criteria in the query results to be displayed. The invention also provides an information inquiry system, comprising:

An information storage unit for storing an information database;

a query unit, configured to query an information database stored by the information storage unit according to a user query condition, and determine a record that meets the query condition;

a priority value determining unit, configured to determine a priority value corresponding to the record determined by the query unit;

a sorting unit, configured to randomly determine a record ranked first in a query result to be displayed according to a priority value corresponding to the record determined by the priority value determining unit; and determine the query unit The sorted position of the other records determined in the query results to be displayed.

In the technical solution provided by the present invention, the record matching the keyword is determined according to the query condition query database, and the record ranked first in the displayed query result is randomly determined according to the priority value of each unit, so that the query currently arranged in the display is arranged. The result of the first place is unpredictable. The problem of unfairness caused by malicious queries due to the prediction of the query results by malicious users is avoided, which is conducive to enhancing the confidence of registered users in the quality of service provided by the information query system. In addition, in the technical solution provided by the present invention, according to the priority value of each unit, the records ranked in the first position of the displayed query result are randomly determined, and the query that should be currently arranged in the display is determined according to the statistics of the previous arrangement in the first place. The result of the first record enables the newly registered user's records to be valid in real time, improving the business performance of the information query system and the experience of the direct users (operators) of the system. DRAWINGS

1 is a schematic flowchart of a method for a user to query information through a call terminal according to Embodiment 1; FIG. 2 is a schematic diagram of a data organization structure of an information database used in the present invention;

3 is a schematic diagram showing a flow of determining a query result sorting method according to a priority value provided in Embodiment 1;

4 is a schematic diagram showing a mapping relationship between a priority value and a numerical interval of Embodiment 1;

5 is a schematic flowchart of determining a method for sorting query results according to a priority value provided in Embodiment 2;

6 is a schematic structural diagram of an information inquiry system in Embodiment 3;

7 is a schematic structural diagram of an information inquiry system in Embodiment 4;

FIG. 8 is a schematic structural diagram of an information inquiry system in Embodiment 5. detailed description

The core of the embodiment of the present invention is that, after determining the record that meets the query condition according to the query condition query information database, the record ranked first in the query result is randomly determined according to the priority value corresponding to each record, so that the query cannot be based on the current query condition. The result is predicted to be followed by the same query condition that the query will be ranked in the first place.

In order to make the content of the present invention better understood by those skilled in the art, the present invention will be described in detail below with reference to the accompanying drawings and specific embodiments. Example 1:

1 is a schematic flowchart of a method for a user to query information through a call terminal according to the embodiment. As shown in the figure, the method includes:

Step 101: The user accesses the access device through the call terminal device.

The user dials the number of the telephone information inquiry system (such as: 114 directory system, 12580 information service center, etc.) through the fixed telephone, mobile phone, PHS, IPTV terminal, Internet terminal, etc., and accesses the corresponding query through the communication network. System access device.

Step 102: The access device accesses the call request and receives the caller.

After receiving the access of the user, the access device accesses the access call request to the attendant seat according to the predetermined access rule, and the attendant processes the query request of the user, and the specific access processing may be processed by using existing technical means. .

Step 103: The attendant determines the query request of the user to determine the query condition, and inputs the query condition query information database.

After the user picks up the caller, the attendant describes the query request, and the attendant determines the query condition according to the query requirement of the user and the search experience (the query condition is generally composed of the query keyword and the service category of the query), and inputs the query to the information query system. The condition is to query the information database according to the query condition by the information query system.

The registered user information is stored in the information database, and the registered user information is stored in accordance with different business categories. In order to facilitate the management and maintenance of the information database, taking the registered user as the user as an example, the unit information in the information database can use the data organization structure shown in FIG. 2, and the information of other types of registered users can be referred to FIG. 2 accordingly. The structure of the description, the corresponding query method is the same as the corresponding query method of the registered user, as shown in Figure 2:

The unit information 20 is composed of three types of information: unit registrant information 21, unit extension information 22, and unit priority information 23, wherein the unit registrant information 21 includes the name of the unit, the unit contact telephone number, the location city, the business scope, the contact person, and the location Specific location, and specific unit basic information such as WEB or WAP address; Unit extension information 22 has different performance according to different industries and service types in which the unit is located, and generally includes business information of the unit and other classification reference information reflecting the unit business; In the priority information 23, the service category 231 in which the unit is located, the keyword 232 registered in the service category 231, the priority value 233 corresponding to the keyword 232, and the like are searched. Relevant information; For units that need to register multiple service categories, the corresponding keywords can be separately registered for different service categories, and the corresponding priority values are respectively registered for each keyword. The use of this data organization structure is beneficial to the management and maintenance of the information database, and it is also beneficial to expand the information database in the future to provide diversified services for the registration unit. In the unit priority information 23, if the service category 231 field is empty, it indicates that the priority data is applicable to all service data.

Step 104: Perform a query according to the query condition, determine all information records that meet the query condition, and a priority value corresponding to each record.

The general query condition consists of service category information and keywords. The operator enters the query keyword, set it to "XXXX", and the service category, after setting it to "business 1", the search engine of the query system is shown in the data structure shown in Figure 2. The field matching is performed in the information database library. Specifically, the keyword "XXXX" is matched in the field of the keyword 232 of each unit record shown in FIG. 2, and the service category "Service 1" is matched in the field of the service category 231. According to the query conditions, the set "and,, and operation, matching in the unit priority data, all the unit records satisfying the requirements of the keyword and the business category are obtained.

If the input task category information is empty, it means that the query is performed in all service categories, and the information of the service category does not need to be adapted when querying.

The priority values registered for the service category and the keyword are determined according to the information content of the corresponding field of each record. It is assumed that there are a total of n unit records satisfying the query condition, based on the unit name (the content of the field 211 in FIG. 2) in each record, and the service category 231, the keyword 232, and the priority value 205 held in the unit priority information 23. The information content of the field forms a correspondence as shown in Table 1:

Table 1: Correspondence between unit name and priority information of each record

Table 1 shows the priority information of the unit records obtained based on the keywords of the current query and the business category query. Step 105: Randomly determine the records ranked in the first position of the query result to be displayed according to the priority value corresponding to the record that meets the query condition, and determine the sorting position of the other records that meet the query condition in the query result to be displayed.

FIG. 3 is a schematic flowchart of a method for determining a query result according to a priority value according to the embodiment. As shown in the figure, the method includes:

Step 301: Determine the sum of the priority values corresponding to the records in the query result.

The priority values corresponding to the records are summed, and the sum of the priority values is marked as: SumXn. Step 302: Determine a proportional relationship between each priority value and the sum.

The proportional value of each priority value and the sum SumXn are respectively determined, and the proportional relationship between each priority value and the sum is determined, and each proportional value indicates that the record corresponding to each priority value may be ranked in the query result to be displayed. The chance of the first place.

Step 303: According to the proportional relationship, the relationship between each priority value and the sum is mapped to the relationship of the length of the numerical interval.

The sum is taken as a whole of a numerical interval, and the proportional relationship between each priority value and the interval is expressed as the numerical interval of the priority value in the overall numerical interval, and the priority values can be combined with the sum. The relationship of the relationship to the size of the numerical interval is such that the priority values correspond to the numerical intervals they occupy.

In order to explain this step more specifically, it is assumed that the priority values corresponding to the records of the sorted query result are: 2, 3, 1, 4, and the sum of the priority values is: 10, so each priority value and the The proportional relationship of the sum is: 2/10, 3/10, 1/10, 4/10. As shown in FIG. 4, according to the sum (10), a value interval whose interval length is equal to the sum (10) is determined, as in the interval 5 in FIG. 4, the upper limit value of the numerical interval may be an arbitrary value, and only the numerical interval is required. The length of the interval is equal to the sum of the priority values; according to the proportional relationship of the priority values in the sum, the length of the interval that each priority value should occupy in the numerical interval 5 is determined, and the priority value is 2 The length of the interval of the numerical interval occupied by the interval 5 is 2, and the lengths of the interval of the numerical interval which should be occupied by the interval 3, 1, and 4 respectively are 3, 1, and 4, respectively, and the value should be occupied according to each priority value. The interval length of the interval determines the numerical interval occupied by each priority value in the interval 5, as shown in Fig. 4, the numerical intervals occupied by the priority values 2, 3, 1, and 4 are respectively: interval 1, interval 2, Interval 3, Interval 4. Step 304: Randomly generate a value in the numerical interval corresponding to the sum of the priority values determined in step 303.

In the numerical interval corresponding to the sum of the priority values determined in step 303 (such as interval 5 in Fig. 4), a value is arbitrarily selected, and the random number is X.

Step 305: The record corresponding to the priority value corresponding to the numerical interval in which the random number X falls is placed in the next position of the position where the record having the largest sorting number of the sorting position is determined in the arrangement of the query result to be displayed.

The random number X certainly falls within the numerical interval 5 of the interval length as shown in the sum (10) shown in FIG. 4, and the probability of which numerical interval falls in the range equal to the ratio of the length of the interval of each numerical interval to the length of the interval of the numerical interval 5. Therefore, the probability that the random number falls on the numerical interval corresponding to the higher priority value is larger, and the probability that each record may be determined in the unit ranked first in the query result is equal to the priority value corresponding to the corresponding record and all the records satisfying the query condition. The ratio of the sum of the priority values is optimally fulfilled with a commitment to the priority value registered by each registered user.

Determining a specific numerical interval (interval 1, interval 2, interval 3, or interval 4) in which the random number falls, and placing a record corresponding to the priority value corresponding to the numerical interval in which the random number is located in the arrangement of the query result to be displayed The next position of the position where the sorting number with the largest sorting position is determined is determined.

When the step 305 is performed for the first time, since the position of any one of the records to be displayed in the arrangement of the query results is not determined, the record corresponding to the priority value corresponding to the numerical interval in which the random number falls is to be displayed. The first record in the arrangement of the query results; and after determining the position of the i records in the arrangement of the query results to be displayed, where i is a natural number greater than or equal to 1, the numerical value determined by the random value determined in this step falls The arrangement number of the record corresponding to the priority value corresponding to the interval in the arrangement of the query result to be displayed is: i+l.

Based on the characteristics of the application of the telephone-based query service system, the operator will use the record displayed in the first place of the query result as the recommendation record and recommend it to the query user. Therefore, determining the record ranked first in the query result to be displayed is the main result of determining the result ranking. The task may even only need to determine the first record according to the priority value, and other records may be randomly arranged after the first record regardless of their priority value. Therefore, the first execution to this point, you can complete the record that determines the top position of all the query results that need to be displayed. However, in order to make the order of all the records according to the size of the priority value, the probability that the record with the higher priority value is arranged in front of the arrangement is larger, and step 306 is continued.

Step 306: Determine whether there is only one record of the query result to be sorted, and if yes, execute step 308; otherwise, execute step 307.

If it is not determined that there are more than one record of the sorted query result, then step 307 is continued; otherwise, step 308 is performed.

Step 307: Step 305 is deleted from all the query results to determine the record of the sort position, and return to step 304 to continue sorting the records to be sorted.

The purpose of this step is to determine the set of records for which the sort is not determined, and the records that have been determined to be sorted out of all query results are a collection of records that are not determined to be sorted. Returning to step 304, continue to determine the location of other records in the sort to be displayed.

Step 308: Place the record at the end of the sort.

Place the last remaining undetermined sorted record at the last bit of the sort.

Step 309: Sorting ends.

At this point, the display ordering of all the query results is completed, so that the order of each record is based on the size of the priority value, and the probability that the record with higher priority value is arranged in front of the arrangement is larger.

Step 106: Display the query result to the operator according to the determined order.

The query results are displayed to the operator in accordance with the order determined in step 105.

Step 107: The attendant recommends a query result to the querying user according to the query result.

Generally, the attendant will recommend the record in the first place as the recommended record to the user, or according to the user's request, continue to recommend the records ranked in the second and third places to the user for the user to select, as far as possible to meet the user's query needs. .

It should be noted that, according to the core of the above technical solution, the following modifications can be made to the technical solution: In step 303 in step 105, the relationship between each priority value and the sum is mapped to the numerical interval according to the proportional relationship. In the case of the relationship between the sizes and the values, the numerical interval corresponding to the length of the interval is 1. According to the proportional relationship between the priority values and the sum, each priority value is respectively assigned to the small value interval in the numerical interval corresponding to the sum, specifically : the length of the interval occupied by each priority value in the numerical interval corresponding to the sum is equal to the ratio of each priority value to the sum Value; the other steps are unchanged. The technical solution after the change can also obtain the same technical effects as those of the technical solutions shown in FIGS. 3 and 4.

In addition, if the step 301 in step 105 in this embodiment is changed to: determine the product of each priority weight, or directly take a fixed value greater than the sum of the priority values. And correspondingly in the subsequent steps 302 to 304, all the values involving the sum are changed to a product, or a fixed value greater than the sum of the priority values, and the basic flow of the method is unchanged, forming a further technical solution. The modified technical solution can also complete the unit of determining the first position of the query result to be displayed according to the priority value to be achieved by the present invention, and the purpose of ordering the displayed query result is unpredictable, only the technical solution Only the probability that each record is determined to be ranked first in the query result is related to the priority value corresponding to the unit, rather than strictly equal to the ratio of each priority value to the sum. In addition, the technical solution of the change is relative to the method shown in FIG. 3, and each time the record ranked first in the query result to be sorted is determined, it is possible that the selected random number does not fall under any priority value. In the numerical interval, the determination fails, and another random number needs to be randomly selected to continue the comparison determination until the random number falls within the numerical interval corresponding to a certain priority value, so the technical effect obtained by the technical solution is not as shown in FIG. The technical solution shown, however, the probability that each record may be determined by the unit ranked first in the query result is related to the priority value corresponding to the unit, and is in a proportional relationship, and the priority value corresponding to each registration unit is executed. committed to.

Example 2:

Another method for determining the query result according to the priority value is provided in this embodiment. As shown in FIG. 5, the method includes:

Step 501: Determine a sum SumXn of each priority value corresponding to each record of the undetermined sort position in the query result.

Step 502: Sort the unsorted records in the query result according to the corresponding priority values from large to small, and determine the sequence numbers of the records after the sorting.

There are n records that meet the query conditions. According to the size of the priority value, the corresponding numbers of the records are: 1, 2, 3...n.

Step 503: For each record, calculate a sum SumXi of the priority value corresponding to each serial number and all the priority values corresponding to all the serial numbers smaller than the serial number, where i is any of 1, 2, 3...n. Let the record numbers be: 1, 2, 3...n The corresponding priority values are: XI, X2, X3—.Xn, ^ Xl>=X2>=X3>=...Xn„

The sum of the priority values corresponding to the serial numbers and all the priority values corresponding to all the serial numbers smaller than the serial number can be expressed as: SumXi= Xl+X2+...+Xi, where i belongs to {1, 2, 3...n }, that is, for the record with sequence number 1, the corresponding SumXl=Xl; for the record with sequence number 2, the corresponding SumX2=Xl+X2; for the record with sequence number 3, the corresponding SumX2=Xl+X2+X3 ,So on and so forth.

Step 504: Take a random number RanX between 0 and 1 and calculate the product of RanX and SumXn RanX*SumXn„

Step 505: Determine the size relationship between RanX*SumXn and each SumXi, which is greater than

The record represented by the smallest value in the set of SumXi of RanX*SumXn, the position of the record in the arrangement of the query result to be displayed is determined as the latter position of the record where the sorting number of the sorting position is the largest.

In the same manner as step 305, when the step 505 is performed for the first time, since the position of any record should be determined in the arrangement of the query results to be displayed, the priority value corresponding to the numerical range in which the random value falls corresponds to Recording the record as the first bit in the arrangement of the query results to be displayed; and after determining the position of the i records in the arrangement of the query results to be displayed, where i is a natural number greater than or equal to 1, the step determined in this step The sequence number of the record corresponding to the priority value corresponding to the numerical interval in which the random number falls within the arrangement of the query result to be displayed is: i+l.

Since the higher the priority value is, the larger the SumXi is, the larger the probability is greater than RanX*SumXn, so the probability of being determined as the first record of the sorted result of the query result to be sorted is larger, and the order is sorted according to the priority value. . Due to the uncertainty of the random number RanX, the record represented by the smallest value in the set of SumXi larger than RanX*SumXn is also uncertain in the user's view, and the user cannot predict the ordering of the displayed query results, thereby avoiding the The problem of unfairness caused by malicious queries due to malicious users predicting the ranking of query results.

Step 506: Determine whether there is only one record of the query result to be sorted, and if yes, execute step 508; otherwise, execute step 507.

Step 507: Step 505 is deleted from all the query results to determine the record of the sort position, and return to step 501 to continue sorting the records to be sorted. Step 508: Place the record at the end of the sort.

Step 509: Sorting ends.

Example 3:

FIG. 6 is a schematic structural diagram of an information query system according to the embodiment. As shown in the figure, the system includes:

The information storage unit 601 is configured to store an information database.

The information stored in the information storage unit 601 may use the data organization structure shown in FIG. 2. When the stored information is unit information, the stored information includes: a unit name, a contact information of the unit, and a service category of the unit. , keywords registered according to the business category and corresponding priority value information.

The query unit 602 is configured to query the information database stored by the information storage unit 601 according to the query condition of the user, determine the unit that meets the query condition, and the record corresponding to the unit.

The general query condition is composed of the service category information and the keyword, and the query unit 602 uses the service category information and the keyword to perform field matching on the information stored in the information library storage unit 601, assuming that the information uses the data organization structure shown in FIG. Then, specifically, the keyword "XXXX" is matched in the field of the keyword 232 registered in each unit shown in FIG. 2, and the service category "Service 1" is matched in the field of the service category 231. According to the query conditions, the collection "and,, operation, unit priority data matching all the records that meet the requirements of the keyword and business category.

If the input task category information is empty, it means that the query is performed in all service categories, and the query unit 602 does not need to adapt the information of the service category.

The priority value determining unit 603 is configured to determine a priority value corresponding to the record determined by the query unit 602.

The sorting unit 604 is configured to determine, according to the priority value corresponding to the record determined by the priority value determining unit 603, from the record determined by the query unit 602, the record ranked first in the query result to be displayed, and determine the query unit The sorted position of the other records determined in the query results to be displayed. In order to cause the display terminal to display the query result to the operator according to the ranking determined by the sorting unit 604, the operator can recommend the information to the querying user according to the displayed query result.

The sorting unit 604 includes:

The first calculating unit 6041 is configured to obtain the priority value determining unit 603 for the undetermined display The priority values determined by each record of the sort position in the query result are the sum of the priority values.

The priority value and interval relationship determining unit 6042 is configured to determine that the interval length is equal to the value interval acquired by the first calculating unit 6041, and establish a mapping relationship between the value obtained by the first calculating unit 6041 and the numerical interval, and according to the priority value. Determining, by the determining unit 603, the proportional relationship between the priority values determined by the first calculating unit 6041 and determining the length of each of the priority values in the numerical interval obtained by the first calculating unit 6041. Establish a mapping relationship between each priority value and a numerical interval. For the basic principle of the mapping relationship, refer to the description in step 303 in Embodiment 1, and details are not described herein.

The random number selection unit 6043 is configured to arbitrarily select a value within the numerical interval obtained by the priority value and interval relationship determining unit 6042 to be equal to the value range obtained by the first calculating unit 6041.

The first sorting order determining unit 6044 is configured to select, according to the numerical interval in which the value selected by the random number selecting unit 6043 is located, the probability that the random number belongs to the numerical interval corresponding to each priority value, and the corresponding unit of the priority value is ranked in the query. The probability of the first position of the result), the priority value corresponding to the priority value and the value range corresponding to the value range, and the record corresponding to the priority value is placed in the record of the query result to be displayed, and the record with the largest sort number of the sorted position is determined. The next position in the location.

The specific working principle of the first sort order determining unit 6044 is as described in step 305 in Embodiment 1.

It can be seen that the information query system provided in this embodiment not only realizes the record ranked first in the query result according to the priority value, but makes the order of the query result unpredictable, and solves the problem that the malicious user predicts the query result and performs the malicious query. The problem of unfairness also makes the probability that each record may be determined by the unit ranked first in the query result, which is equal to the ratio of the priority value corresponding to the corresponding record to the sum of the priority values of all the records satisfying the query condition. Further, the information inquiry system of the present invention makes the probability that the record having the higher priority value is arranged in the previous query result is larger, and the commitment of the priority value corresponding to each registration unit is optimized.

Example 4: FIG. 7 is a schematic structural diagram of an information inquiry system according to an embodiment of the present invention. As shown in FIG. 7, the basic structure of the information inquiry system provided in this embodiment is the same as that in Embodiment 3, except that the ranking unit of the system of this embodiment is different. The second calculating unit 6045 for obtaining the product of the respective priority values determined by the priority value determining unit 603 in 605 replaces the first calculating unit 6041 in the sorting unit 605 in the second embodiment.

The information query system provided in this embodiment can still accomplish the purpose of the present invention, so that the first place of the query result is unpredictable, and solves the problem that the malicious user predicts the query result and performs the malicious query.

Different from Embodiment 3, due to the replacement of the second calculating unit 6045, each record may be determined by the first sorting order determining unit 6044 to determine the probability of ranking in the first place of the query result, which is related to the priority value corresponding to the unit, instead of Strictly equal to the ratio of each priority value to the sum.

In addition, the random number selected by the random number selection unit 6043 in the information query system of the embodiment may not fall within the numerical interval corresponding to any priority value, causing the first sort order determining unit 6044 to determine that the first record fails. In addition, the random number selection unit 6043 needs to regenerate another random number, and continues to be determined by the first sort order determining unit 6044 until the random number falls within a numerical interval corresponding to a certain priority value, so the present embodiment provides The operation efficiency of the information inquiry system is slightly worse than that of the information inquiry system provided in Embodiment 3.

Example 5

FIG. 8 is a schematic structural diagram of an information inquiry system according to the embodiment. As shown in the figure, the system includes:

The difference between the embodiment and the embodiments 3 and 4 is that the sorting unit 800 of the embodiment includes: a pre-sorting unit 801: for each record that does not determine the sorting position in the displayed query result, according to the corresponding priority The weights are sorted from large to small, and the sequence numbers of the records after sorting are determined.

There are n records of undetermined sorting positions that meet the query conditions. According to the size of the priority value, the corresponding serial numbers of each record are: 1, 2, 3 ... n.

The first summation unit 802 is configured to obtain a sum of priority values of the ranking positions that are not determined in the displayed query result, and set the sum to SumXn.

The random number generating unit 803 is configured to generate a random number smaller than the sum acquired by the first summation unit 802. The second summation unit 804 is configured to determine, according to the order and the sequence number determined by the pre-sorting determining unit 801, the sum of the priority values corresponding to the records and the priority values corresponding to the records whose record numbers are smaller than the record number.

The second sorting order determining unit 805 is configured to select, in the value determined by the second summing unit 804, a set of values larger than the random number obtained by the random number generating unit 803, and select a minimum value representative from the set. Recording, placing the record in the arrangement of the query result to be displayed in the latter position of the position of the record having the largest sorting number of the sorted position.

The specific working principle of the first sort order determining unit 805 is as described in step 505 in Embodiment 2.

Since the higher the priority value is, the larger the SumXi is, the larger the probability is greater than RanX*SumXn, so the probability that the second sort order determining unit 805 determines that the first record of the ranking of the query result to be sorted is placed is larger. It is guaranteed to be sorted according to the priority value. Due to the uncertainty of the random number RanX, the record represented by the smallest value in the set of SumXi larger than RanX*SumXn is also uncertain in the user's view, and the user cannot predict the ordering of the displayed query results, thereby avoiding the The problem of the unfairness caused by the malicious query by the malicious user predicting the ranking of the query results, and the information query system provided in this embodiment is the same as the system described in Embodiment 3, and the record with the higher priority value is also The greater the probability of being ranked in the actual query results, the more optimal the commitment to the priority values registered by each registration unit.

Obviously, those skilled in the art should understand that each unit or step in the above embodiments of the present invention may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed in multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or Multiple of these units or steps are made in a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.

The method for sorting query results and the information query system provided by the embodiments of the present invention are described above. The description of the above embodiments is only for helping to understand the method and core idea of the present invention; meanwhile, it is for those skilled in the art. According to the idea of the present invention, in the specific implementation There is a change in the scope of the invention and the scope of the application, and the contents of the specification are not to be construed as limiting the invention.

Claims

Rights request

A method for sorting query results, which is characterized by comprising:

And determine the sort position of other records that meet the query criteria in the query results to be displayed.

The method according to claim 1, wherein the recording of the first position of the query result to be displayed is randomly determined according to the priority value, and specifically includes:

Determining the priority value corresponding to each record that meets the query condition;

Obtaining a sum of the priority values, creating a numerical interval whose interval length is equal to the sum, and establishing a mapping relationship between the sum and the numerical interval;

Determining, according to the proportional relationship between the priority values and the sum, the length of the interval occupied by each priority value in the numerical interval in which the interval length is equal to the sum, and the numerical interval, establishing each priority value and the numerical interval Mapping relations;

Setting a value in the numerical interval in which the interval length is equal to the sum; determining a priority value corresponding to the numerical interval to which the selected value belongs, and placing the record corresponding to the priority value in the query result to be displayed first place.

The sorting method according to claim 1, wherein the record of the first position of the query result to be displayed is randomly determined according to the priority value, and specifically includes:

Obtaining a product of the priority values, creating a numerical interval whose interval length is equal to the product, and establishing a mapping relationship between the product and the numerical interval;

Determining, according to the proportional relationship between the priority values and the product, a mapping relationship between each priority value and the value interval;

In the numerical interval in which the length of the interval is equal to the product, a value is arbitrarily selected; a priority value corresponding to the numerical interval to which the selected value belongs is determined, and the record corresponding to the priority value is placed in the query result to be displayed. first place.

The sorting method according to claim 1, wherein, according to the priority value, Randomly determine the records ranked in the first place of the query result to be displayed, including:

Determining a priority value corresponding to each record that meets the query condition, and sorting the records according to the corresponding priority value from large to small, and determining the sequence number of each record after sorting;

Determining a sum of the priority values, and selecting a random number smaller than the sum; determining a sum of a priority value corresponding to each record and a priority value corresponding to a record whose record number is smaller than the record number;

And selecting, in the sum of the priority values corresponding to the record whose record number is smaller than the record number, selecting a set of values larger than the random number less than the sum of the priority values, and selecting from the set The smallest value represents the record, placing the record in the first place of the query result to be displayed.

The sorting method according to claim 1, wherein the information database comprises:

Unit name, contact information of the unit, business category information or keyword information registered by the unit;

The querying the information database according to the query condition to determine the specific records that meet the query conditions:

Query information database according to keywords and business categories;

A record that matches both the business category and the keyword is used as a record that meets the query criteria.

6. An information query system, comprising:

An information storage unit for storing an information database;

a sorting unit, configured to randomly determine a record ranked first in the query result to be displayed according to the priority value corresponding to the record determined by the priority value determining unit; and determine another query determined by the query unit in the query to be displayed The sort position in the result.

The information query system according to claim 6, wherein the information stored by the information storage unit comprises: Unit name, contact information of the unit, business type of the unit, the unit is the keyword registered in the service category, and the priority value information.

The information query system according to claim 6 or 7, wherein the sorting unit comprises:

a calculating unit, configured to obtain, by the priority value determining unit, a priority value of each priority value corresponding to each record that does not determine a sorting position in the displayed query result, and obtain a sum of priority values;

a priority value and interval relationship determining unit, configured to determine a value interval whose interval length is equal to a sum obtained by the calculating unit, establish a mapping ratio relationship between a sum obtained by the calculating unit and a numerical interval, and determine each priority value in the The interval length is equal to the numerical interval occupied in the numerical interval of the sum, and the mapping relationship between each priority value and the numerical interval is established;

a random number selecting unit, configured to arbitrarily select a value within a range of values in which the interval length is equal to the sum obtained by the calculating unit;

a first sorting order determining unit, configured to record, in the arrangement position of the query result to be displayed, corresponding to the priority value corresponding to the numerical interval to which the value selected by the random number selecting unit belongs, determine the sorting of the determined sorting position The last position of the location where the largest record is located.

The information query system according to claim 6 or 7, wherein the sorting unit comprises: a priority value and an interval relationship determining unit, configured to determine a value interval in which the interval length is equal to the product obtained by the calculating unit Establishing a mapping relationship between the product and the numerical interval obtained by the calculating unit, determining a numerical interval occupied by each priority value in a numerical interval in which the interval length is equal to the product, and establishing a mapping between each priority value and a numerical interval Relationship

a random number selecting unit, configured to arbitrarily select a value within a range of values in which the interval length is equal to the product obtained by the calculating unit;

The information query system according to claim 6 or 7, wherein the ordering unit comprises:

a pre-sorting unit for sorting the records of the sorting positions in the displayed query results, sorting the priority values corresponding to the records from large to small, and determining the serial numbers of the records after sorting;

a first summation unit, configured to obtain a sum of priority values of the sort position that are not determined in the displayed query result;

a random number generating unit, configured to generate a random number smaller than a sum obtained by the first summation unit; determining a sum of a priority value corresponding to each record and a priority value corresponding to a record whose recording sequence number is smaller than the record serial number ;

a second sorting order determining unit, configured to record, in the value determined by the second summation unit, a record smaller than a minimum value in the set of values of the random number obtained by the random number generating unit in the query to be displayed The arrangement position of the result is determined as the latter position of the position where the record with the largest sort number of the sort position has been determined.