Method, system and equipment for checking shortest transfer time of interlinked flight and medium

Abstract

The invention is suitable for the technical field of flight verification, and discloses a method, a system, equipment and a medium for verifying the shortest transfer time of a linked flight, and the method comprises the steps: obtaining the shortest transfer time data of a whole market, and storing the data by adopting a secondary file chain structure; based on the adjacent leg information in the linked flight, obtaining first shortest transfer time corresponding to the adjacent leg information from the shortest transfer time data stored in the secondary file chain structure; determining the actual rotation time difference corresponding to the adjacent leg information as second shortest rotation time; verifying the first shortest turning time and the second shortest turning time to obtain a shortest turning time verification result corresponding to the adjacent leg information; and based on the shortest transfer time verification result corresponding to all adjacent leg information in the interline flight, determining the shortest transfer time verification result of the interline flight. According to the invention, MCT verification can be rapidly and accurately carried out when the user books the interline flight, and the transit travel service experience of passengers is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of flight verification, and in particular to a method, system, equipment and medium for verifying the shortest connecting time of connecting flights. Background Art

[0002] Transfer and connecting business is an important component of the air transport industry. Among them, the shortest transfer time data as one of the key parameters has attracted more and more attention from airlines. It plays an important role in the construction of airline hub airports, convenient travel for passengers, and improving aviation service capabilities. The role of the shortest transfer time has evolved from its initial airport logistics use to an important strategy for airline market sales.

[0003] Airlines set the shortest connection time rules for connecting flights based on the flight network and the transfer service support at each airport, and synchronize the rule data with OAG. After receiving the shortest connection time rule data released by each airline, OAG will integrate the shortest connection time data of all airlines in the IATA standard format at a specific time every day to form a market-wide shortest connection time file and publish it to various global ticket distribution systems, airlines and ticket agents.

[0004] However, with the development of the civil aviation market, the number of airports and flights has increased, the shortest transfer time rules have become more and more complicated, and the amount of data in the rules has also increased. In the existing civil aviation reservation system, there are inconsistencies in the shortest transfer time verification between the query link and the booking link, as well as low verification efficiency. Summary of the invention

[0005] In order to solve the above problems, the present invention provides a method, system, device and medium for checking the shortest connecting time of connecting flights, so that users can quickly and accurately perform MCT verification when booking connecting flights, thereby comprehensively improving the quality of transfer services and the passenger transfer travel service experience, greatly increasing passengers' willingness to travel, stimulating the potential of the aviation market, and bringing new profit growth points to airlines.

[0006] To achieve the above object, the present invention adopts the following technical solution:

[0007] In a first aspect, the present invention provides a method for verifying the shortest connecting time of a connecting flight, comprising:

[0008] Obtain the shortest transfer time data for the entire market and use a secondary file chain structure to store the shortest transfer time data;

[0009] Based on the adjacent flight segment information in the connecting flight, the first shortest connecting time corresponding to the adjacent flight segment information is obtained from the shortest connecting time data stored in the secondary file chain structure;

[0010] The actual connecting time difference corresponding to the adjacent flight segment information is determined as the second shortest connecting time;

[0011] Verify the first shortest connecting time and the second shortest connecting time to obtain the shortest connecting time verification result corresponding to the adjacent flight segment information;

[0012] Based on the shortest connection time verification results corresponding to the information of all adjacent flight segments in the connecting flight, the shortest connection time verification result of the connecting flight is determined.

[0013] Furthermore, the secondary file chain structure includes: a primary SP file and a secondary SM file. The primary SP file and the secondary SM file establish a chain structure through index values.

[0014] Furthermore, a secondary file chain structure is used to store the shortest transfer time data, including:

[0015] The first-level SP file stores the three-letter airport code and establishes the index value corresponding to the three-letter airport code;

[0016] The secondary SM file stores the shortest connection time data corresponding to the three-letter airport code and establishes the index value of the shortest connection time data;

[0017] The primary SP file stores the index value corresponding to the shortest connection time data stored in the secondary SM file, and the three-letter airport code stored in the primary SP file corresponds one to one to the index value of the shortest connection time data stored in the secondary SM file.

[0018] Further,

[0019] The three-letter airport codes stored in the first-level SP file are sorted in alphabetical order according to the two letters after the three-letter code.

[0020] Furthermore, when the secondary SM file stores the shortest connecting time data corresponding to the three-letter airport code, if the last two letters of the three-letter airport code are the same, they are stored as one storage record.

[0021] Further, based on the adjacent flight segment information in the connecting flight, the first shortest connecting time corresponding to the adjacent flight segment information is obtained from the shortest connecting time data stored in the secondary file chain structure, including:

[0022] Based on the index of the three-letter airport code of the first flight segment destination in the adjacent flight segment information, a search is performed in the shortest connection time data stored in the secondary file chain structure. If the shortest connection time data corresponding to the three-letter airport code of the first flight segment destination is retrieved, the first shortest connection time corresponding to the second flight segment departure place in the adjacent flight segment information is obtained from the shortest connection time data.

[0023] Further, the first shortest connecting time and the second shortest connecting time are verified to obtain the shortest connecting time verification result corresponding to the adjacent flight segment information, including:

[0024] The first shortest connection time and the second shortest connection time are compared. If the second shortest connection time is greater than or equal to the first shortest connection time, the shortest connection time corresponding to the adjacent flight segment information is successfully verified.

[0025] In a second aspect, the present invention further provides a system for verifying the shortest connecting time of connecting flights, comprising:

[0026] A storage module is used to obtain the shortest connection time data of the entire market and store the shortest connection time data in a secondary file chain structure;

[0027] An obtaining module, for obtaining the first shortest connecting time corresponding to the adjacent flight segment information from the shortest connecting time data stored in the secondary file chain structure based on the adjacent flight segment information in the connecting flight;

[0028] A determination module, used to determine the actual connecting time difference corresponding to the adjacent flight segment information as the second shortest connecting time;

[0029] A verification module, used to verify the first shortest connecting time and the second shortest connecting time, and obtain a verification result of the shortest connecting time corresponding to the adjacent flight segment information;

[0030] The determination module is also used to determine the shortest connection time verification result of the connecting flight based on the shortest connection time verification result corresponding to all adjacent flight segment information in the connecting flight.

[0031] In a third aspect, the present invention further provides an electronic device, comprising: a processor and a memory;

[0032] The processor is coupled to the memory;

[0033] The processor is used to read and execute the program or instructions stored in the memory, so that the device executes the method of the first aspect.

[0034] In a fourth aspect, the present invention further provides a computer-readable storage medium storing a computer program, which implements the method of the first aspect when executed by a processor.

[0035] The technical solution provided by the present invention has at least the following technical effects or advantages:

[0036] The actual transfer time difference of all adjacent segments in the passenger's connecting flight order is verified with the shortest transfer time provided by OAG, and then the verification result of the shortest transfer time of the connecting flight is determined. If the verification result is successful, the connecting flight is established, and if the verification result is failed, the passenger is reminded. The solution of the present invention enables users to quickly and accurately perform MCT verification when booking connecting flights, thereby comprehensively improving the quality of transfer services and the transfer travel service experience of passengers, greatly increasing passengers' willingness to travel, stimulating the potential of the aviation market, and bringing new profit growth points to airlines.

[0037] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0039] Figure 1 A schematic diagram of a flow chart of a method for verifying the shortest connecting time of a connecting flight in an embodiment of the present invention;

[0040] Figure 2 A schematic diagram of a process for verifying the shortest connecting time of a user's connecting flight order in an embodiment of the present invention;

[0041] Figure 3 This is a schematic diagram of the structure of a system for verifying the shortest connecting time of connecting flights in an embodiment of the present invention;

[0042] Figure 4 The present invention is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0043] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0044] MCT: In civil aviation passenger transportation, the Minimum Connection Time (MCT) refers to the shortest ground support time required at a certain airport to ensure that passengers and their checked baggage are transferred from the arriving flight to the subsequent outbound flight. It is one of the main factors for the reservation system to determine which flights can be effectively connected to form transfer products for sale. It is also one of the key indicators that airlines focus on in multiple business links such as network planning, flight scheduling, and transfer services.

[0045] OAG: is a company that provides aviation data and publications. Its name comes from "Official Airline Guide". It is one of the most authoritative flight data and analysis providers in the world. The company collects, organizes and publishes information on flight schedules, flight dynamics, airport information and airline data to help airlines, travel agencies and passengers understand flight information and itinerary planning.

[0046] Figure 1 The following is a flow chart of a method for verifying the shortest connecting time of a connecting flight according to an embodiment of the present invention. As shown in the figure, the method includes:

[0047] S101. Obtain the shortest transfer time data of the entire market, and use a secondary file chain structure to store the shortest transfer time data;

[0048] Through FTP or SFTP, the latest MCT data files of the shortest connection time in the entire market are collected from OAG on a regular basis, the shortest connection time data in the files are processed into the required structured data, and the processed shortest connection time data is stored using a file database mechanism, that is, a two-level file chain structure is used to store the shortest connection time data. The two-level file chain structure storage includes: a first-level SP file, a second-level SM file, and a first-level SP file and a second-level SM file, and a chain structure is established through index values. The first-level SP file stores all the three-letter airport codes and establishes index values ​​corresponding to the three-letter airport codes; the second-level SM file stores the shortest connection time data corresponding to the three-letter airport codes and establishes index values ​​for the shortest connection time data; the first-level SP file stores the index values ​​corresponding to the shortest connection time data stored in the second-level SM file, and the three-letter airport codes stored in the first-level SP file correspond to the index values ​​of the shortest connection time data stored in the second-level SM file. The airport three-letter codes stored in the first-level SP file are sorted in alphabetical order according to the last two letters of the three-letter code; when the second-level SM file stores the shortest connection time data corresponding to the airport three-letter code, if the last two letters of the airport three-letter code are the same, they are stored as one storage record. According to the characteristics of the shortest connection time data, each specific airport three-letter code may contain multiple entry data. It is necessary to ensure that the multiple entry data of the same airport three-letter code are stored in the data entry corresponding to the same specific airport three-letter code in the second-level SM file.

[0049] S102, based on the adjacent flight segment information in the connecting flight, obtaining the first shortest connecting time corresponding to the adjacent flight segment information from the shortest connecting time data stored in the secondary file chain structure;

[0050] A flight segment information and the next flight segment information adjacent to the flight segment information are selected from the passenger's connecting flight order as the adjacent flight segment information. Based on the index corresponding to the three-letter code of the destination airport of the first flight segment in the adjacent flight segment information, a search is performed in the shortest connection time data stored in the secondary file chain structure. If the shortest connection time data corresponding to the three-letter code of the destination airport of the first flight segment is retrieved, the first shortest connection time value corresponding to the departure place of the second flight segment in the adjacent flight segment information is obtained from the shortest connection time data.

[0051] S103, determining the actual connecting time difference corresponding to the adjacent flight segment information as the second shortest connecting time;

[0052] The actual transfer time difference corresponding to the adjacent flight segment information is determined as the second shortest transfer time for further verification.

[0053] S104, verifying the first shortest connecting time and the second shortest connecting time to obtain a verification result of the shortest connecting time corresponding to the adjacent flight segment information;

[0054] The first shortest transfer time and the second shortest transfer time are compared. If the second shortest transfer time value corresponding to the adjacent flight segment information is greater than or equal to the first shortest transfer time value, the shortest time verification result corresponding to the adjacent flight information is allowed, that is, the verification is successful.

[0055] S105: Determine the shortest connection time verification result of the connecting flight based on the shortest connection time verification results corresponding to the information of all adjacent flight segments in the connecting flight.

[0056] Based on the above steps S102-S104, the shortest connecting time corresponding to all adjacent flight segments in the passenger's connecting flight order is verified. If all verification results are successful, it is determined that the verification result of the shortest connecting time corresponding to the connecting flight order is successful, and the passenger's connecting flight order is allowed to be confirmed.

[0057] The technical solution in the embodiments of the present invention has at least the following technical effects or advantages:

[0058] The actual transfer time difference of all adjacent segments in the passenger's connecting flight order is verified with the shortest transfer time provided by OAG, and then the verification result of the shortest transfer time of the connecting flight is determined. If the verification result is successful, the connecting flight is established, and if the verification result is failed, the passenger is reminded. The solution of the present invention enables users to quickly and accurately perform MCT verification when booking connecting flights, thereby comprehensively improving the quality of transfer services and the transfer travel service experience of passengers, greatly increasing passengers' willingness to travel, stimulating the potential of the aviation market, and bringing new profit growth points to airlines.

[0059] The technical solution of the present invention is further explained below through the process of a user booking a connecting flight:

[0060] Step 1: Obtain MCT data and store MCT data;

[0061] When users book connecting flights, the source of the flight shortest connection time data is OAG's MCT data file. The system receives the latest full-market MCT data files from OAG every day via FTP or SFTP. After collecting the MCT data files, they are structured and stored using a file database mechanism. Specifically, a secondary file chain structure - the SP-SM file structure is used for data storage. The secondary file chain data structure refers to a method of storing and managing file data through a linked list structure, which is suitable for scenarios that require high-speed and efficient management of massive data content. In the SP-SM file structure, SP is the primary index file and SM is the secondary data file.

[0062] 1. Store airport three-letter code information

[0063] The first-level SP file stores all the airport three-letter code information and establishes a hash index. It is graded according to the airport three-letter code (AAA-...ZZZ), and the last two characters in the three-letter code are taken as the hash index. The index is performed in the order of AZ from the second character to the third character (XAA-XBA-...XZA-XAB-XBB-...XZB-XAC......-XZZ, X represents any character, a total of 26*26=676 indexes); the first-level SP file also stores the index value corresponding to the shortest transfer time data stored in the second-level SM file. Each index in the first-level SP file corresponds to a keyword (index value) of an SM file record. When a three-letter airport code is given, the corresponding keyword (index value) can be used to quickly read the content in the corresponding SM file record, and then locate the SM record of the airport three-letter code.

[0064] 2. Store MCT data for specific airport three-letter codes

[0065] The secondary SM file stores the MCT data of a specific airport three-letter code and establishes the keyword (index value) of the MCT data. Each record in the SM file stores the shortest connection time data corresponding to several airport three-letter codes (the last two letters of these airport three-letter codes are the same). For example, the shortest connection time data corresponding to the three airport three-letter codes ORD, URD, and IRD will be stored in the same SM record. According to the characteristics of the shortest connection time data, each specific airport three-letter code may correspond to multiple shortest connection time data entries, and multiple shortest connection time data entries are stored in the same SM record of the secondary SM file.

[0066] Each record in the SM file is divided into a record header part and a record content part. The record header part stores the common data content common to all three-letter airport codes applicable to this SM record (as shown in Table 1); the record content part stores the shortest connection time data corresponding to each three-letter airport code, that is, the unique and personalized data content corresponding to the three-letter airport code (as shown in Table 2). The shortest connection time data entry corresponding to each three-letter airport code in the record content part includes flight segment information and shortest connection time information.

[0067] Table 1

[0068]

[0069] Table 2

[0070]

[0071] Step 2: Check the shortest connecting time

[0072] Due to the characteristics of flight shortest connection time data, there may be several shortest connection time rules that meet certain requirements in the database. When checking the rules, multiple rules and corresponding connection time values ​​may be matched. Which one is the most suitable and how to find the shortest connection time value that meets the passenger's scheduled connection, matches best and has the highest priority becomes a thorny problem.

[0073] The present invention determines the priority of the shortest connection time data by adopting a bit value switch, and then obtains the shortest connection time value with the highest priority. Specifically, according to the priority of the field to be matched in the shortest connection time data, a priority identifier PRIORITY is defined, wherein the priority of the field can be set according to the requirements of the shortest connection time file.

[0074] The 12-bit value corresponding to the identifier PRIORITY is 36-bit octal data, that is, PRIORITY="000000000000". The identifier PRIORITY is an octal number with a length of 36 bits. The value of each octal "0" is octal 0 to 7, representing three binary bits. The least significant bit is on the right and the most significant bit is on the left. It can represent the switch status of up to 36 fields, and the high priority will be located in the high significant bit. The priority value of decimal data is represented by a bit value switch, such as: "000000000000" is decimal 0; "000000000001" is decimal 1; "000000000011" is decimal 9; "000000000100" is decimal 64; "000000000400" is decimal 256; "000000000470" is decimal 312; "100000000000" is decimal 8589934592; "700000000000" is decimal 60129542144; "777777777777" is decimal 68719476735, which is also 36B in 12-bit octal system The maximum decimal value that can be represented by a number that is IT bits long.

[0075] The identifier PRIORITY places the high priority value in the most significant bit, so that a 12-bit octal 36-bit long can represent a maximum of 1-36 priority values; when comparing PRIORITY1 and PRIORITY2, you only need to simply compare the values ​​of the two to determine the priority of the two. The following example illustrates the priority of PRIORITY1 and PRIORITY2.

[0076] Exemplarily, if the value of priority PRIORITY1 is defined according to the priorities of the two fields "terminal" and "flight number", assuming that the priority of the "terminal" field is 4 and the priority of the "flight number" field is 15, and the shortest connection time is 60 minutes, then the corresponding value of priority PRIORITY1 is represented in octal as "000000040010". Here, 4 represents the 15th BIT starting from the least significant bit (counting from right to left), and 1 represents the 4th BIT starting from the least significant bit (counting from right to left). At this time, the decimal value of PRIORITY1 = "000000040010" is 16392; if the value of priority PRIORITY2 is defined according to the priorities of the two fields "terminal" and "international flight", assuming that the priority of the "terminal" field is 4 and the priority of the "international flight" field is 26, and the shortest connection time is 45 minutes, then the corresponding value of priority PRIORITY2 is represented in octal as "000200000010". Here, 2 is the 26th BIT counting from right to left, and 1 is the 4th BIT counting from right to left. At this time, the decimal value of PRIORITY2 = "000200000010" is 33554440. When querying the shortest connection time data, if the two shortest connection time data with priority values of PRIORITY1 and PRIORITY2 are found, by comparing the values of these two PRIORITY1 and PRIORITY2 (16392 <3355444>0), we can conveniently determine that the shortest connection time data corresponding to priority PRIORITY2 is the highest, and take the shortest connection time value corresponding to this shortest connection time data as the shortest connection time value for this query, that is, the shortest connection time value is 45 minutes.

[0077] For the priorities of the fields to be matched in the shortest connection time data, the larger the defined number, the higher the position of its switch in the high significant bit, and the higher its priority. The priorities of specific fields can be set according to the requirements of the shortest connection time file.

[0078] During the process of a user booking a connecting flight and preparing to perform an order confirmation operation, a verification of the shortest connection time of the flight will be carried out.

[0079] The verification process is to select a flight segment information from the passenger connecting flight order, and form adjacent flight segments with the next flight segment information, and search in the secondary file chain structure according to the three-letter code of the first flight segment destination airport in the adjacent flight segment information, so as to obtain the shortest connection time value between the two adjacent flight segments, and then compare this value with the actual time difference between the two flight segments. When the actual time difference between the two flight segments is greater than or equal to the shortest connection time value retrieved from the secondary file chain structure, the connection between the two flight segments is recognized and established, that is, the shortest connection time corresponding to the two flight segments is successfully verified. If the shortest connection time corresponding to the two flight segments is successfully verified, the next flight segment information is selected, and the next flight segment information is formed with the next flight segment information, and the shortest connection time corresponding to the adjacent flight segments is continuously verified according to the above verification rules, until the result of the verification of the shortest connection time corresponding to all adjacent flight segments in the passenger connecting flight order is successful, the shortest connection time verification of the connecting flight order is considered successful, and the passenger connecting flight order is allowed to be confirmed. Verify the shortest connection time corresponding to adjacent flight segments. If the verification is successful, the shortest connection time value of the adjacent flight segments will be returned in hours and minutes. If the verification of the shortest connection time corresponding to the above adjacent flight segments or the shortest connection time of the connecting flight order fails, the user will be reminded that the shortest connection time verification failed and the connecting flight cannot be established. Figure 2 The figure is a flow chart of verifying the shortest connecting time of a user's connecting flight order in an embodiment of the present invention.

[0080] The above-mentioned method searches the secondary file chain structure according to the three-letter code of the destination airport of the first flight segment in the adjacent flight segment information, so as to obtain the shortest connection time value between the two adjacent flight segments, specifically including: directly searching and locating the corresponding SM file record according to the index value of the last two letters of the three-letter code of the airport with extremely high efficiency of time complexity O(1); traversing the corresponding shortest connection time data entries in the SM file, finding the shortest connection time data corresponding to the three-letter code of the destination airport of the first flight segment in the adjacent flight segment, and obtaining the shortest connection time data corresponding to the second three-letter code of the adjacent flight segment information from the shortest connection time data. The shortest connection time value corresponding to the departure place of the flight segment is the shortest connection time value between the two adjacent flight segments; if after traversing the corresponding shortest connection time data entries in the SM file, multiple shortest connection time data corresponding to the three-letter airport code of the destination of the first flight segment in the adjacent flight segments are found, then according to the priority of the fields in the multiple shortest connection time data, the bit value switch method is used to determine the priority of the multiple shortest connection time data, and the shortest connection data time value in the shortest connection time data with the largest priority value is determined as the shortest connection time value between the two adjacent flight segments.

[0081] Figure 3This is a schematic diagram of the structure of a system for verifying the shortest connecting time of a connecting flight provided in an embodiment of the present invention. As shown in the figure, the system includes:

[0082] A storage module is used to obtain the shortest connection time data of the entire market and store the shortest connection time data in a secondary file chain structure;

[0083] An obtaining module, for obtaining the first shortest connecting time corresponding to the adjacent flight segment information from the shortest connecting time data stored in the secondary file chain structure based on the adjacent flight segment information in the connecting flight;

[0084] A determination module, used to determine the actual connecting time difference corresponding to the adjacent flight segment information as the second shortest connecting time;

[0085] A verification module, used to verify the first shortest connecting time and the second shortest connecting time, and obtain a verification result of the shortest connecting time corresponding to the adjacent flight segment information;

[0086] The determination module is also used to determine the shortest connection time verification result of the connecting flight based on the shortest connection time verification result corresponding to all adjacent flight segment information in the connecting flight.

[0087] It should be noted that, for the sake of convenience, Figure 3 For example, only the main modules of the system structure for checking the shortest connecting time of connecting flights are shown. In practical applications, the system may also include modules or components not shown in the figure; the system is not limited to the above module structure, but may also be other module structures for implementing the above method embodiments.

[0088] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. As shown in the figure, the electronic device includes: a processor and a memory;

[0089] The processor is used to read and execute programs and instructions stored in the memory, so that the electronic device executes the above method embodiment.

[0090] It should be noted that, for the sake of convenience, Figure 4 For example, only the main components of the electronic device are shown. In actual applications, the electronic device may also include components or assemblies not shown in the figure.

[0091] The present invention also provides a computer-readable storage medium storing a program or instruction. When a computer reads and executes the program or instruction, the computer executes the above method embodiment.

[0092] Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent substitutions for some of the technical features therein; and these modifications or substitutions do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for verifying the shortest connecting time of connecting flights, characterized in that: include: Obtain the shortest connection time data of the entire market, and use a secondary file chain structure to store the shortest connection time data; Based on the adjacent flight segment information in the connecting flight, obtaining the first shortest connecting time corresponding to the adjacent flight segment information from the shortest connecting time data stored in the secondary file chain structure; Determine the actual connecting time difference corresponding to the adjacent flight segment information as the second shortest connecting time; Verify the first shortest connecting time and the second shortest connecting time to obtain a verification result of the shortest connecting time corresponding to the adjacent flight segment information; Based on the shortest connection time verification results corresponding to the information of all adjacent flight segments in the connecting flight, the shortest connection time verification result of the connecting flight is determined.

2. The method for checking the shortest connecting time of connecting flights according to claim 1, characterized in that: The secondary file chain structure includes: a primary SP file and a secondary SM file. The primary SP file and the secondary SM file establish a chain structure through index values.

3. The method for verifying the shortest connecting time of connecting flights according to claim 2, characterized in that: The storing of the shortest connecting time data using a secondary file chain structure includes: The first-level SP file stores the three-letter airport code and establishes an index value corresponding to the three-letter airport code; The secondary SM file stores the shortest connection time data corresponding to the airport three-letter code, and establishes the index value of the shortest connection time data; The primary SP file stores the index value corresponding to the shortest connection time data stored in the secondary SM file, and the three-letter airport code stored in the primary SP file corresponds one-to-one to the index value of the shortest connection time data stored in the secondary SM file.

4. The method for verifying the shortest connecting time of connecting flights according to claim 3, characterized in that: The three-letter airport codes stored in the first-level SP file are sorted in alphabetical order according to the two letters after the three-letter codes.

5. The method for verifying the shortest connecting time of connecting flights according to claim 3, characterized in that: When the secondary SM file stores the shortest connecting time data corresponding to the three-letter airport code, if the last two letters of the three-letter airport code are the same, they are stored as a storage record.

6. The method for verifying the shortest connecting time of connecting flights according to claim 1, characterized in that: The obtaining, based on the adjacent flight segment information in the connecting flight, the first shortest connecting time corresponding to the adjacent flight segment information from the shortest connecting time data stored in the secondary file chain structure includes: Based on the index of the three-letter airport code of the first flight segment destination in the adjacent flight segment information, a search is performed in the shortest connection time data stored in the secondary file chain structure. If the shortest connection time data corresponding to the three-letter airport code of the first flight segment destination is retrieved, the first shortest connection time corresponding to the second flight segment departure place in the adjacent flight segment information is obtained from the shortest connection time data.

7. The method for verifying the shortest connecting time of connecting flights according to any one of claims 1 to 6, characterized in that: Verifying the first shortest connecting time and the second shortest connecting time to obtain a verification result of the shortest connecting time corresponding to the adjacent flight segment information includes: The first shortest connecting time and the second shortest connecting time are compared. If the second shortest connecting time is greater than or equal to the first shortest connecting time, the shortest connecting time corresponding to the adjacent flight segment information is successfully verified.

8. A system for verifying the shortest connecting time of connecting flights, characterized in that: include: A storage module, used for obtaining the shortest connection time data of the entire market, and storing the shortest connection time data in a secondary file chain structure; An obtaining module, configured to obtain, based on the adjacent flight segment information in the connecting flight, the first shortest connecting time corresponding to the adjacent flight segment information from the shortest connecting time data stored in the secondary file chain structure; A determination module, configured to determine the actual connecting time difference corresponding to the adjacent flight segment information as the second shortest connecting time; A verification module, configured to verify the first shortest connecting time and the second shortest connecting time, and obtain a verification result of the shortest connecting time corresponding to the adjacent flight segment information; The determination module is also used to determine the shortest connection time verification result of the connecting flight based on the shortest connection time verification result corresponding to all adjacent flight segment information in the connecting flight.

9. An electronic device, characterized in that: include: Processor and memory; The processor is coupled to the memory; The processor is used to read and execute the program or instruction stored in the memory, so that the device executes the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: A computer program is stored, and when the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images