JPH0667968A - Data management system in object direction - Google Patents

Abstract

PURPOSE:To provide a data management system in object direction, by which data can be accessed at high speed compared to a conventional case, by searching the data management table of chain structure in an object with a data identification number as a key. CONSTITUTION:A data identification number registration means 107 deciding a data identification number 108 which is uniquely decided to a data name from a registered data name 105 and registering the group of the data name 105 and the identification number 108, a data registration means 109 registering the group of the data identification number 108 and registered data 106 for the respective objects, a data identification number searching means 111 searching the data identification number 112 of a data name 110 from a registered data identification number group and a data searching means 113 searching and accessing data 114 registered in the target object with the searched data identification number 112 as the key are provided.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an object-oriented data management system.

[0002]

2. Description of the Related Art Object-oriented data management is managed for each object.

FIG. 7 exemplifies the structure of a conventional object.

The object 701 has an object name 7
03, a chain structure 704 in which data management tables are connected by pointers, and an object table 702 that stores these pointers.

The data management table 705 stores a pointer 706 to the next data management table, a data name pointer 707, and data 708.

Conventionally, to access data by such a data management method, the data name is used as a key to search the data management table having the same data name from the head of the chain structure 704 of the data management table to access the data. .

Data access of the above-described conventional object-oriented data management system will be described with reference to the flowchart of FIG.

At step 801, the head pointer of the chain structure of the data management table of the target object is obtained, and at step 802, the existence of the data management table is checked. If there is no data management table, the process ends.

In step 803, the data name in the data management table is obtained, and in step 804, the target data name and the first character of the data name obtained in step 803 are extracted and compared in step 805.

If the compared characters are different, step 80
In step 6, the next data management table is obtained and the process returns to step 802.

In step 807, the next character of each data name is obtained, and the process returns to step 805 to set the data name to 1
Compare character by character. In step 808, all the characters are compared, and if the data names are the same, in step 809 the target data is extracted and accessed.

[0012]

As described above, the conventional object-oriented data management system uses the data name as a key to search the data management table in which the data is stored. I was searching while comparing.

Therefore, when there are many data names whose data names are long and only the last one character is different, and there are several dozen or more data management tables in one object, the data structure is added at the back of the chain structure. Accessing the data of a certain data management table has the drawback that it takes a very long time.

It is an object of the present invention to provide an object-oriented data management system capable of accessing data at a much higher speed by searching a data management table having a chain structure in an object using a data identification number as a key.

[0015]

According to the object-oriented data management method of the present invention, a data identification number uniquely determined for a data name to be registered is determined from the data name to be registered, and the data name to be registered and its identification number Data identification number registration means for registering a set of the data identification number, data registration means for registering the set of the data identification number and the data to be registered for each object, and data identification of the data name searched for from the registered data identification number group It comprises a data identification number searching means for searching a number, and a data searching means for searching for and accessing data registered in a target object using the searched data identification number as a key.

[0016]

Embodiments of the present invention will now be described with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of a data management system in the object orientation of the present invention.

As shown in FIG. 1, the data management method in the object oriented method of this embodiment is the data registration processing 10.
2 and a data search process 103.

The data registration processing 102 receives the data name 105 to be registered and the data 106 to be registered, and the data name 105 to be registered by the data identification number registration means 107.
Data name 10 to determine and register the data identification number 108 of
5 and the data identification number 108 are registered, and the data registration means 109 registers the data identification number 108 and the data 106 of the data name registered in the object.

The data search processing 103 receives the data name 110 to be searched by the data identification number search means 111, and the data identification number 112 of the data name to be searched from now on.
Then, the data search means 113 searches the data using the data identification number 112 of the data name to be searched as a key, and accesses the searched data 114.

FIG. 2 is a structural diagram showing the structure of data identification number registration means and data management by the data registration means of this embodiment.

The management by the data identification number registration means 107 is performed by the data name management tables 204, 205, 206 etc. for individually managing the data name and the data identification number, and the values obtained by calculating the hash value from the data name. A data identification number management hash table 203 for managing a data name management table in a position in a chain structure, and a data name 210, 2
It is composed of 11, 212 and the like.

The data name management table 204 stores the data name management table pointer 208 of the next data name management table 205 and the pointer of the data name 210. The data name management table 205 stores the pointer of the data name 211, and the data name management table 206 stores the pointer of the data name 212.

The management by the data registration means 109 is composed of a plurality of objects. The object 213 as one example stores a plurality of data management tables 217, 218 and 219 connected by a chain structure 220 for managing individual data, a head pointer 215 of the chain structure and a pointer of an object name 216. Object table 214 and object name 216.

The data management table 218 stores the pointer, data identification number 222 and data 224 of the next data management table 219.

In this embodiment, the data name management table pointer is used as the data identification number uniquely determined for the data name.

Therefore, the data identification number 221 of the data management table 217 is the data name management table pointer 209 of the data name “DATA0005” 212 of the data stored in the data management table 217, and the data identification of the data management table 218. The number 222 is the data name “DATA
The data name management table pointer 207 of “0001” 210 and the data identification number 22 of the data management table 219.
Reference numeral 3 is a data name management table pointer 208 for the data name “DATA0010” 211.

Next, a data registration process of registering data names and data to be registered and registering them will be described with reference to a flow chart.

FIG. 3 is a flow chart showing a processing procedure of data identification number registration processing relating to data name registration and data identification number determination performed by the data identification number registration means during the data registration processing of the present embodiment.

A hash value is calculated from the input data name 105 to be registered (step 301). The hash value indicates the position of the element of the data identification number management hash table 203, and by this, the head pointer of the chain of the data name management table stored at that position can be obtained (step 302).

Therefore, it is checked whether or not the data name management table exists (step 303). When it exists (YES branch of step 303), the pointer of the data name stored in it is obtained (step 304), The data name and the data name to be registered are compared character by character (loops of steps 305, 306 and 307), and if the comparison results are not the same (NO branch of step 305), the data is chained one after another. The data name stored in the name management table is compared (step 309,
Loops such as 303, 304 and 305).

If all the characters of the data name of the data name management table and the data name to be registered are the same (YES branch of step 307), the pointer of the data name management table indicates the data name to be registered. This is a data identification number (step 308).

When it is not the same as the data name stored in any data name management table in the chain (NO branch of step 303), an area for storing the data name to be registered is secured and the data name is stored there. Then, a new data name management table is created and its storage area is secured (step 310), and then a pointer of the data name to be registered in the data name management table is stored (step 311).

Next, the newly created data name management table is added to the beginning of the chain of the data name management table obtained in step 302. That is, the head pointer of the chain in the data identification number management hash table 203 is stored in the newly created data name management table, and the head pointer of the data identification number management hash table is replaced with the pointer of the newly created data name management table. (Step 312). In this way, it is possible to register the data name to be registered and obtain the pointer of the data name management table, that is, the data identification number of the registered data name (step 308).

FIG. 4 is a flow chart showing the processing procedure of the data registration processing performed by the data registration means during the data registration processing of this embodiment.

In step 401, the head pointer of the chain of the data management table stored in the object table in the object is obtained, and by tracing this, the data identification number stored in the chained data management table and the above-mentioned The data identification numbers obtained in the data identification number registration processing are successively compared (steps 402 and 403).
And 404 loops).

If the comparison result is a match (step 40)
No branch 3), change the data stored in the data management table to the data to be newly registered (step 4)
05). If it does not match any of the data identification numbers (NO branch of step 402), a new data management table is created and its storage area is secured (step 40).
6) Store the data to be registered in the data management table and the data identification number obtained in the above-mentioned data identification number registration processing (step 407), and newly create it at the beginning of the chain of the data management table obtained in step 401. Added data management table. That is, the head pointer of the chain in the object table is stored in the newly created data management table, and the head pointer of the chain in the object table is replaced with the pointer of the newly created data management table (step 408).
Data can be registered in this way.

As described above, the data name and data can be registered and the data identification number can be determined.

Next, a data search process for searching for a data identification number corresponding to a given data name to be searched and searching for a corresponding data identification number will be described with reference to a flow chart.

FIG. 5 is a flow chart showing the processing procedure of the data identification number searching process performed by the data identification number searching means in the data searching process of this embodiment.

The data name 110 of the input search data
A hash value is calculated from (step 501). The hash value is the data identification number management hash table 203.
Of the data element management table stored in that position can be obtained (step 502).

Then, it is checked whether or not the data name management table exists (step 503), and if it exists (YES branch of step 503), the pointer of the data name stored therein is obtained (step 504), The data name and the data name to be searched are compared character by character (loops of steps 505, 506 and 507), and if the comparison results are not the same (NO branch of step 505), the data are chained one after another. A comparison is made with the data name stored in the name management table (step 509,
Loops such as 503, 504 and 505).

If the data name stored in any of the data name management tables in the chain is not the same (NO branch of step 503), there is no data name management table corresponding to the data name to be searched, that is, the search is performed. The data name to be registered is not registered.

However, if all the characters of the data name in the data name management table and the data name to be searched are the same (YES branch of step 507), the pointer of the data name management table indicates the data name to be searched. This is a data identification number (step 508).

In this way, the pointer of the data name management table of the searched data name, that is, the data identification number of the searched data name can be obtained (step 50).
8).

FIG. 6 is a flow chart showing the processing procedure of the data search processing performed by the data search means during the data search processing of this embodiment.

With respect to the processing result of the above-mentioned data identification number search processing, it is judged whether or not the data name to be searched is unregistered (step 601), and if it is not registered (NO branch of step 601), the data to be searched. The data corresponding to the first name cannot be accessed.

If the judgment in step 601 is registered (YES branch in step 601), the head pointer of the chain of the data management table stored in the object table in the object is obtained in step 602,
Following this, the data identification number stored in the chained data management table and the data identification number obtained by the above-mentioned data identification number search processing are successively compared (loop of steps 603, 604 and 605). .

When it does not match any data identification number (NO branch of step 603), the data corresponding to the searched data name is not registered, and the data corresponding to the searched data name cannot be accessed. .

When the comparison result is a match (step 60)
No. 4 branch), the data stored in the data management table is the target access target data (step 6).
06).

As described above, the data corresponding to the data name to be searched can be searched using the data identification number as a key.

As described above, by searching with the data identification number as a key, the number of data name comparisons is averaged, and the number of conventional data name comparisons is calculated as the number of pointers stored in the data identification number management hash table. The identification number newly added in this embodiment is also compared with each other by numbers, so that it is performed at high speed and the time required to access the data can be greatly shortened.

In the present embodiment, as described above, the data identification number is used as the pointer of the data name management table, but the present invention is not limited to this, and a unique number may be given in the order of registration. Needless to say.

[0054]

As described above, the object-oriented data management system of the present invention searches for a chain-structured data management table in an object using a data identification number as a key, and thus is much faster than the conventional method. It has the effect of being able to access the data.

[Brief description of drawings]

FIG. 1 is a block diagram showing an example of an object-oriented data management system of the present invention.

FIG. 2 is a data management structure diagram showing a data management structure of an object-oriented data management method of the present invention.

FIG. 3 is a flow chart showing an example of the operation of a data identification number registration process in the object-oriented data management system of the present embodiment.

FIG. 4 is a flowchart showing an example of the operation of a data registration process in the object-oriented data management system of the present embodiment.

FIG. 5 is a flowchart showing an example of the operation of the data identification number search processing in the object-oriented data management system of the present embodiment.

FIG. 6 is a flowchart showing an example of the operation of a data search process in the object-oriented data management system of the present embodiment.

FIG. 7 is a structural diagram showing a structure of a conventional object.

FIG. 8 is a flowchart showing the operation of a conventional data search process.

[Explanation of symbols]

102 data registration processing 103 data search processing 105 data name to be registered 106 data to be registered 107 data identification number registration means 108 data identification number of data name to be registered 109 data registration means 110 data name to be searched 111 data identification number search means 112 to search Data identification number of data name 113 Data search means 114 Searched data 203 Data identification number management hash table 204, 205, 206 Data name management table 207, 208, 209 Data name management table pointer 210, 211, 212 Data name 213, 701 Object 214, 702 Object table 215, 706 Data management table pointer 216, 703 Object name 217, 218, 219, 705 Data management table 22 The chain structure of the 704 data management table 221, 222, 223 data identification number 224,708 data 301～312,401～408,501～509,6
01-606, 801-809 Flow chart step 707 Data name pointer

Claims (1)

[Claims] 1. A data identification number registration means for determining a data identification number uniquely determined for the data name to be registered and registering a set of the data name to be registered and the identification number, and the data identification. Data registration means for registering a set of a number and data to be registered for each object,
A data identification number searching means for searching a data identification number of a data name to be searched from a registered data identification number group, and searching for data registered in a target object using the searched data identification number as a key. An object-oriented data management method, comprising: a data search means for accessing.