JPH0283638A - Data base record managing system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Summary] This invention relates to a record management method for a database in which records corresponding to each hierarchy are created as necessary in a database with a hierarchical structure, with the aim of improving database management efficiency. , in a record management method for a database that has a hierarchical structure and accesses records in the lowest hierarchy based on records corresponding to one or more upper hierarchy, a key part for specifying the corresponding part of each hierarchy. and a management part for managing the usage status of each hierarchy, and a record that accesses the relevant hierarchy of the database and has a corresponding key part based on the management part in the record. The present invention is configured to include a search means for performing a search, and a pattern creation means for generating a record corresponding to each layer below the applicable layer when a corresponding code does not exist as a result of the search by the search means.

(Industrial Application Field) The present invention relates to a record management system for a database having a hierarchical structure, in which records corresponding to each hierarchy are created as necessary.

[Conventional Technique 4] In recent years, the importance of databases in computer systems has increased, and it is necessary to efficiently create and manage the enormous amount of data stored in databases.

A database is a system that systematically integrates several data files to eliminate duplication of data items and stores data in a structured manner. Creating a database has the advantages of making effective use of direct access storage, allowing for accurate data updates, and centrally managing the data so that it can be used effectively among many independent users. In other words, when using a computer system, as the amount of data increases as the applied work becomes more complex,
There are many types of data files. Therefore, traditional file storage methods result in data items being duplicated in several files.

For this reason, a database with a hierarchical structure was created, but
Because data is centrally managed, one database can be used for various applications (published by Ohmsha, Information Processing Examination Course "Software Knowledge (2nd Edition) J.2.
83. Quoted from page 284).

FIG. 6 shows a conventional record management procedure for fixedly securing records corresponding to each hierarchy.

In the figure, ■ to ■ indicate the first to fourth hierarchies, respectively, and when constructing the database, records "1" to "N" are fixedly secured in correspondence to each hierarchy.

Since each hierarchy is specified by records "1" to "N", N4 records are secured corresponding to the lowest floor N (fourth hierarchy).

Further, FIG. 7 shows a conventional record management procedure in which a management section is provided to manage the lowest hierarchy. (a) shows a management table for managing the lowest hierarchy, and (b) shows the correspondence of records in each hierarchy secured based on the management table.

When constructing a database, records for each hierarchy except the lowest hierarchy are fixedly secured, and only the records for the lowest hierarchy are sequentially updated based on the management table.

For example, the initial value of the nasal sublayer is "001", and the final value is r.
999J, and record management of the database is performed by managing the current value. The current value is sequentially updated (added) as necessary starting from the initial value.

[Problem to be solved by the invention]

By the way, with the above-mentioned conventional method, it is necessary to set records for all hierarchies or all hierarchies except the lowest layer when constructing the database, which requires time and effort to construct the database, and a lot of wasted space, making management difficult. The problem was that it was inefficient.

The present invention was created in view of these points, and an object of the present invention is to provide a database record management method that can improve management efficiency.

[Means to solve the problem]

FIG. 1 is a principle block diagram of the database record management system of the present invention.

In the figure, a database 111 in a record management method of a database that has a hierarchical structure and accesses records in the lowest hierarchy based on records corresponding to one or more upper hierarchy, specifies the corresponding part of each hierarchy. A plurality of records are stored including a key section for managing the usage status of each layer, and a management section for managing the usage status of each layer.

The search means 121 accesses the relevant hierarchy of the database 111 and searches for a record having the relevant key part based on the management part in the record.

The pattern creation means 131 generates records corresponding to each hierarchy below the relevant hierarchy when no corresponding record exists as a result of the search by the search means 121.

Therefore, the system as a whole is configured to generate records corresponding to each layer below this layer when there is no record of the corresponding layer.

[For production]

A plurality of records are stored in the database 111, and each record includes a key part for specifying a corresponding part of each hierarchy, and a management part for managing the usage status of each hierarchy.

The search means 121 accesses records in the relevant hierarchy of the database 111, and if the relevant record does not exist, the pattern creation means 131 creates records corresponding to each hierarchy below the relevant hierarchy.

In the present invention, by securing a minimum area when constructing the database 111 and creating records for each hierarchy as necessary, the number of records to be managed can be kept to a minimum, thereby improving management efficiency. be able to.

〔Example〕

Hereinafter, embodiments of the present invention will be described in detail based on the drawings.

FIG. 2 shows the configuration of a database record management system in an embodiment of the present invention.

(1) Here, the correspondence between the embodiment of the present invention and FIG. 1 will be shown.

Database 111 corresponds to database 231.

The search means 121 uses the CPU 211. It corresponds to the memory 221.

The pattern creation means 131 includes the CPU 211. memory 22
Corresponds to 1.

Examples of the present invention will be described below assuming that the correspondence relationship as described above exists.

In FIG. 2, a computer system to which the database record management method of the present invention is applied includes a CPU 211 that executes programs, and a memory 221 that stores programs and data that are directly controlled by the CPU 211. and a database 231 consisting of a disk device and used to hold programs and data processed by the CPU 211.
a channel device 233 for controlling data input/output to the database 231; a display 241 for displaying data and processing results; a keyboard 243 for inputting data and instructions; A printer 245 for printing, and a display 241.
It includes a keyboard 243 and a channel device 247 that controls input and output of data to and from a printer 245.

CPU211. Memory 221 and two channel devices 2
33 and 247 are connected to the bus. Further, the database 231 is connected to the channel device 233. Display 241. Keyboard 243. printer 245
is connected to channel device 247.

Further, a database management program 223 for accessing a database 231 is stored in the memory 221, and the CPU 211 accesses the database 231 by executing the database management program 223 in the memory 221.

1-140 made by a needle Next, the operation of the embodiment of the present invention described above will be explained.

FIG. 3 shows the contents of management records corresponding to each hierarchy of the database 231, which is composed of three hierarchies. In the figure, [key part J is a four-digit identification number corresponding to each layer, where the part corresponding to the first layer is a, the part corresponding to the second layer is b, and the part corresponding to the third layer is C. shall be. a is stored in the key part of the management record in the first layer, and
A and b are stored in the key part of the management record of the hierarchy, and a, b, and C are stored in the key part of the management record of the third hierarchy.

In addition, "Management Department" represents the usage status of each layer,
"Current value" represents the usage status of the key part (any one of a, b, and c). This current value is initially equal to the "initial value" and is updated each time the storage area (work area) of the database 231 is expanded, and the maximum value becomes the "final value."

Furthermore, ``key meaning j'' indicates the content of each meaning when key parts a, b, and c are each given a meaning.For example, each symbol of A, B, and CD has a meaning. to identify it.

A basic pattern corresponding to the minimum required area is created when constructing the database 231. For example, set key part a to "0"
001", key part C is l'1000", key part C is r2
The basic pattern is set as "000J and r3000".

Thereafter, in this basic pattern, data is acquired by updating the current value of the management section of the third layer management record.

In this embodiment, the user data is a 16-digit value that is the sum of the key part of the third-tier management record and the current value of the management part, and obtaining this user data will be referred to as data acquisition. .

Furthermore, when creating a new pattern whose first or second hierarchy is different from this basic pattern, the values of each key part of the first or second hierarchy are updated.

FIG. 4 shows the operating procedure when accessing the database 231 and creating a new pattern. It is assumed that the CPU 211 that has executed the database management program 223 accesses or makes decisions about the database 231.

First, the first tier management record of the database 231 is accessed (step 410), and it is determined whether or not to acquire data up to the current value of the first tier management record (step 410).
Step 411). When a positive judgment is made, the corresponding second
It is determined whether data up to the current value of the hierarchy management record is to be acquired (step 412).

If a positive judgment is made here (when accessing an existing pattern in both the first and second layers), then a predetermined value (for example, 1) is added to the current value of the third layer management record (step 413). It is determined whether the current value is within a predetermined range (step 414). If this current value exceeds the final value (negative determination), it is determined that the record cannot be extended (step 415), and the process is terminated. If expansion is not possible, the display 241 will notify you of this, for example.

Further, when an affirmative judgment is made in step 414 (when the current value is less than or equal to the final value), the current value of the third layer management record is obtained (step 416), and the process is terminated (addition processing is performed in step 413). (Secure the current value and end the process.)

In addition, if a negative determination is made in step 411 (whether data up to the current value of the first tier management record has been obtained), the next step 4 is to add a predetermined value to the current value of the first tier management record (step 421). It is determined whether the current value is within a predetermined range (step 422). If this current value exceeds the final value (negative determination), it is determined that the record cannot be extended (step 423), and the process is terminated.

When the affirmative judgment is made in step 422, the lower pattern (
A second hierarchical management record in which the initial value is set to the current value is created (step 424), and the created second hierarchical management record is accessed (step 425). Thereafter, the process from step 412 onwards is repeated.

Also, if a negative determination is made in step 412 (data up to the current value of the 21st!! i-store management record has been obtained), then a predetermined value is added to the current value of the second layer management record (step 431). , it is determined whether the added current value is within a predetermined range (step 432), and if this current value exceeds the final value (negative determination), it is determined that the record cannot be extended (step 433). , ends the process.

When the affirmative judgment is made in step 432, the lower pattern (
A third layer management record in which the initial value is set to the current value is created (step 434), and the created third layer management record is accessed (step 7'435). Thereafter, the processing from step 413 onwards is repeated.

FIG. 5 shows a new pattern created according to the operating procedure shown in FIG.

(a) shows a case where a predetermined value is added to the current value of the first layer management section (step 421 in FIG. 4) to create a new pattern consisting of each layer below the first layer. Also, (b)
Adds a predetermined value to the current value of the second layer management section (fourth layer management section).
Step 321) in the figure shows the case where a new pattern consisting of each layer below the second layer is created. Furthermore, (c) shows the case where a new pattern is created by adding a predetermined value to the current value of the third layer management section (step 413 in FIG. 4).

U1 example - 0) J,=≦屹In this way, when constructing the database 231, only the minimum necessary basic patterns are created, and when it becomes necessary to acquire data, the first layer , either the second layer or the third layer is updated, and a new pattern consisting of each subsequent layer is created.

Therefore, the effort required to construct a database can be reduced and
．． There is no need to reserve unnecessary data areas, and database management efficiency can be improved.

Furthermore, since the amount of data to be managed is small, the access time for the target data can be shortened.

V-jIWqhen”~.

In addition, in rl, the correspondence relationship j between the example and FIG. 1,
Although the correspondence between the present invention and the embodiments has been described, those skilled in the art will easily assume that the present invention is not limited to this and that there are various modifications.

〔Effect of the invention〕

As described above, according to the present invention, it is possible to improve management efficiency by securing a minimum amount of space when constructing a database and creating records for each hierarchy as necessary, which makes it possible to improve management efficiency. It is extremely useful.

[Brief explanation of the drawing]

Figure 1 is a basic diagram of the database record management system of the present invention. Figure 2 is a block diagram of an embodiment to which the database record management system of the present invention is applied. Figure 3 is an explanation of management records in the embodiment. 4 is an explanatory diagram of the operation of the embodiment, FIG. 5 is an explanatory diagram of data acquisition in the embodiment, FIG. 6 is an explanatory diagram of the conventional example, and FIG. 7 is an explanatory diagram of the conventional example. In the figure, 111 is a database, 121 is a search means, 131 is a pattern creation means, 211 is a CPIJ, 221 is a memory, 223 is a database management program, 231 is a database, 233 is a channel device, 241 is a display, 243 is a keyboard, 245 is a printer, and 247 is a channel device. , f-departure B month/) no giant! Professional Map No. ■ Figure Kariuri-mura) Kariwa Koji Record 4 Katsuaki Map, Figure 3 (Inruri-eup (4th Te'-7H 4 =) Miman 1J Month 1 Figure 5
figure

Claims (1)

[Claims] (1) In a record management system for a database that has a hierarchical structure and accesses records in the lowest hierarchy based on records corresponding to each of one or more upper hierarchies, there is a method for specifying the relevant part of each hierarchy. a database (111) that stores a plurality of the records including a key part and a management part for managing the usage status of each hierarchy; a search means (121) for searching for a record having a corresponding key part based on the part; and when a corresponding record does not exist as a result of the search by the search means (121), each hierarchy below the corresponding hierarchy; A record management system for a database, characterized in that it is configured to include: pattern creation means (131) for generating the record corresponding to the above.