A data processing method, electronic device, and storage medium for event querying.

Abstract

This invention provides a data processing method, electronic device, and storage medium for event querying. The method includes: receiving a query request sent by a target terminal; the query request includes a region identifier D1 for the target source location and a region identifier D2 for the target destination location; obtaining a set E of target region identifiers corresponding to D1 and D2; using D1, D2, and E as query conditions, querying for target events in a database to determine a list R of target event information; determining the display order of each target event information in the target event information list R, and controlling the target terminal to display each target event information in the specified order. This invention filters all candidate events to be executed in the database using D1, D2, and the target region identifier in the query request, selects target event information that meets the target event query conditions, and sorts all target event information, making it easier for users to observe the specific characteristics of each transit flight and improving the user experience.

Description

Technical Field

[0001] This invention relates to the field of data processing, and in particular to a data processing method, electronic device, and storage medium for event querying. Background Technology

[0002] When users purchase connecting flights on ticketing platforms, existing platforms display all connecting flights or filter them based on only a single factor, requiring users to make their own selections, resulting in a poor user experience. Summary of the Invention

[0003] To address the aforementioned technical problems, the technical solution adopted by this invention is as follows:

[0004] A data processing method for event query is applied to a first server. The first server is connected to a database. The database includes a number of candidate events to be executed. Each candidate event to be executed has a region identifier of a candidate target source location and a region identifier of a candidate target destination location.

[0005] The data processing method for event querying includes the following steps:

[0006] S100, Receive a query request sent by the target terminal; the query request includes the area identifier D1 of the target source location and the area identifier D2 of the target destination location;

[0007] S200. Obtain the target region identifier set E = (E1, E2, ..., E2) corresponding to D1 and D2. i ,...,E j ); where i = 1, 2, ..., j; j is the number of target region identifiers; E i Identify the i-th target region;

[0008] S300. Using D1, D2, and E as query conditions, perform a target event query in the database to determine the target event information list R = (R1, R2, ..., R...). d ,...,R e ); where d = 1, 2, ..., e; e is the number of target event information; R dThis is the information for the d-th target event; each target event information has a first candidate event to be executed and a second candidate event to be executed, which are determined from several candidate events to be executed; the region identifier of the candidate target source location of the first candidate event to be executed in each target event information is D1, the region identifier of the candidate target destination location of the second candidate event to be executed is D2, and the candidate target destination location of the first candidate event to be executed and the candidate target source location of the second candidate event to be executed are located in the same geographical region, and the region identifier of this geographical region exists within E;

[0009] S400, Determine R1, R2, ..., R d ,...,R e The display order is determined, and the target terminal is controlled to display R1, R2, ..., R in that order. d ,...,R e ;

[0010] The target region identifier set E is determined through the following steps:

[0011] S201. Obtain several first region identifiers to obtain a list of first region identifiers K = (K1, K2, ..., K...). m ,...,K n ); where m = 1, 2, ..., n; n is the number of identifiers for the first region; K m This is the identifier for the m-th first region;

[0012] S202. Obtain the distance coefficient corresponding to each first region identifier, and obtain the distance coefficient list Z = (Z1, Z2, ..., Zn). m ,...,Z n Z m =(Dist(D1,K) m )+Dist(K m ,D2)) / Dist(D1,D2); where Z m The distance coefficient is assigned to the m-th first region identifier; Dist() is a preset distance determination function;

[0013] S203, Iterate through each distance coefficient in Z, if Z m If ≤g0, then Z m The corresponding first region identifier is determined as the target region identifier corresponding to D1 and D2, so as to obtain the target region identifier set E; where g0 is a preset distance coefficient threshold.

[0014] A non-transitory computer-readable storage medium stores a computer program that, when executed by a processor, implements the aforementioned data processing method for event querying.

[0015] An electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the aforementioned data processing method for event querying.

[0016] The present invention has at least the following beneficial effects:

[0017] This invention filters all candidate events to be executed in the database by using the region identifier of the target source location, the region identifier of the target destination location, and the target region identifier in the query request. It then filters out the target event information that meets the query conditions, namely the transit flight information, and sorts all the target event information, so that users can more conveniently observe the specific characteristics of each transit flight and select the transit flight that meets the user's query request, thereby improving the user experience. Attached Figure Description

[0018] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1 This is a connection block diagram of a first server for a data processing method for event querying provided in an embodiment of the present invention. Detailed Implementation

[0020] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0021] A data processing method for event query is applied to a ticketing platform where users purchase connecting flights. Based on the user's ticket purchase query request, the method queries and displays flights for each connecting flight, allowing the user to view each connecting flight that meets the purchase criteria.

[0022] like Figure 1As shown, a data processing method for event query is applied to a first server. The first server is communicatively connected to a database and several event execution mechanisms. Each event execution mechanism corresponds to a region identifier. The database includes several candidate events to be executed. Each candidate event to be executed has a region identifier for a candidate target source location and a region identifier for a candidate target destination location. The database also includes several groups of executed events. Each group of executed events has a region identifier for an executed target source location, a region identifier for an executed intermediate location, and a region identifier for an executed target destination location.

[0023] The first server can be the query server of the ticketing platform, and the database can be the data storage repository of the first server. The database contains historical ticket purchase records and real-time flight data. The candidate events to be executed can be flight transfer events, that is, query events for each transfer flight. The candidate target source location is the departure point of the transfer flight, and the candidate target destination location is the destination of the transfer flight. For example, if a user wants to travel from Beijing to Shanghai, the area identifier of the candidate target source location is Beijing, and the area identifier of the candidate target destination location is Shanghai.

[0024] The executed event group consists of historical transit ticket purchase events. The executed target source location is the departure point corresponding to the executed event group, the executed intermediate location is the transit point corresponding to the executed event group, and the executed target destination location is the destination corresponding to the executed event group. For example, if an executed event group in the database is a transit ticket from Beijing to Shanghai via Wuhan, then the area identifier of the executed target source location is Beijing, the area identifier of the executed intermediate location is Wuhan, and the area identifier of the executed target destination location is Shanghai.

[0025] The event execution agency can be the ticketing agency for each ticket. Each event execution agency has a corresponding area identifier to indicate the execution location of the event execution agency. For example, if the area identifier of an event execution agency is Beijing, it means that this event execution agency issues tickets in Beijing.

[0026] Candidate pending events are transit flight query events for passengers who have not yet traveled or purchased tickets, while executed event groups are historical transit flight purchase events for passengers who have already purchased tickets. Candidate pending events are transit flights that meet the query criteria based on the user's query request, while executed event groups are historical records stored in the database.

[0027] The data processing method for event querying includes the following steps:

[0028] S100, Receive a query request sent by the target terminal; the query request includes the area identifier D1 of the target source location and the area identifier D2 of the target destination location;

[0029] The target terminal is the user's flight ticket query terminal, which can be the user's mobile terminal or a public query platform. The user sends a query request to the first server. The area identifier D1 of the target source location in the query request is the user's departure point, and the area identifier D2 of the target destination location is the user's destination. For example, if the user is traveling from Beijing to Shanghai, then D1 is Beijing and D2 is Shanghai.

[0030] S200. Obtain the target region identifier set E = (E1, E2, ..., E2) corresponding to D1 and D2. i ,...,E j ); where i = 1, 2, ..., j; j is the number of target region identifiers; E i Identify the i-th target region;

[0031] Each target area identifier in the target area identifier set E is a region identifier for a city or airport that can be used for transit. That is, a flight from D1 to the target area identifier and a flight from the target area identifier to D2 constitute the user's transit flight, which transits within the geographical area where the target area identifier is located.

[0032] S300. Using D1, D2, and E as query conditions, perform a target event query in the database to determine the target event information list R = (R1, R2, ..., R...). d ,...,R e ); where d = 1, 2, ..., e; e is the number of target event information; R d This is the information for the d-th target event; each target event information has a first candidate event to be executed and a second candidate event to be executed, which are determined from several candidate events to be executed; the region identifier of the candidate target source location of the first candidate event to be executed in each target event information is D1, the region identifier of the candidate target destination location of the second candidate event to be executed is D2, and the candidate target destination location of the first candidate event to be executed and the candidate target source location of the second candidate event to be executed are located in the same geographical region, and the region identifier of this geographical region exists within E;

[0033] The target event query is a flight query for transiting through the geographic area where the target area identifier is located. Each target event information in the target event information list R is flight information from location D1, transiting through the geographic area where the target area identifier is located, to location D2. The first candidate event to be executed is the flight from location D1 to the location of the target area identifier, and the second candidate event to be executed is the flight from the location of the target area identifier to location D2. The candidate target source location is the departure location of the flight corresponding to the candidate event to be executed, and the candidate target destination location is the destination of the flight corresponding to the candidate event to be executed. The transit target area identifier is determined in E.

[0034] There are several candidate pending events, including the first and second candidate pending events. The first and second candidate pending events together constitute the user's overall itinerary flight, namely the flight from D1 to the target area identifier and the flight from the target area identifier to D2.

[0035] Among the first and second candidate events to be executed for each target event information, there is at most one candidate event to be executed with a set identifier; the set identifier is represented by the region identifier of the corresponding candidate event to be executed with the middle position;

[0036] The system identifies transit points, meaning that a user is only allowed a maximum of one transit flight. Candidate events to be executed are transit flights. For example, if a user is traveling from Beijing to Shanghai, they are only allowed a maximum of one transit flight in the entire flight. This means that a user can take a maximum of two flight numbers, ensuring the simplicity of the user's transit process and shortening unnecessary travel time.

[0037] S400, Determine R1, R2, ..., R d ,...,R e The display order is determined, and the target terminal is controlled to display R1, R2, ..., R in that order. d ,...,R e ;

[0038] Determine the display order of each target event information, i.e. each transit flight, on the target terminal for the user to select.

[0039] The target region identifier set E is determined through the following steps:

[0040] S201. Obtain several first region identifiers to obtain a list of first region identifiers K = (K1, K2, ..., K...). m ,...,K n ); where m = 1, 2, ..., n; n is the number of identifiers for the first region; K mThis is the identifier for the m-th first region;

[0041] S202. Obtain the distance coefficient corresponding to each first region identifier, and obtain the distance coefficient list Z = (Z1, Z2, ..., Zn). m ,...,Z n Z m =(Dist(D1,K) m )+Dist(K m ,D2)) / Dist(D1,D2); where Z m The distance coefficient is assigned to the m-th first region identifier; Dist() is a preset distance determination function;

[0042] S203, Iterate through each distance coefficient in Z, if Z m If ≤g0, then Z m The corresponding first region identifier is determined as the target region identifier corresponding to D1 and D2, so as to obtain the target region identifier set E; where g0 is the preset distance coefficient threshold.

[0043] The first area identifier is the identification information of airports or cities that meet the transit conditions. The distance coefficient of each first area identifier is the condition for determining whether to identify the first area identifier as the target area identifier. Dist(D1,K) m () is from D1 to K m The distance between them, Dist(K) m D2) is derived from K m Dist(D1,D2) is the distance between D1 and D2. The corresponding distance coefficient Z is obtained through calculation. m Then, each distance coefficient is compared with the distance coefficient threshold g0. If it is less than or equal to g0, it is identified as the target area identifier to select transit cities with shorter transit distances, thus avoiding excessive travel time caused by excessive transit distances for users.

[0044] Furthermore, the distance coefficient threshold g0 meets the following conditions:

[0045] If 0 < Dist(D1,D2) ≤ L1, then g0 = g1;

[0046] If L1 < Dist(D1,D2) ≤ L2, then g0 = g2;

[0047] If L2 < Dist(D1,D2) ≤ L3, then g0 = g3;

[0048] If Dist(D1,D2)>L3, then g0=g4;

[0049] Where 0 < L1 < L2 < L3; 0 < g1 < g2 < g3 < g4.

[0050] L1, L2, and L3 can be determined according to the actual scenario, such as 500 km, 1000 km, and 1500 km. g1, g2, g3, and g4 are the corresponding distance coefficient thresholds, which can also be expressed as the detour rate, that is, the ratio of the distance that is more than the direct flight during the actual transfer process, which can be 1.2, 1.4, 1.5, and 1.6.

[0051] Further, step S300 includes:

[0052] S311, According to D1, D2, E i Obtain the first target event information corresponding to all target area identifiers, and obtain the first target event information set F = (F1, F2, ..., F...). u ,...,F v ); where u = 1, 2, ..., v; v is the number of first target event information; F u This is the information for the u-th first target event; each first target event information has a third candidate event to be executed and a fourth candidate event to be executed; the third candidate event to be executed and the fourth candidate event to be executed are determined from several candidate events to be executed; E i The region identifier for the candidate target source location of the corresponding third candidate event to be executed is D1, and the region identifier for the candidate target destination location is E. i E i The region identifier for the candidate target source location of the corresponding fourth candidate event to be executed is E. i The region identifier for the candidate target's location is D2;

[0053] The first target event information is the transit flight; the third candidate event to be executed is the itinerary information of the first segment of the transit flight; and the fourth candidate event to be executed is the itinerary information of the second segment of the transit flight.

[0054] S312. Based on D1 and D2, obtain the preset coefficients of the second target event information to obtain the second target event information set H = (H1, H2, ..., H...). k ,...,H y ); where k = 1, 2, ..., y; y is the number of second target event information; H k The preset coefficient is the k-th second target event information; each second target event information has a fifth candidate event to be executed; the region identifier of the candidate target source location of the fifth candidate event to be executed is D1, and the region identifier of the candidate target destination location is D2;

[0055] The second target event information is a direct flight, that is, a direct flight from D1 to D2, with a preset coefficient equal to the price of the direct flight.

[0056] S313. Determine the preset coefficient corresponding to MAX(H) as the target preset coefficient; where MAX() is the preset maximum value determination function;

[0057] The highest ticket price among direct flights is set as the target preset coefficient.

[0058] S314. According to F1, F2, ..., F u ,...,F v Obtain the preset coefficient corresponding to each first target event information; if F u If the corresponding preset coefficient is less than or equal to the target preset coefficient, then F will be... u This has been identified as the target event information.

[0059] The price of each connecting flight (the first target event information) is compared with the highest price of a direct flight. If the former is larger, it means the connecting flight is more expensive than the most expensive direct flight, and the connecting flight is not considered. If the latter is larger, it means the connecting flight is cheaper than the most expensive direct flight, and the connecting flight is considered and identified as the target event information. This step is price filtering, which ensures that the user's cost for connecting flights is not too high and also filters out some excessively expensive connecting flights.

[0060] Specifically, step S314 includes:

[0061] S321. According to F1, F2, ..., F u ,...,F v Obtain the preset coefficient corresponding to each first target event information; if F u If the corresponding preset coefficient is less than or equal to the target preset coefficient, then proceed to step S322;

[0062] S322, Determine F u The corresponding waiting time T u2 =t u1 -t u2 ; where t u1 For F u The corresponding third candidate event to be executed has an event execution start time and F u The time difference between the execution end times of the corresponding fourth candidate event to be executed; t u2 For F u The corresponding third candidate event to be executed and the event execution end time and F u The time difference between the start times of the corresponding fourth candidate event to be executed;

[0063] The waiting time is the transit time for the user during the transfer.

[0064] S323, Obtain F u The corresponding first position identifier O u1 Second position identifier O u2 O u1 For F u The location identifier of the candidate target source location corresponding to the third candidate event to be executed, O u2 For F u The location identifier of the candidate target location for the corresponding fourth candidate event to be executed; O u1 Corresponding geographical location and O u2 The corresponding geographical locations are within the same geographical region, and the regional identifier of that geographical region exists within E;

[0065] The first location identifier represents the destination airport of the first segment of the user's connecting flight, and the second location identifier represents the departure airport of the second segment of the user's connecting flight. The first and second location identifiers belong to the same geographical area, which can represent different airports in the same city. Most cities have only one civilian airport, but some large cities, such as Beijing and Shanghai, have two civilian airports. Although the transit points of the connecting flights are in the same city, the arrival and departure airports are different, and the distance between the two airports is too far, which may affect the user's transfer. Therefore, different airports in the same city are also one of the factors affecting connecting flight tickets.

[0066] S324. If the first target event information meets the following conditions, then the first target event information is determined as target event information;

[0067] O u1 =O u2 And T u2 >s1; indicates that if the destination airport of the first flight and the departure airport of the second flight are the same airport, the restrictions on the user's transfer time can be reduced, such as a transfer time of 120 minutes.

[0068] O u1 ≠O u2 And T u2 >s2; s1 <s2; This indicates that the destination airport of the first connecting flight and the departure airport of the second connecting flight are not the same airport. In this case, the user's transfer time needs to be appropriately increased, such as a transfer time of 300 minutes. Therefore, s2 must be greater than s1. This step is for transfer time filtering, ensuring that the user has sufficient transfer time between the two flights.

[0069] Further, step S400 includes:

[0070] S411. Obtain the sorting influence parameters for each target event, resulting in the sorting influence parameter set W = (W1, W2, ..., W...). d ,...,W e ), W d =(CX*BX) d )-(CY*BY d )-(CZ*BZ d ); where W d BX is the parameter affecting the sorting of the d-th target event information. d =(M 1d +M 2d ) / 200, BX d M is the first influence factor parameter for the d-th target event information. 1d M is the delay factor of the third candidate event to be executed in the d-th target event information. 2d The delay factor for the fourth candidate event to be executed in the d-th target event information; BY d =(N d -N min ) / (N max -N min BY d N is the second influence factor parameter for the d-th target event information. d N represents the preset coefficient corresponding to the d-th target event information. min N is the minimum value among the preset coefficients corresponding to all target event information. max The maximum value among the preset coefficients corresponding to all target event information; BZ d =(T d -T min ) / (T max -T min ), BZ d T is the third influence factor parameter for the d-th target event information. d T is the time coefficient corresponding to the d-th target event information. min T is the minimum value among the time coefficients corresponding to all target event information. max CX is the maximum value among the time coefficients corresponding to all target event information; CY is the weight coefficient corresponding to the first influence factor parameter; CZ is the weight coefficient corresponding to the second influence factor parameter; and CZ is the weight coefficient corresponding to the third influence factor parameter.

[0071] The first influencing factor parameter is the evaluation parameter for on-time performance, and the delay factor is the on-time performance parameter, M. 1d M is the historical on-time rate of the first flight segment. 2dThis is the historical on-time rate for the second segment of the flight. The on-time rate for each flight is stored in the database and can be retrieved directly from the database.

[0072] The second influencing factor parameter is the price evaluation parameter, N. d Let N be the total price of the connecting flights to be determined, which is the sum of the ticket prices for the first and second flights. min N is the lowest price among all connecting flights. max This is the highest price for all connecting flights.

[0073] The third influencing factor parameter is the evaluation parameter for flight time, T. d T represents the total flight time of the connecting flights to be determined, which is the sum of the flight times of the first and second segments of the flight. min For the shortest flight time of all connecting flights, T max This is the longest flight time for all connecting flights.

[0074] The score for the corresponding connecting flight is obtained by multiplying the three influencing factor parameters and their respective weights, which is the ranking influence parameter. From the calculation formula of the ranking influence parameter, the lower the ticket price, the higher the ranking influence parameter, that is, the higher the score of the corresponding connecting flight. The shorter the total flight time, the higher the ranking influence parameter. The higher the on-time rate, the higher the ranking influence parameter. The weights of each parameter can be adjusted according to the system or according to the user's needs. For example, if the user focuses on price, the weight of the ticket price, that is, the second influencing factor parameter, will be increased, thereby affecting each ranking influence parameter.

[0075] S412, According to W1, W2, ..., W d ,...,W e Sort the e target event information to obtain the first target event information list A = (A1, A2, ..., A...). d ,...,A e A1, A2, ..., A d ,...,A e The corresponding sorting effect parameters decrease; where A d This refers to the information of the d-th target event in A;

[0076] S413, Place A1, A2, ..., A d ,...,A e The display order of each target event information is determined, and the target terminal is controlled to display each target event information in the display order.

[0077] Based on the ranking influence parameters obtained for each connecting flight, all connecting flights are sorted from largest to smallest to determine the display position of each connecting flight. The connecting flight with the highest ranking influence parameter is displayed at the top of the target terminal interface, making it easier for users to select a suitable connecting flight based on the overall score.

[0078] Furthermore, after step S100, the data processing method for event querying further includes:

[0079] S110. Traverse each executed event group in the database and determine the number B of the first executed event groups for each executed intermediate location region identifier; the first executed event group is the executed event group whose region identifier for the executed target source location is D1 and whose region identifier for the executed target destination location is D2.

[0080] S120. If B≥q, then the corresponding first executed event group is determined as the target event group to be executed; where q>0, and q is a preset quantity threshold.

[0081] S130, Control the target terminal to display each target pending event group.

[0082] The first executed event group consists of historical transit flight information in the database. By comparing B and q, the transit flight to be displayed is determined. For example, if q is 10, there are 50 historical transit flight orders from Beijing to Shanghai with a stopover in Wuhan, and 8 historical orders from Beijing to Shanghai with a stopover in Jinan. In this case, the flight with a stopover in Wuhan will be displayed directly, and the flight with a stopover in Jinan will be automatically filtered out. This ensures that users can select the flight based on the most historical orders, saving on various comparison procedures for transit tickets and making it easier for users to select transit flights based on historical big data.

[0083] The first area identifier is determined through the following steps:

[0084] S210. Obtain the first target time interval T1 = [t0, t now Within [ ], the maximum number of candidate events that each event execution mechanism can execute is obtained, resulting in an execution count list G = (G 12 G 22 ,...,G r2 ,...,G x2 ); where r = 1, 2, ..., x; x is the number of event execution mechanisms; G r2 The maximum number of candidate events that the r-th event executor can execute; t0 is the first set time point, t now The current time; t0 < t now ;

[0085] S220, if G r2If ≥a, then G r2 The corresponding event execution agency's region identifier is determined as the first region identifier; where 'a' is a preset quantity threshold.

[0086] Each candidate event to be executed corresponds to an execution region identifier;

[0087] Furthermore, the first region identifier list K is determined through the following steps:

[0088] S010. Based on the execution area identifier, obtain the first target time period T1 = [t0, t...] now Within each execution region, the completion data information of the candidate events to be executed corresponding to each execution region is identified, resulting in a completion quantity data information set Q = (Q1, Q2, ..., Q...). r ,...,Q x ), Q r =(G r1 G r2 ); where r = 1, 2, ..., x; x is the number of execution region identifiers; Q r The completion data information of the candidate events to be executed corresponding to the r-th execution region identifier; G r1 For Q r The corresponding execution region identifier, G r2 For G r1 The corresponding number of candidate events to be executed; t0 is the first set time point, t now The current time; t0 < t now ;

[0089] S020, according to G 12 G 22 ,...,G r2 ,...,G x2 Sort the x execution region identifiers to obtain the second target event information list K = (K1, K2, ..., K... r ,...,K x K1, K2, ..., K r ,...,K x The number of completed corresponding target events decreases; where K r Let r be the identifier of the execution region in K;

[0090] S030, Set K1, K2, ..., K m ,...,K n The corresponding execution region identifier is determined as the first region identifier, resulting in a first region identifier list K = (K1, K2, ..., K...). m ,...,K n ); where n≤x.

[0091] This method involves selecting cities based on the number of transit orders within a historical time period. All transit cities are ranked from highest to lowest number of transit orders, and the identification information of the top n transit cities is selected as the first region identifier, i.e., transit cities with a high number of transits.

[0092] This invention filters all candidate events to be executed in the database by using the region identifier of the target source location, the region identifier of the target destination location, and the target region identifier in the query request. It then filters out the target event information that meets the query conditions, namely the transit flight information, and sorts all the target event information, so that users can more conveniently observe the specific characteristics of each transit flight and select the transit flight that meets the user's query request, thereby improving the user experience.

[0093] Embodiments of the present invention also provide a non-transitory computer-readable storage medium that can be disposed in an electronic device to store at least one instruction or at least one program related to implementing a method in the method embodiments, wherein the at least one instruction or the at least one program is loaded and executed by the processor to implement the method provided in the above embodiments.

[0094] Embodiments of the present invention also provide an electronic device, including a processor and the aforementioned non-transitory computer-readable storage medium.

[0095] Embodiments of the present invention also provide a computer program product including program code, which, when the program product is run on an electronic device, causes the electronic device to perform the steps of the methods described above in various exemplary embodiments of the present invention.

[0096] While specific embodiments of the invention have been described in detail by way of example, those skilled in the art should understand that the above examples are for illustrative purposes only and are not intended to limit the scope of the invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.

Claims

1. A data processing method for event querying, characterized in that, It is applied to a first server, which is connected to a database. The database includes several candidate events to be executed. Each candidate event to be executed has a region identifier of a candidate target source location and a region identifier of a candidate target destination location. The method includes the following steps: S100, Receive a query request sent by the target terminal; the query request includes the area identifier D1 of the target source location and the area identifier D2 of the target destination location; S200. Obtain the target region identifier set E=(E1,E2,...,E2) corresponding to D1 and D2. i ,...,E j ); where i = 1, 2, ..., j; j is the number of target region identifiers; E i Identify the i-th target region; S300. Using D1, D2, and E as query conditions, perform a target event query in the database to determine the target event information list R=(R1,R2,...,R...). d ,...,R e ); where d=1,2,...,e; e is the number of target event information; R d This is the d-th target event information; each target event information has a first candidate event to be executed and a second candidate event to be executed, which are determined from a number of candidate events to be executed; the region identifier of the candidate target source location of the first candidate event to be executed in each target event information is D1, the region identifier of the candidate target destination location of the second candidate event to be executed is D2, and the candidate target destination location of the first candidate event to be executed and the candidate target source location of the second candidate event to be executed are located in the same geographical region, and the region identifier of this geographical region exists within E; S400, Determine R1, R2, ..., R d ,...,R e The display order is determined, and the target terminal is controlled to display R1, R2, ..., R in that order. d ,...,R e ; The target region identifier set E is determined through the following steps: S201. Obtain several first region identifiers to obtain a list of first region identifiers K=(K1,K2,...,K...). m ,...,K n ); where m=1,2,...,n; n is the number of identifiers for the first region; K m This is the identifier for the m-th first region; S202. Obtain the distance coefficient corresponding to each of the first region identifiers to obtain a distance coefficient list Z=(Z1,Z2,...,Z...). m ,...,Z n Z m =(Dist(D1,K m )+Dist(K m ,D2)) / Dist(D1,D2); where Z m The distance coefficient is assigned to the m-th first region identifier; Dist() is a preset distance determination function; S203, Iterate through each distance coefficient in Z, if Z m If ≤g0, then Z m The corresponding first region identifier is determined as the target region identifier corresponding to D1 and D2, so as to obtain the target region identifier set E; where g0 is a preset distance coefficient threshold; The first region identifier list K is determined through steps S010-S030: S010. Based on the execution area identifier, obtain the first target time period T1=[t0,t... now Within each execution region, the completion data information of the candidate events to be executed corresponding to each execution region is used to obtain the completion quantity data information set Q=(Q1,Q2,...,Q r ,...,Q x ), Q r =(G r1 G r2 ); where r = 1, 2, ..., x; x is the number of execution region identifiers; Q r The completion data information of the candidate events to be executed corresponding to the r-th execution region identifier; G r1 For Q r The corresponding execution region identifier, G r2 For G r1 The corresponding number of candidate events to be executed; t0 is the first set time point, t now The current time; t0 < t now ; S020, according to G 12 G 22 ,...,G r2 ,...,G x2 Sort the x execution region identifiers to obtain the second target event information list K=(K1,K2,...,K... r ,...,K x K1, K2, ..., K r ,...,K x The number of completed corresponding target events decreases; where K r Let r be the identifier of the execution region in K; S030, Set K1, K2, ..., K m ,...,K n The corresponding execution region identifier is determined as the first region identifier, resulting in a first region identifier list K=(K1,K2,...,K...). m ,...,K n ); where n≤x.

2. The method according to claim 1, characterized in that, The distance coefficient threshold g0 meets the following conditions: If 0 < Dist(D1,D2) ≤ L1, then g0 = g1; If L1 < Dist(D1,D2) ≤ L2, then g0 = g2; If L2 < Dist(D1,D2) ≤ L3, then g0 = g3; If Dist(D1,D2)>L3, then g0=g4; Where 0 < L1 < L2 < L3; 0 < g1 < g2 < g3 < g4; g1, g2, g3, and g4 are preset distance coefficient thresholds.

3. The method according to claim 1, characterized in that, Step S300 includes: S311, According to D1, D2, E i Obtain the first target event information corresponding to all target area identifiers, and obtain the first target event information set F=(F1,F2,...,F...). u ,...,F v ); where u=1,2,...,v; v is the number of first target event information; F u This is the information for the u-th first target event; each first target event information has a third candidate event to be executed and a fourth candidate event to be executed; the third candidate event to be executed and the fourth candidate event to be executed are determined from a plurality of candidate events to be executed; E i The corresponding region identifier for the candidate target source location of the third candidate event to be executed is D1, and the region identifier for the candidate target destination location is E. i E i The corresponding region identifier for the candidate target source location of the fourth candidate event to be executed is E. i The region identifier for the candidate target location is D2; S312. Based on D1 and D2, obtain the preset coefficients of the second target event information to obtain the second target event information set H=(H1,H2,...,H... k ,...,H y ); where k=1,2,...,y; y is the number of second target event information; H k The preset coefficient is the k-th second target event information; each second target event information has a fifth candidate event to be executed; the region identifier of the candidate target source location of the fifth candidate event to be executed is D1, and the region identifier of the candidate target destination location is D2; S313. Determine the preset coefficient corresponding to MAX(H) as the target preset coefficient; where MAX() is the preset maximum value determination function; the target preset coefficient is the preset coefficient with the largest value among several preset coefficients of second target event information; S314. According to F1, F2, ..., F u ,...,F v Obtain the preset coefficient corresponding to each first target event information; if F u If the corresponding preset coefficient is less than or equal to the target preset coefficient, then F will be... u This has been identified as the target event information.

4. The method according to claim 3, characterized in that, Step S314 includes: S321. According to F1, F2, ..., F u ,...,F v Obtain the preset coefficient corresponding to each first target event information; if F u If the corresponding preset coefficient is less than or equal to the target preset coefficient, then proceed to step S322; S322, Determine F u The corresponding waiting time T u2 =t u1 -t u2 ; where t u1 For F u The corresponding third candidate event to be executed has an event execution start time and F u The time difference between the execution end times of the corresponding fourth candidate event to be executed; t u2 For F u The corresponding third candidate event to be executed and the event execution end time and F u The time difference between the start times of the corresponding fourth candidate event to be executed; S323, Obtain F u The corresponding first position identifier O u1 Second position identifier O u2 O u1 For F u The location identifier of the candidate target source location corresponding to the third candidate event to be executed, O u2 For F u The location identifier of the candidate target location for the corresponding fourth candidate event to be executed; O u1 Corresponding geographical location and O u2 The corresponding geographical locations are within the same geographical region, and the regional identifier of that geographical region exists within E; S324. If the first target event information meets the following conditions, then the first target event information is determined as target event information; O u1 =O u2 And T u2 >s1; O u1 ≠O u2 And T u2 >s2; Where s1 < s2.

5. The method according to claim 1, characterized in that, In each target event information, at most one of the first and second candidate events to be executed has a set identifier; the set identifier is represented by the region identifier of the corresponding candidate event to be executed with the middle position.

6. The method according to claim 4, characterized in that, Step S400 includes: S411. Obtain the sorting influence parameters for each target event, resulting in the sorting influence parameter set W=(W1,W2,...,W...). d ,...,W e ), W d =(CX*BX d )-(CY*BY d )-(CZ*BZ d ); where W d BX is the parameter affecting the sorting of the d-th target event information. d =(M 1d +M 2d ) / 200, BX d M is the first influence factor parameter for the d-th target event information. 1d M is the delay factor of the third candidate event to be executed in the d-th target event information. 2d The delay factor for the fourth candidate event to be executed in the d-th target event information; BY d =(N d -N min ) / (N max -N min BY d N is the second influence factor parameter for the d-th target event information. d N represents the preset coefficient corresponding to the d-th target event information. min N is the minimum value among the preset coefficients corresponding to all target event information. max The maximum value among the preset coefficients corresponding to all target event information; BZ d =(T d -T min ) / (T max -T min ), BZ d T is the third influence factor parameter for the d-th target event information. d T is the time coefficient corresponding to the d-th target event information. min T is the minimum value among the time coefficients corresponding to all target event information. max CX is the maximum value among the time coefficients corresponding to all target event information; CY is the weight coefficient corresponding to the first influence factor parameter; CZ is the weight coefficient corresponding to the second influence factor parameter; and CZ is the weight coefficient corresponding to the third influence factor parameter. S412, According to W1, W2, ..., W d ,...,W e Sort the e target event information to obtain the first target event information list A=(A1,A2,...,A... d ,...,A e A1, A2, ..., A d ,...,A e The corresponding sorting effect parameters decrease; where A d This refers to the information of the d-th target event in A; S413, Place A1, A2, ..., A d ,...,A e The display order of each target event information is determined, and the target terminal is controlled to display each target event information in the display order.

7. The method according to claim 1, characterized in that, The database includes several groups of executed events. Each group of executed events has a region identifier for the executed target source location, a region identifier for the executed intermediate location, and a region identifier for the executed target destination location. After step S100, the method further includes: S110. Traverse each executed event group in the database and determine the number B of the first executed event groups for each executed intermediate location region identifier; the first executed event group is the executed event group whose region identifier for the executed target source location is D1 and whose region identifier for the executed target destination location is D2. S120. If B≥q, then the corresponding first executed event group is determined as the target event group to be executed; where q>0, and q is a preset quantity threshold. S130, Control the target terminal to display each target pending event group.

8. The method according to claim 1, characterized in that, The first server is connected to several event execution mechanisms, and each event execution mechanism has a corresponding area identifier. The first area identifier is determined through the following steps: S210, Obtain the first target time interval T1=[t0,t now Within this range, each event execution mechanism can execute the maximum number of candidate events to be executed, resulting in an execution count list G = (G... 12 G 22 ,...,G r2 ,...,G x2 ); where r = 1, 2, ..., x; x is the number of event execution mechanisms; G r2 The maximum number of candidate events that the r-th event executor can execute; t0 is the first set time point, t now The current time; t0 < t now ; S220, if G r2 If ≥a, then G r2 The corresponding event execution agency's region identifier is determined as the first region identifier; where 'a' is a preset quantity threshold.

9. A non-transitory computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements a data processing method for event querying as described in any one of claims 1 to 8.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements a data processing method for event querying as described in any one of claims 1 to 8.

Images