CN111460309B - Information searching method and device and electronic equipment - Google Patents
Information searching method and device and electronic equipment Download PDFInfo
- Publication number
- CN111460309B CN111460309B CN202010265824.7A CN202010265824A CN111460309B CN 111460309 B CN111460309 B CN 111460309B CN 202010265824 A CN202010265824 A CN 202010265824A CN 111460309 B CN111460309 B CN 111460309B
- Authority
- CN
- China
- Prior art keywords
- date
- departure
- travel
- data
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000012545 processing Methods 0.000 claims description 27
- 238000004590 computer program Methods 0.000 claims description 14
- 230000006870 function Effects 0.000 claims description 13
- 238000012216 screening Methods 0.000 claims description 12
- 238000004364 calculation method Methods 0.000 claims description 11
- 230000010006 flight Effects 0.000 claims description 11
- 230000008569 process Effects 0.000 claims description 11
- 238000013524 data verification Methods 0.000 claims description 3
- 238000012795 verification Methods 0.000 claims 14
- 230000008521 reorganization Effects 0.000 claims 2
- 238000010586 diagram Methods 0.000 description 14
- 230000009471 action Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000001502 supplementing effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000007639 printing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G06Q50/40—
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application discloses an information searching method, an information searching device and electronic equipment, wherein the method and the information searching device are particularly used for responding to a searching request of a user, receiving and analyzing a travel date input by the user, wherein the travel date comprises a departure date, a departure offset and a travel period; sorting the travel dates to obtain target travel dates, wherein the target travel dates comprise target departure dates and target return dates; creating travel data according to the target travel date, wherein the travel data comprises flight information and lowest fare information; and returning the flight information and the lowest fare information to the user. According to the scheme, a user does not need to calculate the return date, so that the current searching mode is improved, and the manual operation task of the user is reduced.
Description
Technical Field
The present application relates to the field of aviation technologies, and in particular, to an information searching method, an information searching device, and an electronic device.
Background
Most of the freight rate search platforms at present can realize a calendar search function of displaying the lowest freight rate result of a certain flight combination according to a given departure return date range. However, for some users with well-defined fixed stay days, it is still necessary to manually calculate the return date according to the departure date, and then to obtain the result by invoking the freight rate search system. This makes part of the operation transferred to the user, resulting in unfriendly search patterns.
Disclosure of Invention
In view of the above, the present application provides an information searching method, apparatus and electronic device, which are used for improving the current searching mode and reducing the manual operation task of the user.
In order to achieve the above object, the following solutions have been proposed:
an information search method, comprising the steps of:
responding to a search request of a user, and receiving and analyzing a travel date input by the user, wherein the travel date comprises a departure date, a departure offset and a travel period;
calculating the travel date to obtain a target travel date, wherein the target travel date comprises a target departure date and a target return date;
creating trip data according to the target trip date, wherein the trip data comprises flight information and lowest fare information;
checking whether the travel data is available;
and if the journey data is available, returning the flight information and the lowest fare information to the user.
Optionally, the method further comprises the steps of:
and deleting the travel data if the travel data is not available.
Optionally, the processing the travel date includes the steps of:
performing addition operation on the preset departure date based on the departure offset to obtain the target departure date;
and carrying out addition operation on the target departure date based on the travel deadline to obtain the target return date.
Optionally, the departure offset includes a negative offset before the preset departure date and a positive offset after the departure date.
An information search apparatus, comprising:
the request receiving module is configured to respond to a search request of a user, and receive and analyze a travel date input by the user, wherein the travel date comprises a departure date, a departure offset and a travel deadline;
the data processing module is configured to calculate and process the travel date to obtain a target travel date, wherein the target travel date comprises a target departure date and a target return date;
a itinerary creation module configured to create itinerary data from the target itinerary date, the itinerary data including flight information and minimum fare information;
the data verification module is used for verifying whether the travel data are available or not;
and the information return module is configured to return the flight information and the lowest fare information to a user if the journey data is available.
Optionally, the method further comprises:
a data screening module configured to delete the trip data if the trip data is not available.
Optionally, the data processing module includes:
the first calculating unit is configured to perform addition operation on the preset departure date based on the departure offset to obtain the target departure date;
and the second calculating unit is configured to perform addition operation on the target departure date based on the travel deadline to obtain the target return date.
Optionally, the departure offset includes a negative offset before the preset departure date and a positive offset after the departure date.
An electronic device is provided with the information search apparatus as described above.
An electronic device comprising at least one processor and a memory coupled to the processor, wherein:
the memory is used for storing a computer program or instructions;
the processor is configured to acquire and execute the computer program or instructions to cause the electronic device to perform the information search method as described above.
From the above technical scheme, the application discloses an information searching method and device, particularly, the method and device are used for responding to a searching request of a user, receiving and analyzing a journey date input by the user, wherein the journey date comprises a departure date, a departure offset and a travel period; sorting the travel dates to obtain target travel dates, wherein the target travel dates comprise target departure dates and target return dates; creating travel data according to the target travel date, wherein the travel data comprises flight information and lowest fare information; and checking the journey data, and returning the flight information and the lowest fare information to the user if the journey data are available. According to the scheme, a user does not need to calculate the return date, so that the current searching mode is improved, and the manual operation task of the user is reduced.
Furthermore, the present application has its own unique characteristics compared with other conventional calendar search devices, which are mainly expressed in three aspects: 1. and (3) filtering useless information, namely improving the system performance, and avoiding repeated searching for multiple times to reduce flow consumption.
Drawings
In order to more clearly illustrate the embodiments of the application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of an information searching method according to an embodiment of the present application;
fig. 2 is a block diagram of an information search apparatus according to an embodiment of the present application;
fig. 3 is a system configuration diagram of an information search apparatus according to an embodiment of the present application;
FIG. 4 is a diagram of database components of an information search apparatus according to an embodiment of the present application;
fig. 5 is a flow chart of fare information searching of the information searching apparatus according to the embodiment of the present application;
FIG. 6 is an example result diagram of an information search method according to an embodiment of the present application;
fig. 7 is a functional block diagram of an information search apparatus according to an embodiment of the present application;
fig. 8 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The terms referred to in the present application are as follows:
fire: freight rate;
ATPCO: airline Tariff Publishing Company, an aviation freight issuing company;
iata: international Air Transport Association, international air transport association;
OAG: official airline Guide, official aviation guides;
AVS: availability Status Message, the cabin available status message;
SSM: standard Schedule Message, flight plan message;
FC: the Fare calculation group refers to a space between two adjacent Fare calculation points;
PU: price Unit: a fare element is a combination of one or a part of the legs of a voyage where fares can be calculated separately. That is, one pricing unit may be filled with tickets individually. The printing Unit is composed of one or more fire components;
TKT: a ticket, an air ticket;
journal: journey data, which is all the journey from the origin to the destination in the passenger ticket marked on the passenger ticket, and from the perspective of freight calculation, the journey is composed of one or more price units (price units);
expandard FssCombos: a flight combination information set;
carrier: an airline company;
FssCombo: flight combination information;
agencies: customer information;
PaxPTCCombos: passenger type combination;
passenger: passenger information.
From the analysis of travel behavior, some passengers have a relatively fixed residence time while traveling: for example, the business traveler residence time is determined by the duration of the business activity, the travel traveler residence time of the vacation travel is determined by the destination and the length of the vacation, and generally the off-the-road residence time is relatively determined. And secondly, from the development of the industry, the minimum fare information search oriented to the fixed travel period has strong universality, and many aviation agents have the search requirement. The following examples are therefore specifically presented:
example 1
Fig. 1 is a flowchart of an information searching method according to an embodiment of the present application.
As shown in fig. 1, the searching method of the present embodiment is applied to a fare searching system of a airline or an airline agent, and specifically includes the following steps:
s1, receiving and analyzing a journey date input by a user.
After the user inputs the corresponding search request, the search request is received and parsed to obtain the journey date which is input together through the search request, wherein the journey date comprises the departure date, the departure offset and the journey period.
The time range of the departure date is configured by the user. For example, the user may type in the XXXX year, the XX month, and X days after the X days before the XX day. The system will give a departure time in the time frame when the result is presented.
The user is required to type in the maximum stay period number of days and the minimum stay period number of days. In the system configuration file, a stay day difference span limit coefficient is set. And (3) making the difference between the maximum residence time and the minimum residence time, wherein the value of the difference is smaller than the coefficient minus 1, so that the request splitting can be performed. The function of the coefficient is to limit the span of stay days so as not to cause overlarge splitting logic operation pressure.
S2, calculating the travel date to obtain the target travel date.
The target trip date refers to the final obtained actual trip data of the user, and comprises the actual departure date, the actual return date and the like. Specifically, the data arrangement is performed by the following procedure:
first, a departure variable time range, namely a negative offset (from) before a specified date and a positive offset (to) after the specified date, is taken, from is abstracted to be a negative number, to is abstracted to be a positive number, all values from the negative number from to the positive number to are traversed, and an addition operation is carried out with the specified departure date to obtain a new departure date.
Then, the range of the return time period can be determined through the maximum residence time and the minimum residence time which are input by the user, namely, the new departure time and each residence time in the range of the return residence time are added, and the new return time is obtained. Date matching the new departure time and the new return time to form a new time pair request.
The other fields in the request message are further parsed so that the requests for each time pair form a separate request structure class in the program. There is only a difference in date between classes.
S3, creating travel data according to the target travel date.
The itinerary data here includes flight information and fare information corresponding to the flight information, and the fare information here is corresponding minimum fare information, which contains a minimum fare corresponding to the target itinerary date.
Specifically, the target journey is split by the journey reorganizing function. The initial request is stored in a request segment variable in the processing process, and then FC, PU and TKT are assigned sequentially and processed layer by layer respectively, so that corresponding journey data journ ey is generated.
journ ey is taken as a basis, and the system can hang the optimal flight and optimal freight rate result on FC in journ ey without changing the structure of journ ey.
S4, checking whether the travel data are available.
The application also performs perfect checks on whether the created travel information is available. The checking is also classified into pre-checking and real-time checking according to the consideration of performance optimization, wherein the pre-checking is that when information such as flights is not acquired yet, virtual flights are utilized to carry out coarse screening of freight rule, the freight rate is classified into FC, PU and TICKET 3 levels, the freight rate and flight combination passing the checking can continue to carry out secondary checking in the real-time checking stage, and the non-passing freight rate and flight combination can be deleted, so that the journey is invalid. Only the passing trip data will be returned to the user. If verified, the trip data is available, then the next step is performed.
S5, returning the flight information and the lowest fare information to the user.
After the trip data is finally obtained, namely, after the flight information and the lowest fare information are obtained according to the initially received trip date, the flight information and the lowest fare information are returned to the user inputting the trip date.
From the above technical solution, it can be seen that this embodiment provides a method for searching the lowest fare information facing to a fixed travel period, specifically, responding to a search request of a user, receiving and analyzing a travel date input by the user, where the travel date includes a departure date, a departure offset and a travel period; sorting the travel dates to obtain target travel dates, wherein the target travel dates comprise target departure dates and target return dates; creating travel data according to the target travel date, wherein the travel data comprises flight information and lowest fare information; and checking the journey data, and returning the flight information and the lowest fare information to the user if the journey data are available. According to the scheme, a user does not need to calculate the return date, so that the current searching mode is improved, and the manual operation task of the user is reduced.
In addition, in the embodiment of the application, the method further comprises the following steps:
s6, deleting the travel data.
After checking the journey data, if the journey data is found to be unavailable, deleting the journey data, and returning information which cannot obtain effective journey data to the user, so that the user can input other parameters again to search for the lowest fare information.
Example two
Fig. 2 is a block diagram of an information searching apparatus for a fixed travel period according to an embodiment of the present application.
As shown in fig. 2, the searching apparatus of the present embodiment is applied to a fare searching system of a flight crew or a flight crew agent, and specifically includes a request receiving module 10, a data processing module 20, a trip creating module 30, a data checking module 40 and an information returning module 50.
The request receiving module is used for receiving and analyzing the journey date input by the user.
After the user inputs the corresponding search request, the search request is received and parsed to obtain the journey date which is input together through the search request, wherein the journey date comprises the departure date, the departure offset and the journey period.
The time range of the departure date is configured by the user. For example, the user may type in the XXXX year, the XX month, and X days after the X days before the XX day. The system will give a resulting departure time in the time frame when the result is presented.
The user is required to type in the maximum stay period number of days and the minimum stay period number of days. In the system configuration file, a stay day difference span limit coefficient is set. And (3) making the difference between the maximum residence time and the minimum residence time, wherein the value of the difference is smaller than the coefficient minus 1, so that the request splitting can be performed. The function of the coefficient is to limit the span of stay days so as not to cause overlarge splitting logic operation pressure.
The data processing module is used for calculating and processing the journey date to obtain the target journey date.
The target trip date refers to the final obtained actual trip data of the user, and comprises the actual departure date, the actual return date and the like. Specifically, the module includes a first computing unit and a second computing unit.
The first calculating unit is used for taking a departure variable time range, namely a negative offset (from) before a specified date and a positive offset (to) after the specified date, abstracting from to negative, abstracting to positive, traversing all values from negative from to positive to, and carrying out addition operation with the specified departure date to obtain a new departure date.
The second calculation unit is used for determining a range of the return time period through the maximum residence time and the minimum residence time which are input by the user, namely, adding the new departure time to each residence time in the range of the return residence time, and obtaining the new return time. Date matching the new departure time and the new return time to form a new time pair request.
The other fields in the request message are further parsed so that the requests for each time pair form a separate request structure class in the program. There is only a difference in date between classes.
The journey creation module is used for creating journey data according to the target journey date.
The itinerary data here includes flight information and fare information corresponding to the flight information, and the fare information here is corresponding minimum fare information, which contains a minimum fare corresponding to the target itinerary date.
Specifically, the target journey is split by the journey reorganizing function. The initial request is stored in a request segment variable in the processing process, and then FC, PU and TKT are assigned sequentially and processed layer by layer respectively, so that corresponding journey data journ ey is generated.
journ ey is taken as a basis, and the system can hang the optimal flight and optimal freight rate result on FC in journ ey without changing the structure of journ ey.
The data checking module is used for checking whether the travel data are available.
The application also performs perfect checks on whether the created travel information is available. The checking is also classified into pre-checking and real-time checking according to the consideration of performance optimization, wherein the pre-checking is that when information such as flights is not acquired yet, virtual flights are utilized to carry out coarse screening of freight rule, the freight rate is classified into FC, PU and TICKET 3 levels, the freight rate and flight combination passing the checking can continue to carry out secondary checking in the real-time checking stage, and the non-passing freight rate and flight combination can be deleted, so that the journey is invalid. Only the passing trip data will be returned to the user. If the check is made, the trip data is deleted if it is not available.
The information return module is used for returning the flight information and the lowest fare information to the user.
After the flight data is finally obtained, that is, after the flight information and the lowest fare information are obtained according to the originally received journey date, if the journey data are available, the flight information and the lowest fare information are returned to the user who inputs the journey date.
From the above technical solution, it can be seen that the present embodiment provides a minimum fare information searching device for a fixed travel period, specifically, in response to a search request of a user, receiving and analyzing a travel date input by the user, where the travel date includes a departure date, a departure offset and a travel period; sorting the travel dates to obtain target travel dates, wherein the target travel dates comprise target departure dates and target return dates; creating travel data according to the target travel date, wherein the travel data comprises flight information and lowest fare information; and checking the journey data, and returning the flight information and the lowest fare information to the user if the journey data are available. According to the scheme, a user does not need to calculate the return date, so that the current searching mode is improved, and the manual operation task of the user is reduced.
In addition, in embodiments of the present application, data screening module 60 is also provided.
The data screening module is used for deleting the travel data.
After the data verification module verifies the journey data, if the journey data is found to be unavailable, the journey data is deleted, and information which cannot obtain effective journey data is returned to the user, so that the user can input other parameters again to search the lowest fare information.
The information searching device of the scheme comprises the following components, and the components are shown in fig. 3:
a freight rate search node component: the method is deployed according to the requirements and according to the partitions, and is used for analyzing the user requests, and a travel result solution is provided for the user based on a travel splitting technology and a search technology in the component. It is essentially through distributed deployment that provides a search service node that is closer to the user's location so that the user's request can be processed more quickly.
A database component: global unified deployments to provide various data resources required for freight rate searches. Such as: flight information data, related national tax data, freight rate information data, and the like. The method can be deployed at a root node during deployment, and can also be distributed in a mirror image mode so as to improve the data feedback speed.
Data splitting engine: and the global unified deployment is used for distributing the user search request to different freight rate search nodes according to the configured distribution strategy. The loose coupling unshared framework of the distributed search device is realized through the component, so that the isolation among the search nodes is ensured.
The database component is composed of two modules, namely source data and data processing module, as shown in figure 4. The source data is mainly ATPCO data, OAG data, IATA data and other data.
ATPCO data: the data update mode for storing the freight rate related information is full volume update and incremental update.
OAG data: the flight schedule data update mode is full volume update.
IATA TAX data: tax related data, data update mode is full update.
When the user uses the searching device in the embodiment to search for freight rates, the user requests the device to provide freight rates and flight information data of destinations of the same origin for a plurality of days on the data level. This has a high demand for both real-time and accuracy of data coverage. For this purpose the database components of the device should support data updates at different frequencies. The method and the device can meet the requirement of the device on the spreadability of the freight rate data by pushing full or incremental freight rate and flight information in the non-real-time update data, namely ATPCO File and IATA File (updated per hour), and the two data are more authoritative and comprehensive. And OAG File (updated every day) can meet the real-time requirement of the device on flight data.
These types of data are transferred to the data processing module in the database component via a file transfer protocol by means of automatic acquisition together with other data requiring manual maintenance.
The data processing module is used for sorting and classifying data, creating a corresponding time stack catalog according to the time of receiving the data, and updating the regular data information. The data processing module processes the data information based on the received data information and refreshes the information to the latest in a full-quantity update or incremental update mode. In order to prepare the data for the subsequent freight searching node. The data processing module can continuously check the data consistency information to ensure the accuracy and the usability of the preprocessed data information.
The operation principle of the system is shown in fig. 5, and the specific principle is as follows:
step one, storing flight and freight rate mapping. The database cluster has mapped flights and freight rate related freight rates into memory before requesting to call the backend system to get the results.
Step two, receiving a user request. The user sends a request, and the searching device of the embodiment dynamically distributes the user request to the idle freight rate searching nodes through the data distribution engine.
And thirdly, requesting capture and analysis and stroke construction. When a user requests to enter a freight rate search node, the freight rate search node captures and parses the freight rate. The freight rate search node of the search device of this embodiment analyzes the user request and constructs a corresponding trip for a fixed travel period.
And fourthly, supplementing freight flight information. And supplementing the pre-processed freight flight information from the database according to the journey path information.
And fifthly, checking the travel. See if the outcome scheme for the trip is satisfactory.
And step six, returning search results.
Furthermore, the present application has its own unique characteristics compared with other conventional calendar search devices, which are mainly expressed in three aspects: 1. and (3) filtering useless information, namely improving the system performance, and avoiding repeated searching for multiple times to reduce flow consumption.
Illustrating: a user will go out in the next month. The annual holiday is 5 days and the traveler wishes to stay at the departure destination for 3-5 days, and in the traditional calendar search mode the user types in the departure date, and 30 days later departure offset, return date and return departure offset.
Traditional calendar search typing: date of departure: 10 months 1 day, 30 days of departure offset (departure within one month) and 4 days of return date with earliest 10 months stay for 3 days, and 35 days of return offset (maximum stay time + latest return time), the system calculates the target departure time: 10 months 1-10 months 30 days. Target return date 10 months 4 days-11 months 4 days. The conventional calendar search device then gives a stepwise result set based on the target departure date zone and the target return date zone, and returns the stepwise result set to the user. The specific table is as follows:
the area containing "#" is a result which is useless for the user, the area containing "#" is a result which is actually wanted by the user, the blank area is a result with the departure date being larger than the return date, and the logic error is not displayed.
By using the searching method and the searching device provided by the embodiment, all results required by a user can be returned, and the calculated amount of the system is reduced, so that repeated searching for multiple times is avoided, and the flow consumption is reduced, and the following table is concrete:
| stay for 3 days | Stay for 4 days | Stay for 5 days | |
| 10 months 1 day | 10 months and 4 days | 10 months 5 days | 10 months and 6 days |
| 10 months and 2 days | 10 months 5 days | 10 months and 6 days | 10 months 7 days |
| 10 months 3 days | 10 months and 6 days | 10 months 7 days | 10 month 8 day |
| 10 months and 4 days | … | … | … |
| 10 months 30 days | 11 month 2 day | 11 months 3 days | 11 months and 4 days |
For example, as shown in fig. 6, a user enters a round trip request, wherein the departure date is 2019, 8, 15 days, and the departure time can be flexibly adjusted to be any one of the first 15 days or the last 15 days of 8, 15 days. Maximum residence time was expected to be 32 days and minimum residence time was expected to be 31 days.
Earliest return date: the departure date is 15 days before 15 days of 8 months of 2019, namely 31 days of 7 months of 2019, and the user stays for 31 days to return from 1 day, so that the earliest return time is 31 days of 8 months of 2019.
Similarly, the latest return date, the departure date is 15 days after 15 days of 8 months of 2019, namely 30 days of 8 months of 2019, and the user stays for 32 days to return from 30 days, so the earliest return time is 1 day of 10 months of 2019.
Departure date and return date combinations, if each date combination has a result, the system should eventually return (15- (15) +1) × (31-30+1) =62 results.
Practical application: xiao Li this year, who wants to travel for a month, he plans to start XXX by 8-15 th of this year, and considers that 1-2 days may be required on the way to the return route, so the residence time at XXX is about 30 to 31 days. Xiao Li again, he would like that the departure date could not be completely determined to be 8 months 15 days due to visa reasons, so he chooses 15 days around 8 months 15 as his departure date. Some travel website, li Dengliu, wants to see the price of the ticket meeting the travel requirement. At the moment, the user only needs to input the departure date of 8 months and 15 days, the range of the departure date which can be changed is 15 days before and after, the destination is typed in, the departure place and the residence time are 30 to 31 days, and the price of the air ticket is searched by clicking. The web site will then bid for all available results for each of the hours Li Fanhui, 2019, 7, 31 through 2019, 8, 30 as a return after departure for 30 or 31 days. Xiao Li, being relatively free in time, can be arranged at will, thus selecting the cheapest one to purchase the ticket.
In addition, as shown in fig. 7, the information search method in the present embodiment operates by the following flow.
Existing bin information and flight fare information stored in the cache are used in the search of the lowest fare information. And forming a corresponding chain with the user through the interaction data message. The minimum fare information searching request is a request message from a user, performs freight fare calculation and combines freight fare and position flight information with each other, and provides a query interface of available flights for the user. Wherein:
the freight rate search node engine is responsible for international freight rate search service processing;
the data update domain is responsible for preprocessing and distributing various types of data;
the bin information cluster is responsible for providing available flights and bin information;
the monitor is responsible for system monitoring.
The architecture design of the application can keep the server utilization to reach a moderate value, and basically does not waste any server resource, that is, each request of a user can be uniformly loaded on each idle server.
In the application, the background information is synchronized to each corresponding server node in a multicast mode, and the high concurrency calling pressure of the user can be solved. When the method is used for calculation, the average time is only about 3s, the concurrency number can reach 500TPS, and the server utilization rate is 99.9%. And the system has stronger expansibility, and can provide technical support in aspect of aspect if new data is required to be introduced later or new demand functions are added on the original functions.
Example III
The present embodiment also provides an electronic apparatus provided with the information search device as provided in the second embodiment. The searching device receives and analyzes the journey date input by the user, wherein the journey date comprises a departure date, a departure offset and a journey deadline; sorting the travel dates to obtain target travel dates, wherein the target travel dates comprise target departure dates and target return dates; creating travel data according to the target travel date, wherein the travel data comprises flight information and lowest fare information; and checking the journey data, and returning the flight information and the lowest fare information to the user if the journey data are available. According to the scheme, a user does not need to calculate the return date, so that the current searching mode is improved, and the manual operation task of the user is reduced.
The electronic device may be understood as a server of the navigation data service center, and may also be understood as a functional module of the server.
Example IV
Fig. 8 is a block diagram of an electronic device according to an embodiment of the present application.
As shown in fig. 8, the electronic device provided in this embodiment may be understood as a server of the navigation data service center, and may also be understood as a functional module of the server. The electronic device comprises a processor 101 and a memory 102, which are connected by a data bus 103.
The memory is used for storing a computer program or instructions, and the processor is used for acquiring the computer program or instructions through the data bus and enabling the electronic device to realize the disclosed information searching method according to the embodiment by executing the computer program or instructions.
The searching method specifically comprises the steps of receiving and analyzing a travel date input by a user, wherein the travel date comprises a departure date, a departure offset and a travel period; sorting the travel dates to obtain target travel dates, wherein the target travel dates comprise target departure dates and target return dates; creating travel data according to the target travel date, wherein the travel data comprises flight information and lowest fare information; and checking the journey data, and returning the flight information and the lowest fare information to the user if the journey data are available. According to the scheme, a user does not need to calculate the return date, so that the current searching mode is improved, and the manual operation task of the user is reduced.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described by differences from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other.
It will be apparent to those skilled in the art that embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the application may take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the scope of the embodiments of the application.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or terminal device comprising the element.
The foregoing has outlined rather broadly the more detailed description of the application in order that the detailed description of the application that follows may be better understood, and in order that the present principles and embodiments may be better understood; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.
Claims (8)
1. An information search method, comprising the steps of:
responding to a search request of a user, and receiving and analyzing a travel date input by the user, wherein the travel date comprises a departure date, a departure offset and a travel period; the method comprises the steps that a user types in a maximum stay period number and a minimum stay period number, a stay period number difference span limiting coefficient is set in a system configuration file, the maximum stay period number and the minimum stay period number are made to be different, the value of the difference is smaller than the coefficient minus 1, splitting can be requested, and the coefficient is used for limiting the stay period number span so as not to cause overlarge splitting logic operation pressure;
calculating the travel date to obtain a target travel date, wherein the target travel date comprises a target departure date and a target return date; firstly, taking a departure variable time range, namely a negative offset from before a specified date and a positive offset to after the specified date, abstracting from to negative numbers, abstracting to positive numbers, traversing all values from the negative numbers from to the positive numbers to, carrying out addition operation with the specified departure date to obtain a new departure date, then determining a return time range through the maximum residence time and the minimum residence time which are input by a user, carrying out addition operation on the new departure time and each residence time in the return residence time range to obtain a new return time, and carrying out date matching on the new departure time and the new return time to form a new time pair request;
creating trip data according to the target trip date, wherein the trip data comprises flight information and lowest fare information; the method comprises the steps of carrying out split processing on target journey dates through a journey reorganization function, storing the target journey dates into a request section variable in the processing process, and respectively carrying out sequential assignment and layer-by-layer processing on fare calculation groups FC, fare calculation units PU and air tickets TKT so as to generate corresponding journey data; on the premise of not changing the structure of the journey data, hanging the optimal flight and optimal freight rate results to the FC in the journey data;
checking whether the travel data is available; the verification comprises pre-verification and real-time verification, wherein the pre-verification is to utilize virtual flights to carry out coarse screening of freight rule when the flight information is not acquired yet, and the secondary verification is carried out in the real-time verification stage continuously through the combination of the pre-verification freight and the flights; wherein the coarse screening comprises screening of the FC, the PU, and the TICKET;
if the trip data is available, returning the flight information and the lowest fare information to the user;
the calculation processing for the travel date comprises the following steps:
performing addition operation on a preset departure date based on the departure offset to obtain the target departure date;
and carrying out addition operation on the target departure date based on the travel deadline to obtain the target return date.
2. The information search method of claim 1, further comprising the step of:
and deleting the travel data if the travel data is not available.
3. The information searching method of claim 1, wherein the departure offset includes a negative offset before the preset departure date and a positive offset after the departure date.
4. An information search apparatus, comprising:
the request receiving module is configured to respond to a search request of a user, and receive and analyze a travel date input by the user, wherein the travel date comprises a departure date, a departure offset and a travel deadline; the method comprises the steps that a user types in a maximum stay period number and a minimum stay period number, a stay period number difference span limiting coefficient is set in a system configuration file, the maximum stay period number and the minimum stay period number are made to be different, the value of the difference is smaller than the coefficient minus 1, splitting can be requested, and the coefficient is used for limiting the stay period number span so as not to cause overlarge splitting logic operation pressure;
the data processing module is configured to calculate and process the travel date to obtain a target travel date, wherein the target travel date comprises a target departure date and a target return date; firstly, taking a departure variable time range, namely a negative offset from before a specified date and a positive offset to after the specified date, abstracting from to negative numbers, abstracting to positive numbers, traversing all values from the negative numbers from to the positive numbers to, carrying out addition operation with the specified departure date to obtain a new departure date, then determining a return time range through the maximum residence time and the minimum residence time which are input by a user, carrying out addition operation on the new departure time and each residence time in the return residence time range to obtain a new return time, and carrying out date matching on the new departure time and the new return time to form a new time pair request;
a itinerary creation module configured to create itinerary data from the target itinerary date, the itinerary data including flight information and minimum fare information; the method comprises the steps of carrying out split processing on target journey dates through a journey reorganization function, storing the target journey dates into a request section variable in the processing process, and respectively carrying out sequential assignment and layer-by-layer processing on fare calculation groups FC, fare calculation units PU and air tickets TKT so as to generate corresponding journey data; on the premise of not changing the structure of the journey data, hanging the optimal flight and optimal freight rate results to the FC in the journey data;
the data verification module is used for verifying whether the travel data are available or not; the verification comprises pre-verification and real-time verification, wherein the pre-verification is to utilize virtual flights to carry out coarse screening of freight rule when the flight information is not acquired yet, and the secondary verification is carried out in the real-time verification stage continuously through the combination of the pre-verification freight and the flights; wherein the coarse screening comprises screening of the FC, the PU, and the TICKET;
an information return module configured to return the flight information and the minimum fare information to a user if the itinerary data is available;
the data processing module comprises:
the first calculating unit is configured to perform addition operation on a preset departure date based on the departure offset to obtain the target departure date;
and the second calculating unit is configured to perform addition operation on the target departure date based on the travel deadline to obtain the target return date.
5. The information search apparatus of claim 4, further comprising:
a data screening module configured to delete the trip data if the trip data is not available.
6. The information search apparatus of claim 4, wherein the departure offset includes a negative offset before the preset departure date and a positive offset after the departure date.
7. An electronic device provided with the information search apparatus according to any one of claims 4 to 6.
8. An electronic device comprising at least one processor and a memory coupled to the processor, wherein:
the memory is used for storing a computer program or instructions;
the processor is configured to acquire and execute the computer program or instructions to cause the electronic device to perform the information search method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010265824.7A CN111460309B (en) | 2020-04-07 | 2020-04-07 | Information searching method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010265824.7A CN111460309B (en) | 2020-04-07 | 2020-04-07 | Information searching method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111460309A CN111460309A (en) | 2020-07-28 |
| CN111460309B true CN111460309B (en) | 2023-11-24 |
Family
ID=71682349
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010265824.7A Active CN111460309B (en) | 2020-04-07 | 2020-04-07 | Information searching method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111460309B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1501035A1 (en) * | 2003-07-21 | 2005-01-26 | Emirates | System and method for processing flight booking request |
| CN101027683A (en) * | 2004-05-21 | 2007-08-29 | 赛博有限公司 | Systems, methods, and computer program products for searching and displaying low cost productavailability information for a given departure-return date combination or range of departure-return data co |
| CN105630979A (en) * | 2015-12-25 | 2016-06-01 | 中国民航信息网络股份有限公司 | Flight query method, device and system |
| CN105630984A (en) * | 2015-12-25 | 2016-06-01 | 中国民航信息网络股份有限公司 | Freight rate searching system |
| CN107992494A (en) * | 2016-10-26 | 2018-05-04 | 阿里巴巴集团控股有限公司 | A kind of information providing method and device |
| WO2018135834A1 (en) * | 2017-01-17 | 2018-07-26 | (주) 플라이트그래프 | Plane ticket search system and method using modified plane ticket |
| JP2019079568A (en) * | 2019-01-24 | 2019-05-23 | スカイスキャナー リミテッドＳｋｙｓｃａｎｎｅｒ Ｌｔｄ | Method and server for providing set of price estimates, such as airfare price estimates |
| CN110717794A (en) * | 2019-10-21 | 2020-01-21 | 中国民航信息网络股份有限公司 | Freight rate calculation processing method and device |
| CN110751521A (en) * | 2019-10-21 | 2020-02-04 | 中国民航信息网络股份有限公司 | International freight rate determination method and device for single-trip single-flight section |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8131574B2 (en) * | 2005-09-29 | 2012-03-06 | Amadeus S.A.S. | Air travel system and method for planning roundtrip flights using one way combinable fares |
| US8374895B2 (en) * | 2006-02-17 | 2013-02-12 | Farecast, Inc. | Travel information interval grid |
| US11030635B2 (en) * | 2013-12-11 | 2021-06-08 | Skyscanner Limited | Method and server for providing a set of price estimates, such as air fare price estimates |
-
2020
- 2020-04-07 CN CN202010265824.7A patent/CN111460309B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1501035A1 (en) * | 2003-07-21 | 2005-01-26 | Emirates | System and method for processing flight booking request |
| CN101027683A (en) * | 2004-05-21 | 2007-08-29 | 赛博有限公司 | Systems, methods, and computer program products for searching and displaying low cost productavailability information for a given departure-return date combination or range of departure-return data co |
| CN105630979A (en) * | 2015-12-25 | 2016-06-01 | 中国民航信息网络股份有限公司 | Flight query method, device and system |
| CN105630984A (en) * | 2015-12-25 | 2016-06-01 | 中国民航信息网络股份有限公司 | Freight rate searching system |
| CN107992494A (en) * | 2016-10-26 | 2018-05-04 | 阿里巴巴集团控股有限公司 | A kind of information providing method and device |
| WO2018135834A1 (en) * | 2017-01-17 | 2018-07-26 | (주) 플라이트그래프 | Plane ticket search system and method using modified plane ticket |
| JP2019079568A (en) * | 2019-01-24 | 2019-05-23 | スカイスキャナー リミテッドＳｋｙｓｃａｎｎｅｒ Ｌｔｄ | Method and server for providing set of price estimates, such as airfare price estimates |
| CN110717794A (en) * | 2019-10-21 | 2020-01-21 | 中国民航信息网络股份有限公司 | Freight rate calculation processing method and device |
| CN110751521A (en) * | 2019-10-21 | 2020-02-04 | 中国民航信息网络股份有限公司 | International freight rate determination method and device for single-trip single-flight section |
Non-Patent Citations (2)
| Title |
|---|
| Time-dependent congestion pricing system for large networks: Integrating departure time choice, dynamic traffic assignment and regional travel surveys in the Greater Toronto Area;Aya Aboudina Ph.D.；Hossam Abdelgawad Ph.D., P.Eng. ；Baher Abdulhai Ph.D, P.Eng. ；Khandker Nurul Habib Ph.D, P.Eng;《Transportation Research Part A: Policy and Practice》;第第94卷卷;411-430页 * |
| 基于价格导向的民航运价搜索方案设计;张宏海; 彭明田; 刘开胜;《中国民航大学学报》;第第38卷卷(第第3期期);40-44页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111460309A (en) | 2020-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ma et al. | Real-time city-scale taxi ridesharing | |
| Ota et al. | Stars: Simulating taxi ride sharing at scale | |
| US20080183512A1 (en) | System and method for estimating seat value | |
| CN105631630A (en) | Passenger order data processing method and device | |
| AU2012378631A1 (en) | Database system using batch-oriented computation | |
| US20190318274A1 (en) | Discovering and reserving travel solutions | |
| CA2762165C (en) | Method and system for determining an optimal low fare for a trip | |
| US20130297360A1 (en) | Flight-price monitoring systems and methods | |
| RU2606058C2 (en) | Improved reserve management system and method for implementation thereof | |
| US8615422B1 (en) | Airline pricing system and method | |
| CN106528720A (en) | Transfer station recommendation method and transfer station recommendation system | |
| US20080004920A1 (en) | Airline management system generating routings in real-time | |
| KR20110093860A (en) | Method of integrating in real time large volumes of updates in a database | |
| CN112199405B (en) | Method and device for searching international air ticket change price | |
| US20150127408A1 (en) | Static schedule reaccommodation | |
| US20080086383A1 (en) | Rule-based shopping | |
| CN112966846A (en) | Passenger signing and transferring method and device, storage medium and electronic equipment | |
| US20050240452A1 (en) | System and method of making travel arrangements | |
| US20180211189A1 (en) | Record aggregation database | |
| US10740824B2 (en) | Product delivery system and method | |
| CN111460309B (en) | Information searching method and device and electronic equipment | |
| CN112215453A (en) | Inventory information processing method and device, electronic equipment and storage medium | |
| EP3571651A1 (en) | Record aggregation database | |
| CN116150216A (en) | Stroke search method, device, electronic equipment and storage medium | |
| EP3540606B1 (en) | Product delivery system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |