FR3061575A1 - INTERRUPTION INDEX FOR TRACKING DATABASE RECORDS - Google Patents

Abstract

Systems, methods, and computer program products for processing database records. A database management system may receive a query identifying a ticket that is being exchanged in a ticket database. In response to receiving the query, the database management system can retrieve, in a transition database, a transition record that is indexed to the ticket. The transition record may include an interrupt index having one or more tables, each defining a set of linked data items. The database management system can retrieve additional tickets from the ticket database that are identified by the data items, and arrange the tickets in an orderly, ordered order that defines a history of interruptions for the ticket whose exchange is in progress. The database management system can then generate a hybrid route based on the interrupt history, and use the hybrid route to determine a value for the ticket being exchanged.

Description

Holder (s): simplified.

AMADEUS S.A.S. Joint-stock company

O Extension request (s):

© Agent (s): SAMSON & PARTNER PATENTANWALTE MBB.

p4) INTERRUPTION INDEX FOR FOLLOWING DATABASE RECORDS.

FR 3,061,575 - A1

Systems, methods, and computer program products for processing database records. A database management system can receive a query identifying a ticket whose exchange is in progress in a ticket database. In response to receiving the query, the database management system can retrieve from a transition database a transition record that is indexed to the ticket. The transition record may include an interrupt index having one or more arrays, each defining a set of linked data elements. The database management system can retrieve additional tickets from the ticket database which are identified by the data elements, and organize the tickets according to an established established order which defines a history of interruptions for the ticket whose exchange is in progress. The database management system can then generate a hybrid route based on the history of interruptions, and use the hybrid route to determine a value for the ticket whose exchange is in progress.

INTERRUPTION INDEX FOR TRACKING DATABASE RECORDS

BACKGROUND The invention relates generally to computers and software, and in particular to computer program systems, methods and products for managing database records in a travel management system.

Travel management systems generally include one or more databases, each database storing and organizing a plurality of data record structures, or "records". Database records maintained by a travel management system to manage a trip generally include a passenger name record (FNP) which stores data defining a travel route, and one or more tickets that can be exchanged against boarding passes on the segments included in the travel itinerary.

In the context of air transport, a travel itinerary can include one or more segments which connect a place of origin and a place of destination. Each segment can refer to the operation of a flight between a point where travelers first board a plane, and another point where travelers get off the plane. A segment may include one or more connections, each connection relating to the operation of the aircraft from a scheduled departure stop to the next scheduled arrival stop.

The travel itinerary may include multiple connected segments, with the traveler having to change devices at each connection point between consecutive segments.

Sometimes a traveler with a ticket issued may have to change his itinerary. For example, after an event that affects the scheduling of a segment (eg the cancellation of a connecting flight between two locations), a traveler whose travel itinerary includes the interrupted segment may be having to change their travel itinerary. The modification may include the replacement of the interrupted segment, or a combination of segments including the interrupted segment, with one or more replacement segments. When an appropriate solution is found, a new ticket can be issued, based on the modified route. This new ticket can be exchanged for all or part of the ticket previously held by the traveler. Typically, the traveler is not charged for this exchange.

Normal procedures for updating database records in the travel management system are often bypassed in the event of unintentional changes so that boarding passes can be issued quickly and at no cost additional for the blocked traveler. This can result in inaccurate database records. Database records can be particularly problematic if another change in Route 5 is desired as a result of an involuntary exchange.

Therefore, it is necessary to have improved systems, methods and computer program products to manage the database records in the travel management systems in order to maintain the relevance of the databases in the 'possibility of an involuntary exchange of tickets, and to increase the speed and efficiency with which the relevant data is retrieved from the databases.

SUMMARY In one embodiment, a system is provided which includes one or more processors and a memory coupled to the processors. The memory can store the program code which, when executed by at least one of the processors, causes the system to receive a query identifying a first database record stored in a first database, and retrieve it, in a second database data, a second database record indexed to the first database record. The second database record can contain a hint that includes at least one table defining a set of linked data items. The program code may further cause the system to identify a set of database records in the first database which includes at least one of the linked database elements. The set of database records that includes at least one of the linked data elements, can include the first database record and a third database record. The program code can also cause the system to generate a first table from the set of database records by initializing the first table with data elements taken from the first database record, and adding to the minus one data item from the third database record to the first array.

In another aspect, the data elements in the first database record can include a first series of classified data elements from the oldest data element to the most recent data element, the third database record may include a second series of classified data items from the oldest data item to the most recent data item, and the program code may also cause the system to generate the first table by selecting a most recent data item previously not selected in the third database record and determining a status for the selected data item. In response to the status indicating that the selected data item has been exchanged, the program code may cause the system to activate an exchange signal and delete the selected data item. In response to the status indicating that the selected data item has not been exchanged, the program code may cause the system to add the selected data item to that of a second table or a third table.

In another aspect, the program code can also cause the system to add the selected data item to an item in the first table or in the second table by adding the selected data item to the second table if the signal exchange is not activated, and adding the selected data item to the third table if the exchange signal is activated.

In another aspect, in response to the selected data item being the oldest data item of the third database record, the program code can also cause the system to update the first array by appending the second array to the first array before the oldest data item in the first array, and appending the third array to the first array after the most recent data element in the first array.

In another aspect, each database record in the set of database records can have a time stamp indicating a time at which the database record was added to the first database, and the set of database records may include a fourth database record whose timestamp occurs after the timestamp of the third database record. In response to the status indicating that the selected data item has been exchanged, the program code may also cause the system to determine whether the selected data item appears in a price item from the fourth database record, and if the selected data item does not appear in the price item of the fourth database record, stop processing the database records.

In another aspect, the first series of data elements may include a set of coupons comprising a first ticket, and the second series of data elements may include a set of coupons comprising a second ticket.

In another aspect, the program code can also cause the system to generate a hybrid ticket from the first table, determine a first value for the hybrid ticket using the pricing engine, and assign the first value at first database record.

In another aspect, the program code can also cause the system to determine a second value for a fifth database record for which the first database record is being exchanged at the using the pricing engine, determine a third value equal to the difference between the second value and the first value, and assign the third value to the fifth database record.

In another aspect, the program code can also cause the system to sort the set of database records based on the timestamp of each database record, so that the set is configured as a series of classified database records from the database record 15 having the oldest time stamp to the database record having the most recent time stamp.

In another embodiment, the method for processing database records is provided. The method may include receiving the query identifying the first database record stored in the first database, and retrieving, in the second database, the second database record indexed to the first record database and containing the interrupt index which includes at least one array that defines the set of linked data elements. The method may further include identifying the set of database records (the first database which includes at least one of the linked database items. The set of database records which includes at least one of the linked data items may include the first database record and the third database record. The method may further include generating the first array from the set of data records in initializing the first array with data elements from the first database record, and adding at least one data element from the third database record to the first array.

In another aspect, the data elements of the first database record can include the first series of classified data elements from the oldest data element to the most recent data element, the third database record may include the second series of classified data items from the oldest data item to the most recent data item, and the method may generate the first array by selecting the last item previously unselected data in the third database record, determining the status of the selected data item, in response to the status indicating that the selected data item has been traded, activating the exchange index and deleting the selected data item, and in response to the status indicating that the data item has not been exchanged, by adding the selected data item to one of the second or third table.

In another aspect, the method can add the selected data element to an element of the first table or of the second table by adding the selected data element to the second table if the exchange signal is not activated , and adding the selected data item to the third table if the exchange signal is activated.

In another aspect, in response to the selected data item being the oldest data item of the third database record, the method can update the first table by appending the second table to the first array before the oldest data item in the first array, and appending the third array to the first array after the most recent data element in the first array.

In another aspect, each database record in the set of database records can have the time stamp indicating the time when the database record was added to the first database , the set of database records may include the fourth database record having the time stamp occurring after the time stamp of the third database record, and the method may further include, in response to the status indicating that the data item has been exchanged, to determine if the selected data item appears in the price item of the fourth database record, and if the selected data item does not appear in the price of the fourth database record, stop processing database records.

In another aspect, the first series of data elements may include the set of coupons comprising the first ticket, and the second series of data elements may include the set of coupons comprising the second ticket [0022 ] In another aspect, the method may further include generating the hybrid ticket from the first table, determining the first value for the hybrid ticket using the pricing engine, and assigning the first value on the first database record.

In another aspect, the method can include determining the second value for the fifth database record for which the first database record being exchanged using the pricing engine, determining the third value equal to the difference between the second value and the first value, and assigning the third value to the fifth database record.

In another aspect, the method can also include sorting the set of database records according to the timestamp of each database record, so that the set is configured in as the series of classified database records from the database record with the oldest time stamp to the database record with the most recent time stamp. In another aspect, the first table can define a hybrid route. In another embodiment, a computer program product for processing database records is provided. The computer program product may include durable computer readable storage medium, and program code stored on the medium which. when executed by one or more processors, causes the processors to receive Γ interrogation identifying the first database record stored in the first database, and to retrieve, in the second database, the second basic record data indexed on the first database record 20 and containing the interruption index which includes at least one table which defines all of the linked data elements. The program code may also cause the processors to identify the set of database records in the first database which includes at least one of the linked database elements. The set of database records that includes at least one of the linked data items can include the first database record and the third database record. The program code can also cause the processors to generate the first table from the set of database records by initializing the first table with data elements drawn from the first database record, and by adding to the minus one data item from the third database record to the first array.

In another embodiment, a system is provided and includes one or more processors and a memory coupled to the processors. The memory stores the first data comprising an index for retrieving information from a database, and a program code. When executed by at least one of the processors, the program code can cause the system to recover, in a first data record, the first data defining a first set of parent coupons which has been exchanged for a second set of coupons replacement due to an interruption having affected one or more of the parent coupons, and recovering, in a second database record, a second datum defining the second set of replacement coupons The program code can moreover bring the system to define a first table of operators, each corresponding to one of the respective parent coupons in the first set of parent coupons, and indicating whether the respective parent coupon corresponds to the interruption, define a second table of operators, each corresponding to one of the respective replacement coupons in the second set of coupons replacement, and indicating whether the respective parent coupon corresponds to the interruption, and define a third link table, each Kant at least one parent coupon in the first set to at least one replacement coupon in the second set. The program code can also cause the system to store the first table, the second table, and the third table in the index.

In another aspect, the third table can link each parent coupon in the first set to at least one replacement coupon in the second set, and link each replacement coupon in the second set to at least one parent coupon in the first set.

In another aspect, the parent coupons in each of the first and second sets can be classified in chronological order, and the program code can cause the system to define the first table, the second table, and the third table by selecting an older parent coupon in the first set, by selecting an older parent coupon in the second set, comparing the selected parent coupon to the selected replacement coupon. In response to the selected parent coupon corresponding to the selected replacement coupon, the program code can cause the system to add a first operator to the first table indicating that the selected parent coupon does not correspond to the interruption, add a second operator to the second table indicating that the selected replacement coupon does not correspond to the interruption, and add a first link to the third table linking the selected parent coupon to the selected replacement coupon.

In another aspect, the selected parent coupon and the selected replacement coupon can each be selected based on a counter, and the program code can also bring the system to, in response to the selected parent coupon corresponding to selected replacement coupon, increment counter to select next oldest parent coupon and next most recent replacement coupon, and select next oldest parent coupon and next most recent replacement coupon for comparison based on the counter. The program code can moreover cause the system to increment the counter each time the parent coupon corresponds to the selected replacement coupon, In another aspect, the program code can moreover cause the system to, in response to the selected parent coupon not corresponding to the selected replacement coupon, select an older parent coupon from the first set, select the most recent replacement coupon from the second set, and compare the most recent parent coupon to the replacement coupon most recent. In response to the most recent selected parent coupon corresponding to the most recent replacement coupon, the program code may also cause the system to add a third operator to the first table indicating that the most recent selected parent coupon does not correspond to the 'interruption, add a fourth operator to the second table indicating that the most recent selected parent coupon does not correspond to the interruption, and add a second link to the third table linking the most recent parent coupon to the most recent replacement coupon.

In another aspect, the program code can also cause the system to, in response to the most recent parent coupon not corresponding to the most recent replacement coupon, add a fifth operator to the first table indicating that the parent coupon most recent corresponds to the interruption, add a sixth operator to the second table indicating that the most recent replacement coupon corresponds to the interruption, and add a third link to the third table linking the most recent parent coupon to the replacement coupon most recent.

In another aspect, the program code can also cause the system to, in response to the selected parent coupon corresponding to the selected replacement coupon, determine whether both the next oldest parent coupon exists in the first set and a next oldest replacement coupon exists in the second set, and add only the first operator to the first table, the second operator to the second table, and the first link to the third table if the next oldest parent coupon and the coupon the next oldest replacement both exist.

In another aspect, the program code can also cause the system to, in response to at least one oldest parent coupon and the next oldest oldest replacement coupon not existing. if the next most recent parent coupon exists, add for each parent coupon remaining in the first set, a respective operator to the first table indicating that the respective parent coupon corresponds to the interruption. The program code can also cause the system to, in response to at least the oldest parent coupon and the next oldest replacement coupon non-existent, if the next oldest replacement coupon exists, add for each parent coupon remaining in the second set, a respective operator in the second table indicating that the respective replacement coupon corresponds to the interruption.

In another aspect, the program code can also cause the system to, if the oldest parent coupon exists, add for each parent coupon remaining in the first set, a respective link to the third table linking the parent coupon to the most recent replacement coupon in the second set, and if the next oldest replacement coupon exists, add for each replacement coupon remaining in the first set, a respective link to the third table linking the replacement coupon to a coupon most recent parent in the first set.

In another embodiment, a method generating the index intended to retrieve information from the database is provided. The method may include recovering, from the first database record, the first data defining the first set of parent coupons that have been redeemed for the second set of replacement coupons due to the interruption having affected or several of the parent coupons, and recovering, in the second database record, the second datum defining the second set of replacement coupons.

The method can also include defining the first operator table, each corresponding to one of the respective parent coupons in the first set of parent coupons, and indicating whether the respective parent coupon corresponds to the interruption, defining the second table operators, each corresponding to the respective coupon of the replacement coupons in the second set of replacement coupons, and indicating whether the respective replacement coupon corresponds to the interruption, and define the third table of links, each linking at least one coupon parent in the first set to at least one replacement coupon from the second set. The method may further include storing the first table, the second table, and the third table in the index.

In another aspect, the third table can link each parent coupon in the first set to at least one replacement coupon in the second set, and link each replacement coupon in the second set to at least one parent coupon in the first set.

In another aspect, the parent coupons in the first set and the replacement coupons in the second set can be classified in chronological order, and the first table, the second table, and the third table can be defined by selecting the oldest parent coupon in the first set, selecting the oldest replacement coupon in the second set, and comparing the selected parent coupon to the selected replacement coupon. In response to the selected parent coupon corresponding to the selected replacement coupon, the method can add the first operator to the first table indicating that the selected parent coupon does not correspond to the interruption, add the second operator to the second table indicating that the replacement coupon selected does not correspond to the interruption, and add the first link to the third table linking the selected parent coupon to the selected replacement coupon.

In another aspect, the selected parent coupon and the selected replacement coupon can each be selected based on a counter, and the method can also include, in response to the selected parent coupon corresponding to the selected replacement coupon, increment the counter to select the next oldest parent coupon and the next oldest replacement coupon for a counter-based comparison, where the counter is incremented each time the selected parent coupon matches the selected replacement coupon.

In another aspect, in response to the selected parent coupon not corresponding to the selected replacement coupon, the method can select the oldest parent coupon in the first set, select the most recent replacement coupon in the second set , and compare the most recent parent coupon to the most recent replacement coupon. In response to the most recent selected parent coupon corresponding to the most recent replacement coupon, the method can add the third operator to the first table indicating that the most recent parent coupon does not correspond to the interruption, and add the second link to the third table associating the most recent parent coupon with the most recent replacement coupon In another aspect, in response to the most recent parent coupon not corresponding to the most recent replacement coupon, the method can add the fifth operator to the first table indicating that the most recent parent coupon corresponds to the interruption, add a sixth operator to the second table indicating that the most recent replacement coupon corresponds to the interruption, and add the fourth operator to the second table indicating that the most recent replacement coupon does not match the interruption, and add the second link to the third table associating linking the most recent parent coupon to the most recent replacement coupon.

In another aspect, in response to the selected parent coupon corresponding to the selected replacement coupon, the method can determine whether both the next oldest parent coupon exists in the first set and the oldest replacement coupon next exists in second set, and add only first operator to first table, second operator to second table, and first link to third table if next most recent parent coupon and next most recent replacement coupon all exist of them.

In another aspect, in response to at least one next oldest parent coupon and the next oldest replacement coupon not existing, if the next most recent parent coupon exists, the method can add, for each parent coupon remaining in the first set, the respective operator in the first table indicating that the respective bread coupon corresponds to the interruption. In response to at least the next oldest parent coupon and the next oldest replacement coupon not existing, if the next oldest replacement coupon exists, the method may also add for each parent coupon remaining in the second set , the respective operator in the second table indicating that the respective replacement coupon corresponds to the interruption.

In another aspect, if the oldest parent coupon exists, the method may include adding for each parent coupon remaining in the second set, the respective link to the third table linking the parent coupon to the most replacement coupon. recent in the second set. If the next oldest replacement coupon exists, the method can also add, for each replacement coupon remaining in the second set, the respective link to the third table linking the replacement coupon to the most recent parent coupon in the first set.

In another aspect, each coupon in the first set of parent coupons can have a status and a start time, and retrieving the first data defining the first set of parent coupons can include filtering each parent coupon to which the status is browsed, or for which the departure time is earlier than the departure time of another parent coupon having the browsed status, in the first set of parent coupons.

In another embodiment, a computer program product generating the index for retrieving information from the database is provided. The computer program product may include durable computer readable storage medium, and program code stored on the medium which. when executed by one or more processors, causes the processors to recover, from the first database record, the first data defining the first set of parent coupons having been exchanged for the second set of replacement coupons due of the interruption which affected one or more of the parent coupons, and recovering, from the second database record, the second datum defining the second set of replacement coupons. The program code can moreover cause the processors to define the first array of operators, each corresponding to one of the respective parent coupons in the first set of parent coupons, and indicating whether the respective parent coupon corresponds to the interruption, define the second operator table, each corresponding to the respective coupon for replacement coupons in the second set of replacement coupons, and indicating whether the respective replacement coupon corresponds to the interruption, and define the third table of links, each associating at least one parent coupon in the first set to at least one replacement coupon in the second set. Program code can also cause processors to store the first table, the second table, and the third table in the index.

In another embodiment, a system is provided which includes one or more processors and a memory coupled to the processors. The memory can store the program code which, once executed by at least one of the processors, causes the system to recover, from a first database record, the first data defining a first set of first coupons, and retrieving, from a second database record, a second database defining a second set of segments. The program code can also, for each segment in the second set, generate a second coupon corresponding to the segment, and identify each first coupon for which the second coupon is a replacement. The program code can also cause the system to, for each first coupon identified, create a table that includes a first coupon element that identifies the first coupon and a second coupon element that identifies the second coupon and is linked to the first element

coupon. The program code can also cause the system to add the table to a first index.

In another aspect, the program code can also cause the system to, for each table in the first index, determine whether the first coupon has suffered the impact of an interruption, and, if the interruption affected the first coupon, report the first coupon as corresponding to the interruption.

In another aspect, the first index can be generated in response to the receipt of a first request to exchange a first ticket for a second ticket, and stored in a third database record. In response to receiving a request to display the second ticket, the program code may cause the system to

each table in the first index, recover the third datum which defines the second coupon, recover the fourth datum which defines the first coupon linked to the second coupon, and recover the fifth datum which identifies whether the first coupon linked to the second coupon is correctly marked as corresponding to the interruption. The program code can moreover cause the system to use the third datum, the fourth datum, and the fifth datum to transmit a response to the interrogation, the response being configured to cause the requesting system to display, for each second coupon defined. by the third datum, the sixth datum which defines the second coupon, the first coupon which is linked to the second coupon, and if the first coupon corresponds to the interruption.

In another aspect, the program code can also cause the system to determine if the requesting system is compatible with part of the sixth datum which defines the first coupon which is linked to the second coupon, and if the requesting system is incompatible, filter the part of the sixth datum coming from the response.

In another aspect, the first index can be stored in a third database record, and the program code can also cause the system to, for each first coupon in the first set, extract, from the first database record, a price component of the first coupon, store the price component in a price element, store the third data identifying the first coupon and the first database record in a product element, link the element and the product element to define a data structure, and add the data structure to a second index. The program code may also cause the system to store the second index in the third database record.

In another aspect, the first database record may include an original ticket, the second database record may include a reservation file, the first index may include an interruption index, and the second index may include a pricing structure index.

In another aspect, the first index can be generated in response to the reception of a first request to exchange a first ticket for a second ticket, and the program code can also cause the system to, in response to the reception of a second request to exchange the second ticket for a third ticket, recovering, from the second database record, the third datum defining a third set of segments. The program code can also cause the system to, for each segment in the third set of segments, generate a third coupon corresponding to the segment, and identify each second coupon for which the third coupon is the replacement. For each second identified coupon, the program code can cause the system to identify each table corresponding to the second coupon, add a third coupon element which identifies the third coupon to the identified table, and link the third coupon element to the second coupon element. . The first index can therefore be configured to provide a mapping between each third coupon and at least one corresponding first coupon.

In another aspect, the program code can also cause the system to, for each first data structure in the first index, determine whether the second coupon has been affected by an interruption, and if the 'interruption had an impact on the second coupon, report the second coupon as being interrupted.

In another aspect, the program code can also cause the system to, for each second coupon, determine whether the second coupon is being replaced by more than a third coupon. If the second coupon is being replaced by more than a third coupon, the program code can cause the system to identify each table which includes the second coupon element corresponding to the second coupon, and for each identified table, generate duplicates of the table identified so that a corresponding table exists to accept the third coupon element, each third coupon replacing the second coupon.

In another embodiment, a method indexing database records for retrieving information is provided. The method can include recovering, in the first database record, the first data defining the first set of first coupons, and recovering, in the second database record, the second data defining the second set of segments. The method can also include, for each segment in the second set, the generation of the second coupon corresponding to the segment, and the identification of each first coupon for which the second coupon is the replacement coupon. For each first identified coupon, the method can create the table which includes the first coupon element which identifies the first coupon and the second coupon element which identifies the second coupon and is linked to the first coupon element. The method can also add the table to the first index.

In another aspect, the method can also include, for each table in the first index, to determine if the first coupon has been affected by the interruption, and if the interruption has had an impact on the first coupon, report the first coupon as corresponding to the interruption.

In another aspect, the first index can be generated in response to receipt of the first request to exchange the first ticket for the second ticket and stored in the third database record, and the method can also include receiving the request to display the second ticket In response to receiving the request, the method may retrieve the first index from the third database record. For each table in the first index, the method can recover the third datum which defines the second coupon, recover the fourth datum which defines the first coupon linked to the second coupon, and recover the fifth datum which identifies whether the first coupon linked to the second coupon is well marked as corresponding to the interruption. The method can also include using the third datum, the fourth datum, and the fifth datum to transmit the response to the request, the response being configured to cause the requesting system to display, for each second coupon defined by the third datum , the sixth datum which defines the second coupon, the first coupon which is linked to the second coupon, and whether the first coupon corresponds to the interruption. In another aspect, the method can also include determining whether the requesting system is compatible with the part of the sixth datum which defines the first coupon which is linked to the second coupon, and if the requesting system is incompatible, of filter In another aspect, if the requesting system is compatible with the part of the sixth datum, it can be determined from an identity of the requesting system, or the status of the signal in the request.

In another aspect, the first index can be stored in the third database record, and for each first coupon in the first set, the method can also include extracting the tariff component from the first coupon in the first database record, store the tariff component in the price element, store the third data identifying the first coupon and the first database record in the product element, link the tariff element and the element of product to define the data structure, and add the data structure to the second index. The method can then store the. second clue in the third database record.

In another aspect, the first index can be generated in response to the receipt of the first request to exchange the first ticket for the second ticket, and the method may also include, in response to the receipt of the second request to exchange the second ticket for the third ticket, recover, from the second database record, the third datum defining the third set of segments. For each segment in the third set of segments, the method can generate the third coupon corresponding to the segment, and identify each second coupon for which the third coupon is the replacement. For each second identified coupon, the method can identify each table corresponding to the second coupon, add the third coupon element which identifies the third coupon to the identified table, and link the third coupon element to the second coupon element. The first index can thus be configured to provide the mapping between each third coupon and that at least corresponding to the first coupon.

In another aspect, the method can also include, for each first data structure in the first index, to determine if the interruption has had an impact on the second coupon, and, if the interruption has had affect the second coupon, report the second coupon as discontinued.

In another aspect, the method may also include, for each second coupon, to determine if the second coupon is replaced by more than a third coupon.

If the second coupon is replaced by more than a third coupon, the method can identify each table which includes the second coupon element corresponding to the second coupon, and, for each identified table, generate duplicates of the identified table so that the corresponding table exists to accept the third coupon element for each third coupon replacing the second coupon.

In another embodiment, a computer program product for processing database records is provided. The computer program product may include durable computer-readable storage medium, and program code stored on the medium which, when executed by one or more processors, causes the processors to recover from the first recording of stored database, the first data defining the first set of first coupons, and recovering, from the registration of the second database, the second data defining the second set of segments. The program code can moreover cause the processors to, for each segment in the second set, generate the second coupon corresponding to the segment, and identify each first coupon for which the second coupon is the replacement. The program code can moreover cause the processors to, for each first coupon identified, create the table which includes the first coupon element which identifies the first coupon and the second coupon element which identifies the second coupon and is linked to the first element coupon. The program code can also cause the processors to add the table to the first index.

The above summary may present a simplified overview of certain embodiments of the invention in order to give a basic understanding of certain aspects of the invention discussed herein. The summary does not purport to provide an exhaustive overview of the invention and is not intended to identify any key or critical element or to limit the scope of the invention. The sole purpose of the summary is to simply present a few concepts in a simplified form as a preamble to the detailed description presented below.

BRIEF DESCRIPTION OF THE DRAWINGS The drawings, which form an integral part of the specifications, illustrate various embodiments of the invention and, with the general description of the invention above and the detailed description of the embodiments given below. -after, serve to explain the embodiments of the invention.

FIG. 1 is a schematic view of an exemplary operating environment including a database management system in communication with a user system, a provider system, a reservation database, and a ticket database.

FIG. 2 is a schematic view of an exemplary computer which can be used to provide the FIG operating environment. 1.

FIG. 3 is a schematic view of an image of a reservation file which can be stored in the FIG reservation database. 1.

FIG. 4 is a schematic view of an image of an original ticket which can be stored in the FIG ticket database. 1.

FIG. 5 is a schematic view of the image of the reservation file for the

FIG. 3 with an updated route.

FIG. 6 is a schematic view of the image of the original FIG ticket. 4 and an image of a reissued ticket which may have been issued in response to the execution of a partial reissue of tickets based on the updated route defined by the FIG booking record. 5.

FIG. 7 is a schematic view of the image of the original FIG ticket. 4 and an image of a reissued ticket which may have been issued in response to the execution of a complete reissue of tickets based on the updated route defined by the FIG booking file. 5.

FIG. 8 is a flow diagram of a ticket exchange process which can be implemented by the FIG database management system. 1.

FIG. 9 is a schematic view of an exchange index which can be used by the FIG process. 8 to exchange the ticket.

FIGS. 10 to 13 describe a flow diagram of a process for producing the FIG trading index. 9.

FIGS. 14-18 are schematic views of exemplary sets of coupons which demonstrate the FIG process. 10 to 13 as applied to a number of different ticket trading scenarios.

FIG. 19 is a schematic view of a transition record which includes an interruption index which can be determined on the basis of the FIG exchange index. 9.

FIG. 20 is a schematic view of an image of an updated version of the FIG reservation file. 5, and a number of ticket images that may have been issued based on the updated reservation package.

FIG. 21 is a schematic view of the transition recording from the

FIG. 19 as it may appear after the issue of FIG reissued banknotes. 20.

FIG. 22 is a schematic view of the images enriched with an exemplary parent ticket and an exemplary retransmission ticket which can be displayed by the FIG user system. 1.

FIG. 23 is a schematic view of an enriched image of an exemplary reissue ticket issued in response to an exchange of the reissued ticket in FIG. 22.

FIG. 24 is a schematic view of a masked exemplary version of the enriched image of FIG. 23.

FIG. 25 is a schematic view of an image of an original exemplary ticket. FIG. 26 is a schematic view of an image of the original FIG ticket. 25 and an image of an exemplary ticket reissued after exchanging the original ticket for the reissued ticket.

FIG. 27 is a schematic view of the images of the original ticket and the reissued ticket of FIG. 26, and an image of an exemplary reissued ticket issued in exchange for the oldest reissued ticket.

FIG. 28 is a schematic view of a transition record as well as a hybrid ticket, a paid route, a quote route, and a rate quote record which can be generated from the data stored in the transition record.

FIG. 29 is a schematic view of the FIG database management system. 1 showing additional system information.

FIG. 30 is a flow diagram of a ticket exchange process which can be implemented by the FIG database management system. 29.

FIGS. 31 and 32 are schematic views of the files which can provide the FIG database management system. 29 to implement part of the FIG process. 30.

FIG. 33 is a flow diagram of a process which can be implemented by the FIG database management system. 29 to generate a hybrid route,

DETAILED DESCRIPTION [0093] Embodiments of the invention can be implemented by a data processing system which provides the processing and the database functions allowing interconnections between a plurality of database systems. Embodiments of the invention may include a database management system that provides an interface between a user system, a provider system, and the database systems. The database management system may include an exchange server which generates a transient record. The transition record may store the data used to manage ticket updates and reservation database records arising from requests to exchange a ticket in the user system. The transient registration may include a rate structure index as well as a break index which provides a mapping function between the records in the reservation and ticket databases. This mapping function can increase the speed and efficiency with which the exchange server processes database records in response to the receipt of a ticket exchange request.

Referring now to FIG. 1, an operating environment 10 in accordance with an embodiment of the invention may include a database management system 12, a user system 14, a provider system 16. a reservation database 18, and a ticket database 20. Each of the database management systems 12, user systems 14, provider system 16, reservation database 18, and ticket database 20 is able to communicate via a network 22, The network 22 can include one or more private or public computer networks (eg the Internet) allowing the exchange of data between the systems connected to the network 22.

The database management system 12 can include an electronic ticketing server (ETS) 24, an exchange server 26, as well as a transient database 28. The database management system 12 can be configured to receive and process requests sent by the user system 14 and / or the provider system 16. The database management system 12 can receive and process queries such as search queries, queries relating to pricing information, inquiries relating to fare confirmations, requests for ticket issuance, requests for reissue / exchange of ticket, or any other query related to research, pricing, reservations, and issuance of tickets for travel products. In response to the receipt of a query, the database management system 12 can communicate with one or more user systems 14, provider system 16, reservation database 18, ticket database 20, or any other system to process the query. In one embodiment, the database management system 12 can include a Global Distribution System (GDS).

The user system 14 can be a travel agency system, an airline reservation system, a travel website system, or any other system used to search, book, buy, and / or exchange travel products. The interrogations transmitted to the database management system 12 by the user system 14 can include data defining an origin, a destination, a certain number of spaces to be reserved, a period during which the trip is desired, a flight in particular. , or any other information relating to the subject of the inquiry.

The provider system 16 may include a computer reservation system (CRS) which allows the database management system 12 to book and pay for travel products, such as airline tickets. For air travel providers, CRS can manage space reservations between nodes in a travel network. Each node of the travel network may have a stopover (eg an airport) to and from which the provider operates the flights. The provider system 16 can also interact with other provider systems, either directly or through the database management system 10, to allow an issuing carrier to sell tickets for the spaces provided by the carrier. made. The de facto carrier can then invoice the issuing carrier for the products supplied.

In response to the user system 14 transmitting a reservation request for a travel product, such as a flight, the database management system 12 can produce a new reservation file and / or modify a reservation existing in the reservation database 18. The reservation file may include one or more data elements, or "elements" which contain the data defining the route and the related traveler information relating to one or more products of travel booked. The route may include travel products from more than one travel product supplier. In the context of air transport, the route may include a set of segments comprising one or more flights between a point of origin and a destination. To facilitate the location of the reservation file in the reservation database 18, a registration locator or any other appropriate identifier can be associated with the reservation file. In one embodiment, the reservation file 25 may include a passenger name file (FNP) stored in a FNP database.

The reservation file may include the elements which identify the segments on which the space has been reserved. A distinction must be made in a space and a seat based on the concept of overbooking. Overbooking is the practice where outfitters reserve more space than the number of physical seats on a flight, thus anticipating the fact that due to the non-presentation of certain passengers upon departure of the aircraft , reserved spaces will remain unused. A segment may refer to the operation of an aircraft between a point where passengers first board the aircraft and a point where passengers last depart the aircraft. A segment can include a number of stops during which passengers can exit and re-board on the same aircraft. A flight may relate to the operation of one or more segments with the same flight number, and may involve more than one aircraft. To book a flight that includes multiple segments, multiple items, each defining a segment of the flight, can be created in the reservation folder.

Booking a travel product can include checking the availability of the product in the supplier's inventory to ensure the availability of the product, such as, for example. the space available on the segments including the route. This verification can include sending a reservation request from the user system 14 to the database management system 12. The database management system 12 can alternatively interrogate a corresponding supplying system 16 on the availability of the products requested. If the requested products are available, the products can be reserved, and the supplier's inventory is therefore reduced to reflect the reservation. The ETS 24 can be configured to manage the records in the ticket database 20 which relate to the issue, modification, and use of the tickets,

Each ticket can include a database record that defines flight information such as the issuing carrier, flight number, flight departure point, flight destination, booking class, flight dates, and the price paid for the ticket. The ticket record may also include a time stamp which indicates when the ticket has been issued, ie added to or committed to the ticket database 20. Tickets 20 may be issued by the ETS 24 in response to the receipt of an indication that a linked reservation file has been confirmed. The ETS 24 can generate elements in the ticket based on the data stored in the reservation file. This information may include information for each segment defined in the booking file, such as the booking class, departure date, embarkation point, disembarkation point, passenger identity, one or more forms of payment used to purchase the segment, etc.

The ticket can include the elements that define a "coupon". For a given route, one or more tickets may be issued for a passenger, including coupons for each segment making up the route. Each coupon can identify a specific segment 30 for which the ticket can be used to obtain a boarding pass. Coupon status can be "open" if the coupon is unused, "browsed" if the coupon has been used, or "redeemed" if the coupon has been redeemed for another flight.

Each ticket in the ticket database 20 can have a unique identifier, or ticket number, which can be stored in an element of the ticket. To retrieve data stored in the ticket, a ticket display request query may be transmitted to the ticket database 20. In response to receipt of the display request query, the ticket database tickets 20 can send back data from the database registration corresponding to a ticket number presented in the query.

Tickets can include additional coupons that can be used to obtain products other than boarding passes. The ticket database 20 may also store other types of electronic documents, such as miscellaneous electronic documents (EMD), which represent a payment for paid services that have been purchased by the traveler. These paid services can be represented in the reservation file using Special Service Requests (SSR, or Special Service Requests). Services which are chargeable can be associated with an EMD and / or a coupon number in the reservation file.

[00105] Referring now to FIG. 2, the database management system 12. the user system 14. the provider system 14, the reservation database 18, and the ticket database 20 of the operating environment 10 can be set up application in one or more computer devices or systems, such as the exemplary computer 30. The computer 30 may include a processor 32, a memory 34, a mass memory storage device 36, an input / output interface (I / O) 38, and a man-machine interface (HMI) 40. The computer 30 can also be operatively coupled to one or more external resources 42 via the network 22 or the I / O interface 38. The external resources can include, but not be limited to, servers, databases, mass storage devices, peripheral devices, cloud network services (cloud), or any other appropriate computing resource that may be used with with computer 30.

The processor 32 can include one or more selected devices:

central processing units, programmable door arrays, programmable logic devices, defined state machines, logic circuits, analog circuits, digital circuits or any other device used to manipulate signals (analog or digital ) based on the operating instructions stored in memory 34. Memory 34 may include a single memory device or a plurality of memory devices including, but not limited to, read-only memory (ROM), memory to random access (RAM), volatile memory, memory

non-volatile, static random access memory (SRAM), dynamic random access memory (DRAM), flash memory, cache memory or any other device capable of storing data. The mass memory device 36 may include data storage devices such as a hard disk, an optical disk, a magnetic tape drive, a volatile or non-volatile solid state circuit or any other device capable of store data.

The processor 32 can operate under the control of an operating system 44 which resides in memory 34. The operating system 44 can manage the resources of the computer in such a way that the program code of the computer, integrated in the form of one or more application software, such as the application 46 which resides in the memory 34, can have instructions executed by the processor 32. The processor 32 can execute the application 46 directly and in which case, the operating system 44 can be omitted. One or more application software may include a common example of a server application, which can accept requests from, and provide responses to, one or more corresponding client applications. One or more data structures 48 can also reside in memory 34, and can be used by processor 32, operating system 44 or application 46 to store or manipulate data.

The I / O interface 38 can provide a machine interface which functionally couples the processor 32 to other devices and systems, such as the network 22 or the external resource 42. The application 46 can thus collaborate with the network 22 and / or the external resources 42 by communicating via the 1/0 interface 38 to provide the various elements, functions, applications, processes and / or modules making up the embodiments of the invention. The application server 46 may also have program code that is executed by the one or more external resources 42 and / or otherwise relies on the functions and / or signals provided by another system or other network components external to the computer system 30. Indeed, in view of the almost infinite configurations of possible computer hardware and software, it should be understood that the embodiments of the invention can include applications located outside of the computer system 30, distributed to multiple computers and / or other external resources 42, and / or provided by computer resources (hardware and software) provided as services on the network 22, for example a cloud computing service.

ΗΜΙ 40 can be operatively coupled to processor 32 of the computer system 30 to allow a user to interact directly with the computer 30. The HMI40 can include a video display and / or an alphanumeric display, a screen touchscreen, a speaker and any other visual and audio indicator capable of providing data to the user. The HMI 40 can also include input devices and controls such as an alphanumeric keyboard, pointing device, keyboards, push buttons, control buttons, microphones, etc., capable of accepting commands and / or user input, and to transmit the input input to processor 32.

A database 50 can reside on the mass memory storage device 36 and can be used to collect and organize the data used by the various systems and modules described herein. The database 50 can include data and the data structures that support it to store and organize the data. In particular, the database 50 can be arranged according to any database organization or structure including, in a non-exhaustive manner, a relational database, a hierarchical type database, a networked database, a database object-oriented data or combinations thereof.

A database management system in the form of a computer software application insofar as the instructions on the processor 32 can be used to access the data stored in the records of the database 50 in response to an interrogation, and the interrogation can be automatically determined and executed by the operating system 44, other applications 46 and / or one or more modules. Although embodiments of the invention may be described herein using relational, hierarchical, network, object-oriented or other database terminology in specific examples, it should be understood that the embodiments of the invention can use any appropriate database management model and are not limited to a particular type of database.

[00112] FIG. 3 represents an image 60 of an exemplary reservation file for a flight from Nice in France to John F. Kennedy Airport in New York which passes through Charles de Gaulle Airport in Paris. The reservation file includes an identifier field 62 which stores an identifier record, a passenger name field 64, and a segment field number 65, 66. The identifier record can be an alphanumeric string ( eg 89DRGH) which only identifies the reservation file in the reservation database 18. The passenger name field can store the passenger's name (eg "John Smith"). If more than one passenger is traveling on a route defined by the reservation file, more than one passenger can be listed in the reservation file.

Each segment field 65.66 can include a flight identifier (eg, AF7711) and a class code (eg, "Y" indicating economy class). The flight identifier may include a carrier identifier (eg, AF = Air France) and a flight number (eg, 7711). Each segment field can also include data that defines a travel date (eg 19MAR), a point of origin and a destination point (eg NCECDG), and a departure and arrival time planned for the segment (e.g. departure at 7:10 am, arrival at 8:45 am).

Once the travel products including the route have been booked, the traveler can take the route by purchasing one or more tickets for the travel products. Buying a ticket may involve pricing, booking and ticketing. In response to receiving a request from the user system 14, the database management system 12 can set the price of the ticket using the pricing engine. The pricing engine can determine a total price for the ticket by calculating a price for one or more segments of the route defined by the booking file and add these prices to generate the total price. The resulting ticket may include one or more coupons, each coupon corresponding to one of the segments or services included in the trip.

The ticket route can define the segments for which the ticket can be used to obtain a boarding pass and other services included in the journey.

Each segment of the route can include one or more sequential sections, each connecting a planned departure stopover to a planned arrival stopover.

Once availability has been confirmed and the itinerary has been priced, the traveler can be asked to approve the transaction. In response to the approval of the transaction by the traveler, the database management system 12 or another reservation system 25 can initiate the reservation file, transmit a request to the ETS 24 to generate the tickets for the travel products, and cause the traveler's account to be billed for the price of the services.

[00116] FIG. 4 shows an image 70 of an exemplary ticket database record, or "ticket" which can be created in response to the reservation of the 89DRGH reservation file in image 60. The ticket may include a number field ticket 72 which contains data which uniquely identifies the ticket (e.g. TKT-001), a record locator field 74 which contains data identifying the reservation file from which the ticket was generated, a passenger name field 76, a coupon field number 78.79, and a fare component field number 82.83. On an exemplary ticket TKT-001, the coupon C1 can correspond to the segment SI of the reservation file 89DRGH, and the coupon C2 can correspond to the segment S2 of the reservation file 89DRGH.

Each coupon can include data defining the flight number, the booking class code, the time and date of departure, the code of the place of origin, the destination code and a flight status. On the exemplary ticket TKT-001, the flight status is indicated by "O", or "open", indicating that the coupons have not been used. Other segment statuses may include "P" or "traveled", and "E" or "traded". The ticket can also include one or more fields of tariff component 82, 83. On ticket TKT10 001, the fields of tariff component 82, 83 are indicated under the coupon fields 78, 79, and correspond to the tariffs FC1 and FC2 calculated for the SI and S2 segments of the 89DRGH reservation file.

In some cases, a traveler may be subject to an involuntary change in his itinerary due to the appearance of an interruption. An interruption may occur if, for example, a flight is canceled due to the weather or a mechanical problem, a link segment is missed due to the late arrival of an older segment, a program is modified or a last minute problem occurs at the airport. Unintentional changes to the itinerary can be dealt with by exchanging the entire ticket, or by a partial exchange. In the event of a partial exchange, there may be two tickets coexisting live in the ticket database, each providing part of the total itinerary of the traveler. In both cases, a new route can be defined in the reservation file which replaces the interrupted segments. A remission ticket can then be generated based on the updated reservation file.

By way of example, the use of the reservation file 89DRGH represented in image 60 and of the ticket TKT-001 represented in image 70, in response to the Nice segment at

Interrupted Paris, an agent of the transporter or an automated re-accommodation application may alter the route defined by the 89DRGH reservation file. For example, the reservation file 89DRGH can be modified by substituting a flight which connects the segment from Nice to Paris via Berlin in the reservation file.

[00120] FIG. 5 shows an image 61 of an 89DRGH reservation file, as it may appear after having been modified as described above. Image 61 shows that the previous segment SI defined in segment field 65 of the reservation file 89DRGH has been replaced by two replacement segment fields 67, 68 which define new segments SI and S2 connecting Nice to Charles de Gaulle via Berlin. The previous segment S2 remains part of the route, and is now designated as the segment S3 in the segment field 69. A remission ticket may be issued for the revised route which replaces the exchanged ticket, or a ticket may be issued which replaces only the interrupted segment. In both cases, because the change was involuntary, the fare may remain unchanged from the flight originally booked. In conventional reservation systems, this may require an agent to set the rate for the replacement segments manually.

[00121] FIG. 6 shows a scenario in which a reissue TKT-002 is issued when exchanging a TKT-001 ticket in its entirety. In this scenario, the exchanged or “parent” ticket TKT-001 may appear as shown on the ticket image 71, and a reissue ticket TKT-002 may appear as shown on the ticket image 90. The reissue ticket may include a ticket number field 92 which contains a new ticket number, a registration locator field 94 which contains data identifying the reservation file 89DRGH from which the ticket TKT-002 was generated, a field of passenger name 96, coupon field number 98-100, and fare component field number 102-104.

The total price of replacement coupons C1, C2 identified in coupon fields 98, 99 of the reissue ticket TKT-002 can be set to the same amount (eg, 80 USD) as the coupon that has been replaced (TKT-001 key) to maintain the total price at the price of the original ticket. Because the TKT-001 ticket has been completely replaced, the status of coupons Cl and C2 on the TKT-001 ticket can be “E” for “redeemed”, since they have been replaced by coupons Cl, C2 and C3 on ticket TKT-002.

FIG. 7 represents a partial exchange in which the TKT-002 ticket is issued only for the new segments. In this case, tickets TKT-001 and TKT-002 can coexist as live tickets in the ticket database 20. As shown by image 73 of ticket TKT-001 and image 91 of TKT-002 , in this other scenario, the status of coupon C2 remains open on the ticket TKT-001, and TKT-002 includes only the coupon fields 98 and 99 and the tariff component fields 102 and 103.

Because route changes resulting from an interruption are typically not billed to the traveler, reissue tickets associated with the interruption can be generated without calculating replacement fares. This can happen, for example, when reissue tickets are issued free of charge by the airline in response to a flight interruption due to weather conditions, equipment issues, crew availability, overbooking, delayed connecting flights, etc.

Reissue tickets calculated without replacement fares can allow agents to quickly issue new tickets to passengers whose travel has been interrupted. However, these tickets may be non-standard tickets that lack inherent fare data.

The lack of inherent pricing data can create problems when additional transactions involving reissue of the ticket are requested after the involuntary exchange. For example, calculations to determine points in the loyalty program (eg, accumulated frequent flyer mileage), compensation for canceled flights, and / or refunds or exchange value of the reissue ticket it can be based on the segments which have been paid rather than on the segments which have been currently covered or which have been the subject of a ticket due to an involuntary exchange. These types of calculations may require both global pricing information (e.g., the total ticket price) as well as information on the structural price of the original ticket at a pricing component and / or coupon level.

As a specific example, if the reissue ticket issued as part of an involuntary exchange is subsequently voluntarily exchanged by the traveler, the traveler should not normally be subject to additional charges for flights that have been changed involuntarily. If the traveler subsequently requests a partial refund of the reissue ticket, determining the residual value of the reissue ticket may require linked segments on the original and reissue tickets. The reissue ticket can then be used to determine the status of each coupon (e.g., open, scanned or redeemed), and the original ticket can be used to determine the monetary value of each segment (e.g., the amount paid and / or the amount of the tariff).

Scenarios that can further complicate the determination of structural price information may include a partial exchange of a ticket, which may result in the entire route being split into multiple tickets. In some cases, one or more exchanged tickets may have been removed from the system due to the age of the ticket. Because the life of the tickets may differ, some exchanged tickets linked to a reissue ticket may be available while others may be missing. For these reasons at least, attempting to determine the structural price information by identifying and retrieving each exchanged ticket, and reconstructing the trading history may produce erroneous results.

The compensation for reimbursed or exchanged tickets can be determined on the basis of the value of delayed flights. Because replacement segment coupons issued as a result of an involuntary exchange are not purchased, the value of these coupons cannot necessarily be determined on the basis of either an amount paid for the exchanged segment or the normal rate for the replacement segment. This means that these segments can have a value which is independent of the normal prices of the exchanged or replacement segments. In some cases, the compensation may be linked to the original coupon of the ticket purchased originally. However, it may be difficult or impossible to determine the exchange of a particular segment was voluntary or involuntary solely on the basis of ticket records. In cases where the ticket has been fully exchanged, it may also be difficult to determine whether the exchange has taken place or not.

Ticket registrations and reservation files may be required to comply with certain standard formats so that compatibility is maintained between various carriers, travel agencies and GDS systems. Therefore, it is impossible to simply add new types of data to, or otherwise modify, ticket records and reservation records in order to address issues caused by involuntary exchanges. To resolve these issues, embodiments of the invention may use a transition record to track the old fare component and the coupon data. Transition records may include a new type of database record which is used by the exchange server 26 to provide various features of the embodiments of the present invention. The exchange server 26 can analyze the ticket records and the ticket reservation files to determine which flights have been interrupted, link the segments of the old route to the corresponding segments in the new route, and store the data defining these segments. broken and links in the transition record, [00130] The transition record may include a pricing structure data which would have been included in the involuntary tickets if they had been issued as part of a voluntary exchange. The exchange server 26 can also create a hybrid ticket including all the coupons for the current route on the basis of the data in the transition record. Pricing information from the originally purchased ticket and links to hybrid ticket coupons can be stored in the transition record and can assist in determining structural pricing information for Unintentionally Exchanged Tickets [00131] The hybrid ticket can allow involuntary tickets to appear as if their price had been set and if they had been purchased rather than issued as part of an exchange. This can allow follow-up processes to work transparently on involuntarily exchanged tickets by matching previously issued tickets with the corresponding reissue tickets. From an involuntarily given ticket, embodiments of the invention can cause the user system 14 to display the complete current route, including the segments traveled and open. This can make it possible to make links between tickets in the exchange chain, which can facilitate exchanges or subsequent refunds of an involuntary exchanged ticket. For any given coupon of the reissue ticket, the exchange server 26 can find the pricing elements of the coupon, eg, the original tariff component (s) from which the coupon originates. This can allow the exchange server 26 to assign a value to the coupon. The compensation rules can be applied to these tariff components and the cumulative mileage can be determined on the basis of the original price.

[00132] FIG. 8 shows a diagram of a ticket exchange process 110 which can be implemented by the exchange server 26 to manage involuntary exchanges. In block 112, process 110 can receive a request for an involuntary exchange.

This request may include the ticket number of the ticket being exchanged and / or the registration locator of a reservation file associated with the ticket. In response to receiving the request, the process 110 may proceed to block 114 and retrieve the ticket being exchanged from the ticket database 20. Retrieving the ticket may include transmitting a request to the base 20 ticket data requesting an image of the ticket. This image may include the data defining the coupons comprising the ticket and the tariff components used to fix the price of the ticket, and may be included in addition in a response transmitted to the exchange server 26 by the ticket database 20. For the exemplary ticket, original priced and purchased TKT-001, the ticket database 20 can return the image 70 of FIG. 4 to the exchange server 26.

In response to receiving the response from the ticket database 20, the process 110 may proceed to block 116 and check the status of each ticket coupon to determine if the ticket is redeemable. For example, a ticket for which all coupons have been scanned cannot be redeemed. As can be seen in coupon fields 78, 79 in image 70, coupons C1 and C2 of TKT-001 are open. Therefore, the TKT-001 ticket can be exchanged.

Once the status of each coupon of the ticket being exchanged has been determined, the process 110 can go to block 117 and retrieve the reservation file identified by the data in the field of the ticket registration locator . In the present example, the registration locator field 74 of the ticket TKT-001 identifies the reservation file 89DRGH, which may appear as shown in FIG. 61 of FIG. 5. The reservation file may define an alternative route that includes one or more replacement segments (eg, segments SI and S2) that replace (s) one or more interrupted segments of the previous route.

In response to the reception of the image of the reservation file, the process 110 can pass to block 118 and create a reissue ticket (for example, ticket TKT-002) in the ticket database 20. The 110 process can also modify the original ticket (eg, TKT-001 ticket) to reflect changes in the status of that ticket. In the present exemplary scenario, the original SI segment connecting Nice to Paris has been replaced in the 89DRGH reservation file by two SI and S2 segments including a flight with a connection to Berlin. In the event of a complete exchange, the TKT-002 ticket as shown in FIG. 90 of FIG. 6 can be created in the ticket database 20. Because the ticket TKT-002 shown in picture 90 is a replacement for the ticket TKT-001 in its entirety as shown in picture 70, TKT-001 can be modified by changing the status of the coupons to “redeemed”, as shown in picture 71.

Once the tickets involved in the exchange have been created and / or modified, the process 110 can go to block 119. In block 11 9, the process 110 can determine which coupons of the parent ticket and of the ticket reissue are associated with the interrupt. Once the interrupted coupons have been identified, the process 110 can proceed to block 120 and create a transition record which stores the data related to the ticket exchange.

As described above, transition recording can improve the speed and efficiency of future data recovery operations involving an exchange of the reissue ticket.

The process of determining the coupons corresponding to the interruption and of creating the transition record linking these coupons can begin by identifying one or more coupons in the parent ticket which were involved in the exchange. A coupon in the parent ticket can be considered as corresponding to a coupon, say the reissue ticket, if the compared coupons have the same flight information. Flight information may include the identities of the originating and actual carriers, the flight number, departure and arrival locations, booking and / or cabin class, and / or flight dates for departure and arrival, for example.

FIG. 9 represents an exemplary exchange index 122 which includes several tables or "sets" 124-128. These sets can be used by the exchange server 26 to identify coupons interrupted in parent and reissue tickets.

and link the coupons in the parent ticket to the corresponding replacement coupon in the reissue ticket. Sets 124-128 can include a set J of one or more parent coupons a _s that are open (and therefore redeemable) in the parent ticket. For a set A having m coupons, the set can be defined as follows:

^{5 A} ~ l ^a s}> 3 ë [0, m] (Eqn.l)

In the event of a partial exchange, the coupons in set A can be filtered so that only the coupons that could be involved in the exchange of tickets are analyzed. For example, any coupon whose status is "scanned" can be excluded from the analysis. If multiple coupons in the parent ticket have been scanned outside of this sequence (i.e. there is an open coupon with a departure date older than a scanned coupon), any Open coupon with dates departure date prior to the departure date of a voucher traveled can also be filtered outside of set A.

The exchange server 26 can also determine a set B of one or more replacement coupons bh on the reissue ticket. The set B can include n 15 coupons which collectively provide a solution replacing the coupons of the interrupted segments in the set A. The set B of coupons bh can be defined as follows:

B = 0¼}. Β θ [0, n] (Fqn. 2) [00140] To document the associations with the interruptions and the links between the coupons in each set, the exchange server can fill the set A 'with m 20 boolean operators a ' _g , the set B' with n Boolean operators b 'h, and the set D with l links. For example, the set A 'can be presented by equation 3,

A '= {a ^}, ^ e [Ô, mJ (Fqn.3) where each operator a _g has a true value (eg, "1") if the coupon a _g corresponds to an interrupted segment, and to a false value (eg "0") if the coupon a _g does not correspond to any interrupted segment. Similarly, the set B 'can be presented by equation 4, fî' = (b ' _ft }, 0e [Ô, nJ (Eqn.4) where each operator b'h has a true value if the coupon bh corresponds to the interruption (i.e.

the coupon replaces an interrupted coupon a _g ), and a false value if the corresponding coupon bh does not correspond to the interruption (ie the coupon bh does not replace an interrupted coupon ag). In one embodiment, the value of each operator a ' _g and b'h can start with, or otherwise be initially set to false. The set D can include a table of links which provide an index linking each coupon a _g to one or more coupons bh which replace) the coupon a _s .

The set D can comprise a set l of links dk, each link dt comprising a data structure which defines a relationship between a parent coupon a _g and a corresponding replacement coupon /> *. Each dk link can be represented as follows: dk ~ (@ g · b / ι) (Eqn. 5)

Each parent coupon a _g can be linked to at least one replacement coupon & *. Similarly, each replacement coupon b * can be linked to at least one parent coupon a _g . For example, a segment interrupted to be replaced by several segments (eg, if a direct flight is replaced by a connecting flight), and vice versa. This can give rise to m which is not equal to n. Consequently, the number l of links dk in the set D can be provided by:

l = max (n, m)

Since each parent / replacement coupon is linked to at least one replacement / parent coupon. There is not necessarily a one-to-one correspondence between the interrupted segments and the replacement segments because a single interrupted segment can be replaced by two replacement segments, or two interrupted segments can be replaced by a single replacement segment .

The process for generating the sets A \ B'et D can include the comparison of the oldest parent coupon (ie the coupon with the most distant departure time) in the set A (e.g. coupon ai) and the oldest replacement coupon in set B (e.g. coupon bi). If the coupons match (i.e., the segment 20 for which each coupon is redeemable appears to be the same segment based on flight data), the redemption server 26 can compare the next oldest parent coupon in set A to the next older replacement coupon in set B, advancing chronologically until you find two coupons that do not match.

In response to identifying a pair of coupons that do not match, the process can select the most recent parent coupon (i.e. the coupon with the most recent departure time) in set A (eg, coupon a „), the most recent replacement coupon in set B (eg, coupon b _m ), and compare these coupons. If the coupons match, the exchange server 26 can compare the next most recent coupon in set A with the next most recent coupon in set B, advancing in reverse chronological order until two coupons are found that don't match.

The exchange server 26 can then determine that all of the coupons between and including the oldest pair of coupons that do not match and the most recent pair of coupons that do not match are associated with the interrupt. This means that the coupons identified correspond to the interrupted coupons a _g in set A, and to the corresponding replacement coupons ά ”in set B.

FIGS. 10-13 show flowcharts representing a process 130 which can be implemented by the exchange server 26 to detect interrupted coupons, match them to their corresponding replacement coupons and generate the exchange index. With reference to FIG. 10, in block 132, process 130 can initialize one or more counters, eg, by setting counter i-1 and counter / = 0. The counters can be used to keep track of coupons in sets A and B which are analyzed, as well as the locations of the links dt added to the set D by the process 130.

Once the counters are set, the process 130 can go to block 134 and compare the coupon a, from set A to coupon b "from set B. If the coupons do not match (branch" NO »Of decision block 136), process 130 can pass to block 138, set the values of a ', and b' _t to true in sets A 'and B', thereby indicating that the coupons are associated with a interruption, and go to block 139 (FIG. 11). If the coupons correspond (“YES” branch of the decision block 136), the process 130 can pass to block 140.

In block 140, the process 130 can determine whether both the coupon a + r exists in the set J and the coupon 6, + i exists in the set B. If no coupon exists in this respective set (“NO” branch of decision block 140), process 130 can pass to block 142 (FIG. 12). If the two coupons exist in their respective sets (“YES” branch of the decision block 140), the process 130 can pass to block 144.

In block 144, the process 130 can set the values of a't and b 7 to false in the sets J'and B \ respectively, to indicate that the coupons are not associated with an interruption, and add a link d, = (a ,, b,) to the set D. The link d, can define a relation between the coupon a, and the coupon The process 130 can then pass to block 146, increment the counter i, return to block 134, and continue the coupon comparison process.

[00148] Referring now to FIG. 11, in block 139, process 130 can compare coupon a, „. J with coupon b _n .j. If the coupons do not correspond (“NO” branch of decision block 148), process 130 can go to block 150. In block 150, process 130 can adjust the values of each operator a / via in set A \ each operator F, via b mj in the set B 'on true. Process 130 can also add links d = (a _g , bh) to D for g = i to mj eth = i to nj. Once the operators and links have been defined in their respective sets, the process 130 can be terminated.

If the coupons correspond ("YES" branch of the decision block 148), the process 130 can pass to block 152. In block 152, the process 130 can determine whether the operator a or the operator b ' _n -j is true. If both operators are true (“YES” branch of decision block 152). process 130 can proceed to block 154 (FIG. 13). If no operator is true (“NO” branch of the decision block 152), the process 130 can pass to block 156.

In block 156, process 130 can set a ' _m .j and b = false in sets A' and B ', respectively, and add a link dy = (a _m -j, b _n -j) to the set D. The link d / .j can define a relationship between the coupon a _m -j and the coupon b _n -j. The process 130 can then go to block 158, increment the counter j, return to block 139, and continue the process of comparing the coupons.

[00151] Referring now to FIG. 12, in block 142, the process 130 can determine if the coupon bt + \ exists in the set B. If the coupon exists (“YES” branch of the decision block 142), the process 130 can go to block 160 and set the values of each operator 6 ', + / via b in the set 5' on true. Process 130 can also add links d = (a ,, bh) to D for h = i to n. Once the value of the operators via b ' _K has been fixed and the links d have been added to the set D, the process 130 can be terminated.

If the coupon bra does not exist in set B ("NO" branch of decision block 142), process 130 can pass to block 162.

In block 162, the process 130 can determine whether the coupon a / + i exists in the set A. If the coupon exists (“YES” branch of the decision block 162), the process 130 can pass to the block 164. In block 164, process 130 can set the values of each operator a ' _t + i via a' _m in the set A 'to true, and add links d = (a _g , b,) to D for g = i to m. Once the values of the operators '', + / via a ^f _m have been set and the links d have been added to the set D, the process 130 can be terminated. If the coupon û / + i does not exist in the non-breaking set A (“NO” branch of the decision block 162), the process 130 can pass to block 166, generating a message indicating that no interrupted coupon has been detected and terminate.

[00153] Referring now to FIG. 13, in block 154, process 130 can determine whether the value of the operator best is true. If the value of the operator b'nj is true (branch "YES" of the decision block 154), the process 130 can go to block 168, set the value of the operator b Zj in the set B * to false , and set the values of each operator at all via to true. Process 130 can also add links d _g = (a _g , bnf) to D for g - i to m ~ j before terminating. If the value of the operator b "y is not true (branch" NO "of the decision block 154), the process 130 can go to block 170. In block 170, the process 130 can set the operator value a ' _m .

j in set A 'on false, and set the values of each operator b't via bf-ji in set B' on true. Process 130 can also add links d /, = (a _m - ,. b ;,) to D for h = z to nj before ending.

FIG. 14 shows an application of the process described above 130 to an exemplary set 180 of coupons 182-185 (e.g., set A of coupons ai-aff from a parent ticket, and an exemplary set 190 of coupons 192- 195 (eg, set B of coupons bi-bf) from a reissue ticket The exchange server 26 can start the analysis by initializing the counter i - 1 and the counter j = 0, and selecting the oldest coupon in chronological order from each set A and set B (e.g. coupon ai and coupon bj) based on the value of the counter i.

The exchange server 26 can compare the selected coupons ai and bj (as indicated by the double arrow line 200) to determine if they have the same flight information. In response to determining that the coupons have the same flight information (i.e. ai = b \), the exchange server 26 can then determine whether both the coupon ai exists in the the set A, and the coupon fe exists in the set B. In response to determining that these coupons exist in each of the respective sets, the exchange server 26 can adjust (or check, if necessary) the value of the operator a'i of the set A 'and of the operator b'2 of the set B' overflows (thus indicating that they are not associated with a broken link), add a link di = (ai , bi) to set D, and increment the counter 2 to 2.

The exchange server 26 can then compare the coupon 02 of Γ assembly A with the coupon b2 of the assembly (as indicated by the double arrow line 202), which are the next coupons in chronological order in each together, as indicated by the counter i. Because the flight information of coupon 02 is different from the flight information of coupon 62, the exchange server 26 can determine that the coupon as does not match the coupon bz, i.e. than 02 f 62.

In response to the determination that ai f bi, the exchange server 26 can adjust the value of the operator a'2 of the set A 'and of the operator bf of the set B' on true. The exchange server 26 can also select the last coupon which appears in chronological order in each set A and set B (for example, the coupon a $ of the set A and the coupon bi of the set B) based on the value of the counter J and the number of coupons in each set, and compare the selected coupons, as indicated by the double arrow line 204. Because the flight information for each of these coupons is the same, the server exchange 26 can determine that a * = b4. In response to the determination that m = 64, the exchange server 26 can further determine whether the value of the operator a'4 of the set A 'or of the operator b'4 of the set B is true. In the present example, since neither the operator a'4 nor the operator b'4 has been set to true, the exchange server 26 can determine that no operator has the value true, k following of its determination, the exchange server 26 can set the value of each of these operators to false, add a link di = (end, bi) to the set D, and increment the counter j to 1. [00158] The exchange server 26 can then select the next most recent coupon in chronological order from each of sets A and B (e.g., coupon a $ from set A and coupon 63 from set B) based on the value of the counter /, and compare the severed coupons, as indicated by the double arrow line 206. Because the flight information is the same for each of these coupons, and because neither the operator has' 3 neither the operator b'3 has been set to true, the exchange server 26 can set the value of each of these operators on false, add a link = ("23, 63) to the set D, and increment the counter j to 2.

The exchange server 26 can then select the next most recent coupon in chronological order of each set based on the value of the counter j (eg, coupon 02 of set A and coupon bz of the set B) and compare the coupons, as indicated by the double arrow line 208. In response to the determination that 02 f bz, the exchange server 26 can adjust the value of the operator a'2 on true, set the value of the operator b'2 to true, add a link dï = (02, bi) to the set D, and end the analysis.

[00160] FIG. 15 shows the application of the process 130 described above on the exemplary set 180 of coupons 182-185 and another exemplary set 210 of coupons 212-215 (e.g., the set B of coupons bi-bt) of a reissue ticket in which coupons b \ and bi replaced coupons ai and 02.

The exchange server 26 can start the analysis by initializing the counters and by selecting the oldest coupons in chronological order in each set A and set B, for example, the coupon ai and the coupon bi as indicated by the counter i. The exchange server 26 can compare the selected coupons ai and bi (as indicated by the double arrow line 220) to determine if they have the same flight information. In response to the determination that the coupons do not have the same flight information (i.e. ai f bi), the exchange server 26 may adjust the values of the operator a '\ de l 'set A' and of the operator b 'i of the set B * on true.

The exchange server 26 can then select the most recent coupon which appears in chronological order in each of the sets A and B (for example, the coupon a * of the set A and the coupon & 4 of set B), and compare the selected coupons, as indicated by the double arrow line 222. Because the flight information for each of these coupons is the same, the exchange server 26 can determine that a "= Ô4 . In response to the determination that at = 64, the exchange server 26 may further determine whether the value of the operator 0'4 of the set A 'or of the operator b'4 of the set B is true. Because neither the operator a'4 nor the operator b'4 has been activated on true, the exchange server 26 can set the value of each of these operators to false, add a link d * = (" 4, b ^ to the set D, and increment the counter j to 1.

The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets A and B (for example, the coupon ai of the set A and the coupon by of the set B) on the basis of the value of the counter j, and compare the selected coupons, as indicated by the double arrow line 224. Because the flight information for each of these coupons is the same, and that neither the operator has' 3 neither the operator b'3 has been set to true, the exchange server 26 can set the value of each of the operators to false, add a link dy = (ay, by) to the set D, and increment counter j to 2.

The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets A and B (for example, the coupon ay of the set A and the coupon b? Of l 'set B) based on the value of counter J, and compare 25 the selected coupons, as indicated by the double arrow line 226. In response to the determination that az f by, the exchange server 26 can activate the values of operators aj, a'y, b'i, and b'2 on true, add links d \ - (ai, bi) and d2 = (ay, bz) to the set D, and end the analysis.

[00165] FIG. 16 shows an application of the process 130 described above on the exemplary set 180 of the coupons 182-185 and on an exemplary set 230 of the coupons 232-236 (e.g., set B of coupons & i-às) of a ticket in which the by and by replace the ay coupon.

The exchange server 26 can start the analysis by initializing the counters and selecting the oldest coupons ai and bi in their sets A and B. The exchange server 26 can compare the selected coupons (as indicated by the double arrow line 238), determine that they have the same flight information, and that both the coupon ai exists in set A, and the coupon bi exists in set B. In response to these determinations, the exchange server 26 can set the values of the operator aj of the set A 'and of the operator bf of the set B ¹ to false, add a link di = (m, bi) to the set D, and increment the counter i to 2.

The exchange server 26 can then select the next oldest coupon in chronological order in each of the sets A and B (for example, the coupon ai of the set A and the coupon fe of the set B) on the basis of the value of the counter i, and compare the selected coupons, as indicated by the double arrow line 240. Because the flight information of the coupon ai is different from the flight information of the coupon bi, the server of exchange 26 can determine that ai ψ bi. In response to this determination, the exchange server 26 can set the values of the operator a'2 of the set A 'and of the operator b'2 of the set B' to true, select the coupon le most recent which appears in chronological order in each of sets A and B (e.g. coupon 04 of set A and coupon b $ of set B), and compare the selected coupons, as indicated by the double arrow line 242.

Because the flight information of coupons 04 and ôs are the same, the exchange server 26 can determine that a <= 65. In response to the determination that a <= bs, the exchange server 26 can also determine whether the value of the operator a'4 of the set A 'or of the operator b'5, or of the set B' is true. Because neither the operator af nor the operator b's has been set to true, the exchange server 26 can set the value of each of these operators to false, add a link d $ = (04, bs) to the set D, and increment the counter j to L [00169] The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets A and B (for example, the coupon az from set A and coupon 64 from set B) based on the value of counter j, and compare the selected coupons, as indicated by the double arrow line 244. Because the flight information for each of these coupons are the same, and because neither the operator a'3 nor the operator b'4 has been set to true, the exchange server 26 can set the value of each of the operators to false, add a link d4 - (ai, 64) to the set D, and increment the counter j to 2.

The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets J and B (for example, the coupon ai of

Γ set A and coupon bs of set B) on the basis of the value of counter J, and compare the selected coupons, as indicated by the double arrow line 246. In response to the determination that ai t bs, the exchange server 26 can set the values of the operators 0'2, b'2, and b'3 to true, add links ife = (<22, h) and "fe ~ (" 2, M to the set D, and complete the analysis.

[00171] FIG. 17 shows an application of the process 130 described above to the set 180 of coupons 182-185 and an exemplary set 250 of coupons 252-254 (e.g. set B of coupons bi-63) of a reissue ticket in which the flight corresponding to coupons m and 02 has been replaced by a direct flight corresponding to coupon bi.

The exchange server 26 can initialize the counters, select the oldest coupons ai and bi in the respective sets A and B, and compare the selected coupons ai and bi, as indicated by the double arrow line 256. In response to the determination that the coupons do not have the same flight information, the exchange server 26 can adjust the values of the operator a'i of the set A 'and of the operator b'i of the set B ¹ on true, select the most recent coupon which appears in chronological order in each of the sets A and B (for example, the coupon of the set A and the coupon b3 of the set B ), and compare the selected coupons, as indicated by the double arrow line 258.

In response to the determination that 04 = bs, the exchange server 26 can determine whether the value of the operator a 4 of the set A 'or of the operator b'3 of the set B' is true. Because neither the operator a'4 nor the operator b'3 has been activated on true, the exchange server 26 can set the value of each of these operators to false, add a link 4 "- (" 4.63) to set D, and increment counter j to 1.

The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets A and B (for example, the coupon 03 of the set A and the coupon bz of the set B) based on the value of the counter j, and compare the selected coupons, as indicated by the double arrow line 260. In response to the determination that as = bï, the exchange server 26 can determine whether the value of the operator a'3 of the set A 'or of the operator b'2 of the set 5 is true. Because neither the operator a'3 nor the operator b'2 has been set to true, the exchange server 26 can set the value of each of these operators to false, add a link dz = {as, bz) to the set D, and increment the counter J to 2.

The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets A and B (for example, the coupon az of the set A and the coupon bi of the set B) based on the value of the counter /, and compare the selected coupons, as indicated by the double arrow line 262. In response to the determination that azfbi, the exchange server 26 can adjust the values of the operators a ' \, a'z, and b'i on true, add a link dz = (c ?, b \) to the set D, and end the analysis.

[00176] FIG. 18 shows an application of the process 130 described above on the set 180 of coupons 182-185 and an exemplary set 270 of coupons 272,274 (e.g., the set B of bi-bi coupons) in a reissue ticket in which the flight corresponding to coupons ai and ai has been canceled.

The exchange server 26 can initialize the counters, select the oldest coupons ai and bi in their respective sets A and B, and compare the selected coupons ai and bi, as indicated by the double arrow line 276. In response to the determination that the coupons do not have the same flight information, the exchange server 26 can adjust the values of operator a '\ of set A' and operator b'i of the set B 'on true.

The process 130 can then select the most recent coupon which appears in chronological order in each of the sets A and B (for example, the coupon cm of the set A and the coupon bz of the set B ), and compare the selected coupons, as represented by the double arrow line 278. In response to the determination that a # = bz, the exchange server 26 can determine whether the value of the operator a '* of the set A 'or the operator b'z of set B' is true. Because neither the operator a \ nor the operator b'2 has been set to true, the exchange server 26 can activate the value of each of these operators on false, add a link dt = (cm, fe ) to the set D, and increment the counter j to L [00179] The exchange server 26 can then select the next most recent coupon in chronological order in each of the sets A and B (for example, the coupon az of set A and coupon bi of set B) based on the value of counter f and compare the selected coupons, as represented by the double arrow line 280. The exchange server 26 can determine that the flight information for each of these coupons is the same. However, the exchange server 26 can also determine that the operator b '1 has been set to true, following the previous comparison with the coupon ai. In response to the determination that the operator b '\ has been set to true, the exchange server 26 may set the operator b' 1 to false, set the value of the operators n'i and a'z to true , add links di = (ai, 0), dz = (ai, 0), and dz = (03, bi) to the set D, and end the analysis.

Once the coupons interrupted in the parent ticket and their corresponding replacement coupon in the reissue ticket have been identified and linked, the exchange server 26 can store this information in a database record for use interior. However, ticket records and booking records may be required to meet certain standard formats, so that compatibility is maintained between various carriers, travel agencies and GDS systems. Therefore, it is not possible to add new types of data or otherwise modify ticket records and reservation records to store additional non-standard data generated by the exchange server 26.

In order to provide a record for storing the non-standard information generated by the exchange server 26, embodiments of the invention can use transition records. Transition records may include data fields which are used by the exchange server 26 to track the old tariff component and coupon data, and they may include a new type of database record which is used by the exchange server 26 to provide various characteristics of the embodiments of the present invention. Transition records may store information that provides a complete exchange history of a reissue ticket. Information stored in a transaction record may be associated with a specific booking file and may include a copy of each coupon on the current route as well as fare and coupon information from any coupon on fare and purchased tickets which are linked to a coupon from the current route.

[00182] FIG. 19 shows an exemplary transition record 300 in accordance with an embodiment of the invention which includes a rate structure index 302 is an interruption index 304. The transition record 300 may also include signals (not shown) showing the process which generated the record, and whether the transition record 300 was generated on the basis of several original tickets.

The tariff structure index 302 can store data describing the ticket originally issued before any exchange, in particular details on the tariff components and the coupons of the original ticket. This data may not be modified by the exchange process, except for the addition of interrupt signals which can be updated after each exchange. The tariff structure index 302 can thereby allow the database management system 12 to exchange the ticket without retrieving the original ticket from the ticket database 20.

The tariff structure index 302 may include tariff elements 310,312 and product elements 314,316. Each tariff element 310,312 can store tariff data for a coupon of the original ticket and can be linked to a corresponding product element 314,316 to define a data structure 315,317. Each product element can store the data identifying the ticket and the coupon corresponding to the tariff element to which the product element is linked. Tariff structure index 302 may also contain basic tariff and tax data for the product originally purchased.

The interruption index 304 can provide an exchange mapping for each coupon based on the data of one or more exchange indices, and can be updated each time a ticket is exchanged. By allowing the database management system 12 to match the coupons of the reissue ticket with the corresponding coupons of the original ticket and with any other parent intervention ticket, the interruption index 304 may allow the subsequent processing of reissue tickets which would be impossible using systems not having this feature.

The interruption index 304 can include one or more tables 318-320, each defining a set of linked data elements. Each table 318-320 can include a coupon element 322-324 corresponding to a coupon field of a parent ticket, and a coupon element 326-328 corresponding to a coupon field of a reissue ticket.

Tables 318-320 can be arranged inside the interruption index 304 as a series of tables ordered from the oldest table (e.g., the table having the data elements corresponding to the coupons with l 'most distant start time) at the most recent table (e.g. the table with the data element corresponding to the coupons with the nearest departure time).

The coupon elements 322-324 can correspond to the coupons of the set A, the coupon elements 326-328 can correspond to the coupons of the set B, and the links between the coupon elements can be defined by links d of set D of a corresponding interruption index generated in association with the exchange 30 of a parent ticket (e.g. TKT-001) for a reissue ticket (e.g. TKT-002 ). Coupon items associated with an interruption (eg, coupon elements 322 and 323) can be marked as interrupted. The status of the coupon elements can be defined by activating the value of an operator associated with ' _e and / or b'h on true (interrupted) or false (not interrupted) in set A' and / or set B 'of the corresponding exchange index.

For example, the transition record 300 can be described in accordance with the exchange of exemplary ticket TKT-001 for ticket TKT-002, as described above with regard to FIGS. 3-6. In this example, the tariff element 310 can store the data defining the tariff information of the coupon C1 of the ticket TKT-001. Pricing information may include the fare (eg, $ 80) and a signal status (eg, "* ANCIENy>) indicating that the fare has been set for a coupon that has been redeemed. The associated product element 314 can store the data defining the product information of the exchanged product, e.g. the data identifying the specific segment for which the coupon C1 of the ticket TKT-001 could have been used to obtain a boarding pass. Product element 314 may also include a status signal indicating that the product has been discontinued (e.g., * INT).

The most recent data item 326-328 in each table 318-321 can store data that defines the details that are part of the current route, and can be used to define a hybrid ticket. The coupons in the hybrid ticket can have a one-to-one correspondence with the reissue ticket in the ticket database in case of a full exchange or can contain coupons in each of the multiple tickets in the ticket database 20 in the event of a partial exchange.

In the current example, the coupon element 326 can include data identifying the coupon Ci of the ticket TKT-002, which may have been issued in exchange for the coupon C1 of the ticket TKT-001. Consequently, the coupon element 326 can be linked to the coupon element 322, which can include the data identifying the coupon C1 of the ticket TKT-001, and which can be marked as corresponding to Γ interruption.

The coupon element 327 can include data identifying the exemplary coupon C2 of the ticket TKT-002, which was also issued in exchange for the coupon C1 of the ticket TKT-001. Consequently, the coupon element 327 can be linked to the coupon element 323, which can also include the data identifying the coupon C1 of the ticket TKT-001 and be marked as corresponding to the interruption. The coupon element 328 can include the data identifying the exemplary coupon C3 of the ticket TKT-002 which was issued in exchange for the coupon C2 of the ticket TKT-001. Consequently, the coupon element 328 can be linked to the coupon element 324, which can include the data identifying the coupon C2 of the ticket TKT001. However, because coupon C2 does not correspond to the interruption that triggered the exchange of ticket TKT-001 for ticket TKT-002, coupon element 324 cannot contain a signal indicating that coupon C2 of the ticket TKT-001 is associated with Γ interruption. Collectively, tables 318-320 of an interruption index 304 can provide a history of coupon exchanges including the current itinerary of the traveler.

Following the interruption which gave rise to the exchange of the TKT-001 ticket for the TKT-002 ticket, another interruption may occur. In response to this later interruption, a carrier agent or an automatic reshuffle application may modify the route by substituting a replacement segment (s) for one or more interrupted segment (s). For example, if the Paris / New York segment reserved by the S3 segment of the 89DRGH reservation file as shown in Figure 61 (FIG. 5) is canceled (eg, due to mechanical failure or members of the missing crew), the S3 segment can be replaced by another flight.

[00193] FIG. 20 shows an image 63 of an updated reservation file 89DRGH, an image 93 of an updated ticket TKT-002, and an image 340 of a reissue ticket TKT-003, which may have been issued in exchange for a TKT-002 ticket. As shown in picture 63, the segment field 330 and the segment field 332 of the reservation file 89DRGH define the segments S3 and S4, which have replaced the interrupted segment S3 in a segment field 69 of the reservation file 89DRGH as indicated by image 61.

The ticket image 340 may include a ticket number field 342 which contains the data identifying the ticket (eg, TKT-003), a record locator field 344, a name field of passenger 346, multiple coupon fields 348351, and multiple fare component fields 356-359. Each of the coupons Cl-C4 can correspond to a respective segment SI-S4 defined in the updated booking file 89DRGH as shown in image 63. Because the change is involuntary, the total price may again remain unchanged from on the flight originally booked.

Following the exchange, the records of the corresponding parent ticket in the ticket database 20 can be updated to reflect the current status of each coupon. For example, the total price of replacement coupons C3 and C4 on the TKT003 ticket can be set to $ 80 to maintain the total price at the original ticket price, and the status of coupons C1, C2 and C3 in the ticket parent TKT-002 can be defined by "E" to indicate that the coupons have been redeemed. The original TKT-001 ticket may remain unchanged, in which case the TKT-001 ticket may remain as shown in picture 71 (FIG. 6). Once the reissue ticket TKT-003 has been issued, the exchange server 26 can analyze the ticket records, generate a trade index, and update the transition record 300 to reflect the changes.

[00196] FIG. 21 shows how the transition record 300 may appear after the issue of ticket TKT-003 in accordance with the example above. In the exemplary embodiment shown, the interruption index 304 includes new coupon elements 360-363 which contain data identifying the coupons which have been issued to replace the coupons of the TKT-002 ticket. Each coupon element 360-363 can be associated with a corresponding table 318-321 which provides a history of the exchanges of the associated coupon element 360-363. Coupon elements 328 and 329 may include an interrupt signal to indicate that these coupons correspond to the most recent interruption or the last interruption.

The tariff elements 310, 312 and the product elements 314,316 can store additional data not shown in FIGS. 19 and 21. Additional types of data which may be stored in tariff elements 310,312 may include data which identify or define a number of tariff components, a basic tariff, a number of loyalty points, a place of origin, a destination, travel indicator, basic fare code and ticket designator, family fare code and owner, passenger installation fees, taxes, and / or other fees. Additional data types that can be stored in product elements 314,316 may include a coupon number, flight number, operating airline code, booking class, airport codes for departure airports and arrival, departure and arrival times, an original ticket number and the presence or absence of the interruption signal. The elements of product 314,316 can include all the segments involved in the tariff calculation of the original ticket, in particular the segments which have been covered.

In response to an entry indicating that a user wishes to see a ticket, a client application operating on the user system 14 can transmit a display query to the database management system 12. In response to the reception of the interrogation, the database management system 12 can interrogate the ticket database 20 to obtain a ticket identified during the interrogation, and / or the transition record database 28 to obtain a registration of transition corresponding to the ticket. The database management system 12 can use the data from the transition record to enrich the data from the ticket record, and transmit a response to the client application.

[00199] FIG. 22 represents an image 370 of TKT-001 and an image 400 of TKT-002 which can be displayed in response to the reception of display interrogations by the database management system 12. For example, an interrogation of display of the TKT-001 ticket transmitted before the exchange for the TKT-002 ticket can cause the user system 14 to display the image 370 of the TKT-001 ticket. The image of the displayed ticket 370 includes a ticket number field 372, a check locator field 374, a passenger name field 376, coupon fields 378,379, a fare calculation line 382, and tariff components 384, 386.

If the database management system 12 receives a display query for tickets issued from the 89DRGH reservation file after the exchange caused by the interruption of flight AF7711 from Nice to Paris, the management system of databases 12 can cause the user system 14 to display the image of the ticket 400. The underlined portions of the image of the ticket 400 may represent information added to the image of the ticket 400 which has been generated on the basis of data from the transition record 300. The displayed ticket image 400 includes a ticket number field 402, a check locator field 404, a passenger name field 406, coupon fields 408 -410, a tariff calculation line 414, and tariff component fields 416,418. The ticket image 400 may also include the original ticket coupon fields 420,422 which provide information relating to the ticket originally issued and priced. These fields 420, 422 can provide structured price components and old flight information with coupon details.

The displayed image 400 may include information added to the coupon fields 408 and 409, e.g. "(INT TKT-001 Cl)". This information may link this to the discontinued coupon it replaces. For example, the information added to coupons C1 and C2 of TKT-002 may indicate that the coupons were issued to replace the interrupted coupon of the ticket TKT-001. Data (eg, "FOR TKT-001 Cl", "FOR TKT-001 C2") can also be added to the tariff component fields 416.418 to indicate the source of the tariff.

[00202] FIG. 23 represents an image 430 of TKT-003 which can be displayed in response to the reception of a display query by the database management system 12, following the exchange of the ticket TKT-002 for TKT-003 caused by the interruption of the Paris / New York flight. As with FIG. 22, the underlined portions of the image 430 can represent information added to the image of the ticket 430 on the basis of the data of the transition record 300. The image of the displayed ticket 430 can include a number field of the ticket 432, check-in locator field 434. passenger name field 436, coupon fields 438-441, fare calculation field 446, fare component fields 448.450, and coupon data fields of the original post 452, 454.

The added data connecting each coupon of TKT-003 to the interrupted coupons of tickets TKT-001 and TKT-002 can provide a history of exchanges of the respective coupon. For example, the link data added to the coupon C1 in the coupon field 438 can inform the user that the coupon is valid for the same segment as the coupon C1 of the ticket TKT-002. which in turn was a replacement coupon for the discontinued coupon C1 of ticket TKT-001. The link data added to the coupon C2 in the coupon field 439 can inform the user that the coupon is valid for the same segment as the coupon C2 of the ticket TKT-002, which in turn was a coupon to replace the interrupted coupon Ticket TKT-001 key. The link data added to coupons C3 and C4 in coupon fields 440 and 441 can inform the user that each of these coupons replaces coupon C3 of ticket TKT-002, which in turn was a coupon of the same segment as coupon C2 of ticket TKT-001.

Enhanced ticket images can be more complex than standard ticket images to comply with IATA standards, the presence of non-standard data can cause problems with certain applications. For example, by associating fare components with the original coupons, an enriched ticket image can cause compatibility issues with systems required to assign a monetary value to each segment. For example, a departure control system (DCS) may be required to provide a monetary value for each segment on the exemplary TKT-003 above. However, because the fare components of the TKT-003 ticket are linked to the original C1 and C2 coupons of TKT-001, some systems may be unable to process the enriched ticket.

To allow the enriched ticket images to be used by systems having compatibility problems, the exchange server 26 can be configured to mask certain portions of an enriched ticket image in response to the determination that a requesting system is incompatible with the enriched ticket image. The exchange server 26 can determine when to mask an enriched ticket image, for example, based on the identity of the requesting system, and / or a data field in the query, eg, if a signal " standard view only ”is defined in the query. The masking algorithm can create a simplified version of the rich ticket image using the trap links stored in the transition record. These links can allow the exchange server 26 to associate the tariff components stored in the tariff component field with the current segments.

[00206] FIG. 24 represents a masked ticket image 460 which can be generated from the enriched ticket image 430. The exchange server 26 can determine from the links defined by the data added to the right portion of the coupon field 438 in image 430 that the coupon C1 of the ticket TKT-003 is linked to Cl of the ticket TKT-001. The exchange server 26 can moreover determine, on the basis of the data in the structured tariff component field 448 added to the lower part of the ticket image 430, that the applicable tariff is FC1. Because the fare components (both in terms of fare calculation and structured form) are linked to the current flights in the ticket image, the client application may not need to display the original flights, which are not normally not present on standard IATA tickets. The information of the parent flight can therefore be masked on the image 460 transmitted to the requesting system as indicated in FIG. 24.

In some cases, a traveler may wish to voluntarily exchange tickets which have previously been the subject of an involuntary exchange. This type of exchange can cause problems determining the exchange value of the parent ticket and setting the price of the reissue ticket because the parent ticket was issued with a non-standard rate. Non-standard fares may give rise to cases where the traveler cannot be charged for a reissue ticket 20 and therefore the booking system determines that it is not necessary to query the pricing engine to fix the price of the reissue ticket. Consequently, the price of each coupon on a ticket issued following an involuntary exchange may be based on the price of the ticket previously exchanged before the interruption, or coded according to predefined values. The price of each coupon on a reissue ticket issued due to an involuntary exchange may therefore not correspond to the normal fare of the replacement route on the reissue ticket. In addition, in cases where a ticket has been exchanged involuntarily on multiple occasions, the traveler's itinerary can be spread over several tickets, the coupons of each ticket having one of the statuses, such as traveled, exchanged or opened.

[00208] FIG. 25 shows an exemplary ticket image 500 of an original ticket TKT-004 which includes a ticket number field 502, a check locator field 504, a passenger name field 506, coupon fields 508-510 , and a tariff calculation line 512. TKT-004 includes three coupons for segments including a flight on SOUTHWEST AIRLINES® from Louisville to Los Angeles with stopovers at

Chicago and Denver. The image of ticket 500 may represent ticket TKT-004 as it would appear after the traveler's departure for Chicago.

As can be seen, the status of the coupon C1 for the SDFMDW segment (Louisvîlle in Chicago) is "browsed", indicating that this coupon was used for travel, and that the remaining coupons C2 and C3 for the MDWDEN segments (Chicago in Denver) and DENLAX (Denver in Los Angeles) are still open. Tariff calculation line 512 indicates that the tariff for each segment is $ 258.00. As a result, the total price paid for the flight booked originally from Louisville to Los Angeles was $ 774.00. If the flight from Chicago to Denver is canceled after the Louisville-Chicago segment has been covered, ticket TKT-004 may be subject to partial exchange.

[00210] FIG. 26 shows a ticket image 501 showing the TKT-004 ticket as it may appear after the exchange, and the ticket image 520 which represents a TKT-005 reissue ticket. Ticket image 520 can include a ticket number field 522, a check locator field 524, a passenger name field 526, coupon fields 528, 530, and a fare calculation field 532. As we can see it on image 501, the status of coupon C2 of ticket TKT-004 has changed and become “E”, or exchanged, and the status of coupon C3 of ticket TKT-004 remains open. The reissue ticket TKT-005 may include the open coupons Cl and C2 which replace the coupon C2 of TKT-004. As a result, there may be two live tickets in the ticket database 20 for the passenger's "not traveled" or "remaining" route.

The segment from Chicago to Denver has been replaced by a segment from Chicago to Saint-Louis and another segment from Saint-Louis to Denver. However, the tariff element on the remission ticket TKT-005 can only add an "I-Date" in front of the existing tariff element on the parent ticket. The I-Date can simply provide an indication that the ticket was issued on March 9, 2016 in exchange for another ticket. Therefore, the fare calculation itself may not correspond to the route defined by the reissue ticket. [00212] FIG. 27 shows an image 503 of the ticket TKT-004, an image 521 of the ticket TKT-005, and an image 540 of a ticket TKT-006 recently issued. Images 503, 521, and 540 can represent tickets TKT-004, TKT-005. and TKT-006 after coupon C1 of TKT-005 was unintentionally exchanged for TKT-006, eg, due to the interruption of flight WN0984. At this point, the traveler's remaining itinerary can be spread over three active tickets. The ticket image 540 may include a ticket number field 542, a check locator field 544, a passenger name field 546, a coupon field 548, is a fare calculation field 550. As can be see it, TKT-004 may remain unchanged by the last interruption, the status of coupon C1 of ticket TKT-005 has changed and changed to "E", or exchanged, and the reissue ticket TKT-006 may include coupon Cl to replace coupon TKT-005 Cl.

As shown in the example above, the price element on tickets issued as part of an involuntary exchange may indicate that the price is based on a ticket involuntarily exchanged. However, the fare element itself may not provide information related to what the fare would be either for coupons for the reissue ticket or for the entire replacement route, if the ticket had been changed voluntarily. In addition, a full view can only be provided for the route paid initially 10 on the original ticket. Due to the potential for partial redemptions, open coupons may exist on previous tickets that do not appear on a reissue ticket. In addition, parent tickets can also include one or more coupons traveled. For a voluntary exchange of a ticket having a traveled coupon, a new tariff calculation can be carried out, which takes into account the coupons traveled and stores an image of the coupon traveled in a large binary object (BLOB) database. However, for an involuntary exchange, the coupons crossed may not appear on a remission ticket.

With continuous reference to FIG. 27, if the traveler requests a voluntary exchange of the ticket TKT-006, an agent carrying out the exchange and using conventional systems can know from the tariff calculation field 550 that the coupon C1 of TKT-005 has been exchanged for the coupon T of TKT-006, but cannot see coupon Cl on TKT-004, or even be informed of the existence of ticket TKT-004.

Embodiments of the invention can solve this problem by processing the tariff data linked to the original route (ie, the route defined by the original ticket), and by routing the linked data the interrupted portion of the route (eg, Route defined by the reissue ticket). The exchange server 26 can thereby identify which coupons have actually been interrupted so that the price of the exchange can be determined based at least in part on whether one or more segments in progress d have been interrupted. The exchange server 26 can also reconcile the entire route with 30, even if the route is spread over several tickets. This type of multi-ticket reconciliation may require the exchange server 26 to change the coupon status of multiple tickets once, depending on the type of change requested.

[00216] FIG. 28 shows an exemplary transition record 600 which may have been generated during the exchange sequence described above, a hybrid ticket 602, a paid route 604, a quote route 606, and a tariff quote record 608 which can be generated on the basis of the data stored in the transition record 600. The transition record 600 can include a price structure index 610 and an interruption index 612, and can be indexed to the ticket number for each ticket referenced in transition record 600, e.g. tickets TKT-004, TKT-005, and TKT-006. Tariff structure index 610 may include elements of tariff components 614-616, each of which may be linked to a corresponding product element 618-620 for the ticket (s) originally priced, e.g. ticket TKT-004. The interruption index 604 may include one or more tables 622-624, each defining a set of linked coupon elements 626-631.

[00217] Each table 622-624 can include a data container which holds a number of coupon elements 626-631 in a specific order. For example, the order can be based on the time each coupon item was issued, so that each array 622-624 is configured as a series of ordered coupon items from the oldest item 15 to the most recent item. Each coupon element 626-631 of each table 622-624 can identify a specific coupon on a specific ticket, and a coupon status, eg, interrupted or active. Coupon elements 626-631 can be organized in the order of their respective table 622-624 which defines a sequence of exchanges. In the exemplary interruption index 612, the oldest coupon element 626 in table 622 can identify coupon C2 of ticket TKT-004 as the oldest coupon to be exchanged, and the coupon element the most recent 628 in table 622 can identify the coupon C1 of the ticket TKT-006 as being the most recent coupon issued in the series. The coupon elements in each table can be accessed using an integer index to specify which element in the table is accessible. For example, in Table 622, the coupon element 626 can be indexed as element "1", the coupon element 627 can be indexed as element "2", and the coupon element 628 can be indexed as item "3".

Each table 622-624 can provide a history of exchanges for the coupon issued to you more recently or the most recent of the table to return to an "original" coupon. The original coupon identified in each table 622-624 may be the last priced coupon, such as a coupon issued on a ticket originally purchased or on a reissue ticket that was issued as part of a voluntary exchange . In the present example, table 622 includes coupon elements 626-628 identifying a sequence of coupons exchanged for coupon C2 of ticket TKT-004, table 623 includes coupon elements 629 and 630 which identify the other coupon exchanged against coupon C2 of ticket TKT-004, and table 624 includes a coupon element 631 identifying coupon C3 of ticket TKT-004, which must now be exchanged and is therefore always active. The hybrid ticket 602 can include one or more virtual coupons 632-634. Each of the virtual coupons 632-634 can correspond to an open coupon identified by the most recent coupon element that appears in each table 622-624.

Indexing provided by transition records can improve the speed and efficiency with which database records, including information relevant to identifying a ticket in a database query, can be located. The interruption index can identify all coupons associated with an existing route by returning to the last fare ticket and the full history, including interruption indications. This information can be used, for example, to calculate the value of a ticket in exchange, which can be credited towards the exchange price.

When a ticket containing only fare coupons is exchanged voluntarily, the exchange process may apply fare calculation rules to the rest of the route to determine the exchange value of the ticket. The exchange process can also apply the fare calculation rules to the new route to determine a price for the reissue ticket. The amount to be collected for the exchange can then be determined based on the difference between the price of the reissue ticket and the exchange value of the parent ticket. However, if the ticket being exchanged has been involuntarily exchanged, the ticket (s) being exchanged may (s) not include coupons that have never been priced. Therefore, in order to exchange a ticket voluntarily, the exchange server 26 may have to determine the value for the ticket being exchanged. [00221] FIG. 29 shows an embodiment of the exchange server 26 which includes a data recovery and decoding module 650, a business object model (BOM) 652, a hybrid ticket module 654, and an interface module 656 which communicates with a pricing engine 658.

When the traveler exchanges a ticket, the user system 14 can transmit an exchange request to the exchange server 26 identifying the ticket to be exchanged. In response to the reception of a request, the data recovery and decoding module 650 can interrogate one or more reservation database (s) 18, ticket database 20, and / or reservation database. transition records 28 to identify and recover data relating to any interruption, tickets involved any prior involuntary exchange, and / or history of reservation records.

The data recovery and decoding module 650 can decode the data received and store a history of interruptions in the BOM 652, which provides a container configured to store non-standard data. The data stored in the transition records can allow the data recovery and decoding module 650 to construct the history of interruptions of the ticket being exchanged. Interruption history can be generated, for example, by querying the ticket database 20 on the tickets identified in a transition record associated with the tickets being exchanged. The tickets returned by the ticket database 20 can be added to a ticket set, and the ticket set can be classified, so as to order the tickets from the ticket with the oldest timestamp to the ticket with the most recent timestamp. The resulting series of database records can provide a list of tickets that begins with the most recently issued ticket that was fully priced and extends to the ticket being exchanged.

Using exemplary transition record 600 as an example, the

BOM 652 can call the hybrid ticket module 654 to generate the hybrid ticket 602, which the BOM 652 can transfer to the interface module 656. The interface module 656 can transfer the hybrid ticket 602 to the pricing engine 658 to fix it the price. The hybrid ticket 602 can include a virtual coupon 632-634 corresponding to each segment in the current route which has yet to be traveled, and can allow the exchange server 26 to evaluate the tickets involuntarily exchanged using the pricing engine 658 The pricing engine 658 can calculate a value of the hybrid ticket 602, which can be used to determine a value of the ticket being exchanged. BOM 652 can also include or access business rules (eg, carrier requirements) and an execution object model to apply pricing rules to virtual coupons 632-634.

Once the history of interruptions, the tariffed hybrid ticket and Paid route have been generated, the interface module 656 can transmit a response to the user system 14 which causes the user system 14 to display a data structure in the form of a tree representing the price of the route, with all the pricing details provided by the pricing engine 658. The hybrid ticket 602 can allow the exchange server 26 to perform an automatic calculation guaranteed to be correct by the pricing engine 658, and which is based on the tariff scheme filed by the airline. Entrance with pricing engine 658 may include all details on the use case, including passage, route and options.

For a voluntary exchange appearing after an involuntary exchange, the interface module 656 can provide details on the paid route (eg, which parts of the paid route were interrupted) and the current route after successive interruptions. By using transition record 600 and / or BOM 652 to store non-standard data structures, the exchange server 26 can have improved characteristics while preserving the overall structure and the reusability of the pricing request message. . The construction of the hybrid ticket 602 can also allow for different interrupt results to be broken down into a set of factors (eg, virtual coupons) which can be provided as standard to the pricing engine 658 for processing. The interface module 656 can receive the output of the pricing engine 658, and store the results in a price line of an associated reservation record in the reservation database 18.

[00227] FIG. 30 shows a flowchart illustrating the exchange process 660 which can be implemented by the exchange server 26 to process a request for voluntary exchange of a ticket which has previously been involved in an involuntary exchange. In block 662, process 660 can receive a ticket exchange request, such as the TKT-006 ticket described above relating to FIG. 27. In response to receiving the request, process 660 can proceed to block 664 and retrieve a transition record associated with the ticket being exchanged. This retrieval may include, for example, transmitting a query to the transition record database 28 requesting that the database return the transition records indexed to or containing the ticket number of the ticket being exchange. In response, the transition record database 28 may return a transition record associated with the ticket, eg, transition record 600.

In block 666, process 660 can recover the data or generate a history of interruptions on the basis thereof. FIGS. 31 and 32 represent exemplary files 668 and 670, each comprising a series of EDIFACT commands which can cause the data recovery and decoding module 650 to recover the ticket data for use by generating the history of interruptions. The portions of the EDIFACT 668 command file indicated as "[data]" can be filled with additional EDIFACT commands, such as those in file 670. The data retrieved by the execution of EDIFACT commands can include tickets involved in the history exchanges of the ticket in question which are always active, e.g. which include a coupon with open status.

The process 660 can identify tickets in the ticket database 20 involved in the exchange history based on the data in the transition record 600. For example, the process 660 can extract ticket numbers from the tariff structure index and / or the interruption index. Using these ticket numbers, the process 660 can query the ticket database 20 to retrieve the identified tickets. The process 660 can also query the reservation database 18 to receive a history of the reservation records. The booking record history can be used by the 660 process in conjunction with the rate structure index, interruption index, and / or recovered tickets to generate the interruption history of each active coupon.

The process 660 can generate a complete history of interruptions of the ticket being exchanged on the basis of the data retrieved. The history of ticket interruptions being processed can be spread across multiple data containers (e.g., large binary objects) at the coupon level. These objects can be returned by the database of transition records 28 and / or retrieved from the history of reservation records in the reservation database 18. The data containers at the coupon level can be used to aggregate the interrupt data from multiple objects and build the list of previous tickets to recover.

In one embodiment, the history of interruptions can be represented by a set of database records comprising a series of tickets Ts, Ti, ...

T _n , where Ti is the oldest ticket in the series (ie, the ticket with the oldest time stamp, eg, the fare ticket), and the ticket T "is the Most recent ticket in the series (ie, the ticket with the most recent time stamp, eg the ticket being exchanged). The exchange server 26 can also cause the retrieved tickets to be displayed by the user system 14 so that the agent is provided with an updated passenger route status. Once the history of interruptions has been generated, the process 660 can pass to block 672 and generate a hybrid ticket (eg, the hybrid ticket 602) which can be sent to the pricing engine 658 to calculate a value for the ticket being exchanged. The hybrid ticket can include a coupon corresponding to each segment of the current route which has been or will be traveled, and can allow the exchange server 26 to process the involuntary exchanged tickets using the pricing engine 658.

[00233] In response to the hybrid ticket being generated, process 660 can proceed to block 674 and set the price of the hybrid ticket. The determination of the price of the hybrid ticket may include the transmission of the hybrid ticket to the pricing engine 658 so that the price is determined on the basis of the tariff scheme submitted by the airline. Process 660 can then go to block 676, update the reservation record, and confirm the remission ticket in the ticket database 20.

A first show reference can be used to create an element of an old document (FO) or a line in a route change process. Line

FO may refer to the original ticket number used for the exchange. A ticket data table can include an issue envelope number, ticket number, original ticket number, passenger reference, passenger name and issuing carrier fields, and can be used in the process of re-pricing to build a new ticket.

Updating the reservation record may include the creation of a multi-ticket FO line in the reservation record to facilitate the exchange of the remaining open coupons. The FO line may include details of the original ticket issued, the remission ticket number, and coupons being redeemed. The FO line can identify coupons that should be redeemed when the reissue ticket is issued, thereby ensuring the integrity of the exchange. The FO creation process can use a list of successively interrupted tickets which still contains open coupons to create the multi-ticket FO line. This multi-ticket FO line can be in the standard format expected by the back-end servers. An exemplary FO line can be formatted as shown below:

FO TKTOCityDate / IATA ... ./TKTnEl/TKTjF3,4/ .. ./TKT1F1,3 ...

[00236] FIG. 33 shows a flow diagram illustrating a process 680 which can be used by the exchange server to define a hybrid route from which the hybrid ticket in block 672 of process 660 can be generated. Hybrid route H may include a table of coupons extracted from tickets in the history of interruptions.

In block 682, process 680 can initialize the hybrid route. Initialization can include setting a ticket counter i to an initial value of n (if n is the total number of tickets in the history of interruptions), and defining the hybrid route H as follows:

H = CET _n

If T _n represents the ticket being exchanged so that the hybrid route H initially includes all the coupons C in the ticket T _n .

In block 684, process 680 can clean up work tables B and E, and an exchange signal, or "e-signal". Work Tables B and E can be used by the 680 process to temporarily store coupons, which will then be added either at the start or at the end of a current version of the hybrid route H to generate an updated version. of the hybrid route H. The e-signal can be used to keep track and to know if a coupon with an “exchanged” status was found during the processing of a particular ticket. In block 684, the process 680 can also decrement the ticket counter i, initialize a coupon counter j by defining j equal to the number of coupons of the ticket Tt, which can initially be the parent ticket immediately preceding the ticket T _n , or the ticket T _n .}. Process 680 can then go to block 686 and select the coupon Cj of the ticket Tt.

In block 688, process 680 can determine whether the status of coupon Cj is "exchanged". If the status is "exchanged" (branch "YES" of decision block 688), process 680 can go to block 690, define the e-signal, and go to block 692. In block 692, process 680 can determine if the coupon Cj is included in the fare element of the previously processed ticket Ί} + ι (i.e., the ticket issued in exchange for the ticket Cj). If coupon Q is missing from the price element of ticket 7} + t ("NO" branch of decision block 692), this may indicate that the ticket Tt has been exchanged for more than one ticket. In this case, process 680 can go to block 694, reject the exchange, and terminate. If the coupon Cj includes in the tariff element of the previously processed ticket 7) +1, ("YES" branch of the decision block 692), the process 680 can pass to block 696.

Returning to block 688, if the status of the coupon Cj is not "exchanged" (branch "NO" of decision block 688), the process 680 can then pass to block 698. In block 698, the 680 process can determine if the e-signal is defined. If the e-signal is defined (“YES” branch of decision block 698), process 680 can go to block 700, add the coupon Cj at the start of work table E, and go to block 696. If the e-signal is not defined (“NO” branch of decision block 698), process 680 can go to block 702, add the coupon Cj at the start of work table B, and go to block 696.

In block 696, the process 680 can determine whether the coupon Q is the last coupon remaining in the ticket Tt, ie. that j = L If the coupon Q is not the last coupon remaining in the ticket 7), (branch "NO" of the decision block 696), the process 680 can pass to block 704, decrement the counter of coupons j, and return to block 686 to begin processing the next coupon on ticket 7). If the coupon Cj is the last coupon remaining on the ticket 7} (branch "YES" of the decision block 696), the process 680 can pass to the block 706.

In block 706, process 680 can update Γ hybrid route H by adding the coupons in work table B at the start of hybrid route H, and add the coupons in work table E to the end of route H, i.e., update hybrid route H as follows;

Process 680 can then proceed to block 708 and determine if the ticket Ti is the last ticket, i.e. if i = 1. If ticket T is not the last ticket ("NO" branch of decision block 708), process 680 can return to block 684 and start processing the next ticket. If ticket T, is the last ticket ("YES" branch of decision block 708), subprocess 680 can go to block 710, store the hybrid route, and return to main process 660.

In general, the routines executed to implement the embodiments of the invention, whether implemented as part of an operating system or a specific application, of a component, of 'a program, object, module or sequence of instructions, or even a subset thereof, may be referred to herein as "computer program code" or simply "Program code". Program code typically includes computer readable instructions which reside at various times in various memory and storage devices in a computer, and which when read and executed by one or more processors in a computer, cause the 'execution by the computer of operations necessary to execute operations and / or elements specific to the various aspects of the embodiments of the invention. The instructions of a computer-readable computer program for carrying out the operations of the embodiments of the invention may be, for example, the assembly language, a source code or an object code, written in combination with one or more languages programming.

Various program codes described herein can be identified, depending on the application in which they are implemented, in specific embodiments of the invention. However, it should be noted that any nomenclature of a particular program which follows is used only for convenience; thus, the invention cannot be limited to a single use in any specific application identified and / or implied by said nomenclature. Furthermore, in view of the generally infinite number of means by which computer programs can be organized according to subprograms, procedures, procedures, modules, objects, and so on, as well as the various ways of affecting the functionality of a program. among various layers of software that reside on a typical computer (eg, operating systems, libraries, program application interfaces (APIs), applications, small applet applications, web services , etc.); it will be noted that the embodiments of the invention are not limited to the specific organization and to the specific allocation of the program functionalities as described herein.

The program code implemented in any application / module described herein may be distributed individually or collectively as a computer program product, in a variety of forms. In particular, the program code can be distributed using a computer readable storage medium having computer readable program instructions by causing a processor to execute aspects of the embodiments of the invention.

Data storage media readable by computer and which are intrinsically durable, can include tangible, volatile and non-volatile, removable and non-removable media, implemented in any process or technology for storing information, such as computer readable program instructions, data structures, program modules, or other data. Computer readable storage media can also include random memory (RAM), read only memory (ROM), read only, programmable and erasable memory (EPROM), read only memory, electrically erasable and programmable (EEPROM ), flash memory, any solid memory support technology, portable compact disc with read-only memory (CD-ROM) or any other optical storage, magnetic cassette, magnetic recording tape, magnetic disc memory, another magnetic storage device or any other medium which can be used to store the desired information and which can be read by a computer. A computer-readable storage medium cannot be interpreted as transient signals per se (e.g. radio waves or other electromagnetic waves propagating through a transmission medium such as a waveguide or electrical signals transmitted by cable). Computer-readable program instructions can be downloaded to a computer, another type of programmable data processing device, or to another computer-readable storage medium, or to an external computer or to an external storage device via a network [00246] The computer-readable program instructions, stored on a computer-readable medium, can be used to instruct a computer, other types of programmable processing devices or other devices to operate a in a particular way, so that the instructions stored on the computer-readable medium produce an article of manufacture comprising the instructions which implement the functions, actions and / or operations specified in the flowcharts, sequential diagrams, and / or block diagrams . Computer program instructions may be provided by one or more processors on a general purpose computer, a special purpose computer, or any other programmable data processing apparatus to produce a machine such as instructions executed by the through one or more processors, cause a series of calculations to be performed to implement the functions, actions and / operations specified in the flowcharts, sequential diagrams 10 and / or block diagrams.

In certain alternative embodiments, the functions, actions and / or operations specified in the flowcharts, sequential diagrams and / or block diagrams can be reordered, processed in series and / or processed simultaneously with the embodiments of the invention. In addition, any flowchart, sequence diagram, and / or block diagram may include more blocks or fewer blocks than those illustrated in accordance with the embodiments of the invention.

The terminology used herein is intended to describe only specific embodiments and is not intended to limit the embodiments of the invention. It will also be understood that the verbal forms of the verb "to understand", 20 "includes" and / or "comprising", when used in this specification, specifies the presence of characteristics, whole numbers, actions, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more characteristics, whole numbers, actions, steps, elements, components and / or groups, in this. In addition, to the extent that the verbs "include", "having", "a", "with", "composed of" or variations thereof are used in the detailed description or claims, these terms are supposed to be inclusive in a similar way to the verb form "comprising".

Although the invention is illustrated by a description of various embodiments and although these embodiments are described in great detail, the Applicant does not intend to restrict or limit, in any way however, the scope of the claims herein to these details. Additional advantages and possible modifications will be readily apparent to those skilled in the art. The invention from a wider angle is therefore not limited to specific details, representative processes and apparatus, and to the illustrations shown and described by way of example. Therefore, it is possible to depart from these details without departing from the spirit and scope of the Applicant's general inventive concept.

Claims (11)

1. A system for processing database records, the system comprising: 5 one or more processors; and a memory associated with one or more processors, the memory storing the program code which, when executed by one or more processors, causes the system to: receive a query identifying a first database record stored in a first database of data ; Retrieving from the first database a second database record indexed on the first database record containing an interruption index which includes at least one table which defines a set of associated data elements; identify a set of database records in the first database 15 data which includes at least one of the linked data elements, all of the data records including the first database record and a third database record; and generate a first table from all of the database records using: Initializing the first array with the data elements in the first database record, and adding at least one data element from the third database record to the first array. 25 2. The system of claim 1, wherein the data elements from the first database record consist of a first series of classified data elements from the oldest data element to the oldest data element. newer, the third database record includes a second series of data elements classified from the oldest data element to the most recent data element, and the code 30 of program causes the system to generate the first table by means of: selecting the last previously unselected data item in the third database record; determining the status of the selected data item; in response to the status indicating that the selected data item has been exchanged, activating an exchange signal and deleting the selected data item; and in response to the status indicating that the selected data item has not been exchanged, adding the selected data item to that of a second table or a third table. 3. The system according to claim 2, wherein the program code causes the system to add the selected data item to that of the first table or the second table by means of: 10 adding the selected data element to the second table if the exchange signal is not activated and adding the selected data element to the third table if the exchange signal is activated. 15 4. The system of claim 2 or 3, wherein the program code brings the system in response to the selected data item being the oldest data item in the record of the third database. , to update the first table by means of: append the second table to the first table before the most data element 20 from the first table, and append the third table to the first table after the most recent data item in the first table. 5. The system according to any of claims 2 to 4, wherein each 25 database record in the set of database records has a timestamp indicating a time at which the database record was added to the first database, the set of database records includes a fourth database record, the time stamp of the fourth database record occurring after the time stamp of the third 30 database record, and the program code also causes the system: in response to the status indicating that the selected database item has been swapped, to determine whether the selected data item appears in a price of the fourth database record, and if the selected database item does not appear in the price item of the fourth database record, to stop processing the database records. 5 The system according to any of claims 2 to 5, wherein the first series of data elements consists of a first set of coupons comprising a first ticket, and the second series of data elements consists of a second set of coupons including a second ticket. 10 7. The system according to any of claims 1 to 6, wherein the program code causes the system to: generate a hybrid ticket from the first table; determine a first value for the hybrid ticket using a pricing engine; and 15 assign the first value to the first database record. 8. The system of claim 7 wherein the program code further causes the system to: determine a second value for a fifth basic record of 20 data for which the first database record is exchanged using the pricing engine; determining a third value equal to the difference between the second value and the first value; and assigning the third value to the fifth database record. The system according to any of claims 1 to 4, wherein each database record in the set of database records has a time stamp indicating a time at which the database record was added to the first database, and the program code also brings the 30 system to: sort the set of database records according to the timestamp of each database record, so that the set of database records is configured as a series of basic records classified data from the database record with the oldest timestamp to the database record with the most recent timestamp. 10. A process for processing database records, the process 5 including: receiving a query identifying a first database record stored in a first database; retrieving from a second database a second database record indexed to the first database record, the second database record containing an interrupt index which includes at least an array that defines a set of linked data elements; identifying a set of database records in the first database which includes at least one of the associated data items, the set of database records including the first database record and a third database record; and the generation of a first table from all the database records by means of: initialization of the first array with the data elements from the first database record, and 20 adding at least one data element from the third data record to the first table. 11. A computer program product comprising program code instructions recorded on a medium readable by 25 computer to implement the steps of the method according to claim 10 when said program is executed on a computer. 1/24 λ J λ /