JP2018132971A - Database writing control device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To solve a problem that data that can be referenced in a database is old when the database writing processing cannot catch up due to a high database load.SOLUTION: A queue registration unit writes data to be written in a database into a queue. A load state detection unit detects a load of the database. A queue extraction unit, based on the load of the database, determines data to be extracted from the queue for writing to the database from one or more data stored in the queue.SELECTED DRAWING: Figure 1

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 data obtained by sensing (hereinafter referred to as sensor data) to a server device, and a server device that has a database that stores the sensor data and registers sensor data received from the sensor in the database. A sensor network system has been proposed (see, for example, Patent Document 1).

Japanese Patent No. 5069884

  By the way, in order to be able to cope with a situation in which data traffic that occurs every moment, such as sensor data, temporarily increases, a queue that temporarily stores data before being written to a 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 the data can be written to the database, the server device extracts the data from the queue and writes it into the database. When retrieving data from the queue, the server device retrieves the oldest data stored in the queue.

  However, in the configuration in which the server device retrieves data for writing to the database in a certain method of retrieving data from the queue that stores one or more data in the oldest order, the database processing is high because the load on the database is high. If it cannot catch up, the data that can be referenced in the database will be out of date.

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

A database write control device according to an aspect of the present invention provides:
A database write control device that performs control of waiting for the order of writing data to be written to a database,
A queue for temporarily storing the data;
A queue registration unit for writing the data to the queue;
A load status detection unit for detecting the load of the database;
A queue retrieval unit that determines data to be retrieved from the queue for writing to the database from one or more of the data stored in the queue based on a load on the database;
including.

A database writing control method according to another aspect of the present invention is as follows.
A database write control method executed by a computer having a queue for temporarily storing data to be written to a database, comprising:
Writing the data to the queue;
Detecting the load on the database,
Of the one or more data stored in the queue, data to be retrieved from the queue for writing to the database is determined based on the load on the database.

A program according to another aspect of the present invention is:
A computer having a queue for temporarily storing data to be written to a database;
A queue registration unit for writing the data to the queue;
A load status detection unit for detecting the load of the database;
A queue retrieval unit that determines data to be retrieved from the queue for writing to the database from one or more of the data stored in the queue based on a load on the database;
And 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 catch up because the load on the database is high.

It is a figure which shows the structural example of the database write control apparatus which concerns on the 1st Embodiment of this invention. It is a figure which shows an example of the data structure managed in the write waiting queue area | region in the database write control apparatus concerning the 1st Embodiment of this invention. It is a figure which shows an example of the data structure which chains several data on the queue in the database write control apparatus concerning the 1st Embodiment of this invention. It is a flowchart which shows an example of operation | movement of the queue registration part in the database write control apparatus concerning the 1st Embodiment of this invention. It is a flowchart which shows an example of operation | movement of the queue extraction part in the database write control apparatus concerning the 1st Embodiment of this invention. It is a flowchart which shows the other example of operation | movement of the queue extraction part in the database write control apparatus concerning the 1st Embodiment of this invention. It is a figure which shows the structural example of the database write control apparatus which concerns on the 2nd Embodiment of this invention. It is a flowchart which shows an example of operation | movement of the queue extraction part in the database write control apparatus concerning the 2nd Embodiment of this invention. It is a figure which shows the structural example of the database write control apparatus which concerns on the 3rd Embodiment of this invention. It is a figure which shows the structural example of the database write control apparatus which concerns on the 4th Embodiment of this invention.

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

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

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

  When configuring a system that records and references information such as aircraft location information, if a large amount of information is generated or the system is in a degraded state due to a failure, etc., the writing process cannot catch up and can be referenced in the database Information may be out of date. If a configuration that assumes the maximum amount of information that occurs in advance or a configuration that provides redundancy in case of a failure occurs, the above problem can be avoided, but there is a problem that costs increase.

<Solution by this embodiment>
The database write control apparatus according to the present embodiment manages the data write order to the database in a queue. The database write control device retrieves data from the top of the queue in order during normal times and writes it to the database. In other words, the database write control device takes out the data registered in the queue most recently from the data stored in the queue during normal times and writes it in the database. However, if there is a concern that the writing of data to the database will be delayed during high load, etc., and it will be difficult to refer to the latest information, the database writing control device will preferentially write newer data to the database. Therefore, data is extracted from the middle or end of the queue. Thereby, as new information as possible can always be referred to from the database. Further, the database write control device finally takes out the postponed data from the queue and writes it in the database. Thereby, all information including old information is stored in the database as history information.

<Configuration of this embodiment>
FIG. 1 shows an example of the configuration of the database write control apparatus 100 according to the present embodiment. FIG. 1 shows an example of the configuration of a system that provides the operator with the measured / collected information using the database writing control device 100. Each arrow in FIG. 1 indicates a data flow until the data reference program 111 refers to information measured and collected by each sensor unit 101.

  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 or a GPS mounted on each aircraft. The aircraft position information collected by each sensor unit 101 is transmitted to the data reception unit 102 by wireless communication. The position information includes, for example, the latitude, longitude, and altitude of the aircraft. The position information may further include the collected time and information for identifying the sensor unit 101 (hereinafter referred to as sensor ID). Hereinafter, the position information of the aircraft is referred to as “data”.

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

  The database write control apparatus 100 includes a queue registration unit 103, a write queue region 104, a queue extraction unit 105, a target queue selection unit 106, and a load status detection unit 107.

  Upon receiving the data write request, the queue registration unit 103 accesses the write wait 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 requested to be written. FIG. 2 shows an example of the data structure managed in the write wait queue area 104.

  Referring to FIG. 2, the write queue area 104 has a pair of queue control information 200 and a 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 head position pointer 202, and an extraction position pointer 203. The head position pointer 202 is a pointer that points to the head data 211 of the plurality of data 211 chained in the queue 210. At normal times, the data pointed to by the head position pointer 202 is taken out from the queue 210. The extraction position pointer 203 is a pointer that points to data 211 to be extracted in a high load situation. The chaining of the head position pointer 202, the extraction position pointer 203, and the data 211 is updated as the data 211 is added by the queue registration unit 103 and the data 211 is extracted by the queue extraction unit 105.

  FIG. 3 shows an example of a data structure for chaining a plurality of data 211. In the example of FIG. 3, three pieces of 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 at the time of registration in the queue 210 and are removed at the time of removal from the queue 210.

  In the example of FIG. 3, among the three data 211-1 to 211-3, the data 211-1 is first registered in the queue 210, the data 211-2 is registered in the queue 210, and finally the data 211- Reference numeral 3 denotes a status registered in the queue 210. At this time, the data 211-1 is referred to as the head data or the oldest data of the plurality of chained data 211. The data 211-3 is referred to as the last data of the plurality of data 211 chained or the latest data. The data 211-2 is referred to as intermediate data among the plurality of chained data 211. Further, when viewed from the data 211-2, the data 211-1 is called the previous data, and the data 211-3 is called the next data. The forward pointer 224 of the data 211-2 and 211-3 other than the head data 211-1 points to the previous data 211-1 and 211-2. The forward pointer 224 of the top data 211-1 is, for example, a NULL value. The backward pointer 225 of the data 211-1, 211-2 other than the tail data 211-3 points to the next data 211-2, 211-3. The backward pointer 225 of the tail data 211-3 is, for example, a NULL value. 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 again to FIG. 1, the target queue selection unit 106 selects a queue from which data is to be extracted from among the plurality of queues 210 in the write wait queue area 104. Selection criteria can be, for example, in the order of data registration. Alternatively, the selection criterion can be a predetermined priority order between the sensor IDs. Alternatively, the selection criteria may be different between when the database 120 is heavily loaded and when it is normal. 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 unit 106 notifies the queue extraction unit 105 of the selected queue.

  The load status detection unit 107 detects the load status of the database 120. A method for detecting the load status of the database 120 is arbitrary. For example, the load status detection unit 107 measures the usage rate of a CPU (Central Processor Unit), which is a hardware element constituting the database 120, and detects the load status of the database 120 based on the measured CPU usage rate. It's okay. For example, the load status detection means 107 may be “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 detection unit 107 measures the disk input / output (I / O) usage rate of a disk device that is a hardware element constituting the database 120, and the database 120 is based on the measured disk I / O usage rate. You may detect the load situation. For example, the load status detection unit 107 may set “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 lower than the threshold value. In the above, the load on the database 120 is detected based on the CPU usage rate and the disk I / O usage rate. However, the load status detection unit 107 detects the load status of the database 120 from the usage status of resources other than the CPU and the disk. It's okay. Alternatively, the load status detection unit 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 detection unit 107 may detect the load status of the database 120 using another method determined according to the characteristics of the system of FIG. 1 constructed by the user.

  When the data can be written to the database 120, the queue extraction unit 105 extracts one piece of data 211 from the write-waiting queue area 104, and sends the extracted data 211 to the database 120. Request registration. The queue 210 in the write waiting queue area 104 from which the queue extraction unit 105 extracts the data 211 is the queue 210 selected by the target queue selection unit 106. Further, the queue extraction unit 105 extracts the data 211 from the queue 210 based on the load status detected by the load status detection unit 107. That is, if the database 120 is heavily loaded, the queue extraction unit 105 extracts the data 211 pointed to by the extraction position pointer 203. Further, the queue extraction unit 105 extracts the data 211 pointed to by the head position pointer 202 if the database 120 has a low load (normal time).

  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 write request from the queue extraction unit 105 and writes the data to the storage device 109. The storage device 109 is a storage area that actually stores data. There are a plurality of storage devices 109 in this example, but at least one storage device 109 is sufficient. 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 wake map, etc. based on the received data and displays the graph 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 a data registration request from the data reception unit 102, the queue registration unit 103 performs the operation illustrated in FIG. First, the queue registration unit 103 checks 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 queue region 104 (E01). If not, the queue registration unit 103 generates a pair of the queue control information 200 and the 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 extraction position pointer 203 of the queue control information 200 needs to be updated based on a predetermined extraction position update rule, and if necessary, sets the extraction position pointer 203 to the data registered this time. Update to point 211. As the take-out position update rule, for example, the following can be considered.
(A) Each time the queue registration unit 103 registers data, the queue registration unit 103 updates the extraction position pointer 203 so as to indicate the latest registered data.
(B) The queue registration unit 103 updates the extraction position pointer 203 to indicate the latest registered data every time n pieces of data (n is a positive integer of 2 or more) are registered. For example, when five pieces of data are registered in the queue 210, the extraction position pointer 203 is updated so as to point to the last registered data, and thereafter, when the four pieces of data are registered, the extraction 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 if the queue 210 corresponds to a specific sensor ID, and applies the rule B if the queue 210 corresponds to other than the specific sensor ID.
However, the rule for updating the extraction position pointer 203 is not limited to the above example. The queue registration unit 103 may determine whether or not the extraction 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 queue extraction unit 105. For example, when the queue extracting unit 105 finishes writing the data currently written by the data writing unit 108 and receives a notification from the data writing unit 108 that the next data can be written, The operation shown in FIG.

  First, the queue extraction unit 105 determines a target queue 210 from which the data 211 is extracted in accordance with the selection by the target queue selection unit 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 state detection unit 107 (D02).

  When it is normal (when the database 120 is not heavily loaded), the queue extraction unit 105 extracts 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 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 extraction unit 105 extracts the data 211 pointed to by the extraction position pointer 203 in the queue control information 200 of the selected queue 210 (D06). Next, the queue extraction unit 105 updates the extraction position pointer 203 (D07). For example, if there is one or more data after the extracted data 211, the queue extraction unit 105 updates the extraction position pointer 203 to point to one or more data 211 after the extracted data 211. In addition, if there is no data after the extracted data 211, the queue extraction unit 105 updates the extraction position pointer 203 to point to the data 211 immediately preceding the extracted data 211, if any. Next, the queue extraction unit 105 requests the data writing unit 108 to write the extracted data 211 (D05).

  FIG. 6 is a flowchart illustrating 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. Referring to FIG. 6, the queue extraction unit 105 first determines whether or not the database 120 is in a high load state (D02). Next, when it is normal time (when it is not high load), the queue extraction unit 105 determines the queue 210 selected by the target queue selection unit 106 based on the normal selection criterion as the extraction target queue (D01A). Then, the queue extraction unit 105 performs the same processing as steps D03 to D05 in FIG. On the other hand, if the load is high, the queue extraction unit 105 determines the queue 210 selected by the target queue selection unit 106 based on the selection criterion at the time of high load as the extraction target queue (D01B). The queue extraction unit 105 performs the same processing as steps D06, D07, and D08 in FIG.

<Effect of this embodiment>
According to the present embodiment, when the database 120 is heavily loaded, priority is given to writing of newly generated data on the queue 210 to the database 120. Therefore, the latest data as much as possible is obtained from the database 120 when referring to the data. Can do.

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

[Second Embodiment]
FIG. 7 shows an example of the configuration of a database write control apparatus 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 database write control device 100A further includes a data discard determination unit 112, as compared with the database write control device 100 shown in FIG. Otherwise, it is the same as the database write control device 100.

The data discard determination unit 112 determines whether or not the data 211 extracted from the queue 210 needs to be written to the database 120 based on the value of the data 211. For example, the following may be considered as a criterion for determining whether or not writing is necessary based on the value of the data 211.
(A) The data discard determination unit 112 determines that data whose registration time in the queue 210 is older than a certain time is sufficiently low and determines that writing is not necessary, and determines that other data is required to be written. In this case, the queue registration unit 103 gives a registration time to the data 211 and stores it in the queue 210. The data discard determination unit 112 compares the registration time given to the data 211 with the current time, and determines whether the registration time is data older than a certain time.
(B) The data discarding determination unit 112 determines that the data of the sensor that does not need to be particularly watched at that time and whose value is within the prediction range is sufficiently low in value, and determines that writing is not necessary, The other data is determined to be written. The data discard determination unit 112 determines whether or not the sensor data need not be particularly watched at that time, for example, based on whether or not the sensor data specified by the command from the operator indicates that the data needs to be watched. to decide. In addition, the data discard determination unit 112 determines whether the data is within the prediction range, for example, an estimated value calculated by interpolation based on data previously registered in the queue 210 and the value of the data. If the error is within a certain value, it is determined to be predictable data, and the other 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 write request is generated according to the determination contents of the data discard determination means 112. FIG. 8 is different from FIG. 5 in that steps D08 and D09 are added, and is otherwise the same as FIG.

  Referring to FIG. 8, when the database 120 is under a high load (Yes in D02), the queue fetch unit 105 uses the data discard determination unit 112 to determine whether the data 211 retrieved from the queue 210 needs to be written to the database 120. Determine (D08). 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 necessary, the queue extraction 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 extracted from the queue 210, and the data is written without causing a write request for data that does not need to be written. Discard. As a result, if it is determined that there is no need to write data to the database 120 afterwards, data written to the database 120 can be discarded without generating a data write request. As a result, the amount of writing to the database 120 can be suppressed, and resources can be allocated for writing data that is to be kept at a minimum.

  Further, according to the present embodiment, all the data extracted from the queue 210 can be written into the database 120 during normal times when the load is not high. However, as another embodiment of the present invention, the data discard determination unit 112 may always determine whether or not the data extracted from the queue 210 needs to be written to the database 120 regardless of whether the load is high or normal.

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

  The CPU 301 controls the entire computer apparatus 300 by operating an operating system. Further, the CPU 301 may read a program or data from a recording medium 308 mounted on, for example, a drive device and store the program or data in the memory 302. The CPU 301 also includes the data receiving unit 102, the queue registration unit 103, the queue extraction unit 105, the target queue selection unit 106, the load status detection unit 107, the data writing unit 108, the data reading unit 110, and the data reference program shown in FIG. 111 functions as the data discard determination unit 112 in FIG. 7 and executes various processes based on the program. The CPU 301 may be configured by a plurality of CPUs.

  The memory 302 is, for example, a random access memory (RAM). 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 optical disk, an external hard disk, or a semiconductor memory. 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 records a program executed by the CPU 301 therein. The recording medium 308 may be a part of the recording device 303. The program may be downloaded via an I / F 304 from an external computer (not shown) connected to the communication network.

  The input device 306 is realized by, for example, a mouse, a keyboard, a built-in key button, and 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, but may be a touch panel, for example. The output device 307 is realized by a display, for example, and is used for confirming the output.

  As described above, the database write control device 100B according to the present embodiment is realized by the hardware configuration and 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.

  In addition, the computer apparatus 300 may be realized by one physically coupled apparatus, or may be realized by a plurality of apparatuses that are physically or physically connected by connecting two or more physically separated apparatuses. Good.

[Fourth Embodiment]
Referring to FIG. 10, a database write control device 100C according to the fourth embodiment of the present invention is a device that performs write order wait control of data 411 to be written to 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 extraction 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 on the database 410. The queue extraction unit 404 has a function of determining data to be extracted from the queue 401 for writing to the database 410 from one or more pieces of data 411 stored in the queue 401 based on the load on the database 410.

  The database write control device 100C configured as described above operates as follows. First, when 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 into the database 410, first, the load status detection unit 403 detects the load on the database 410. Next, the queue extraction unit 404 determines data to be extracted 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 on the database 410.

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

[Other Embodiments]
In the embodiment described above, the load status detection unit 107 classifies the load status of the database 120 into high load and normal time. However, the load status detection unit 107 may classify the load status into three or more. For example, the load status detection unit 107 indicates that the database 120 has the maximum load if the resource usage rate such as the CPU usage rate or the disk I / O usage rate is equal to or higher than the first threshold, and the second lower than the first threshold. If it is less than the threshold value, the database 120 may be detected as the minimum load, and if it is greater than or equal to the second threshold value and less than the first threshold value, it may be detected as an intermediate load. If the database 120 has the maximum load, the queue extraction unit 105 extracts the data at the end of the queue 210. If the database 120 has the minimum load, the queue extraction unit 105 extracts the data at the top of the queue 210. And an intermediate data between the head and the head may be extracted.

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

  INDUSTRIAL APPLICABILITY The present invention can be used in all systems for writing data measured and collected by sensors into a database, and in particular, can be used in a system for inquiring and storing aircraft position information in air traffic control.

DESCRIPTION OF SYMBOLS 100 ... Database write control apparatus 100A ... Database write control apparatus 100B ... Database write control apparatus 100C ... Database write control apparatus 101 ... Sensor part 102 ... Data receiving part 103 ... Queue registration part 104 ... Write waiting queue area 105 Queue extraction unit 106 Target queue selection unit 107 Load condition detection unit 108 Data writing unit 109 Storage device 110 Data reading unit 111 Data reference program 112 Data discard determination unit 200 Queue control information 201 Sensor ID
202 ... Leading position pointer 203 ... Extraction position pointer 210 ... Queue 221 ... Sensor ID
222 ... Collection time 223 ... Sensing data 224 ... Forward pointer 225 ... Back 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 (8)

A database write control device that performs control of waiting for the order of writing data to be written to a database,
A queue for temporarily storing the data;
A queue registration unit for writing the data to the queue;
A load status detection unit for detecting the load of the database;
A queue retrieval unit that determines data to be retrieved from the queue for writing to the database from one or more of the data stored in the queue based on a load on the database;
A database writing control device. An area for storing a start position pointer indicating the oldest data of the data in the queue; and an area for storing an extraction position pointer indicating the latest data of the data in the queue. ,
The queue extraction unit determines whether to extract the data pointed to by the head position pointer or the data pointed to by the extraction position pointer based on the load on the database;
The database write control device according to claim 1. A data discard determination unit that determines whether or not the data retrieved from the queue is to be written to the database based on the value of the data;
The database writing control apparatus according to claim 1 or 2. The data is data sensed by a sensor,
The cue exists for each sensor,
The database write control device according to claim 1. A target queue selection unit that determines from which queue of the queues for each sensor the queue extraction unit extracts the data;
The database writing control device according to claim 4. The queue extraction unit preferentially takes out the data written to the queue more recently from the queue as the load on the database is higher.
The database write control device according to claim 1. A database write control method executed by a computer having a queue for temporarily storing data to be written to a database, comprising:
Writing the data to the queue;
Detecting the load on the database,
Determining, from one or more of the data stored in the queue, data to be retrieved from the queue for writing to the database based on a load on the database;
Database write control method. A computer having a queue for temporarily storing data to be written to a database;
A queue registration unit for writing the data to the queue;
A load status detection unit for detecting the load of the database;
A queue retrieval unit that determines data to be retrieved from the queue for writing to the database from one or more of the data stored in the queue based on a load on the database;
Program to make it function.

Images