JP6891527B2 - Database write controller - Google Patents

Description

The present invention relates to a database write control device, a database write control method, and a program.

It includes a sensor that transmits the data obtained by sensing (hereinafter referred to as sensor data) to the server device, and a server device that has a database that stores the sensor data and registers the sensor data received from the sensor in the above database. A sensor network system has been proposed (see, for example, Patent Document 1).

Japanese Patent No. 50698884

By the way, in order to cope with a situation where the traffic of data that is generated every moment such as sensor data is temporarily increased, a queue that temporarily stores the data before being written to the database may be provided. In this case, the server device temporarily stores the data received from the sensor or the like in the queue, and when it becomes possible to write to the database, the server device takes out the data from the queue and writes it to the database. When retrieving data from the queue, the server device retrieves the oldest data stored in the queue.

However, in a configuration in which the server device retrieves data to be written to the database by a fixed method of fetching data from a queue that stores one or more data in chronological order, the load on the database is high, so the write process to the database is performed. If you can't keep up, the data available in the database will be out of date.

An object of the present invention is to provide a database write control device that solves the above-mentioned problems.

The database write control device according to one embodiment of the present invention is
A database write control device that controls the writing order of data to be written to the database.
A queue that temporarily stores the data and
A queue registration unit that writes the data to the queue,
A load status detection unit that detects the load on the database,
A queue retrieval unit that determines data to be fetched from the queue for writing to the database from one or more of the data stored in the queue based on the load of the database.
including.

The database write control method according to another embodiment of the present invention is
A database write control method executed by a computer that has a queue that temporarily stores the data to be written to the database.
Write the data to the queue,
Detects the load on the database and
From one or more of the data stored in the queue, the data to be fetched from the queue for writing to the database is determined based on the load of the database.

Programs according to other embodiments of the present invention
A computer that has a queue that temporarily stores the data to be written to the database
A queue registration unit that writes the data to the queue,
A load status detection unit that detects the load on the database,
A queue retrieval unit that determines data to be fetched from the queue for writing to the database from one or more of the data stored in the queue based on the load of the database.
To make it work.

By having the above-described configuration, the present invention can prevent the data that can be referred to in the database from becoming old even when the writing process to the database cannot keep up with the load on the database.

It is a figure which shows the structural example of the database write control apparatus which concerns on 1st Embodiment of this invention. It is a figure which shows an example of the data structure managed in the write-waiting queue area in the database write control apparatus which concerns on 1st Embodiment of this invention. It is a figure which shows an example of the data structure which chains a plurality of data on the queue in the database write control apparatus which concerns on 1st Embodiment of this invention. It is a flowchart which shows an example of the operation of the queue registration part in the database write control device which concerns on 1st Embodiment of this invention. It is a flowchart which shows an example of the operation of the queue fetching part in the database write control apparatus which concerns on 1st Embodiment of this invention. It is a flowchart which shows another example of the operation of the queue fetching part in the database write control apparatus which concerns on 1st Embodiment of this invention. It is a figure which shows the configuration example of the database write control apparatus which concerns on 2nd Embodiment of this invention. It is a flowchart which shows an example of the operation of the queue fetching part in the database write control apparatus which concerns on 2nd Embodiment of this invention. It is a figure which shows the structural example of the database write control apparatus which concerns on 3rd Embodiment of this invention. It is a figure which shows the structural example of the database write control apparatus which concerns on 4th Embodiment of this invention.

[First Embodiment]
Next, the first embodiment of the present invention will be described in detail with reference to the drawings.

<Outline of this embodiment>
The database write control device according to the present embodiment normally writes data to the database in the order registered in the queue. However, the database write control device fetches data from the middle or the end of the queue as needed, and preferentially writes newer data to the database. By doing so, the database write control device can refer to the latest information from the database as much as possible.

<Problems to be solved by this embodiment>
An example of the data to be written to the database is the location information of the aircraft. As a controller, I want to keep track of the latest aircraft position information. The reason is that after a certain amount of time, newer information is generated, and the value of the previous information is greatly reduced. However, when viewed as historical information, it is desirable to record all aircraft position information, including old ones, in the database.

When configuring a system that records and refers to information such as aircraft position information, if a large amount of information is generated or the system is in a degenerate state due to a failure, etc., the writing process cannot keep up and can be referred to in the database. The information may be out of date. The above problem can be avoided, but there is a problem that the cost is high if the configuration is such that the maximum amount of information generated in advance is assumed or the configuration is made redundant in preparation for the occurrence of a failure.

<Solution by the present embodiment>
The database write control device according to the present embodiment manages the data write order to the database in a queue. In normal times, the database write control device takes out data in order from the beginning of the queue and writes it to the database. That is, in normal times, the database write control device takes out the data stored in the queue most recently and writes it to the database. However, when there is a concern that writing data to the database will be delayed and it will be difficult to refer to the latest information when the load is high, the database write control device will give priority to writing newer data to the database. To retrieve data from the middle or end of the queue. This ensures that as much new information as possible is always available from the database. In addition, the database write control device finally takes out the postponed data from the queue and writes it to the database. As a result, all the information including the old information is stored in the database as history information.

<Structure of this embodiment>
FIG. 1 shows an example of the configuration of the database write control device 100 according to the present embodiment. Further, FIG. 1 shows an example of a system configuration in which the database write control device 100 is used to provide the measured / collected information to the operator. Each arrow in FIG. 1 indicates a data flow until the information measured / collected by each sensor unit 101 is referred to by the data reference program 111.

The sensor unit 101 transmits the measured / collected information to the data receiving unit 102. For example, each sensor unit 101 may include a radar, GPS, or the like mounted on each aircraft. The position information of the aircraft collected by each sensor unit 101 is transmitted to the data receiving unit 102 by wireless communication. The position information includes, for example, the latitude, longitude, and altitude of the aircraft. Further, the above-mentioned position information may further include information for identifying the sampled time and the sensor unit 101 (hereinafter, referred to as a sensor ID). Hereinafter, the position information of the aircraft will be referred to as "data".

The data receiving unit 102 receives the data transmitted from each sensor unit 101, and sends a data writing request to the queue registration unit 103 of the database writing control device 100. The data writing request includes data received from each sensor unit 101.

The database write control device 100 includes a queue registration unit 103, a write-waiting queue area 104, a queue retrieval unit 105, a target queue selection means 106, and a load status detection means 107.

The queue registration unit 103 that receives the data write request accesses the write waiting queue area 104, and adds the data included in the data write request to the end of the queue provided for each sensor ID of each sensor unit 101. To do.

The write-waiting queue area 104 is a storage area for temporarily holding data for which a data write request has been made. FIG. 2 shows an example of a data structure managed in the write-waiting queue area 104.

Referring to FIG. 2, the write-waiting queue area 104 has a pair of queue control information 200 and queue 210 for each sensor ID.

The queue 210 is an area for storing a plurality of data 211 in a chain. The queue control information 200 includes a sensor ID 201, a start position pointer 202, and a take-out position pointer 203. The head position pointer 202 is a pointer that points to the head data 211 of a plurality of data 211 chained in the queue 210. In normal times, the data pointed to by the head position pointer 202 is fetched from the queue 210. The take-out position pointer 203 is a pointer that points to the data 211 to be taken out in a high load situation. The chaining of the head position pointer 202, the retrieval position pointer 203, and the data 211 is updated with the addition of the data 211 by the queue registration unit 103 and the retrieval of the data 211 by the queue retrieval unit 105.

FIG. 3 shows an example of a data structure in which a plurality of data 211 are chained. In the example of FIG. 3, three data 211-1 to 211-3 are chained. Each data 211 includes a sensor ID 221, a collection time 222, sensing data 223, a forward pointer 224, and a backward pointer 225. The sensor ID 221, the collection time 222, and the sensing data 223 are elements that constitute data transmitted from the sensor unit 101. The forward pointer 224 is a pointer that points to the previous data 211 on the chain. The backward pointer 225 is a pointer that points to the next data 211 on the chain. The forward pointer 224 and the backward pointer 225 are added to the data 211 when they are registered in the queue 210, and are removed when they are taken out from the queue 210.

In the example of FIG. 3, of the three data 211-1 to 211-3, the data 211-1 is first registered in the queue 210, then the data 211-2 is registered in the queue 210, and finally the data 211- 3 indicates the status of being registered in the queue 210. At this time, the data 211-1 is referred to as the head data of the plurality of chained data 211 or the oldest data. Further, the data 211-3 is referred to as the last data of the plurality of chained data 211 or the latest data. Further, the data 211-2 is referred to as data intermediate between a plurality of chained data 211. Further, the data 211-1 is referred to as the previous data and the data 211-3 is referred to as the next data when viewed from the data 211-2. The forward pointers 224 of the data 211-2 and 211-3 other than the first data 211-1 point to the previous data 211-1 and 211-2. The forward pointer 224 of the first data 211-1 is, for example, a NULL value. The backward pointers 225 of the data 211-1 and 211-2 other than the data 211-3 at the end point to the data 211-2 and 211-3 one after. The backward pointer 225 of the trailing data 211-3 is, for example, a NULL value. Further, in the example of FIG. 3, the head position pointer 202 points to the head data 211-1. The take-out position pointer 203 points to the last data 211-3.

Referring to FIG. 1 again, the target queue selection means 106 selects a queue for fetching data from a plurality of queues 210 in the write-waiting queue area 104. The selection criterion can be, for example, the time order of data registration. Alternatively, the selection criterion can be a predetermined priority order among the sensor IDs. Alternatively, the selection criteria may differ between high load and normal times of the database 120. Alternatively, the selection criteria may be other criteria determined according to the characteristics of the system of FIG. 1 constructed by the user. The target queue selection means 106 notifies the queue extraction unit 105 of the selected queue.

The load status detecting means 107 detects the load status of the database 120. The method of detecting the load status of the database 120 is arbitrary. For example, the load status detecting means 107 measures the usage rate of the CPU (Central Processor Unit), which is an element of the hardware constituting the database 120, and detects the load status of the database 120 based on the measured CPU usage rate. You can. For example, the load status detecting means 107 may be set to "high load" if the CPU usage rate is higher than the threshold value, and "low load" (normal time) if the CPU usage rate is equal to or lower than the threshold value. Alternatively, the load status detecting means 107 measures the disk input / output (I / O) usage rate of the disk device which is an element of the hardware constituting the database 120, and the database 120 is based on the measured disk I / O usage rate. You may detect the load status of. For example, the load status detecting means 107 may be set to "high load" if the disk I / O usage rate is higher than the threshold value, and "low load" (normal time) if the disk I / O usage rate is equal to or lower than the threshold value. In the above, the load of the database 120 is detected based on the CPU usage rate and the disk I / O usage rate, but the load status detecting means 107 detects the load status of the database 120 from the usage status of resources other than the CPU and the disk. You can. Alternatively, the load status detecting means 107 may detect the load status of the database 120 by receiving a command indicating the load status of the database 120 from the operator. Alternatively, the load status detecting means 107 may detect the load status of the database 120 by using another method determined according to the characteristics of the system of FIG. 1 constructed by the user.

When the queue fetching unit 105 can write data to the database 120, the queue fetching unit 105 fetches one data 211 from the write-waiting queue area 104, and the data writing unit 108 reads the retrieved data 211 to the database 120. Request registration. The queue 210 in the write-waiting queue area 104 from which the queue fetching unit 105 retrieves data 211 is the queue 210 selected by the target queue selection means 106. Further, the queue taking-out unit 105 retrieves data 211 from the queue 210 based on the load status detected by the load status detecting means 107. That is, if the database 120 has a high load, the queue retrieval unit 105 retrieves the data 211 pointed to by the retrieval position pointer 203. Further, if the database 120 has a low load (normal time), the queue fetching unit 105 retrieves the data 211 pointed to by the head position pointer 202.

The database 120 includes a data writing unit 108, a plurality of storage devices 109, and a data reading unit 110. The data writing unit 108 receives the data writing request from the queue fetching unit 105 and writes the data to the storage device 109. The storage device 109 is a storage area that actually stores data. Although there are a plurality of storage devices 109 in this example, at least one storage device 109 may be used. The data reading unit 110 accesses the storage device 109, acquires the written data, and passes it to the data reference program 111.

The data reference program 111 is a program that refers to the database 120. The data reference program 111 processes the data received from the data reading unit 110 and outputs it from an output device (not shown). For example, the data reference program 111 creates a graph, a track map, or the like based on the received data and displays it on the display.

<Operation of this embodiment>
FIG. 4 is a flowchart showing an example of the operation of the queue registration unit 103. When the queue registration unit 103 receives the data registration request from the data reception unit 102, the queue registration unit 103 performs the operation shown in FIG. First, the queue registration unit 103 confirms whether or not the queue 210 corresponding to the sensor ID included in the data registration request from the data reception unit 102 already exists in the write-waiting queue area 104 (E01). If it does not exist, the queue registration unit 103 generates a pair of queue control information 200 and queue 210 corresponding to the sensor ID included in the data registration request, registers the data 211 included in the data registration request in the queue 210, and ends. (E02).

On the other hand, when the queue 210 corresponding to the sensor ID included in the data registration request exists, the queue registration unit 103 registers the data 211 included in the data registration request at the end of the queue 210 (E03). Further, the queue registration unit 103 determines whether or not the retrieval position pointer 203 of the queue control information 200 needs to be updated based on a predetermined retrieval position update rule, and if necessary, registers the retrieval position pointer 203 this time. Update to point to 211. For example, the following can be considered as the take-out position update rule.
(A) The queue registration unit 103 updates the extraction position pointer 203 so as to point to the latest registered data each time data is registered.
(B) The queue registration unit 103 updates the extraction position pointer 203 so as to point to the latest registered data every time n data (n is a positive integer of 2 or more) is registered. For example, when five pieces of data are registered in the queue 210, the take-out position pointer 203 is updated so as to point to the last registered data, and then, when four pieces of data are registered, the take-out position pointer 203 is not updated.
(C) The queue registration unit 103 makes the determination of A or B for each sensor ID. That is, the queue registration unit 103 applies the rule A above if the queue 210 corresponds to a specific sensor ID, and applies the rule B above if the queue 210 corresponds to a queue other than the specific sensor ID.
However, the rule for updating the take-out position pointer 203 is not limited to the above example. The queue registration unit 103 may determine whether or not the take-out position pointer 203 needs to be updated based on other rules determined according to the characteristics of the system of FIG. 1 constructed by the user.

FIG. 5 is a flowchart showing an example of the operation of the cue extraction unit 105. When, for example, the queue fetching unit 105 receives a notification from the data writing unit 108 that the data writing unit 108 has finished writing the data currently being written and the next data can be written, the figure is shown in the figure. The operation shown in 5 is performed.

First, the queue extraction unit 105 determines the target queue 210 from which the data 211 is to be extracted according to the selection of the target queue selection means 106 (D01). Next, the queue extraction unit 105 determines whether or not the database 120 is in a high load state based on the detection result by the load status detecting means 107 (D02).

In normal times (unless the database 120 is heavily loaded), the queue fetching unit 105 retrieves the data 211 pointed to by the head position pointer 202 in the queue control information 200 of the selected queue 210 (D03). Next, the queue extraction unit 105 updates the head position pointer 202 so as to point to the data 211 immediately after the extracted data 211 (D04). Next, the queue extraction unit 105 requests the data writing unit 108 to write the extracted data 211 (D05).

On the other hand, if the load is high, the queue retrieval unit 105 retrieves the data 211 pointed to by the retrieval position pointer 203 in the queue control information 200 of the selected queue 210 (D06). Next, the queue take-out unit 105 updates the take-out position pointer 203 (D07). For example, if there is one or more data behind the fetched data 211, the queue fetching unit 105 updates the fetching position pointer 203 so as to point to the data 211 one or more behind the fetched data 211. Further, the queue extraction unit 105 updates the extraction position pointer 203 so as to point to the data 211 immediately before the extracted data 211 if there is no data after the extracted data 211. Next, the queue extraction unit 105 requests the data writing unit 108 to write the extracted data 211 (D05).

FIG. 6 is a flowchart showing another example of the operation of the queue extraction unit 105. In FIG. 6, the order of step D01 and step D02 shown in FIG. 5 is switched. With reference to FIG. 6, the queue retrieval unit 105 first determines whether or not the database 120 is in a high load state (D02). Next, in normal times (when the load is not high), the queue take-out unit 105 determines the queue 210 selected by the target queue selection means 106 based on the selection criteria in normal times as the target queue (D01A). Then, the cue extraction unit 105 performs the same processing as in steps D03 to D05 of FIG. On the other hand, if the load is high, the queue take-out unit 105 determines the queue 210 selected by the target queue selection means 106 based on the selection criteria at the time of high load as the target queue (D01B). Then, the cue extraction unit 105 performs the same processing as in steps D06, D07, and D08 of FIG.

<Effect of this embodiment>
According to the present embodiment, when the load of the database 120 is high, the writing of the newly generated data on the queue 210 to the database 120 is prioritized. Therefore, when referencing the data, the latest data as much as possible should be obtained from the database 120. Can be done.

The data on the queue 210 whose writing to the database 120 has been postponed is temporarily unavailable from the database 120. However, since the new data on the queue 210 is written in order or the old data is written in order when returning to normal time, all the data can be referred to from the database 120 in the end.

[Second Embodiment]
FIG. 7 shows an example of the configuration of the database write control device 100A according to the second embodiment of the present invention. The database write control device 100A according to the present embodiment is different from the database write control device 100 in that the data destruction determination means 112 is further included as compared with the database write control device 100 shown in FIG. Other than that, it is the same as the database write control device 100.

The data destruction determining means 112 determines whether or not the data 211 taken out from the queue 210 needs to be written to the database 120 based on the value of the data 211. For example, the following can be considered as the criteria for determining the necessity of writing based on the value of the data 211.
(A) The data destruction determining means 112 determines that the data whose registration time in the queue 210 is older than a certain time is sufficiently low in value and determines that the data does not need to be written, and determines that the other data needs to be written. In this case, the queue registration unit 103 assigns a registration time to the data 211 and stores it in the queue 210. The data destruction determining means 112 compares the registration time assigned to the data 211 with the current time, and determines whether or not the registration time is older than a certain time.
(B) The data discard determination means 112 determines that the data of the sensor that does not need to be closely watched at that time and whose value is within the range of prediction is sufficiently low in value and that writing is unnecessary. It is determined that other data needs to be written. Whether or not the data destruction determination means 112 is the data of the sensor that does not need to be watched at that time is based on, for example, whether or not the data of the sensor that needs to be watched is the data of the sensor specified by the command from the operator. to decide. Further, the data destruction determining means 112 determines whether or not the data is within the prediction range, for example, the estimated value calculated by interpolation or the like based on the data registered in the queue 210 before that and the value of the data. If the error is within a certain value, it is determined to be predictable data, otherwise it is determined to be unpredictable data.

FIG. 8 is a flowchart showing the operation of the queue extraction unit 105 that determines whether or not a data writing request is generated based on the determination content of the data destruction determination means 112. FIG. 8 is different from FIG. 5 in that steps D08 and D09 are added, and is the same as FIG. 5 except for the addition.

Referring to FIG. 8, when the load of the database 120 is high (Yes in D02), the queue fetching unit 105 uses the data discard determination means 112 to determine whether or not the data 211 fetched from the queue 210 needs to be written to the database 120. Judgment (D08). Then, if writing is unnecessary, the queue fetching unit 105 discards the data without sending a write request to the data writing unit 108 (D09). On the other hand, if writing is required, the queue retrieval unit 105 sends a write request for the data to the data writing unit 108 (D05).

As described above, according to the present embodiment, the necessity of writing to the database 120 is determined based on the value of the data 211 fetched from the queue 210, and the data is generated without generating a write request for the data that does not need to be written. Discard. As a result, if it can be determined that it is not necessary to write the data to the database 120 after the data has been postponed to be written to the database 120, the write request for the data can be discarded without being generated. As a result, it is possible to suppress the amount of writing to the database 120 and devote resources to writing the data to be retained at a minimum.

Further, according to the present embodiment, all the data fetched from the queue 210 can be written to the database 120 during normal times when the load is not high. However, as another embodiment of the present invention, the data destruction determining means 112 may always determine whether or not the data taken out from the queue 210 needs to be written to the database 120 regardless of the heavy load and the normal time.

[Third Embodiment]
FIG. 9 is a block diagram of the database write control device 100B according to the third embodiment of the present invention. The computer device 300 constituting the database write control device 100B according to the present embodiment includes a CPU 51, a memory 302, a recording device 303 such as a hard disk for storing programs and data, and an I / F (Interface) 304 for network connection. Including. Further, the computer device 300 is connected to the input device 306 and the output device 307 via the bus 305.

The CPU 301 operates an operating system to control the entire computer device 300. Further, the CPU 301 may read a program or data from a recording medium 308 mounted on a drive device or the like and store the program or data in the memory 302. Further, the CPU 301 includes a data receiving unit 102, a queue registration unit 103, a queue fetching unit 105, a target queue selecting means 106, a load status detecting means 107, a data writing unit 108, a data reading unit 110, and a data reference program shown in FIG. 111, it functions as the data destruction determination means 112 of FIG. 7, and executes various processes based on the program. The CPU 301 may be composed of a plurality of CPUs.

The memory 302 is, for example, a random access memory (RAM) or the like. A part of the memory 302 is used as a write-waiting queue area 104. The recording device 303 is, for example, an optical disk, a flexible disk, a magnetic disk disk, an external hard disk, a semiconductor memory, or the like. A part of the recording device 303 is used as the storage device 109 of the database 120. The recording medium 308 is a non-volatile storage device, and a program executed by the CPU 301 is recorded therein. The recording medium 308 may be a part of the recording device 303. Further, the program may be downloaded from an external computer (not shown) connected to the communication network via the I / F 304.

The input device 306 is realized by, for example, a mouse, a keyboard, a built-in key button, or the like, and is used for an input operation. The input device 306 is not limited to a mouse, a keyboard, and a built-in key button, and may be, for example, a touch panel. The output device 307 is realized, for example, on a display and is used to confirm the output.

As described above, the database write control device 100B according to the present embodiment is realized by the hardware configuration and the program shown in FIG. However, the hardware configuration is not limited to the configuration shown in FIG. For example, the input device 306 and the output device 307 may be externally attached via the interface 304.

Further, the computer device 300 may be realized by one physically connected device, or may be realized by connecting two or more physically separated devices by wire or wirelessly and these plurality of devices. Good.

[Fourth Embodiment]
Referring to FIG. 10, the database write control device 100C according to the fourth embodiment of the present invention is a device that controls the write order wait control of the data 411 to be written in the database 410. The database write control device 100C includes a queue 401, a queue registration unit 402, a load status detection unit 403, and a queue retrieval unit 404.

The queue 401 has a function of temporarily storing data 411. The queue registration unit 402 has a function of writing data 411 to the queue 401. The load status detection unit 403 has a function of detecting the load of the database 410. The queue retrieval unit 404 has a function of determining data to be retrieved from the queue 401 for writing to the database 410 from among one or more data 411 stored in the queue 401 based on the load of the database 410.

The database write control device 100C configured in this way operates as follows. First, when the data 411 to be written to the database 410 is input to the database write control device 100C, the queue registration unit 402 writes the data 411 to the queue 401.

On the other hand, when writing data to the database 410, the load status detection unit 403 first detects the load of the database 410. Next, the queue retrieval unit 404 determines from among one or more data 411 stored in the queue 401, the data to be retrieved from the queue 401 for writing to the database 410 based on the load of the database 410.

As described above, according to the present embodiment, even when the writing process to the database 410 cannot keep up with the load of the database 410, it is possible to prevent the data that can be referred to by the database 410 from becoming old. it can. The reason is that the queue fetching unit 404 determines the data to be fetched from the queue 401 for writing to the database 410 from the one or more data 411 stored in the queue 401 based on the load of the database 410. is there.

[Other Embodiments]
In the above-described embodiment, the load status detecting means 107 classifies the load status of the database 120 into high load and normal time, but may detect it by classifying it into three or more. For example, in the load status detecting means 107, if the resource usage rate such as the CPU usage rate and the disk I / O usage rate is equal to or higher than the first threshold value, the database 120 has the maximum load and is smaller than the first threshold value. If it is less than the threshold value of, the database 120 may detect that it is the minimum load, and if it is equal to or more than the second threshold value and less than the first threshold value, it may be detected as an intermediate load. Then, the queue fetching unit 105 extracts the data at the end of the queue 210 if the database 120 has the maximum load, extracts the data at the beginning of the queue 210 if the load is the minimum, and ends the queue 210 if the database 120 has an intermediate load. It may be configured to retrieve data between the beginning and the beginning.

In the above-described embodiment, the data to be written in the database is the position information of the aircraft detected by the sensor unit, but the sensor data other than the position information of the aircraft, for example, the sensing data of the sensor that detects temperature, humidity, wind speed, etc. The present invention can also be applied when writing to a database.

The present invention can be used for all systems that write data measured and collected by sensors into a database, and can be particularly used for a system that inquires and stores aircraft position information in air traffic control.

100 ... Database write control device 100A ... Database write control device 100B ... Database write control device 100C ... Database write control device 101 ... Sensor unit 102 ... Data receiving unit 103 ... Queue registration unit 104 ... Write waiting queue area 105 ... Queue retrieval unit 106 ... Target queue selection means 107 ... Load status detecting means 108 ... Data writing unit 109 ... Storage device 110 ... Data reading unit 111 ... Data reference program 112 ... Data discard determination means 200 ... Queue control information 201 ... Sensor ID
202 ... Start position pointer 203 ... Extraction position pointer 210 ... Queue 221 ... Sensor ID
222 ... Collection time 223 ... Sensing data 224 ... Forward pointer 225 ... Backward pointer 300 ... Computer device 301 ... CPU
302 ... Memory 303 ... Recording device 304 ... Interface 305 ... Bus 306 ... Input device 307 ... Output device 308 ... Recording medium 401 ... Queue 402 ... Queue registration unit 403 ... Load status detection unit 404 ... Queue extraction unit 410 ... Database 411 ... Data

Claims (7)

A database write control device that controls the writing order of data to be written to the database.
A queue that temporarily stores the data and
A queue registration unit that writes the data to the queue,
A load status detection unit that detects the load on the database,
A queue retrieval unit that determines data to be fetched from the queue for writing to the database from one or more of the data stored in the queue based on the load of the database.
An area for storing a start position pointer that points to the oldest data among the data in the queue, and an area for storing a fetch position pointer that points to the latest data among the data in the queue.
Including
The queue fetching unit determines whether to fetch the data pointed to by the head position pointer or the data pointed to by the fetch position pointer based on the load of the database.
Database write controller. Further including a data destruction determination unit that determines whether or not the data taken out from the queue needs to be written to the database based on the value of the data.
The database write control device according to claim 1. The data is the data sensed by the sensor.
The queue exists for each sensor.
The database write control device according to claim 1 or 2. A target queue selection unit for determining from which queue of the queues for each sensor the queue extraction unit retrieves the data is further included.
The database write control device according to claim 3. The queue fetching unit preferentially retrieves the data written in the queue more recently from the queue as the load on the database is higher.
The database write control device according to any one of claims 1 to 4. A queue that temporarily stores the data to be written to the database, a start position pointer that points to the oldest data among the data in the queue, and a fetch position pointer that points to the latest data among the data in the queue. It is a database write control method executed by a computer having
Write the data to the queue,
Detects the load on the database and
From one or more of the data stored in the queue, the data to be retrieved from the queue for writing to the database is determined based on the load of the database .
In the determination, it is determined whether to retrieve the data pointed to by the start position pointer or the data pointed to by the fetch position pointer based on the load of the database .
Database write control method. A queue that temporarily stores the data to be written to the database, a start position pointer that points to the oldest data among the data in the queue, and a fetch position pointer that points to the latest data among the data in the queue. Computer with
A queue registration unit that writes the data to the queue,
A load status detection unit that detects the load on the database,
From one or more of the data stored in the queue, the data to be retrieved from the queue for writing to the database is determined based on the load of the database, and in the determination , based on the load of the database. , A queue extraction unit that determines whether to extract the data pointed to by the head position pointer or the data pointed to by the extraction position pointer.
A program to make it work.

Images