JP2004527820A - Method of processing and accessing data in a computer reservation system and a system for implementing the method - Google Patents

Abstract

The present invention relates to a method for processing and accessing data in a computerized reservation system, and a computerized system for implementing the method. According to the present invention, at least one cache (9a, 9b) containing reservation data is created in the server unit, and data is added to the cache (9a, 9b) by transfer from at least one inventory setup (I), and the cache (9a, 9b) is added. , 9b) and the client application, whereby a user issues a request and receives the data in the response. INDUSTRIAL APPLICABILITY The present invention is applicable to a computerized reservation system, in particular, a reservation system in the fields of transportation, travel, and accommodation.
[Selection diagram] Fig. 1

Description

【Technical field】
[0001]
The present invention relates firstly to a data processing and access method in a computer reservation system.
[0002]
The invention also relates to a computer reservation system adapted to use this method.
[Background Art]
[0003]
Currently, computer booking systems are used, in particular, in the field of travel, air transport, or for booking accommodation.
[0004]
In this field, there is one or more inventory bases corresponding to the reservation status at each of the service providers such as airlines and car rental companies. A central system processes the information and allows access to different inventory bases to meet user demands. Thus, a user can query a central system using a client application to obtain data, particularly regarding availability, cost, and the type of service provided.
[0005]
This access and data transfer are all performed by a communication network.
[0006]
According to current technology, a central system receives multiple requests from multiple users and directly queries one or more inventory bases to respond to them.
[0007]
This operating principle has the disadvantage that it makes the communication network mainly related to the inventory base more cumbersome and difficult. This is more harmful because certain requests of the user do not require direct access to the inventory database in a synchronized manner.
[0008]
For example, a user connected via a wide area network such as the Internet sometimes queries the reservation system only to know the type and cost of the reservation. Therefore, it is not necessary at all to give them specific information on whether a reservation can be made.
[0009]
Examples of current technology include, inter alia, U.S. Pat. No. 5,570,283. This patent discloses a computer system with modular software that allows travelers to access inventory electronically to get airfare very quickly in a friendly software environment and It allows both agents and professionals to make reservations and access specific databases related to their professional activities.
[Patent Document 1]
US Patent No. 5,570,283 DISCLOSURE OF THE INVENTION
[Problems to be solved by the invention]
[0010]
The above references are essentially concerned with the price of the item offered. Thus, computer systems make the prices completely up to date for agents and other professionals.
[0011]
However, according to the above references, it is still necessary to directly access the inventory base for any kind of request to check the reservation status.
[0012]
The present invention overcomes the deficiencies of current technology.
[0013]
The invention makes it possible to reduce the amount of direct access to the reserved inventory base by providing a "cache" type database adapted to respond to the user's initial query.
[0014]
In addition, access to this cache has the advantage that it can be provided by a wide area communication network such as the Internet, where the cost of communication is very low.
[0015]
Other objects and advantages will become apparent from the description below. This description describes preferred embodiments of the present invention, but does not limit the invention.
[Means for Solving the Problems]
[0016]
The present invention relates to a method for processing and accessing data in a computer reservation system, the computer reservation system comprising a server unit having a central system and at least one inventory base of reservation status, and a client unit comprising at least one client application. Wherein the server unit and the client unit are connected by a communication network, create at least one cache including reservation data in the server unit, and add data to the cache by transferring from at least one inventory base; An application interface between the client and one or more client applications so that the user can make requests to the cache and receive the data in the response. .
[0017]
This method has the following modifications. That is,
-When the cache does not contain the requested data when the client application makes a request to the cache,
The request is processed in a central system and the requested data is located by accessing a reserved inventory base;
-This data is added to the cache,
The requested data is returned to the client application in response.
-Data contained in the cache is deleted using the following procedure. That is,
-Assign a maximum retention period for each data contained in the cache,
-Periodically search for data contained in the cache to detect data for which the maximum retention period has expired,
-Delete data for which the maximum retention period has expired.
・ Data contained in the cache is deleted by the following procedure. That is,
Assigning to the cache a limit size and a threshold size whose value is lower by a predetermined margin than this limit,
-When the limit size is reached, the data contained in the cache is deleted in chronological order of usage until the threshold size is reached.
-Data is placed in the cache as follows. That is,
-Assign a key to each data to be stored,
-Convert the key to a number,
-Creating a vector of lists consisting of a series of compartments adapted to contain lists of data,
-Assign a natural number index starting from zero to each parcel,
For each data, determine the index of the storage partition by modulating the numerical value of the data key by the number of partitions,
Storing the data in the partition thus determined;
Looking for data in the cache by converting the key to a number, and modulating the number of the key by the number of partitions to determine the index of the storage partition;
-If there is only a single piece of data in the parcel, retrieve the searched data,
-If there is no data in the parcel, it is returned that there is no information,
-If there is more than one piece of data in a parcel, the keys of the data are compared, thereby determining the data actually sought.
Block only access to the partition being processed, thereby enabling other request processing in other partitions to be performed simultaneously.
[0018]
Further, the present invention relates to a computer reservation system, wherein the computer reservation system includes a server unit having a central system and at least one inventory base of reservation status, and a client unit including at least one client application, wherein the server The unit and the client unit are connected by a communication network and are adapted to use the method according to the invention.
[0019]
The reservation system includes at least one cache provided in the server unit and including reservation data, and a cache and one or more client applications connected to the cache so that a user can issue a request to the cache and receive data in a response. And at least one application interface provided therebetween.
[0020]
According to a variant,
At least one cache block comprising a cache and a cache management application; and at least one input management block comprising a plurality of input management modules, each receiving requests from one or more client applications, and controlled by input control. Is provided.
Each input management module is assigned to a single client application.
An input management module is assigned to a plurality of client applications, the cache blocks of which are adapted to receive requests from the client applications and redistribute them according to the order of the input as requested by the cache, and a list. One or more caches containing a vector of data, said vector comprising a series of partitions adapted to contain a list of data, wherein the data is indexed by the index of the partition in which the data is stored. An index has been assigned to search for data.
An erase tool is provided that is adapted to issue an erase command to the cache according to a predetermined procedure.
BEST MODE FOR CARRYING OUT THE INVENTION
[0021]
The accompanying drawings are given by way of example. They show embodiments to facilitate understanding of the invention.
[0022]
As shown very schematically in FIG. 1, according to the current technology, the client makes a request to obtain data on availability, for example for airplane reservations, or for all types of services. (CS).
[0023]
This request can be represented by a "GET" operation sent to the central system (CS). The central system (CS) is connected to one or more inventory bases (I) in a reservation state, and data to be searched exists in the inventory base (I). By querying these inventory bases (I), the central system (CS) can return a response to the client.
[0024]
More precisely, according to the current technology, different clients send inquiry messages to a component commonly referred to as a "FRONT END", which in turn forwards the request. Relay to clients in a central system called "BACK END". Thus, the front-end component constitutes an intermediary between the client and the central part of the central system. It is at this level that the client's different messages are sent before transmission. This type of organization generates a large number of communications between the different components of the system and the large assembly of the central system.
[0025]
The reservation system according to the present invention avoids such disadvantages.
[0026]
In a manner known per se, the reservation system according to the invention comprises a client part having a plurality of client applications (19) and a server part comprising a central system (CS) and one or more inventory bases (I). Integrated into the configuration.
[0027]
The processing of a request according to the present invention can be performed as a supplement to the above-mentioned current method or in place of the current method.
[0028]
The inventory base is typically a database made available by a service provider, such as an airline, where the service provider is updating the booking status.
[0029]
According to the current technology and also in the configuration of the present invention, communication between the server unit and the client unit is performed by the communication network 5.
[0030]
Within the scope of the present invention, communication network 5 may include a wide area network such as the Internet.
[0031]
Characteristically, as shown in FIG. 2, the system according to the present invention includes at least one cache (9a, 9b).
[0032]
The cache is located in the server unit and includes reservation data. The caches (9a, 9b) are integrated into the cache blocks (3a, 3b, 3c) shown in FIG. In a manner known per se, the caches (9a, 9b) can be constituted by a volatile memory of the RAM type (Random Access Memory). Of course, the periodic protection of the data contained in these caches (9a, 9b) can be performed using a non-volatile memory or a disk.
[0033]
The system shown here includes an interface application (18) provided between different client applications (19) and one or more caches (9a, 9b). The interface application (18) allows the user to make requests to the cache and receive the data in the response.
[0034]
Referring again to FIG. 2, the system preferably includes one or more input management blocks (2a, 2b).
[0035]
The input management blocks (2a, 2b) communicate with the interface application (18) by the routing means (4). According to the invention, which is not limited to a particular variant, any type of routing can be used.
[0036]
The structure consisting of the input management blocks (2a, 2b), the routing means (4), the interface application (18) and the different cache blocks (3a, 3b, 3c) makes it possible to form a functional unit called a server cache (1). I do.
[0037]
More precisely, in the server cache (1), the blocks are preferably arranged in the following way.
[0038]
As for the input management blocks (2a, 2b), they include a plurality of input management modules (8a, 8b) connected to the client application (19) by a communication network (5).
[0039]
According to a first variant, each input management module is connected to a single client application (19). Therefore, there are as many modules (8a, 8b, 8c) as there are client applications (19) connected to the input management blocks (2a, 2b). To manage each input management module (8a, 8b), each input management block (2a, 2b) includes an input manager (7a, 7b). The input managers (7a, 7b) make it possible to apply operating parameters to each input management module (8a, 8b).
[0040]
The input management block (2a, 2b) is connected to one cache block (3a, 3b) or a plurality of cache blocks according to appropriate routing conditions.
[0041]
According to the example of FIG. 3, the input management block (2a) communicates with the cache block (3a).
[0042]
The cache block (3a) includes the cache (9a) as described above, and the cache (9a) is operated by the cache management application (10a).
[0043]
This cache application (10a) provides an interface between the input management block and the cache block.
[0044]
In the example of this figure, each client application (19) corresponds to an input management module (8a, 8b). According to a variant, multiple clients (19) can issue their requests to a single input management module.
[0045]
In the case of FIG. 7, the modules (8a, 8b) are connected to the file (16). This file (16) operates according to (first in, first out) logic adapted to receive requests and redistribute them in input order.
[0046]
In this connection, at the output of the file (16) there is a line group (17) that sends the request to the cache (9a, 9b). Therefore, the number of input management modules (8a, 8b) of the system can be limited.
[0047]
FIG. 5 shows a preferred embodiment for erasing data contained in the caches (9a, 9b). To this end, the system includes an erasure tool (11) that sends erasure commands (12) to different caches (9a, 9b). The procedure exemplified for this erasure will be described later.
[0048]
The operation of the system according to the invention and the methods for processing and accessing that form an integral part of the invention are described below.
[0049]
In this connection, one or more caches (9a, 9b) are created in the server unit for holding the reservation data. Clients can access the caches (9a, 9b) to respond quickly to requests without disturbing the rest of the central system, as described above.
[0050]
To update data held in one or more caches (9a, 9b), data is added to the caches (9a, 9b) by transfer from at least one inventory base (I).
[0051]
FIG. 4 shows an example of a continuous operation enabling data to be added to the caches (9a, 9b).
[0052]
According to this diagram, the client issues a request to generate a "GET" operation for querying the cache (9a, 9b). If the cache (9a, 9b) can provide a positive response to the "GET" query, the data held in the cache is returned to the client as a response.
[0053]
If the cache does not hold the response requested by the client, the request is issued to the central system (CS). The central system (CS) is adapted to generate a response by connection with the inventory base (I). The data in response is returned by the central system (CS) and added to the cache (9a, 9b) by a "PUT" operation.
[0054]
In this way, data that was not previously held in the cache is stored.
[0055]
This series of operations can be performed from a cache that does not contain any data when the system according to the present invention is started up. In the cache, data is continuously stored according to an inquiry from a client.
[0056]
It is important to keep the data contained in the cache updated to avoid overloading the cache and optimizing operation.
[0057]
In this context, the method according to the invention proposes two separate procedures, which can also be used simultaneously for performing data erasure.
[0058]
According to the first procedure, a maximum storage period is assigned to each data. The data contained in the caches (9a, 9b) are inspected periodically, and data exceeding the storage time limit is detected.
[0059]
These data are deleted from the cache.
[0060]
In this way, data that is too old and no longer has realistic and reliable properties is deleted.
[0061]
Of course, the cycle of updating by this procedure changes according to the nature of the stored data. For example, the time interval between two erase commands can be 60 seconds.
[0062]
The second erasure procedure can be used in place of, or in addition to, the first procedure in accordance with the method of the present invention.
[0063]
In this context, a size limit is assigned to the cache according to the maximum size it is desired to give to the cache. In addition, the cache is assigned a threshold size that is less than or equal to the limit size and that corresponds to a size that is acceptable for good operation of the cache. For example, the threshold size can be fixed at 80% of the limit size.
[0064]
When the size reaches the limit size, the held data (9a, 9b) is deleted from the oldest usage time until the size reaches the threshold size.
[0065]
In this way, very old data used is removed as necessary to reach the allowed size of the cache.
[0066]
In addition, a specific mode in which data is filed in the caches (9a, 9b) to optimize the operation of the caches (9a, 9b) will be described below.
[0067]
Generally, a key is assigned to each data to be stored in the cache.
[0068]
This key can be converted to a number, which is commonly referred to as a "HASH CODE" according to the currently used hashing method.
[0069]
In addition, a vector (14) of a list is created that includes a series of partitions (13), shown in FIG. 6 and commonly called "BUCKETs". Each section (13) is adapted to contain one or more data.
[0070]
A numerical index, which is a natural number starting from 0, is assigned to each section (13).
[0071]
For example, a cache with a size limit of 51200 kilo octets (Kilo Octets) can have 20011 partitions.
[0072]
Thereafter, a correspondence is made between the key assigned to each data and the numerical index of each section (13). The establishment of this correspondence can be achieved by modulating the numeric keys of the data by the number of sections (13) of the list vector (14).
[0073]
The purpose of this association is to store the data at a specific index in the partition (13), and for the data in the partition (13) having the same index as the data that the client is searching for, the data of the data held in the cache is stored. That is, no comparison is made.
[0074]
In this way, the number of required comparison operations is greatly reduced.
[0075]
The number of values included in the section (13) is not limited. However, it should be understood that the smaller the number of values, the better the performance.
[0076]
Also, in order to optimize the operation of the caches (9a, 9b), only access to the used partition (13) can be prevented during the processing of the request. In this way, the processing of requests assigned to a partition (13) does not prevent the operation of other partitions (13). To do this, a selective access blocking means (15), also called a semaphore or "MUTEX", is used.
[0077]
This allows for better management of concurrent requests and reduces the risk of concurrent requests being processed in the same partition (13).
[Brief description of the drawings]
[0078]
FIG. 1 shows an example of processing a request from a client according to the present technology.
FIG. 2 schematically illustrates components of the system of the present invention in a particular embodiment; FIG. 3 illustrates another schematic diagram of an embodiment of a system according to the present invention, specifically illustrating certain components.
FIG. 4 is a schematic diagram showing a query phase and a cache display phase in the system according to the present invention.
FIG. 5 shows an example of erasing data held in a cache.
FIG. 6 shows a modification of the arrangement of data in the cache.
FIG. 7 is a modification of the present invention in which a plurality of clients access the system by the same input management module.
[Explanation of symbols]
[0079]
1 Cache server 2a, 2b Input management block 3a, 3b, 3c Cache block 4 Routing means 5 Communication network 6a, 6b Input port 7a, 7b Input manager 8a, 8b Input management module 9a, 9b, 9c Cache 10a, 10b Cache management application 11 Erase Tool 12 Erase Command 13 Section 14 List Vector 15 Selective Access Prevention Means 16 File 17 Line Group 18 Interface Application 19 Client Application CS Central System I Inventory Base

Claims (13)

A server unit having a central system (CS) and at least one inventory base (I) in a reservation state; and a client unit including at least one client application (19), wherein the server unit and the client unit are connected to a communication network ( 5) a data processing and access method in the computer reservation system connected by 5),
At least one cache (9a, 9b) including reservation data is created in the server unit, and data is added to the cache (9a, 9b) by transfer from at least one inventory base (I);
Create an interface application (18) between the cache (9a, 9b) and one or more client applications (19) so that a user can make a request to the cache (9a, 9b) and receive the data in the response. A data processing and access method characterized by the above. When the client application (19) makes a request to the cache (9a, 9b) and the cache (9a, 9b) does not contain the requested data,
The request is processed in the central system (CS) and the requested data is located by accessing the inventory base (I) in the reserved state;
This data is added to the cache (9a, 9b),
The method according to claim 1, characterized in that the requested data is returned to the client application (19) when responding. Assign a maximum retention period to each data contained in the cache (9a, 9b),
Periodically scrutinize the data contained in the caches (9a, 9b) to detect data for which the maximum retention period has elapsed,
Delete data for which the maximum retention period has passed,
3. The data processing and access method according to claim 1, wherein data contained in the caches (9a, 9b) is erased. Assigning to the caches (9a, 9b) a limit size and a threshold size whose value is lower by a predetermined margin than the limit value,
When the limit size is reached, the data contained in the cache (9a, 9b) is deleted in the order of oldest use, until the threshold size is reached,
The data processing and access method according to any one of claims 1 to 3, wherein the data contained in the caches (9a, 9b) is erased. Assign a key to each data to be stored,
Convert the key to a number,
Creating a list vector (14) consisting of a series of compartments (13) adapted to contain a plurality of lists of data;
Assign a natural number index starting from zero to each section (13),
For each data, determine the index of the storage partition by modulating the key value of the data by the number of partitions (13);
Storing the data in the section (13) specified in this way,
5. The data processing and access method according to claim 1, wherein the data in the caches (9a, 9b) are classified. Looking for data in the cache (9a, 9b) by converting the key to a number and modulating the key value by the number of partitions to determine the index of the storage partition (13);
If there is only a single piece of data in section (13), retrieve the searched data,
If there is no data in the section (13), the absence information is extracted and
6. Data processing and access according to claim 5, characterized in that if there is more than one piece of data in the partition (13), the keys of the data are compared, thereby determining the data actually sought. Method. 7. The method according to claim 6, wherein only access to the section (13) that is processing the request is blocked, so that another request processing can be simultaneously performed in another section (13). Data processing and access methods. A server unit having a central system (CS) and at least one inventory base (I) in a reservation state; and a client unit including at least one client application (19), wherein the server unit and the client unit are connected to a communication network ( A computer reservation system connected by 5) and adapted to use the method according to any of the preceding claims,
At least one cache (9a, 9b) provided in the server unit and including reservation data;
At least one of the client applications (19) is provided between the cache (9a, 9b) and one or more client applications (19) so that a user can issue a request to the cache (9a, 9b) and receive the data in the response. A computer reservation system, comprising: one interface application (18). At least one cache block (3a, 3b, 3c) comprising a cache (9a, 9b) and an application (10a, 10b) for managing the cache (9a, 9b);
At least one input management block (2a, 2b) comprising a plurality of input management modules (8a, 8b) each receiving a request from one or more client applications (19) and managed by an input manager (2a, 2b). 2. The computer reservation system according to claim 1, wherein the server unit includes at least one cache server (I) comprising: Computer reservation system according to claim 9, characterized in that each input management module (8a, 8b) is assigned to a single client application (19). The input management module (8a, 8b) is assigned to a plurality of client applications (19), and their cache blocks (3a, 3b, 3c) receive requests from the client applications (8a, 8b) and cache them. Computer reservation system according to claim 9, characterized in that it comprises a file (6) adapted to redistribute in response to requests from 9a, 9b) according to the order of input. One or more caches (9a, 9b) include a vector of lists (14), said vector (14) including a series of partitions (13) adapted to include a list of data, and The computer reservation system according to any one of claims 8 to 11, wherein an index is assigned to search data by an index of a partition (13) in which the data is stored. Computer reservation system according to any of claims 8 to 12, characterized in that it comprises an erasing tool (11) adapted to issue an erasing command to the cache (9a, 9b) according to a predetermined procedure.