JP4843016B2 - Database device - Google Patents

Description

  When managing the data generated every moment in the relational database (RDB), if the amount of the data is large, there is a risk of exceeding a preset storage area. For example, when storing a plurality of track position information used in logistics and monitoring information of a large number of articles on a production line using IC tags, such a problem is likely to occur.

  To solve this, the storage area can be simply increased, but the storage capacity is infinite. Therefore, in general, the following two methods are taken.

  The first is a method of securing an empty area by filling in the deleted portion because there is data that is unnecessary and deleted in the data stored in the storage area (see FIG. 1). (Referred to as filling process). In FIG. 1, the data 4 is moved to the third line, the data 6 is moved to the fourth line, the data 7 is moved to the fifth line, and so on. Thereby, the same number of records as the deleted data can be secured at the end of the storage area. Such a method is disclosed in Patent Document 1.

  The second is that new data is recorded in the record area from which the data has been deleted without performing the above-described filling process.

JP-A-11-110266.

  In the first method as described in Patent Document 1, in a system that frequently writes and deletes a large amount of data, a long time is required for the filling process, so the filling process is performed during operation. I couldn't. For this reason, there was a problem that it cannot be used in a continuous operation system such as a 24-hour operation.

  On the other hand, since the second method does not perform the filling process, the above problem does not occur. However, since the time order of the data is not aligned, a separate sort process is required to obtain the search results when the search is performed in the order of time. As a result, there has been a problem that the retrieval process is slow.

  SUMMARY OF THE INVENTION An object of the present invention is to provide a database system that solves the above-described problems, eliminates the need for a stuffing process that requires a long time, and allows a quick search process.

  Several independent aspects of the database device according to the present invention are described below.

(1) When the database device according to the present invention receives the data to be stored and the recording unit having the first storage area that can be recorded by the circulation method and the second storage area that can be recorded by the sequential method, If data is not stored in the storage location of one storage area, the data to be stored is stored in the location, and the data is recorded in the storage location of the first storage area After the data stored in the location is moved to the second storage area, the storage control means for storing the data to be stored in the location and the command to delete the data are received, When the number of data that can be additionally stored by the deletion control means for deleting the data from the second storage area and the sequential method of the second storage area becomes smaller than a predetermined value, the data is deleted in the second recording area. Stuffed Tokoro, and a packed processing means for increasing the number of possible additional stored data.

  Therefore, when the storage in the first storage area is completed, the data is stored in order of time from the top of the first storage area including the place where the data is deleted, and the storage location in the first storage area can be used effectively. At the same time, the temporal order of data in the first storage area of the circulation method is maintained. Further, in the above processing, the data remaining in the first storage area is moved to the second storage area while maintaining the temporal order. In this way, the database device can store the data in a time sequence in the first storage area and the second storage area without performing the filling process of the first storage area, and can perform a quick search process. Can be provided.

(2) The database device according to the present invention further comprises search processing means for searching for data stored in the first storage area and the second storage area when receiving a search command including a search condition. It is characterized by.

  Therefore, since the data is arranged in the storage area in the order of time stored in the database, a quick search process can be executed.

(3) The database apparatus according to the present invention is characterized in that the search processing means performs the search processing divided into the following a) b) c):
a) A search is performed for data from the location after the storage pointer indicating the location to be stored in the first storage area to the last location in the first storage area. b) Search for data from the first location in the first storage area to the storage pointer. c) Search for data in the second storage area.

  Therefore, since the temporal order is maintained in each search area, sorting in time order is easy, and the search can be executed quickly.

(4) The database device according to the present invention provides a storage capacity control means for increasing the storage capacity of the first storage area when the number of data deleted in the second storage area exceeds a predetermined number within a predetermined time. Is further provided.

  Therefore, it is possible to automatically control the storage capacity of the first storage area so as to reduce data deletion in the second storage area and prevent frequent processing in the second storage area.

(5) In the database device according to the present invention, when the number of data moved from the first storage area to the second storage area exceeds a predetermined number within a predetermined time, or based on a change over time in the number of moved data. It is characterized by further comprising a storage capacity control means for increasing the storage capacity of the first storage area when the calculated number of data to be moved within the predetermined time exceeds a predetermined number.

  Therefore, it is possible to automatically control the storage capacity of the first storage area so that the number of movement data from the first storage area to the second storage area does not increase and the processing load of data movement does not increase too much.

[Correspondence between Claims and Embodiments]
In the present invention, the “first storage area that can be recorded by the circulation method” corresponds to the main table (ring table) 5075 of the database control device 305. The “second storage area that can be recorded by the sequential method” corresponds to the secondary table (linear table) 5077 of the database control device 305.

  The “storage control means” corresponds to the processing functions of steps S701 to S703 in FIG. The “deletion control means” corresponds to the processing function shown in FIG. 8a or 8b. The “clogging processing means” corresponds to the processing function shown in (2.6) of “1.5 Database Program Processing”. The “search processing means” corresponds to the processing functions shown in FIGS. 9a and 9b.

  “A) Searching for data from the location after the storage pointer indicating the location to be stored in the first storage area to the last location in the first storage area” searches the area B in FIG. This is true. “B) Searching for data from the first location of the first storage area to the storage pointer” corresponds to searching the area A in FIG. “C) Searching the data in the second storage area” corresponds to searching the area C in FIG.

  “When the number of data to be deleted in the second storage area exceeds a predetermined number within a predetermined time” corresponds to step S1811 in FIG. 18 or as shown in (6) of the fourth embodiment. This corresponds to the case where the number of data deleted at the time of delivery exceeds a predetermined number within a predetermined time. The “storage capacity control means for increasing the storage capacity of the first storage area” corresponds to the processing function of step S1813.

  “When the number of data to be moved from the first storage area to the second storage area exceeds a predetermined number within a predetermined time, or moved within a predetermined time calculated based on a change over time in the number of data to be moved. The case where the number of data exceeds a predetermined number corresponds to the case corresponding to step S1903 in FIG. The “storage capacity control means for increasing the storage capacity of the first storage area” corresponds to the processing function of step S1905.

  In the present invention, “... Means” is a concept including functions of a CPU realized by a program. Here, the “program” is a concept including not only a program that can be directly executed by the CPU but also a program in a source format, a compressed program, an encrypted program, and the like.

1. 1. First Embodiment 1.1 Overall Configuration FIG. 2 shows an overall configuration diagram according to an embodiment of a database apparatus according to the present invention. In FIG. 2, the database device 1 includes a recording unit 200 having a first storage area 201 and a second storage area 203, storage control means 205, deletion control means 207, and clogging processing means 209.

  The first storage area 201 is a database that adopts a cyclic method in which data is recorded by returning to the first record when data has been recorded up to the last record, and the main table (ring table) shown in FIG. 15 corresponds to this. .

  The second storage area 203 is a database that employs a sequential method in which data is recorded after the last record that has not been deleted by searching in order from the first record to the last record, and the secondary table (linear table) shown in FIG. Corresponding to this.

  When the storage control unit 205 receives the data to be stored, the storage control unit 205 specifies a location to be stored in the first storage area 201 by a pointer, and stores any data to be stored if no data is stored at this location.

  On the other hand, if data has already been recorded at the recording location specified by the pointer, the data stored at this location is moved to the second storage area 203. Thereafter, since no data is stored in the location to be stored in the first storage area 201, the data to be stored can be stored. For example, in the main table (ring table) of FIG. 15, the data recorded in the pointer position record 153 is moved to the sub table (linear table). As a result, the record 153 becomes an empty record as shown in the main table of FIG. Therefore, new data can be recorded in the record 153.

  In this case, since the main table which is the first storage area 201 is recorded in a circular manner, the data is always recorded in the order of records. Therefore, it is not necessary to perform the filling process in the first storage area 201.

  When the data recording process is repeated in this way, the record group recorded in the area above the pointer is a collection of the most recently recorded records, and the record group recorded in the area below the pointer is recorded before that. A collection of recorded records. Also in the secondary table which is the second storage area 203, data is recorded in order from the first record.

  Therefore, as shown in FIG. 17, in the main table which is the first storage area 201, data is recorded separately in the areas A and B with the pointer P1 as a boundary, and each record is recorded in the areas A and B. Recorded in order of data generation. Further, in the secondary table which is the second storage area 203, data moved from the main table is recorded, and the data in the main table is recorded in the order of data generation. Therefore, also in the moved secondary table (area C). It will be recorded in the order of data generation. That is, in area C, data older than area B is recorded in the order of data generation.

  Thereby, in the first storage area 201 and the second storage area 203, the temporal order is maintained and the data is stored, so that it is not necessary to sort after the search, and the search process can be speeded up.

  When receiving a command to delete data, the deletion control unit 207 executes a process of deleting the data from the first storage area 201 or the second storage area 203. For example, in the main table or sub-table of FIG. 15, data whose data retention period has passed is deleted by batch processing.

  When the number of data that can be additionally stored by the sequential method of the second storage area 203 becomes smaller than a predetermined value, the filling processing unit 209 packs the place where the data has been deleted in the second recording area 203 and additionally stores the data that can be additionally stored. Execute processing to increase the number. In this case, since the first storage area 201 is not the target of the clogging process, the influence of the clogging process on the operating system can be reduced.

1.2 System Configuration In the present embodiment, an example of a system using the database device 1 will be described with reference to FIG. 3 in order to manage parts that are stored and received in an interprocess material storage area such as a factory. It should be noted that an RFID tag for identifying each component is attached to the component that is loaded and unloaded.

  On the warehousing gate side of the interprocess material storage 30 is provided a warehousing reader 301 for reading the RFID tag information of the parts to be admitted, and also on the warehousing gate side for reading the RFID tag information of the parts to be shed. A delivery reader 302 is provided. Since the warehousing reader 301 and the warehousing reader 302 are connected to the server device 303, the server device 303 can acquire the RFID tag information related to the parts that are warehousing or unloading at the interprocess material storage.

  The server device 303 is connected to a database control device 305 including a database 3051 via a network or the like. The database 3051 is for recording RFID tag information acquired by the server device 303.

  Further, the server device 303 is connected to a plurality of client devices 307. Each client device 307 is for searching for RFID tag information recorded in the database 3051 via the server device 303.

  When a part is stored in the inter-process material storage area 30 illustrated in FIG. 3, the storage reader 301 reads the RFID tag information attached to the part and transmits it to the server device 303. In response to this, the server device 303 transmits the RFID tag information of the warehousing parts to the database control device 305 (corresponding to the database device 1 in FIG. 1). In response to this, the database control device 305 records the RFID tag information of the incoming parts in the database 3051.

  Further, when a part is delivered from the inter-process material storage 30 illustrated in FIG. 3, the delivery reader 302 reads the RFID tag information attached to the part and transmits it to the server device 303. In response to this, the server device 303 transmits the RFID tag information of the outgoing parts to the database control device 305. In response to this, the database control device 305 records the RFID tag information of the outgoing parts in the database 3051.

1.3 Hardware Configuration of Server Device FIG. 4 shows an example of the hardware configuration of the server device 303 shown in FIG. In this embodiment, the server device 303 is a computer device, and includes a display 401, a CPU 403, a memory 405, a hard disk 407, a keyboard / mouse 409, and a CD-ROM drive 411. A reader 302 is connected.

  The hard disk 407 stores an OS (Operating System) 4071 and a data processing program 4073 for performing data processing according to the present invention. This program is installed by reading data recorded on the CD-ROM 4111 via the CD-ROM drive 411 or the like. The installation may be performed using data downloaded from the Internet or the like using a communication circuit or the like.

  As described above, the warehousing reader 301 and the warehousing reader 302 are for reading the RFID tags attached to the parts that are admitted to and removed from the interprocess material storage 30.

1.4 Hardware and Data Table Configuration of Database Controller FIG. 5 shows an example of the hardware configuration of the database controller 305 shown in FIG. In this embodiment, the database control device 305 is a computer device and includes a display 501, a CPU 503, a memory 505, a hard disk 507, a keyboard / mouse 509, and a CD-ROM drive 511.

  In addition to the OS (operating system) 5071, the hard disk 407 stores a database program 5073, a main table 5075, and a sub table 5077 for performing database control processing according to the present invention. This program is installed by reading data recorded on the CD-ROM 5111 via the CD-ROM drive 511 or the like. The installation may be performed using data downloaded from the Internet or the like using a communication circuit or the like.

  FIG. 11 shows an example of the main table 5075 and the sub table 5077. The main table 5075 shown in the main table (ring table) of FIG. 11 includes an ID 1101 for identifying an RFID tag, a bring-in time 1103 indicating the time when a part is received in the interprocess material storage area, and a part from the interprocess material storage area. The unloading time 1105 indicating the time when the item is issued and the data storage time limit 1107 indicating the time limit for storing the data record related to the ID 1101 in the main table 5075 are recorded.

  Here, the main table 5075 is recorded in a cyclic manner in which recording is performed sequentially from the first record 110 to the last record 11n, and after recording in the last record 11n, the recording is returned to the first record 110 again.

  A sub table 5077 shown in FIG. 11B has the same structure as the main table 5075.

1.5 Database program processing
(1) Outline of Processing The processing for recording RFID tag information of the parts that are stored in and out of the inter-process material storage 30 will be described with reference to FIG. In this processing, the CPU 403 of the server device 303 executes the data processing program 4073, and the CPU 503 of the database control device 305 executes the database program.

  When the CPU 403 of the server device 303 acquires the RFID tag information of the warehousing parts from the warehousing reader 301, the CPU 403 performs processing for storing the status data of the RFID tag information (step S601). For example, an ID included in the RFID tag information and a command for saving the ID as warehousing data are transmitted to the database control device 305.

  In response to this, the CPU 503 of the database control device 305 adds an erasure period corresponding to the state data to the ID (step S621). For example, as shown in the record 110 in the main table of FIG. 11, the data retention period “2008.10.24 11:31” is added to the ID “12916925” of the warehousing data.

  Next, the CPU 503 performs data storage processing on the first-stage ring table indicated by the pointer (step S623). For example, the record 110 in the main table of FIG. 11 is recorded in the top record of the main table. In this case, the current time acquired from the system date is recorded in the record 110 as the carry-in time “2008.9.24 11:31”.

(2) Details of Processing Details of the processing in step S623 will be described using the flowchart in FIG.

(2.1) Recording Process The CPU 503 determines whether or not any information (data record) is recorded in the previous record indicated by the pointer of the main table that is a ring table (step S701).

  If no information is recorded in the previous record indicated by the pointer, the CPU 503 records information (data record) in the record at the pointer position (step S703). For example, since no information is recorded in the previous record 113 indicated by the pointer in the main table of FIG. 11, new information is recorded in the record 113.

  A record 113 shown in the main table of FIG. 12 is an example of a record newly recorded in this case. In the record 113, an ID 1101 “28756113”, a carry-in time 1103 “2008.9.25 09:53”, and a data storage time limit 1107 “2008.12.25 09:53” are recorded. Here, the data retention period of the warehousing data is set using a retention period acquisition table set corresponding to the ID as shown in FIG. In this table, ID 1001, part name 1003, and storage time limit 1005 are recorded in association with each other, so that the storage time limit corresponding to the ID can be acquired. Since the retention period corresponding to ID 1101 “28756113” is “March” according to the record 100, “March” is added to the carry-in time 1103 “2008.9.24 15:59”, and the data retention period 1107 “2008.12” .24 15:59 "is calculated. It should be noted that the data retention period of the outgoing data is “January” from the carry-out time 1105.

  When information is recorded in the record, the CPU 503 advances the pointer position by one (step S705). For example, in the main table of FIG. 12, the pointer is advanced by one to the position of the record below the record 113. Thereby, when the next data storage instruction is received, the data record can be recorded at the pointer position.

(2.2) Deletion process As the record recording progresses, it becomes as shown in the main table (ring table) of FIG. The database program 5073 periodically executes the data cancellation process shown in FIGS. 8a and 8b in order to delete data records whose data retention period has passed in the main table (ring table) and the sub table (linear table). This data cancellation process is executed as a batch process once every 30 minutes, for example.

  In FIG. 8a, the CPU 503 acquires the first data record in the main table (ring table) as a processing target (step S801). For example, the record 110 in FIG. 11 is acquired.

  The CPU 503 determines whether or not the expiration date of the acquired data of the target record has passed the current time (step S803). For example, since the data retention period of the record 110 in FIG. 11 is smaller than the current time “2008.10.1 12:00” at “2008.10.24 11:31”, the data retention period of the record 110 has not yet elapsed. to decide.

  The CPU 503 repeats the determination process in step S803 for all data records in the main table (ring table) (steps S805 and S806). That is, if the target record in step S801 is not the last record of the main table, it is determined whether the expiration date has passed the current time with the next record of the target record as a new target record.

  If the CPU 503 determines that the expiration date of the acquired data of the target record has passed the current time (step S807, YES), the CPU 503 deletes the target data record from the main table. For example, since the data retention period “2008.9.31 12:01” of the record 111 in FIG. 11 is smaller than the current time “2008.10.1 12:00”, it is determined that the data retention period of the record 111 has passed. When the record 111 is deleted, the record 111 of the main table in FIG. 12 is obtained.

  As will be described later, in the secondary table (linear table), the data record of the main table having the data storage time limit is moved and recorded as it is, so that as shown in FIG. For the table, the same data revocation process as in FIG. 8a is executed.

(2.3) Pointer circular processing When record recording progresses, it becomes as shown in the main table (ring table) of FIG. 12, but the main table (ring table) has a pointer position for recording data in a circular manner. If the value exceeds the end of the data record, it must be changed to indicate the first data record. Processing in this case will be described below.

  In FIG. 7, when the pointer is advanced by 1 (step S705), the CPU 503 determines whether or not the current pointer position is longer than the ring table (step S707). That is, if the pointer position is indicated by the number of records, it is determined whether this number of records is greater than the maximum number of records that can be recorded in the entire ring table. For example, as shown in FIG. 13, when the numerical value indicating the pointer position exceeds the numerical value indicating the pointer position of the record 11n, the pointer position is larger than the maximum number of records.

  If it is determined that the numerical value indicating the pointer position is larger than the maximum number of records in the main table (ring table) (step S707), the CPU 503 performs processing to change the pointer to indicate the head of the ring table (step S708). For example, in FIG. 13, when the numerical value indicating the pointer position becomes larger than the numerical value indicating the pointer position of the record 11n, the pointer is moved to the first record 110.

  After the pointer moves to the first record 110, the latest record is recorded at the position 110, as shown in FIG.

(2.4) Data Movement Processing In step S701 described above, when the CPU 503 determines that information is recorded in the destination record indicated by the pointer, the CPU 503 performs data record movement / erasure processing on the information (step S702). For example, since the information of the data record associated with the ID “33110003” is recorded in the previous record 153 indicated by the pointer in the main table of FIG. 15, this record 153 is moved to the record 1501 of the sub table (linear table). At the same time, a process of deleting the information of the record 153 from the main table is executed.

  In this case, in the sub table, data records are recorded in order from the top. That is, recording is performed from the first record 1501 to the last record 150n.

  The main table and the sub table after step S702 are as shown in FIG. In this case, since the pointer after the data movement / erasure is at the position of the record 153, the next data record is written at the position of the record 153 in step S703.

(2.5) State after Recording FIG. 17 schematically shows a state in which data records are recorded to some extent in the main table (ring table) and the sub table (linear table) by the above processing.

  In this state, the main table bisects the area A and the area B with the position of the pointer P1 as a boundary, and the area of the sub table is the area C. In this case, new data is accumulated in the order of areas A, B, and C. In each region, data is arranged in the order of time of carry-in time or carry-out time.

  Therefore, when the data record search process is performed for the areas A, B, and C, it is not necessary to sort the search results in time order. For this reason, the search process can be performed quickly. Even when the carry-in time or the carry-out time is used as a search key, the search process can be performed quickly.

(2.6) Stuffing process As described above, the data erasing process shown in FIG. 8b is also executed in the sub-table, and the data records whose data retention period has passed are deleted. In this case, since information is not recorded in a part of the data records of the sub table (1703 and 1706 in FIG. 17), processing (stuffing processing) for sequentially filling the data is necessary. In this case, the stuffing process is started when the number of data that can be additionally stored in the sub-table becomes smaller than a predetermined value.

  For example, by moving the record 1704 to the position of the record 1703 and moving the record 1705 to the position of the record 1704, processing for filling the empty area is performed.

  Note that the filling process may be automatically executed by detecting the degree of missing teeth in the secondary table (linear table) (recording between records is discontinuous).

  As described above, since it takes a long time for the filling process, it is not easy to perform the filling process during operation, but in this case, the access frequency to the secondary table is less than that of the main table. There is an advantage that the sub-table (linear table) can be filled without greatly affecting the continuous operation system.

(2.7) Retrieval Processing An example of retrieving data records recorded in the main table and the sub table will be described with reference to FIGS. 9a and 9b.

  In S900 of FIG. 9A, the search condition is notified from the server apparatus 303 to the database control apparatus 305. For example, when searching for the part name “handle B”, IDs “10000001” to “2000000” corresponding to the handle B are notified as search conditions according to the table shown in FIG.

  The CPU of the database control device 305 first searches the first record from the first record in the sub-table in order, and temporarily stores the data records that match the search condition in the temporary area 90 (steps S901 to S909). Thereafter, the search is sequentially performed from the pointer position to the last record position of the main table, and similarly matching data records are temporarily stored in the temporary area 90 (steps S911 to 919). Further, the same search is performed from the first record of the main table to the record immediately before the pointer (steps S921 to 930).

  This search order will be described with reference to FIG. 17. Search is performed in the order of region C, region B, and region A. By performing the search in such an order, the data can be searched in order from the past in the storage time (carry-in time or carry-out time). Thereby, the search efficiency of data can be improved.

  When the CPU 503 finishes the search processing for all the areas, the CPU 503 transmits the stored data recorded in the temporary area 90 to the server device 303 as a search result (step S931). For example, data records with IDs “10000001” to “2000000” corresponding to the handle B are transmitted as search results.

2. Second Embodiment In the above embodiment, when the data movement from the main table (ring table) to the sub table (linear table) becomes frequent and a large load is applied to the filling process in the linear table, an efficient database is obtained. It becomes impossible to manage. Therefore, in the present embodiment, an example will be described in which the size (maximum number of records) of the main table (ring table) is automatically expanded according to the data record deletion status or movement status.

  Due to the expansion of the maximum number of records, the movement of records from the first storage area (ring table) to the second storage area (linear table) is reduced, and therefore it has been deleted in the second storage area (linear table) until then. Since data is deleted in the first storage area (ring table), the frequency of writing to and deletion from the second storage area (linear table) decreases. As a result, the processing speed of the entire system is improved by reducing the total number of processes.

2.1 Expansion by deletion status A predetermined limit is set for the number of times records are deleted from the secondary table (linear table) in the data cancellation process, and the ring table size (maximum number of records) is automatically set when the limit is exceeded. An example of a general extension will be described below.

  The data cancellation process shown in FIG. 18 is periodically executed, for example, once every 30 minutes, as in FIGS. 8a and 8b. In FIG. 18, the CPU 503 resets the deleted data number counter for counting the number of deleted data to zero (step S1800).

  The CPU 503 acquires the first data record in the sub table (linear table) as a processing target (step S1801). The CPU 503 determines whether or not the expiration date of the acquired data of the target record has passed the current time (step S1803). The CPU 503 repeats the determination process in step S1803 for all data records in the sub table (linear table) (steps S1805 and S1806). That is, if the target record in step S1801 is not the last record of the main table, it is determined whether the expiration date has passed the current time with the next record of the target record as a new target record.

  If the CPU 503 determines that the expiration date of the data of the acquired target record has passed the current time (step S1803, YES), the CPU 503 deletes the target data record from the sub table (linear table) (step S1808). When the data record is deleted from the sub table, the CPU 503 adds 1 to the deleted data number counter (step S1809).

  In this way, the CPU 503 repeats the above processing for all data and counts the number of deleted data. When the data cancellation process is completed for all the data records, it is determined whether or not the counted number of deleted data n is larger than a predetermined value V1 (step S1811).

  If the number of deleted data n is greater than V1, the maximum number of records S in the ring table is expanded based on the following formula (step S1813).

S = S × n / V1
As described above, when the number of data in the secondary table (linear table) to be deleted in the data cancellation process is equal to or larger than the predetermined value, the secondary table is expanded from the primary table (linear table) by expanding the primary table (ring table). The amount of data records moving to the table (linear table) can be reduced. Thereby, the data movement / deletion process executed in step S702 of FIG. 7 can be reduced, and the processing efficiency can be improved. As a result, the number of data records to be deleted increases in the data erasure process executed on the main table.

  In the above description, the movement status monitoring process is executed once every 30 minutes. However, the present invention is not limited to this, and the execution interval may be set longer or shorter. For example, if n records exceeding V (k−1) / k are deleted from the linear table while N (k−1) / k hours have elapsed with k being a natural number of 2 or more, the ring You may make it obtain | require the maximum number of records of a table with the following formula | equation.

S = S * n / V * k / (k-1)
As a result, when the number of deleted data at the time point when N hours elapses reaches a predetermined value V, the maximum number of records can be changed by predicting whether or not the limit is exceeded in advance.

2.2 Extension by Movement Status A predetermined limit is set for the number of data movement / deletion processes executed in step S702 in FIG. 7, and when the limit is exceeded or the limit is exceeded An example of automatically expanding the size (maximum number of records) will be described below.

  FIG. 7a is obtained by adding a process of adding 1 to the movement data number counter (step S704) after the process of step S702 of FIG. Further, the movement status monitoring process shown in FIG. 19 is a process periodically executed, for example, once every 30 minutes, as in FIGS. 8a and 8b.

  In FIG. 19, the CPU 503 reads a movement data number counter (step S1901). Here, the movement data number counter is incremented every time data is moved / erased from the main table to the sub table in FIG. 7a described above.

  The CPU 503 determines whether or not the value m of the movement data number counter is larger than the predetermined value V2 (step S1903).

  When the moving data number m is larger than V2, the maximum number of records S in the ring table is expanded based on the following formula (step S1905).

S = S × m / V2
As described above, when the number of data in the main table (linear table) to be moved / deleted in the data move / delete process is equal to or larger than a predetermined value, the main table (linear table) is expanded by expanding the main table (ring table). ) To the secondary table (linear table) can be reduced. Thereby, the processing load of the data movement / deletion processing executed in step S702 of FIG. 7 can be reduced, and the processing efficiency can be improved.

3. Third Embodiment In the above embodiment, the example of managing the parts that are stored in and out of the interprocess material storage area such as a factory has been described. However, the deletion time of each data record is different, so that the data is deleted between the data. The present invention can be applied to obtain a desired effect as long as the data is easily generated.

(1) Warehousing and unloading management of goods at distribution relay points At relay points where goods are collected and shipped by trucking, the time required for loading and unloading varies depending on the type of package and the shipping destination. For this reason, the erasing time of each data record is different, and a gap is generated between the data records in the database table.

  Therefore, the database can be used efficiently by applying the database apparatus of the present invention to the relay point collection / shipment system.

(2) A system involving multiple vendors Prepare a database device consisting of the above-mentioned main table and sub-table for each of multiple vendors that will receive and store packages, and manage the warehousing and shipping information at each vendor. It may be. For example, when a package placed on a truck is delivered after entering a relay point, this corresponds to a case where the entry trader is different from the delivery trader.

  In this case, the data record generated by each supplier is recorded in the database for the warehousing supplier with the expiration date set by the warehousing supplier, and the data of the shipping supplier is set in the database for the shipping supplier. Data can be recorded with the specified expiration date. As a result, it is possible to handle each piece of package data according to the supplier.

  It should be noted that the vendor ID may be recorded in the data records of the main table and the sub table, and the system may be managed by one database. Thereby, data management can be performed for each trader and for each package.

(3) Tool storage and use management In situations where tools are frequently put in and out of tool shelves, etc., when tools are expensive or security management is important, etc. Entry / exit management is required. For example, management when a small number of tools are shared by multiple processes at remote locations in a large factory, management of therapeutic equipment in hospitals, etc., or take-out management of special tools used for telecommunications It corresponds to.

  In the management of these tools, a data record is recorded at the time of take-out and return, and a process of erasing data when a predetermined time has elapsed since the return is performed.

4). Fourth embodiment
(1) In the above embodiment, only the main table (ring table) is configured as a circulation system, but the secondary table (linear table) may also be configured as a circulation system. In this case, a further sub-table may be provided to move the data record of the sub-table.

(2) In the above embodiment, the server device 303 and the database control device 305 are individually configured (FIG. 3), but these devices may be integrated into a single device.

(3) In the above embodiment, the RFID tag information read by the reader is recorded in the database. However, information other than the RFID tag information may be recorded. For example, barcode reading data and input data may be recorded.

(4) In the above embodiment, the maximum number of records when expanding the ring table is calculated using an equation, but only a predetermined number of records may be expanded.

(5) Although the case where the ring table is extended has been described in the above embodiment, the ring table may be reduced. For example, when the number n of deleted data is smaller than a predetermined value in step S1811 in FIG. 18, or when the number m of moving data is smaller than a predetermined value in step S1903 in FIG. 19, the maximum number S of records in the ring table is reduced. May be. Thereby, the storage area of the ring table can be optimized, and the processing efficiency can be improved by using the ring table according to the data amount.

(6) In the above embodiment, the configuration is such that when a part is issued from the inter-process material storage area, the data storage deadline is recorded, and the record that has passed the data storage deadline is deleted by subsequent batch processing. The record may be deleted at the time of delivery.

  For example, in FIG. 3, a case where incoming goods information from the incoming reader 301 is recorded in the database, while a record corresponding to outgoing goods information from the outgoing reader 302 is deleted from the database. Applicable. In this case, recording and deletion of records are performed irregularly, but by calculating the number of records and deletions within a predetermined time and using this calculation result as statistical information, a more appropriate storage area size Can be set automatically.

(7) In the above embodiment, the CPU is used to realize the function shown in FIG. 2, and this is realized by software. However, some or all of them may be realized by hardware such as a logic circuit. In addition, you may make it make an operating system (OS) process a part of program further.

It is an example of the storage area in a prior art. It is an example of the functional block diagram of the database apparatus of this invention. It is an example of the system block diagram containing the database apparatus of this invention. It is an example of the hardware block diagram in the server apparatus of this invention. It is an example of the hardware block diagram in the database control apparatus of this invention. It is an example of the flowchart in the whole process of this invention. It is an example of the flowchart in the data preservation | save process of this invention. It is an example of the flowchart in the data preservation | save process of this invention. It is an example of the flowchart in the data cancellation process of this invention. It is an example of the flowchart in the data cancellation process of this invention. It is an example of the flowchart in the data search process of this invention. It is an example of the flowchart in the data search process of this invention. It is an example of the storage term acquisition table of this invention. It is an example of the main table of this invention, and a subtable. It is an example of the main table of this invention, and a subtable. It is an example of the main table of this invention, and a subtable. It is an example of the main table of this invention, and a subtable. It is an example of the main table of this invention, and a subtable. It is an example of the main table of this invention, and a subtable. It is an example of the schematic diagram about the search area | region of the main table of this invention, and a subtable. It is an example of the flowchart in the data cancellation process of this invention. It is an example of the flowchart in the operating condition monitoring process of this invention.

Explanation of symbols

201 First storage area 203 Second storage area 205 Storage control means 207 Deletion control means 209 Stuffing processing means

Claims (7)

A recording unit having a first storage area that can be recorded by a circulation method and a second storage area that can be recorded by a sequential method;
When data to be stored is received, if no data is stored in the location to be stored in the first storage area, the data to be stored is stored in the location and is to be recorded in the first storage area. In the case where data is recorded in the place, after the data stored in the place is moved to the second storage area, storage control means for storing data to be stored in the place;
When receiving a command to delete data, a deletion control means for deleting the data from the first storage area or the second storage area,
A clogging processing means for reducing the number of data that can be additionally stored in the second recording area when the number of data that can be additionally stored in the sequential method of the second storage area is smaller than a predetermined value; ,
A database device with The database apparatus according to claim 1, wherein
A database apparatus further comprising search processing means for searching for data stored in the first storage area and the second storage area when a search command including a search condition is received. The database apparatus according to claim 2, wherein
The search processing means performs the search processing divided into the following a) b) c):
a) Search for data from a location after the storage pointer indicating the location to be stored in the first storage area to the last location in the first storage area.
b) Search for data from the first location in the first storage area to the storage pointer.
c) Search for data in the second storage area. In the database apparatus in any one of Claims 1-3,
A database device further comprising storage capacity control means for increasing the storage capacity of the first storage area when the number of data deleted in the second storage area exceeds a predetermined number within a predetermined time . In the database apparatus in any one of Claims 1-4,
When the number of data to be moved from the first storage area to the second storage area exceeds a predetermined number within a predetermined time, or the data is moved within a predetermined time calculated based on a change in the number of data to be moved over time. The database apparatus further comprising storage capacity control means for increasing the storage capacity of the first storage area when the number of data exceeds a predetermined number. A database program for realizing the following functions by a computer,
When the data to be stored is received, if the data is not stored in the location to be stored in the first storage area that is stored in the circulation method, the data to be stored is stored in the location, and the first storage If data is recorded at the location to be recorded in the area, the data to be stored in the location is moved to the second storage area where the data stored in the location is sequentially stored. Storage control means for storing
When receiving a command to delete data, a deletion control means for deleting the data from the first storage area or the second storage area,
When the number of data that can be additionally stored in the sequential method of the second storage area becomes smaller than a predetermined value, the stuffing processing means for increasing the number of data that can be additionally stored by packing the place where the data is deleted in the second storage area ,
A database program for realizing a computer. A data management method using a computer,
When the computer receives the data to be stored, if the data is not stored in the location to be stored in the first storage area that stores the data in a circular manner, the computer stores the data to be stored in the location, If data is recorded in the location to be recorded in the first storage area, the data stored in the location is moved to the second storage area where the data is stored in a sequential manner, and then stored in the location. Remember the data to be
When receiving a command to delete data, the data is deleted from the first storage area or the second storage area,
A data management method in which when the number of data that can be additionally stored in the sequential method of the second storage area becomes smaller than a predetermined value, the number of data that can be additionally stored can be increased by closing the place where the data is deleted in the second recording area.

Images