JP2001160014A - Method for transmitting queuing for reducing data amount - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce data to be registered in a queue by merging data, when data which can be merged with data to be registered in a queue by a program for operating data transmission are already registered in the queue. SOLUTION: At transmission and reception time of data between plural programs, a data transmission program retrieves whether data, which can be merged with data (data B), are already registered in a queue at registering of the data B in the queue, and when data (data A) which can be merged with the data to be registered are registered in the queue, the data transmission program reads the data A from the queue, merges the data A with the data B, prepares data (data AB) to be newly registered in the queue, and registers the data AB instead of the data A and the data B.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a system using a queue for transferring data between programs running on one or more computers.

[0002]

2. Description of the Related Art A data transmission system has been put to practical use for transferring data between programs operating on one or a plurality of computers via a queue.

In this type of data transmission system, when a program for transmitting data requests transmission of a program to be received, the data requested for transmission is registered in a queue as it is.

[0004]

In the queuing method of the conventional data transmission system, when a data transmitting program registers data in a queue, the data is registered irrespective of data already in the queue. Even when the data can be merged with the data already existing in the queue, the registration has been performed similarly. Therefore, the process of passing data to the program that performs data reception, the process of performing data processing of the program that performs data reception, and the computer resources for holding the data registered in the queue are performed by the program that performs data transmission. There was a problem that the number increased in proportion to the number of registered cases.

An object of the present invention is to reduce data to be registered in a queue by merging data when data that can be merged with data to be registered in the queue is already registered in the queue. Another object of the present invention is to provide a method for solving the above problem.

[0006]

In order to achieve the above object, according to the present invention, data that can be merged is searched from each data registered in a queue, merged with the data to be registered, and registered. .

When transmitting and receiving data between a plurality of programs, the data transmission program searches for data that can be merged with data B in the queue when registering data (referred to as data B) in the queue. When data that can be merged with the data to be merged (data A) is registered in the queue, data A is read from the queue, data A and data B are merged, and data to be newly registered in the queue (data AB and Is created) and data AB is registered in place of data B and data A. As a result, data registered in the queue is reduced, data is passed to the program that performs data reception, processing for processing data of the program that performs data reception, and a computer that retains data registered in the queue. Reduce resources.

[0008]

Embodiments of the present invention will be described below in detail with reference to the drawings.

FIG. 1 is a block diagram showing an outline of an embodiment of a transaction system to which the present invention is applied. In FIG. 1, a transaction system 1 comprises a transaction processing system 2, a board information distribution system 3, and a terminal 4, and is a system for electronically trading stocks and the like. Trading system 1
Uses a display method called a board as a means for displaying the order status. In the embodiment of the present invention, an order is placed on the transaction processing system 2 while viewing the board (order status) on the terminal 4,
When the order status changes in the transaction processing system 2, the terminal 4 is notified of the change in the order status through the board information distribution system 3 as board data, and the terminal 4 uses the board (order status) based on the board data. Is a system that displays Of course, a plurality of terminals 4 are provided, and board data is also notified of changes in order status due to orders placed from other terminals and the board (order status) is displayed.

Next, examples of plates (order status) are shown in FIGS.
This will be described with reference to FIG. The plate state 200 in FIG. 4, the plate state 210 in FIG. 5, and the plate state 220 in FIG. 6 are diagrams showing the order status of the brand A at times t1, t2, and t3, respectively. The relationship between t1, t2 and t3 is t1 <t2 <t3
And t3 is the latest time. In the plate state 200, the value 201 is 1 for a sell order with a price of the brand A of 102 yen.
Shows that there are 100 sheets. A value 202 indicates that there is one purchase order of 100 yen for brand A at 100 yen. At time t1, the transaction is not established because the sell and the buy do not exist at the same price. For example, at time t1, one sell order with a price of brand A of 100 yen is received from terminal 4;
When the order of 00 sheets is made, a transaction is established with the value 202, and the board (order status) becomes one with the value 202, and 100 pieces become 0 and 0 pieces. The same applies to FIGS. 5 and 6.

Next, an outline of a board information distribution system to which the data transmission system of the present invention is applied will be described with reference to FIG. FIG. 2 shows a detailed block diagram of the board information distribution system 3 of FIG. The board information distribution system 10 includes a distribution data creation process 20 and a distribution process 30. The distribution data creation processing 20 receives the board data from the transaction processing system 2 of FIG. 1, creates the data 21 that is difference data from the previous order status based on the board data, and creates the data 21 created for the delivery processing 30. Request for distribution.

The distribution process 30 includes a program 31 to 34 and a transmission queue 36 for temporarily storing one or more data 37 requested to be transmitted.

The queue control unit 31 performs a distribution data creation process 2
0 and whether there is data that can be merged in the data 21 in the transmission queue 36 and the data 21 in the transmission queue 36 based on the search conditions registered in advance in the queue management unit 34. When it is determined that there is data that can be merged with the data 21 and the function of requesting the search and the function of determining the search result of the queue management unit 34,
A function of merging data that can be merged with data 21 in a predetermined method, a function of requesting queuing execution unit 32 to read data 37, and merging data 21 or data that can be merged with data 21 in queuing execution unit 32 It has a function to request registration of data in a queue.

The queuing execution unit 32 includes a queue control unit 3
1 or in response to a request from the data transfer unit 32, the data 37 in the transmission queue 36 is read, and data obtained by merging data that can be merged with the data 21 is transmitted to the transmission queue 3
6 is provided.

Based on a search request from the queue control unit 31, the queue management unit 34 notifies the queue control unit 31 of a function of searching for data that can be merged with the data 21 from the data 37 in the transmission queue 36. It has the function to do.

The data distribution unit 33 has a function of reading data 37 in the transmission queue 36 via the queuing execution unit 32 and transferring the data 37 to the terminal 90 via the communication line 80.

Next, a method of registering data in the queue of the data transmission system applied to the distribution processing of the board information distribution system will be described with reference to the flowchart of FIG. 3 and FIGS.

FIG. 3 shows that the distribution data creation processing 20
21 is a flowchart showing a case in which a distribution request is received for the data 21, the merge control is determined by the queue control unit 31, the merge is performed according to the determination of the merge process, and the distribution data is registered in the transmission queue 36.

Data A211 which is the plate difference data of FIG.
Is board difference data created by the distribution data creation processing 20 when the board state 200 changes to the board state 210. A1C is a stock code and A1 is a price as attributes of data A211.
P, buy / sell category is A1B, update time is A1T, quantity is A1M, number is
A1K. The contents of the data A221 are as follows. When the board data update time A1T is t2, the order code A1C changes from the previous board data update time t1 at t1 as a change in the ordering status of A. A1
K indicates one case and A1M indicates 100 sheets.

Data B221 which is the plate difference data of FIG.
Is board difference data created by the distribution data creation processing 20 when the board state 210 changes to the board state 220. A2C for stock code and A2 for price as attributes of data B221
P, buy / sell category is A2B, update time is A2T, quantity is A2M, number is
A2K. The contents of the data B221 are as follows: when the board data update time A2T is t3, the order code A2C has changed from the previous board data update time t2 at t2 as a change in the ordering status of A. A2
K indicates that there were two, and the number A2M was 200.

The data AB 230 shown in FIG.
1 and data B221. As the attributes of the data AB230, the brand code is A3C, the price is A3P,
A3B for trading category, A3T for update time, A3M for quantity, A3K for number
And The content of the data AB230 is the board data update time.
A3T is t3 which is the previous plate data update time at t3.
The change of the order status of the stock code A3C from 1 o'clock A is the change of the order status of the price A3P is 101 yen, and the sales division A3B is the number of sell orders A3K.
Indicates that there were three cases and the number A3M was 300.

First, the distribution data creation processing 20 requests the queue control unit 31 to distribute the data 21, that is, the data B 221 in FIG. 8, to the terminal 90 (step 100).

The situation in the transmission queue 36 at the start of the flowchart of FIG. 3 is that the data A211 is not distributed by the data transfer unit 33 and is in the data 37 in the transmission queue 36.

The queue control unit 31 stores the data B22 in FIG.
In order to determine whether there is any data that can be merged among the data 37 in the transmission queue 36 with the data 1, a search request is made to the queue management unit 34 as to whether there is any data that can be merged. The queue control unit 31 passes the brand code A2C, the price A2P, and the trading category A2B, which are the attributes of the data B221 in FIG. 8, to the queue management unit 34 as attributes for determining whether merging is possible.

The queue management unit 34 searches the transmission queue 36 for data matching the values of the brand code A2C, the price A2P, and the trading category A2B, which are the attributes of the data B221.
It notifies the queue control unit 31 that the data A211 corresponds to the above (step 110).

The queue control unit 31 performs the processing in step 11
Brand code which is the attribute of data B221 as a result of 0
When it is determined that the data A211 that is data matching the values of A2C, price A2P, and trading category A2B is “present” in the data 37 in the transmission queue 36 (step 111), the data A211 is sent to the queuing execution unit 32. The queuing execution unit 32 reads data A211 from the transmission queue 36, and passes the data A211 to the queue control unit 31. In that case, the data transfer unit 33
Does not process the data A211 (step 120).

The queue control unit 31 reads the data A
The new data AB 230 is created by merging the data 211 with the data B 221 by a predetermined method (step 130).

The queue control unit 31 sends a registration request of the data AB 230 to the transmission queue 36 to the queuing execution unit 32
The queuing execution unit 32 transmits the data AB 230 passed from the queue control unit 31 to the transmission queue 36.
Is registered (step 140).

The situation in the transmission queue 36 at the start of the flowchart of FIG. 3 is the same as that of the above-described step 1 when the data A211 is distributed by the data transfer unit 33.
The determination of No. 11 is “not present” and the queue control unit 31
Makes a request to register the data B 221 to the transmission queue 36 to the queuing execution unit 32, and the queuing execution unit 32 transmits the data B 221 passed from the queue control unit 31.
1 is registered in the transmission queue 36 (step 170).

Next, a data merge method will be described with reference to the flowchart of FIG.

FIG. 9 shows that the order status of the brand A becomes the plate state 220 in FIG.
After making a data distribution request to the queue control unit 31, the queue management unit searches for data that can be merged with the data B221, and stores the data A21 in the transmission queue 36.
1 exists, and "data B221
And data A211 which is data that can be merged in the transmission queue 36 ".
, The queuing execution unit 32 reads the data A211 from the transmission queue 36, and performs the merge process of step 130 when the data A211 is passed to the queue control unit 31.
Data A, which is a merged data of data 221 and data A211
FIG. 18 is a diagram illustrating a case where B231 is created.

First, the update time A2T of the data B221 is substituted for the update time A3T of the data AB230 (step 300 in FIG. 10).

Next, the result of addition of the number A1M of data A211 and the number A2M of data B221 is referred to as data AB230.
(Step 310).

Next, the number A1K of data A211 and the number A2K of data B221 are added to the number A3K of data AB230.
(Step 320).

By performing steps 300 to 320, data AB230 of merge data of data A211 and data B221 is created.

The registration method and the merge method in the transmission queue 32 perform a search for mergeable data based on search conditions such as a brand code, a price, and a trade category, which are attributes of data, and perform a merge such as replacement or addition depending on the attribute. However, if the search condition registered in advance in the search request function to the queue management unit 34 of the queue control unit 31 and the merge method in the merge function are changed, search and search of mergeable data by another method can be performed. Merging is possible.

In addition to the embodiment of the present invention, the data in the queue and the data to be newly registered in the queue can be merged. If the merged data is registered in the queue, the data already in the queue can be merged. A system that processes data that has the characteristic that no data to be newly registered in the queue is required, or a system that processes data that has the characteristic that data in the queue can be replaced with data that is newly registered in the queue. The present invention can be used.

[0038]

As described above, according to the present invention,
In the data transmission system, since data registered in the queue is reduced by merging data, a process of passing data to a program for receiving data, a process for processing data of a program for receiving data, and a process of registering in a queue The computer resources for holding data can be reduced, and the efficiency of the data transmission system can be greatly improved.

[Brief description of the drawings]

FIG. 1 is a schematic system configuration block diagram shown in an embodiment of the present invention.

FIG. 2 is a block diagram showing a system configuration according to an embodiment of the present invention.

FIG. 3 is a flowchart showing a procedure of a registration method for a queue in FIG. 1;

FIG. 4 is a view showing a state of the A brand at the time t1.

FIG. 5 is a view showing a state of the A brand at time t2.

FIG. 6 is a view showing a state of the A brand at time t3.

FIG. 7 is a view showing plate difference data for changing a plate state between time t1 and time t2.

FIG. 8 is a view showing plate difference data for changing a plate state between time t1 and time t2.

FIG. 9 is a view showing plate difference data for changing a plate state between time t1 and time t3.

FIG. 10 is a flowchart illustrating the procedure of a merge process.

[Explanation of symbols]

10: board information distribution system, 20: distribution data creation processing program, 21: data to be registered in a queue, 30: distribution processing, 31: queue control program, 32: queuing execution program, 33: data transfer program, 3
4: Queue management program, 36: transmission queue, 37 ...
Data in the transmission queue, 80 ... network, 90 ... terminal.

Continuation of the front page (51) Int.Cl. ⁷ Identification code FI Theme coat II (Reference) G06F 15/21 Q (72) Inventor Akihiro Date 890 Kashimada, Saiwai-ku, Kawasaki-shi, Kanagawa Prefecture Information Systems Division, Hitachi, Ltd. ( 72) Inventor Akiko Matsushita 890 Kashimada, Yuki-ku, Kawasaki City, Kanagawa Prefecture F-term in the Information Systems Division, Hitachi, Ltd. 5K030 HA08 HB19 KA02 LA20 MB15

Claims (2)

[Claims] In a system for transferring data between programs operating on one or more computers using a queue, it is determined whether data registered in the queue and data already registered in the queue can be merged. And a means for creating new data from the data when the data to be registered in the queue and the data already registered in the queue can be merged. 2. When a data transmission program registers data (referred to as data B) in a queue, it determines whether data that can be merged with data B has already been registered in the queue, and determines whether data (data A) can be merged into the queue. ), Data B and data A are merged to create new data (referred to as data AB), and data AB is registered in a queue instead of data A and data B. How to queue the sending system.