Method and system for data filing systems

This application claims the benefit of European Patent Application No. 11306750.8, filed Dec. 22, 2011; the disclosure of which is incorporated herein by reference in its entirety.

The present invention relates to a method and system for facilitating the update of data related to data filing systems used in the travel industry.

In the travel industry, data filing systems deal with the filing and the storing of data related to products such as travel and associated products and services. For example, filing systems provide pricing engines with such data for producing a specific fare for a specific trip.

Nowadays, two categories of data filing systems exist. Fare providers such as Airline Tariff Publishing Company (ATPCo) and Societe Internationale de Telecommunications Aeronautiques (SITA) provide a first category of data filing system called an institutional filing system. Each airline can send standard data related to standard products to the institutional filing system such as fares, rules and branded fares. Travel providers provide a second category of data filing system called a proprietary filing system. Some proprietary filing systems also receive standard data transmitted by the institutional filing system several times per day. The latest transmission of a given standard data relates to the current version of this standard data to be used by the proprietary filing system for producing an up to date airfare data related to standard products. In addition to the standard data, the proprietary filing system can also provide additional functionalities to allow airlines or travel agencies to add specific data to their standard data to extend the content of the corresponding standard product. Specific data may for instance relate to dynamic discounted fares or baggage.

However, in the current process, the airline must determine an efficient strategy for filing data. The airline can either exclusively use the institutional filing system to benefit from the wide data distribution system of the institutional filing system; or exclusively use the proprietary filing system to benefit from the additional functionalities and features of the proprietary filing system; or to use both institutional and proprietary filing systems which require filing the standard data twice. The standard data is not currently shared between the institutional filing system and the proprietary filing system. The airline must file the standard data a first time in the institutional filing system, and a second time in the proprietary filing system to benefit from any additional features.

This process has many inconveniences. To send duplicates of the standard data may give rise to errors when entering data in the proprietary filing system. In addition, sending duplicates may also cause an increasing amount of transmitted data on the corresponding transmission networks between airlines and proprietary filing systems. In addition, if airlines need to amend standard data, airlines have to process amendments in both the institutional filing system and the corresponding proprietary filing systems, which is highly time consuming.

It is an object of the present invention to overcome at least some of the problems associated with the prior art.

It is a further object of the present invention to provide a method and system for facilitating the update of data for data filing systems used in the travel industry.

The present invention provides a method and system for updating data, as described in the accompanying claims.

According to one aspect of the present invention there is provided a method for updating data to ensure the correct version of the data is available for a user of a second data system, wherein the data is capable of being stored in a first data entity and in a component of the second data system, wherein the method comprises in the second data system the steps of receiving via a computer an update request from the first data entity to update the data in the second component and wherein the update request comprises an updated version of the data for updating the data; comparing via a computer the updated version of the data with a currently stored version of the data in the second component to determine a change therein; producing via a computer an operating function representative of the change in the data; applying via a computer the operating function to the currently stored version of the standard data to produce a resulting data and storing via a computer the operating function having the change therein which represents the difference between the currently stored version of the data and the updated version of the data to ensure the correct version of the data is capable of being output if requested.

According to a second aspect of the present invention there is provided a system for updating data to ensure the correct version of the data is available for a user of a data system, wherein the data is capable of being stored in a component of the data system and wherein the system comprises: a request handling component for receiving an update request from a data entity and updating the data in the component wherein the update request comprises an updated version of the data for updating the data; an operating function component for comparing the updated version of the data with a currently stored version of the data in the component to determine a change therein; an operating function determination component for producing an operating function representative of the change in the data and a memory component for storing the operating function having the change therein to ensure the correct version of the data is capable of being output if requested.

Reference will now be made, by way of example, to the accompanying drawings, in which:

FIG. 1 is a schematic representation of a system, in accordance with an embodiment of the invention, given by way of example,

FIG. 2 is a schematic representation of a first example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 3 is a schematic representation of a second example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 4 is a schematic representation of a third example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 5 is a schematic representation of a fourth example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 6 is a schematic representation of a fifth example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 7 is a schematic representation of a sixth example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 8 is a schematic representation of a seventh example of the operations of the system of FIG. 1 , in accordance with an embodiment of the invention, given by way of example,

FIG. 9 is a schematic representation of date management, in accordance with an embodiment of the invention, given by way of example,

FIG. 10 is a schematic representation of renumbering sequences, in accordance with an embodiment of the invention, given by way of example.

FIG. 1 shows a user device 100 relating to airlines for example. The user device 100 can be for example a personal computer, a laptop device or any other handheld device which is able to connect to a communication network such as the Internet. The user device 100 is connected to a first data system such as an institutional filing system 200 related to travel fare providers for example. The user device 100 is also connected to a second data system such as a proprietary filing system 300 related to a travel provider 300 . The user can send requests to both the institutional filing system 200 and the proprietary filing system 300 through the user device 100 .

The institutional filing system 200 comprises a receiving component 210 for receiving a request from the user. The request may comprise standard data to generate or updated versions of existing standard data. Standard data relates to standard travel products such as fares, rules and branded fares as provided by users. Standard data is valid during a predetermined duration of time, from an initial date to a final date. Standard data comprises a specific parameter such as a key having a first set of fields and corresponding values. A key represents the update/display granularity of a product. The corresponding values cannot be amended. Standard data also comprises one or more sequences comprising a second set of fields and corresponding values. The corresponding values can be amended through update requests. A sequence is always associated with a key. As a result, an update request always refers to both a key and a sequence. The institutional filing system 200 also comprises a first data entity such as a database 220 for storing standard data. The institutional filing system 200 regularly transmits the standard data to several proprietary filing systems such as the proprietary filing system 300 by means of a transmission component 230 . The transmissions can occur several times per day. As a result, the institutional filing system 200 sends an updated version of a standard data to the proprietary filing system 300 .

The proprietary filing system 300 comprises components operable in a computer environment. The components comprise a request handling component 310 , a standard data handling component 320 , a component such as a standard data database 330 , a closure handling component 340 , a closure database 350 , a closure determination component 360 , a closure application component 370 , a memory component such as a cache database 380 and a graphical display interface (GUI).

The request handling component 310 can receive and process specific update requests or display requests from the user device 100 .

A specific update request can relate to correction of a standard data already stored in the standard data database 330 . In the situation of a correction of the standard data, the update request may require the removal or the amendment of standard values; or the removal of standard fields in a sequence.

Alternatively, the specific update request can relate to specific data to add to the standard data; or to amend in a previous version of a previously updated standard data. Specific data may relate to dynamic discounted fares, add-on zones or baggage for example. In this situation, the update request may require the addition of a specific field and the addition of a corresponding specific value in a sequence; or the amendment of a specific value previously added with a previous specific update request in a sequence. Specific data is valid during a predetermined duration of time, from an initial date to a final date. The request handling component 310 provides resulting data based on a standard update request; or on a specific update request.

The proprietary filing system 300 comprises a standard data handling component 320 for handling the standard data received from the request handling component 310 . The proprietary filing system 300 also comprises a standard data database 330 to store standard data transmitted by the standard data handling component 320 .

The proprietary filing system 300 comprises a closure handling component 340 to receive any request from the request handling component 310 regarding the existence of a closure associated with specific standard data. In the present description, the word closure relates to the information technology wording for defining objects carrying a function and corresponding parameters to apply to the function. The closure may be defined as an operating function. The proprietary filing system 300 comprises an operating function determination component such as the closure determination component 360 to process specific update requests to determine the function of the specific update and the nature of the data associated with each specific update request. The function can relate to an addition or an amendment of fields and values in a sequence. The nature of the data can relate to a field, a value of a field or both, in a sequence.

An operating function handling component such as the closure handling component 340 can send a request to the closure determination component 360 to produce a closure. The closure handling component 340 can transmit the created closure to an operating function component such as the closure database 350 to store the created closure. The request handling component 310 can transmit the created closure to an operating function application component such as the closure application component 370 to apply the created closure on the corresponding version of standard data. As a result, the closure application component 370 provides resulting data for a specific request.

The request handling component 310 can also determine which standard data from the standard data database 330 is associated with a specific update request within the proprietary filing system. The request handling component 310 sends a request to the standard data handling component 320 . The standard data handling component 320 can then carry out a search in the standard data database 330 for retrieving the specific standard data. The request handling component 310 can also send a request to the closure handling component 340 to retrieve a closure associated with the retrieved standard data. The closure handling component 340 can then send a request to the closure database 350 to retrieve any stored closures associated with the standard data. Thus, the request handling component 310 retrieves the last stored standard data and the corresponding closure, if any.

The proprietary filing system 300 comprises a memory component such as a cache database 380 for storing the resulting data provided by the closure application component 370 . This means that the cache database 380 only stores the last resulting version of data related to the standard data. Thus, the content of the cache database 380 does not increase each time an update request is processed.

The proprietary filing system 300 is connected to a pricing component such as a pricing engine 400 . The pricing engine 400 can regularly request resulting data from the cache database 380 to provide fares when requested by users. As a result, the cache database 380 sends the resulting data to the pricing engine 400 .

The method steps of the present invention will now be described with respect to several examples shown in FIGS. 2 to 8 .

In the description below, the standard data is referred as data K to indicate that the standard data comprises a key K. In all examples below, all data comprise the same key K.

FIG. 2 relates to an update of data K with a first version S 1 from the institutional filing system 200 . The user sends a request to the institutional filing system 200 for creating an update S 1 comprising a sequence SQ 1 .

During a predetermined replication process, the transmission component 230 sends the update S 1 to the request handling component 310 in step 1 . The request handling component 310 transmits the update request to the standard data handling component 320 in step 2 . The standard data handling component 320 carries out a search in the standard data database 330 of the proprietary filing system for retrieving any previously stored version of data having the same key K, i.e. a data K in the standard data database 330 in step 3 . As S 1 is the first standard version, the standard data component 320 does not find any other version for data K in step 4 . The standard data component 320 then stores S 1 in the standard data database 330 in step 5 as the first version of data K. The standard data handling component 320 returns the result S 1 of the update request to the request handling component 310 in step 6 . In step 7 , the request handling component 310 sends a request to the closure handling component 340 to check if any closure is linked with the data K in the closure database 350 in step 8 . As S 1 is a brand new data, the closure handling component 340 does not retrieve any related closure in step 9 . In step 10 , the closure handling component 340 sends to the request handling component 310 the information regarding the absence of any closure. Finally, the request handling component 310 sends both the result of the update S 1 received from the standard data handling component 320 and the result received from the closure handling component 340 to the closure application component 370 in step 11 .

The closure application component 370 then applies any retrieved closure on the version S 1 to create the resulting data R 1 . As no closure was retrieved, the resulting data R 1 is identical to the standard version S 1 . The closure application component 370 transmits the resulting data R 1 to the cache database 380 for storing the resulting data R 1 as the only resulting data for data K in step 12 .

FIG. 3 relates to an update of data K with a second version S 2 from the institutional filing system 200 . The user sends another request to the institutional filing system 200 for updating version S 1 of data K. Thus, the user sends a second version S 2 , which comprises the same key K as S 1 and an updated sequence SQ 2 differing from SQ 1 . During the predetermined replication process, the transmission component 230 sends the second version S 2 to the request handling component 310 in step 1 . In step 2 , the request handling component 310 transmits the update request to the standard data handling component 320 . The standard data handling component 320 carries out a search in the standard data database 330 of the proprietary filing system 300 for retrieving any previously stored version of data K having the same key K as S 2 in step 3 . As S 2 is an updated version of S 1 , the standard data handling component 320 retrieves the update S 1 having the key K in step 4 . The standard data handling component 320 stores S 2 in the standard data database 330 in step 5 and returns the result S 2 to the request handling component 310 in step 6 . The request handling component 310 then sends a request to the closure handling component 340 in step 7 . In step 8 , the closure handling component 340 carries out a search in the closure database 350 to retrieve any stored closure associated with S 1 . In the present example, the request handling component 310 does not retrieve any stored closure in step 9 . In step 10 , the closure handling component 340 sends the information regarding the absence of any closure to the request handling component 310 . Finally, in step lithe request handling component 310 sends both results received from the standard data handling component 320 , i.e. S 2 and from the closure handling component 340 , i.e. no closure to the closure application component 370 .

The closure application component 370 then applies any retrieved closure on the standard version S 2 of data K to create the resulting data R 2 . As no closure was retrieved, the resulting data R 2 is identical to the standard version S 2 . The closure application component 370 then transmits the resulting data R 2 to the cache database 380 for storing the resulting data R 2 as the only resulting data for data K in a step 12 .

FIG. 4 relates to a display of data K requested by the user for later updating data K as shown in FIG. 5 . The user sends a display request to the proprietary filing system 300 by using a Graphical User Interface (GUI) for displaying the current data K. The request handling component 310 receives the display request in step 1 and transmits the request to the standard data handling component 320 in step 2 . Upon reception of the display request, the standard data handling component 320 carries out a search in the standard data database 330 to retrieve the most recent version of the data K that exists in step 3 . The standard data handling component 310 retrieves the version S 2 and sends back S 2 to the request handling component 310 in step 4 . The standard data handling component 320 sends S 2 to the request handling component 310 in step 5 . The request handling component 310 then sends a request to the closure handling component 340 in step 6 . The closure handling component 340 carries out a search in the closure database 350 to retrieve any stored closure associated with S 2 having a key K in step 7 . In the present example, the closure handling component 340 does not retrieve any stored closure in step 8 and sends this information to the request handling component 310 in step 9 . Finally, the request handling component 310 sends both results received from the standard data handling component 320 , i.e. S 2 ; and from the closure handling component 340 , i.e. no closure to the closure application component 370 in step 10 . The closure application component 370 then applies any retrieved closure on the standard version S 2 of data K to create a first data G to be displayed as Ga. As no closure was retrieved, the data Ga is identical to the version S 2 . The closure application component 370 then transmits the data Ga to the request handling component in step 11 for displaying Ga to the user by using the GUI in step 12 .

FIG. 5 relates to an update request of data K requested by the user. The user sends an update request by using the GUI for sending a second data G being Gb associated with the previously displayed data Ga. The data Gb comprises S 2 having the key K and an additional update part.

The request handling component 310 receives the update request in step 1 and transmits the update request to the standard data handling component 320 in step 2 . Upon reception of the update request, the standard data handling component 320 carries out a search in the standard data database 330 to retrieve the most recent version of the standard data K in step 3 . The standard data handling component 310 retrieves the standard data S 2 and sends back S 2 to the request handling component 310 in step 4 . The standard data handling component 320 sends S 2 to the request handling component 310 in step 5 . The request handling component 310 then sends a request comprising the version S 2 and the version Gb to the closure handling component 340 in step 6 . The closure handling component 340 carries out a search in the closure database 350 to retrieve any stored closure associated with S 2 having a key K in step 7 . In the present example, the closure handling component 340 does not retrieve any stored closure in step 8 . In addition, the closure handling component 340 compares the version Gb and the version S 2 and determines that Gb and S 2 are different versions. As a result, the closure, handling component 340 sends both version S 2 and version Gb to the closure determination component 360 in a step 9 . The closure determination component 360 processes a comparison between the version S 2 and the version Gb to build a closure C 1 showing the differences between S 2 and Gb. The closure determination component 360 then determines the function and the nature of the data based on the difference between S 2 and Gb. The closure determination component 360 then transmits the closure C 1 to the closure handling component 340 in step 10 , the closure being associated with data K. The closure handling component 340 then sends the closure C 1 to the closure database 350 for storing in step 11 . The closure handling component 340 also sends the closure C 1 associated with data K to the request handling component 310 in step 12 . The request handling component 310 then transmits both results received from the standard data handling component 320 i.e. S 2 ; and from the closure handling component 340 , i.e. C 1 to the closure application component 370 in step 13 . The closure application component 370 then applies the closure C 1 on the version S 3 of data K to create a resulting data R 3 reflecting the version Gb from the user. The closure application component 370 then transmits R 3 to the cache database 380 for storing R 3 in step 14 .

FIG. 6 relates to an update of data K with a third version S 3 from the institutional filing system 200 . The user sends a request to the institutional filing system 200 for creating an update S 3 comprising a sequence SQ 3 .

Thus, the user sends a fourth version S 3 , which comprises the same key K as the data K and an updated sequence SQ 3 differing from SQ 2 . During the predetermined replication process, the transmission component 230 sends the version S 3 to the request handling component 310 in step 1 . The request handling component 310 transmits the update request to the standard data handling component 320 in step 2 . The standard data handling component 320 carries out a search in the standard data database 330 of the proprietary filing system 300 for retrieving the previously stored version of data K having the same key K as S 3 . As S 3 is an updated version of S 2 , the standard data handling component 310 retrieves S 2 as being the most recent standard data having the key K in the standard data database 330 in step 4 . The standard data handling component 320 then sends the updated data S 3 to the standard data database 330 for storing S 3 in step 5 . The standard data handling component 320 also sends S 3 to the request handling component 310 in step 6 . In step 7 , the request handling component 310 then sends a request to the closure handling component 340 to carry out a search in the closure database 350 to retrieve any stored closure associated with S 2 . The closure handling component 340 carries out the search in step 8 . In the present example, the closure handling component 340 retrieves the previously stored closure C 1 in step 9 . The closure handling component 340 then sends the closure C 1 to the request handling component 310 in step 10 . Finally, in step 11 the request handling component 310 sends both the result received from the standard data handling component 320 , i.e. S 3 ; and the result received from the closure handling component 340 , i.e. C 1 to the closure application component 370 . The closure application component 370 then applies the retrieved closure C 1 on the standard version S 2 of data K to create the resulting data R 4 . The closure application component 370 then transmits the resulting data R 4 to the cache database 380 for storing the resulting data R 4 in step 12 .

FIG. 7 relates to a display of data K requested by the user for later updating data K as shown in FIG. 8 . The user sends a display request to the proprietary filing system 300 by using a Graphical User Interface (GUI) for displaying the current data K.

The request handling component 310 receives the display request in step 1 and transmits the request to the standard data handling component 320 in step 2 . Upon reception of the display request, the standard data handling component 320 carries out a search in the standard data database 330 to retrieve the most recent version of the standard data K in step 3 . The standard data handling component 310 retrieves the standard data S 3 and sends back S 3 to the request handling component 310 in step 4 . The standard data handling component 320 sends S 3 to the request handling component 310 in step 5 . The request handling component 310 then sends a request to the closure handling component 340 in step 6 . The closure handling component 340 carries out a search in the closure database 350 to retrieve any stored closure associated with S 3 having a key K in step 7 . In the present example, the closure handling component 340 retrieves the stored closure C 1 in step 8 and sends this information to the request handling component 310 in step 9 . Finally, the request handling component 310 sends both the result received from the standard data handling component 320 , i.e. S 3 and the result received from the closure handling component 340 , i.e. C 1 to the closure application component 370 in step 10 . The closure application component 370 then applies the closure C 1 on the standard version S 3 of data K to create a third data G to be displayed as Gc. The data Gc then comprises the version S 3 and the closure C 1 . The closure application component 370 then transmits the data Gc to the request handling component in step 11 for displaying Gc to the user by using the GUI in step 12 .

FIG. 8 relates to an update request of data K requested by the user. The user sends an update request by using the GUI for sending a fourth data Gd associated with the previously displayed data Gc. The data Gd comprises S 3 having the key K and an additional update part.

The request handling component 310 receives the update request in step 1 and transmits the update request to the standard data handling component 320 in step 2 . Upon reception of the update request, the standard data handling component 320 carries out a search in the standard data database 330 to retrieve any most recent version of the standard data K in step 3 . The standard data handling component 310 retrieves the version S 3 and sends back S 3 to the request handling component 310 in step 4 . The standard data handling component 320 sends S 3 to the request handling component 310 in step 5 . The request handling component 310 then sends a request comprising the version S 3 and the version Gd to the closure handling component 340 in step 6 . The closure handling component 340 carries out a search in the closure database 350 to retrieve any stored closure associated with S 3 having a key K in step 7 . In the present example, the closure handling component 340 retrieves the previously stored closure C 1 in step 8 . In addition, the closure handling component 340 compares the version Gd and the version S 3 and determines that Gd and S 3 are different versions. As a result, the closure handling component 340 sends both version S 3 and version Gd to the closure determination component 360 in a step 9 . The closure determination component 360 processes a comparison between the version S 3 and the version Gd to build a closure C 2 showing the difference between S 3 and Gd. The closure determination component 360 then determines the function and the nature of the data based on the difference between S 3 and Gd. The closure determination component 360 then transmits the closure C 2 to the closure handling component 340 in step 10 , the closure being associated with data K. The closure handling component 340 then sends the closure C 2 to the closure database 350 for storing in step 11 . The closure handling component 340 also sends the closure C 2 associated with data K to the request handling component 310 in step 12 . The request handling component 310 then transmits both results received from the standard data handling component 320 i.e. S 3 ; and from the closure handling component 340 , i.e. C 2 to the closure application component 370 in step 13 . The closure application component 370 then applies the closure C 2 on the version S 3 of data K to create a resulting data R 5 reflecting the version Gd from the user. The closure application component 370 then transmits R 5 to the cache database 380 for storing R 5 in step 14 .

In the above examples, data such as fare data may comprise several sequences. Each sequence then represents a refinement of the key K and thus defines additional information related to the key K such as the currency used or the route to be taken. A closure can relate to a single field of a single sequence for a given period of time. As a result, the resulting data after applying the closure is the result of the intersection of both the date of the standard data and the date of the closure and the application of the closure during a period of time when the closure is applicable.

As shown in FIG. 9 , a standard data comprising a data part and an amended data part can exist during a period of time from t 0 to t 3 . The data part exists during a first period of time from t 0 to t 1 and the amended data exists during a second period of time from t 1 to t 3 . Two closures C 1 and C 2 relating to the standard data apply during the same period of time t 0 to t 3 as for the existence of the standard data. The closure C 1 can be applied during a first period of time from t 0 to t 2 with t 2 being located between t 1 and t 3 . The closure C 2 can be applied during a second period of time from t 2 to t 3 . This means that the application of both closures on the standard data comprising two applications on two different periods of time. The application of the closure C 1 occurs on the standard data over a period of time from t 0 to t 2 , which is the duration of the closure C 1 . As the data part of the standard data exists over a period of time from t 0 to t 1 only, the closure C 1 applies on this data part. As the amended data part exists over a period of time from t 1 to t 3 , the closure C 1 only applies on the amended data part over a period of time covering the corresponding period of time for the closure C 1 . This means that the closure C 1 partially apply on the amended data part over a period of time from t 1 to t 2 . This means that both the data part and the amended data part of the standard data are impacted by the application of the closure C 1 . The application of the closure C 2 occurs on the standard data over a period of time from t 2 to t 3 , which is the duration of the closure C 2 . As the amended data part exists over a period of time from t 1 to t 2 and from t 2 to t 3 , this means that only the amended data part of the standard data is impacted by the application of the closure C 2 .

Another embodiment is shown in FIG. 10 to illustrate the sequence renumbering function from the institutional filing system 200 . In FIG. 10 , the institutional filing system 200 sends an update relating to two sequences 1 and 2 in step 1 . As a result, the standard data comprises two sequences 1 and 2 and is stored in the standard data database 330 . As shown in FIG. 10 , in step 1 the closure database 350 does not contain any closure. As a result, there is no closure to apply on the standard data from the closure database 350 . The cache database 380 can thus store the standard data comprising the same sequences 1 and 2 as the resulting data.

In step 2 , the user sends an update to the proprietary filing system 300 . The update comprises a closure C 1 associated with the sequence 1 . The closure database 350 then stores the closure C 1 . The cache database 380 stores the standard data having the sequence 1 with the closure C 1 applied thereon and the sequence 2 without any amendment. In step 3 , the institutional filing system 200 requests a sequence renumbering as an amendment provided to the standard data. The request comprises the renumbering of sequence 1 into sequence 4 for the standard data. This means that the standard data now comprises two sequences 2 and 4 as shown in FIG. 10 . The closure handling component 340 renumbers the closure C 1 and associates it to the sequence 4 . The closure database 350 stores the updated version of C 1 . The closure database 350 then associates the stored closure C 1 with the sequence 4 . The cache database 380 stores the standard data having the sequence 2 as stored in step 2 and reorder the sequence 4 with the closure C 1 applied thereon.

The above examples relate to updating and storing changes to travel data. However, the present invention can also relate to other kinds of data. The above examples relate to fares and pricing applications. However, the present invention could also relate to other kinds of applications.

This invention has been applied to the update of data in the travel environment. However, it will be appreciated that the invention may apply to other environments, for example in the domain of pricing and/or booking engines (hotels, cars, and trains), fret, e-shopping (Amazon™, Darty™, etc).

It will be appreciated that this invention may be varied in many different ways and still remain within the intended scope of the invention.

In one exemplary implementation, the subject matter described herein can be implemented using a non-transitory computer readable medium having stored thereon a computer program comprising instructions for carrying out any of the methods described herein. For example, any of the components and engines described herein may be implemented in software embodied in a non-transitory computer readable medium and executed by a processor. Each of the databases described herein may also be embodied in a non-transitory computer readable medium. Exemplary computer readable media suitable for implementing the subject matter described herein include disk memory devices, chip memory devices, programmable logic devices, and application specific integrated circuits. In addition, a computer readable medium that implements the subject matter described herein may be located on a single device or a computing platform or may be distributed across plural devices or computing platforms.

A person skilled in the art will understand that some or all of the functional entities as well as the processes themselves may be embodied in software, or one or more software-enabled modules and/or devices or in any combination thereof. The software may operate on any appropriate computer or other machine. The operation of the invention provides a number of transformations such as adding specific data to standard data to provide resulting data.