JPH06295304A - Reserved sales method - Google Patents

Abstract

PURPOSE:To reduce the load of a CPU at the peak of selling. CONSTITUTION:A train file RF and a seat file ZF stored in a host computer 11 are divided into plural file servers 1 to n and loaded down, and in a high period of selling frequency, selling processing is executed in each file server without accessing host computer 11. When the peak of selling has passed, data left in the file servers are loaded up to the host computer 11 and uniformly managed by the host computer. When stock in the host computer 11 disappears before the up-loading, file servers having remainders are searched and the remainders are loaded up.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of selling tickets for transportation, seat reservations, concerts, baseball fields and the like.

[0002]

2. Description of the Related Art Conventionally, all files for managing sales have been centrally managed by a host computer, and sales have been started all together at a predetermined date and time.

[0003]

Therefore, at that time, transactions concentrate on the host computer,
There was a problem that the response time was slow. The present invention prevents the load from being concentrated on the host computer even if a large number of transactions occur.

[0004]

Means for Solving the Problems A file (hereinafter referred to as an inventory file) managed by a host computer and required for sale is divided and stored in a file server, and the host and the file server are connected by a LAN. The customer inquires about the sales by using the terminal, and the file server and the terminal are connected by the public line network. If there is a sales inquiry from the terminal, the file server connected to that terminal will
If the file is stored on the file server and it is still in stock, it ends the sale procedure and does not access the host computer. Otherwise, access the host computer. This can reduce the load concentration on the host computer.

[0005]

[Operation] An example of selling reserved seat tickets for a train will be described.
The host computer has a train file (RF) that stores the departure date and time, the train name, and the number of seats, and a seat file (ZF) that stores the sales status for each seat. Immediately before the start of sales, the host computer divides and downloads the stock of each train to one or more file servers (leaving a part of the stock in the host computer). Each downloaded RF and ZF file is R
Call them F'and ZF '. The ZF stores the sales status of each seat (vacant seats or sold), or the file server number of the download destination if the file server is on sale.

When there is a sales inquiry from the terminal, the file server connected to the terminal refers to the RF 'and ZF' of the corresponding train, and if there is stock, sells the seat. If not in stock, access the host computer.

When a predetermined time has elapsed from the start of sales, or when a predetermined number of sheets are sold, or when the number of sold sheets per a predetermined time falls below a certain value, RF ', Z
Upload F'to the host computer.

When the host computer runs out of stock, the unsold file server is searched and uploaded. In this way, there is no need for unsold sales despite the need for sales.

As another implementation method, there is a method in which "the departure time of the first train station of the train is set as the sale start time of the reserved seat ticket". RF and Z prepared in the host computer before sale
F is locked, the timer is monitored, and when the sale start time comes, the corresponding RF and ZF are unlocked so that the sale can be accepted.

[0010]

The present invention is applicable to reserved seat tickets for trains and ticket sales for concerts. Here, the former will be taken as an example. Consider two different approaches compared to the current state of the art: a method of distributing files that are concentrated on the first computer, and a start time of the train being the departure time of the train. In the first and second embodiments, a method of distributing files while the sale start time remains a certain specific time (current system) will be described.

FIG. 1 shows a system configuration diagram. The host computer 11 and the file servers 1, 2, ...
Connect with AN12. A terminal is connected to each file server via the public line networks 10, 20, 30. For example, the file server 1 is connected to terminals 1a to 1z, and the file server 2 is connected to terminals 2a to 2z.

A known technique is used as a countermeasure when the file server goes down. Hereinafter, three methods can be considered.

(1) Each file server is duplicated.

(2) If there is no reply from the file server to the terminal even after waiting for a predetermined time, the terminal judges that the file server is down, cancels the transaction issued to the file server, and cancels the transaction with the host computer 11. Make a direct transaction (generate a transaction).

(3) When a transaction occurs in the file server, the host computer 11 also stores a backup of the contents of the transaction. If the file server does not go down and the processing ends normally, the backup of the host computer 11 is canceled, and when the file server goes down, the backup transaction stored in the host computer 11 is processed. After the file server is recovered, the transaction processed by the host computer 11 is canceled while the file server is down (cannot be processed by the file server).

Next, a file distribution method will be described. Immediately after the sale starts, the load is concentrated on the host computer 11 from many terminals.
(File showing the number of remaining seats for each train) and seat file Z
Divide F (file showing sales status for each seat),
It is downloaded from the file server 1 to the file server n (a part of the host computer 11 also remains). FIG. 2 shows an outline of the division. CPU101,
Reference numerals 102 and 103 denote CPUs of the file servers 1, 2, and 3, respectively. For example, the RF and ZF of Hikari A is A
0, A1, A2, A3, ..., A0 is left on the magnetic disk of the host computer 11, A1, A2,
A3 is divided into file servers 1, 2 and 3, respectively, and stored. The same applies to Hikari B and C.

Table 1 shows RF on the host side, Table 2 shows ZF on the host side, and Table 3 shows ZF 'on the file server side. Table 1
Shows an example of only three trains of the RF stored in the host computer 11.

[0018]

[Table 1]

The number of seats left here is the number of seats currently managed by the host computer 11, and does not include the number of seats on sale at the file server. What is the file server operating flag? Is it on sale on the file server (1),
It indicates whether the sale has already been completed and the sale status has been reported (uploaded) to the host computer 11 (0). If there are no more seats left in the host computer 11, it is possible to access the file server in operation. For example,
Although the host computer 11 does not have the remaining "Hikari No. 3 green non-smoking seat", it indicates that the file servers 1 and 2 are on sale, so the file server 1 or 2 is accessed. Here, only one file server operating flag is shown for each train,
It is, of course, possible to set the flag for smoking or non-smoking in normal seats, smoking or smoking in green seats, or to set the flag for each car. RF 'on the file server side is obtained by removing the file server operation flag from Table 1. Hereafter, the remaining seats are called inventory.

Table 2 shows the sales status of each seat (three cars of one train) managed by the host.

[0021]

[Table 2]

Cars 16 and 15 are divided into file servers 1 and 2, respectively, and car 14 is managed by the host. The flags of each seat in the table will be described. '00' means that there are still empty seats. '
01 'is a seat assigned to the file server, and this file (ZF) indicates that it is unknown whether the seat is empty. '10' means reserved but not issued yet, '11' means ticket issued.

Since the flag of each seat of the 16th car is other than "01", it means that the file server 1 reports the sales status and the host is ready to sell. '10' only accepts reservations but has not issued tickets yet
11 '. Therefore, the '10' seat must not be sold to others until canceled. All the flags of car No. 15 are '01', so file server 2
Means that it has been downloaded to and not yet uploaded to. All seats in this vehicle are '00', '10', '11' when uploaded
Is set to either.

Table 3 shows the sales situation by seat (for one vehicle with one train) managed by one file server shown in Table 3.

[0025]

[Table 3]

A flag indicating whether the vehicle has already been uploaded (1) or not yet uploaded (0) is provided. This flag may be set for each vehicle, or RF 'may be provided with an item for storing the state (uploaded or not) for each vehicle. In Table 3,
Each seat is '0' if not already uploaded
Indicates either 0 ',' 10 ', or' 11 '. If it is uploaded, the state of each seat is ignored regardless of what is set, but to be on the safe side, '01' may be set.

FIG. 3 shows a procedure for selling tickets. Step 301: Before sales start, RF and ZF managed by the host are downloaded to the file server (leaving a part of the host). Step 302: The file server waits for a reservation or sales inquiry from the terminal. If it occurs, go to step 303. Step 303: It is judged whether or not the file of the file server connected to the operating terminal can be accessed. Downloading from host to file server,
Or, while uploading from the file server to the host, or while accessing the file on the file server, you cannot access the file server.
The process proceeds to step 307 and is processed by the host. If the file server is accessible, go to step 304. Step 304: Check RF 'whether the passenger's desired train inventory is in the file server. If in stock,
If not, go to step 305.

Step 305: Find an empty seat from ZF 'and sell it. Step 306: Subtract the inventory quantity of RF 'and set the flag of ZF' to '10' (reservation only but not issued) or '11'.
(Ticket issued) Step 307: When you cannot sell on the file server,
Sell by host. Step 308: Determine whether the peak of sales has passed. There are several methods of judgment. For example, there is a case where a predetermined time has elapsed from the start of selling, or a predetermined number of sheets are sold, or the number of sold sheets per a predetermined time is below a certain value. In these cases, it is determined that the peak has passed, and the process proceeds to step 309, and otherwise proceeds to step 302. Step 309: Upload ZF 'and RF' to the host and update ZF and RF on the host.

If the file server cannot be accessed at step 303, "access the host" is used here.
However, other methods are possible. (1) The inquiry from the terminal is made to wait until the access such as downloading to the file is completed. (2) If ZF 'is configured with one train as one file (ZF'1, ZF'2, ...), even if one train file cannot be accessed, another train can be accessed.
Further, even when two transactions try to access the same file, the inquiry from one transaction is made to wait until the file can be accessed. (3) Separate one train for each car and use Z as a separate file.
F'is configured, and the inquiry from the terminal is kept waiting until the file can be accessed. Or access files on other vehicles.

In the cases of (2) and (3), the waiting time is extremely smaller than that of (1).

Although omitted in FIG. 3, as described above,
If there is no stock in the host in step 307, the RF is checked, the file server in operation is accessed, the stock is searched, and the product is sold. If all file servers in production are out of stock, it's sold out.

In FIG. 3, it is described that the host computer is accessed when the file of the file server cannot be accessed. However, when a plurality of transactions are concentrated on one file server, those transactions are distributed and specified. Avoid processing intensively on the file server. Table 4 shows the number of transactions currently running on the host computer and each file server (a0
To an) and the maximum number of cases that can be processed simultaneously (L0 to Ln).

[0033]

[Table 4]

Table 4 is stored in the host computer 11, and each file server part is stored in each file server. When each file server starts processing,
1 is added to the number of active items in the table, and if the process is completed, 1
Subtract.

FIG. 4 shows a processing flow for distributing transactions. Only steps different from those in FIG. 3 will be described. Step 401: The file server checks how many transactions are currently running on the file server connected to the operating terminal. If the number is less than the specified number (see Table 4), the file server accepts processing,
Otherwise, go to step 402. Step 402: If the number of active transactions in the host computer 11 is less than the predetermined number (L0), proceed to step 403. If not, proceed to step 404. Step 403: Host computer 1 with RF in Table 1
Check if 1 is in stock. If there is stock, the process proceeds to step 307, and if there is no stock, the process proceeds to step 404. Step 404: In Table 4, search for a file server in which the number of transactions currently in operation is small and the file server operation flag in Table 1 is 1. If there is no corresponding file server and the host computer 11 is in stock, it is lined up in the queue of the host computer 11, and if there is no stock in the host computer 11, it is sold out, so the process is terminated and the process proceeds to step 308. If there is a corresponding file server, access it and proceed to step 304. This file server is out of stock,
When the host computer 11 is in stock, it is in the queue of the host computer 11. When all the file servers and host computers 11 corresponding to this step are out of stock, they are sold out.

The processing flow after step 404 is shown in FIG. Hereinafter, each step will be described. Step 501: Look for a file server that has less than a predetermined number of transactions being processed and an RF of 1 (may be still in the file server). If there is a file server, proceed to step 502, and if not, proceed to step 505. Step 502: Check whether the file server is in stock. If there is an inventory, sell it, otherwise proceed to step 503. Step 503: Check whether the host computer 11 is in stock. If it is in stock, sell it, otherwise go to step 504. Step 504: If there is a corresponding file server among the file servers checked in Step 501,
If it does not proceed to step 502, it is determined that it is sold out. Step 505: Since there is no file server to be accessed, it is checked whether the host computer 11 has an inventory. If it is in stock, it is sold, and if it is not, it is sold out. If there is no more stock, step 4
It is possible to wait until the number of transactions processed by the file server first trying to access at 01 decreases and then to access there.

Next, when the host computer 11 runs out of stock, or just before the stock runs out, even though a part of the file server is in stock, FIG.
Will be explained. Step 601: Search for a file server that is set to "1" in the file server operation flag of RF. Step 602: If there is a file server that is “1”, the process proceeds to step 603. However, if all the file servers are “0”, it has already been uploaded, so if there is no stock in the host computer 11, it is sold out. Step 603: From among them, select a file server with a slow sales rate. The method is as follows: (1) The smallest number of sales, (2) The smallest number of sales / assignment,
(3) The number of remaining sheets is the maximum (4) The number of remaining sheets / the number of assigned sheets is the maximum. Therefore, in addition to RF and ZF, a file for storing the number of sheets assigned to each host and each file server for each train is prepared at the time of downloading. If you decide on a file server that sells slowly, upload it to the host. Step 604: Subtract RF 'and ZF' of the uploaded file server and add RF and ZF of the host.

Alternatively, a method of uploading to the host computer 11 when a predetermined time has passed after downloading to the file server may be used.

As a result, the passenger cannot purchase the ticket even though the file server has inventory.
Eliminate the inconvenience. In the configuration of FIG. 1, an example in which one host computer 11 and a plurality of file servers are described has been described, but a plurality of host computers may be used, or even one file server may be applied to the present embodiment. Needless to say.

In the first embodiment, the host computer 11 has the authority to download and upload files. In the second embodiment, it is assumed that the file server has the authority and the file server gives the above-mentioned instruction. For ease of file management, the storage location of the file is set to the host computer 11 except during peak hours. File servers 1, 2, ... n have RF with authority
Are train 1, train 2, ... Train n, respectively. Table 5 shows the relationship between the file server authority and the RF name.

[0041]

[Table 5]

In the table, the flag 1 being set means that "download can be instructed", and the flag 1 being set to u means "upload is possible". . For example, the file server 1 can instruct to download the file “train 1” and can also upload it. It also indicates that the other files can be uploaded but cannot be instructed to be downloaded. “Instructing download” means which file server and how many seats to assign, and Table 6 shows the contents.

[0043]

[Table 6]

The file server 1 that has the authority to download a file called train 1 is a host computer 11 (file server 0) and a file server 1.
It is shown that ZF of'seat xx 'is assigned from Tables 1 to n as shown in Table 6. ZF called'seat xx '
The content of is a set of the car number and the seat number, and indicates whether or not the seat is vacant. Details are shown in Table 2. The authoritative file server can also change the number of ZF seats when needed.

Instead of Table 6, the vehicle number may be managed as shown in Table 7.

[0046]

[Table 7]

Cars 1 and 2 of this train are downloaded to the host computer 11, and cars 3 and 4 are downloaded to the file server 1. Table 5, Table 6 (or Table 7)
Is placed on the host computer 11, and RF, ZF is set based on the instruction from the authorized file server before sales.
Is downloaded from the host computer 11 to each file server.

FIG. 7 shows the procedure of this embodiment. Step 701: Instruct the host computer 11 how each file server distributes authorized files before selling. The host computer 11 refers to Table 5 and checks whether the file server is an authorized file server, and then downloads according to the instruction from each file server. Step 702: The file server waits for an inquiry about reservation or sale from the terminal. If a query occurs,
Go to step 703. Step 703: If the file server has stock, go to Step 705, otherwise go to Step 704. Step 704: The host computer 11 accepts reservation or sale. Step 705: The stock quantity of RF 'is subtracted. Step 706: Sell the seat owned by the file server. Step 707: Set the ZF 'flag to' 10 'or' 1.
Set to 1 '. Step 708: Each file server has a file that it has authority for and a file that has two types of personality assigned by another file server. Both these two types of files are the host computer 11
The permission to upload to is on the file server where the file currently resides (as shown in Table 5),
And If uploading (end of sales), proceed to step 709. If not uploading (continue sales), proceed to step 702. Step 709: Upload to the host computer 11, the file server updates RF 'and ZF', and the sale on the file server ends. The host computer 11 updates RF and ZF.

In this embodiment, since the organization having each file server can determine the amount of sales to be requested to other organizations and the amount of sales to be undertaken by itself, a flexible selling method can be realized.

Also, at step 708, it is stated that "the authority to upload is on the file server where the file now exists", but if there is no loss on the file server side and there is no loss on the file server side, From the file server side, it is possible that they do not actively upload. In that case, each file may be given to a file server that has the authority to upload and the authority to download.

Therefore, Table 5 and Table 6 or Table 7 are provided not only in the host computer 11 but also in each file server. For example, the RF of train 1 in Table 5 is
Only the file server 1 has the authority to download and upload. In this case, file server 1
If the stock becomes low, the file server 1 inquires of the other file servers and the host computer 11 about the stock. The file server (and the host computer 11) whose inventory is referred to is that the file server 1 uploads the RF train 1 in Table 5 (the host computer 11
Check if the file server has the authority to download). If it can be confirmed that the user has the authority, in Table 6 or Table 7, the ZF of the train 1 he owns is searched, and the inventory quantity is answered. Alternatively, instead of searching ZF, a file for managing the number of remaining seats of each ZF may be prepared and the value may be answered.

The file server 1 instructs a file server having a large inventory to upload or instructs the host computer 11 to download to the file server 1. Upon receiving the instruction, the file server and the host computer 11 upload the ZF owned by itself to the host computer 11 from the file server, or download the ZF from the host computer 11 to the file server 1.

In the above description, it has been stated that Table 5 and Table 6 or Table 7 are stored in the host computer 11 and all file servers, but Table 5 is divided into tables of file servers that have the authority to download. The host computer 11 may store the table of the file servers having the authority to upload the file in all the file servers. The information given to the file server may be limited to only the ZF name of the own file server by dividing Table 6 and Table 7 as well. For example, in Table 5, ZF stored in the file server 1 is'seat 14 ',' seat 1 '
Only 5 ',' seat 16 ', and'seat 17 may be used.

In this example, the organization having each file server decides the amount to be sold to another organization,
See the sales, cancel the request and sell it yourself,
Because you can decide, you can have a flexible sales method.

In the first and second embodiments, the start of sales of all trains is concentrated at a specific time of day. In the third embodiment, the sales start time will be described as "the departure time from the first departure station on the day one month before the departure date of the train".

Table 8 shows a sales start date table for a special day.

[0057]

[Table 8]

It is a correspondence table to the day when there is no same day in the previous month. Three
The ticket sale date of 29th of month corresponds to February 29th, but in the year which is not a leap year, the ticket sale date of March 29th is March 1st.

Table 9 shows an RF and ZF management table for each departure time of the first departure station.

[0060]

[Table 9]

The time of departure from the starting station of all trains,
The RF name and ZF name are stored. Two trains depart from the starting station at a time b and a train at a time (b + 1), and the time becomes the designated ticket sales start time. Also, at a time (b
It means that there is no train departing from the starting station at +2) minutes.

FIG. 8 shows a flowchart of this embodiment. Here, it is assumed that RF and ZF are all present in the host computer 11 (files are concentrated on the host). Step 801: Host computer 11 before sales start
Prepare RF and ZF and lock their files. Even if the sales request is accidentally accessed from the terminal, the sales can be refused until the sales start time. Step 802: Calculate the boarding date of the train to be sold today. If the same day of the previous month is calculated and there is no such day, Table 8
Refer to. Step 803: Start from 0:00, and proceed to step 804 every 1 minute. Step 804: In Table 9, it is investigated whether or not there is a train departing from the starting station at a time b minutes (when the time when the vehicle has advanced from step 803 is a time b minute). If yes, go to step 805; if no, go to step 803. Step 805: If there is a corresponding train, R of that train
Unlock F and ZF. This makes these files accessible from the terminal. Step 806: Determine whether to continue selling tickets. If it is to continue, the process proceeds to step 803.

Although the RF and ZF are all resident in the host computer 11 here, the files may be dynamically moved as described in the first and second embodiments. Have inventory files on your file server before a peak is expected, and after a certain time interval
If the host computer is low in inventory, you can find a file server with high inventory and upload it to the host computer. Therefore, as shown in Table 1, a table showing the operating status of each file server is required.

As a fourth embodiment, FIG. 9 shows a flowchart combining FIG. 3 and FIG. (This is an example of dynamically moving a file.) Steps 801, 802, 3
01 is a process on the host computer 11 side, and the subsequent processes are a process on the file server side. On the file server side, in parallel with the processing of FIG. 9, the processing of steps 803, 804, 805, and 806 of FIG.
Unlock the ZF file. As a result, the file of the file server can be accessed in step 303.

In the fourth embodiment, the host computer 11 has the authority to download and upload files, but it is also possible to give the authority to the file server. In step 301, each file server instructs how to divide RF and ZF as in step 701, and in the host side, steps 803, 804, 80
5, there is a method of unlocking the file and downloading the unlocked file to each file server according to the instruction of step 301.

Alternatively, the method may be such that, if instructed in step 301, the file is immediately downloaded to the file server, and the file server side repeats the processing of steps 803 to 806 to unlock the file.

Also, as described in the second embodiment, a file server that has the authority to upload and download a certain file may run out of stock in its own file server, or some time after downloading. After the passage of time, it is of course possible to move the inventory file from another file server to the own file server, upload it to the host computer, or download the inventory file on the host computer to the own file server.

In the third and fourth embodiments, the configuration of FIG. 1 is cited, but it goes without saying that there may be a plurality of host computers or one file server, and this embodiment is applicable. Yes.

The third and fourth embodiments have the effect that the peak load does not concentrate at a specific time.

In the first to fourth embodiments, the ticket sales for trains have been described as an example, but the present invention can be applied to concerts, baseball fields, etc. where stocks are limited and applications are concentrated at the start of sales. Needless to say.

[0071]

According to the present invention, the load at the peak of sales can be reduced.

[Brief description of drawings]

FIG. 1 is a system configuration diagram of a host computer, a file server, a terminal, and the like.

FIG. 2 is a diagram showing an example of how data is distributed.

FIG. 3 is a flowchart of a method for moving a file.

FIG. 4 is a flowchart of determining a computer to process a transaction.

FIG. 5 is a flowchart for searching for a computer in stock.

FIG. 6 is a flowchart of countermeasures when the host is out of stock.

FIG. 7 is a flowchart of a method for moving a file.

FIG. 8 is a flowchart of a selling method when the selling start time is shifted.

FIG. 9 is a flowchart of a sales method when the sales start time is shifted.

[Explanation of symbols]

File server, 11 ... Host computer, 12 ... LAN, 10, 20, 3
0 ... Public line network, 1a, 1b, 2a, na ... Terminal.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Tsutomu Tashiro, 1099, Ozenji, Aso-ku, Kawasaki-shi, Kanagawa, Ltd. Inside the Hitachi, Ltd. Systems Development Laboratory (72) Inventor, Susumu 12: 890, Kashimada, Kawasaki-shi, Kanagawa Information Systems Division, Hitachi, Ltd.

Claims (21)

[Claims] [Claim 1] Transportation flights and seat reservations, concerts,
In the so-called reservation / sale computer system that sells tickets for baseball fields, etc., from the first computer system that stores files before the start of reservation / sale,
A reservation and sales method characterized in that a file for accepting reservations / sales is extracted and arranged in a second computer system, and reservations or sales are accepted by the second computer system at a certain time interval after the start of reservations or sales. [Claim 2] Transportation flights, seat reservations, concerts,
In the so-called reservation / sale computer system that sells tickets for baseball fields, etc., from the first computer system that stores files before the start of reservation / sale,
A file for accepting reservations / sales is extracted and arranged in the second computer system, reservations or sales are accepted by the second computer system for a certain time interval after the start of reservation or sales, and there is no inventory in the second computer system. A pre-sale method, wherein the first computer system accepts reservations or sales when the second computer system cannot be accessed. [Claim 3] Transportation flights and seat reservations, concerts,
In the so-called reservation / sale computer system that sells tickets for baseball fields, etc., from the first computer system that stores files before the start of reservation / sale,
A file that accepts reservations / sales is extracted and arranged in a plurality of second computer systems, and reservations or sales are accepted by the second computer system at a certain time interval after the start of the reservation or sales, and the inventory is stored in the second computer system. When the first computer system accepts reservations or sales when the second computer system cannot be accessed or when the second computer system cannot be accessed, the second computer system different from the above is used when the first computer also has no stock. Reservation sales method characterized by access. [Claim 4] The reservation / sales start date and time is set in association with the departure date and time of transportation, the concert performance date, and the performance time so that reservation / sales applications are not concentrated at specific times of the day. Reservation sales method characterized by doing so. 5. The reservation sales method according to claim 4, wherein a file for accepting reservations / sales is stored in one computer system. 6. The second aspect of claim 4, wherein a file for accepting reservation / sales is stored from a first computer system storing the file for accepting reservation / sales before starting reservation / sale of a ticket or the like. Move to the computer system of
Reservation and sales method characterized by accepting reservations and sales with the computer system of. 7. The method according to claim 4, wherein a file for accepting reservation / sales is started from the first computer system storing the file for reservation / sales before starting the reservation / sales of the ticket. Move to the computer system of
Accepting reservations and sales through our computer system
The reservation sales method, wherein the first computer accepts the reservation / sale when the second computer is out of stock or the second computer cannot be accessed. 8. The method according to claim 1, wherein the files arranged in the second computer system are moved again to the first computer system after a certain time interval has passed. How to make a reservation sale. 9. A reservation / sale of a ticket or the like according to any one of claims 1, 2, 6 and 7, when an object of reservation / sale of a ticket or the like to be sold by the first computer system falls below a certain amount. A reservation selling method characterized by locating a second computer system having a file for accepting reservations and moving the file for accepting reservations / sales to the first computer system. 10. The number of seats remaining in the first computer and whether the second computer is operating, or whether the files have been moved to the first computer according to any one of claims 1, 2, 3, and 4. , A reservation for tickets, etc. to be sold on the first computer system.
From the second computer system that holds the file for accepting the sale, the second computer system that holds the inventory
The reservation selling method characterized by locating the computer system of the above from the table and moving the file for accepting the reservation and sale to the first computer system. 11. The number of seats remaining in the first computer and whether the second computer is operating, or whether the file has been moved to the first computer according to any one of claims 1, 2, 3, and 4. , A reservation for tickets, etc. to be sold on the first computer system.
From the second computer system that holds the file for accepting the sale, the second computer system that holds the inventory
The method of pre-sale is characterized in that the computer system is searched from the table, and the file for accepting the reservation / sale is moved to the first computer system from the table. 12. The number of seats remaining in the first computer and whether the second computer is operating, or whether the files have been moved to the first computer according to any one of claims 1, 2, 3, and 4. , A reservation for tickets, etc. to be sold on the first computer system.
From the second computer system that holds the file for accepting the sale, the second computer system that holds the inventory
Is searched from the table, and the file for accepting reservation / sales is moved from the second computer system having a slow sales speed to the first computer system. 13. The slow selling speed in claim 12 means (1) a small number of reservations / sales, (2) a small number of reservations / sales / allocated (3) a large number of stocks (4) a stock The pre-sale method is characterized in that either the number / the number of allocated sheets is large. 14. A reservation selling method according to any one of claims 1, 2, 3, 6, 7, and 8, wherein an instruction to move a file is issued by a first computer system. 15. The reservation selling method according to any one of claims 1, 2, 3, 6, 7, and 8, wherein an instruction to move a file is issued by a second computer system. 16. The method according to claim 1, 2, or 6,
A reservation and sales method characterized in that the first and second computer systems realize reception of reservations and sales, respectively, singular or plural. 17. The reservation sales method according to claim 3, wherein the first computer system realizes reception of reservations and sales regardless of whether the first computer system is single or plural. 18. The time interval according to any one of claims 1, 2, 3, 6, 7, and 8 means (1) a predetermined time has elapsed from the start of sales, and (2) a predetermined number of sheets. (3) The pre-sale method, which is one of the cases where the number of sales per predetermined time is below a certain level. 19. The reservation / sale object such as a ticket sold by a certain second computer system according to any one of claims 1, 2, 3 and 6, or a predetermined amount or less, or a predetermined value. After the lapse of time, a search is made for another second computer system that has a file for accepting reservation / sales of tickets, and the file for accepting reservation / sales is stored in the second computer system. Reservation sales method characterized by moving. 20. In any one of claims 1, 2, 3 and 6, a reservation / sales object such as a ticket sold by a certain second computer system is less than a certain amount or a certain predetermined amount. After a lapse of time, the other second computer system having a file for accepting reservation / sales such as tickets is searched for, and the file for accepting reservation / sales is moved to the first computer system. Reservation sales method characterized by that. 21. In any one of claims 1, 2, 3 and 6, a reservation / sales object such as a ticket to be sold by a certain second computer system is below a certain amount, or a predetermined amount. After the time elapses, moving the file for accepting reservations / sales from the first computer system having the files for accepting reservations / sales such as tickets to the second computer system. Reservation sales method featuring.