JPS62209617A - Retrieving system for knowledge expressing frame - Google Patents

Abstract

PURPOSE:To attain retrieval in a short time even with a large amount of data with use of a prescribed retrieval key, by securing such a system where only the relevant frame can be retrieved via a hash table. CONSTITUTION:A retrieval deciding part 1 decides whether or not the slots in a frame set as retrieval keys form a hash table. If no has table is formed, a conventional retrieving part 2 retrieves all frames individually and successively. At the same time, a fact that a single retrieving action is carried out is recorded to the column of the corresponding slot at a storing area 20 for the retrieving number of data of a frame control data storing device 10. Then, the second decision is carried out by the part 1 when the same slot is requested as a retrieval key. At the same time, the reference is to the frequency and therefore the prescribed value, e.g., '1' is recorded to decide the 2nd retrieving request. Thus the processing is changed not through the part 2.

Description

[Detailed Description of the Invention] [Summary] In a search method of a knowledge data system in which knowledge is expressed in the form of frames, when the search frequency exceeds a predetermined value without searching all frames, data of the constituent elements of the frame is searched. This method creates and searches a hash table.

[Industrial Application Field] The present invention relates to a search method for a knowledge data system in which knowledge is expressed in the form of a frame, and to a method that allows high-speed searching via a hash table.

[Description of Prior Art] In knowledge engineering or expert systems, the concept of a "frame" has been introduced as a knowledge element for structuring and handling a large amount of knowledge information. For example, as shown in Figure 5,
Think about when you want to collect information about people. Reference numeral 20 indicates a management data storage device in which it is determined in advance what information is to be collected. Administrative data is defined in the format of "frames" that express knowledge about people at the time. Each data group collected about a specific individual using the 80 data form is called a frame, and is shown as 23.24. For each frame, name: “Yamada-husband”, age: “3”
The parts that make up a frame, such as "0", are called "slots". Note that 21 and 22 indicate ring data from the management data storage device to the frame. When ticking a large amount of data that matches a predetermined condition, for example, "age 2"
When searching for "5 year olds", how many people are there and what are their names?
All frames were sequentially checked using "age 25" as a key.

[Problems to be Solved by the Invention] In the conventional frame structure, each frame is arranged linearly, so when searching by key information as described above, it is necessary to search all frames sequentially from the first frame to the last frame. This required a long time and was extremely inefficient.

SUMMARY OF THE INVENTION An object of the present invention is to improve the above-mentioned drawbacks and to provide a frame search method that can perform frame searches efficiently with a simple configuration.

[Means for Solving the Problems] FIG. 1 is a block diagram showing the basic configuration of the present invention. In FIG. 1, 10 is a frame management data storage device;
．． 12 is the link data from the data storage device 10 to the frame, 13.14 is the frame, 15 is the Hash table, and 16.17 is the link data from the Hash table to the frame 13.14.
Data 14 indicates a storage location of search frequency data, and 20 indicates a storage location of search frequency data.

[Operation] When starting a search in the operation explanatory diagram shown in FIG. 2, first, the search determination unit (2) determines whether or not the slot in the frame set as the search key is set as a hash table. When a hash table has not been created, the conventional search section (2) sequentially searches all frames individually. At the same time, the frame management data storage device (Fig.
0), the fact that one search has been performed is recorded in the column of the slot in the search frequency data storage location 20. Next, when the same slot is requested as a search key, the decision is made again in the decision section (2). Since the frequency is referenced at the same time, if a predetermined value, for example 1, is recorded and it is determined that this is the second search request, the process is changed to create a hash table instead of the conventional search unit (2). A hash table 15 is created in the hash creation section (2), and then the hash search section (2) shown in FIG. 2 performs a search using the table. In this case, when the search key is related to the age of a person, for example, 25 years old, the data 16.17-. specified from the 25th position of the table among the slots of frames 13.14- of all people. Just search for it. data 1
Regarding No. 6, the data of Yoshiko Suzuki (female) is known from frame 14 via ring data 12. Next data 1
7, the frame is searched in the same way. At this time, age 2
Since no searches have been made for persons other than 5 years old, the processing time required for the search is extremely short.

Once the hash table has been created, when a further search is requested, the hash search section (2) operates immediately after the determination section (2), so the search can always be performed in a shorter time than when the conventional search section (2) operates.

In FIG. 2, ``■'' is a frame memory, and all operations in the retrieval determination unit ``■'' to the hash creation unit ``■'' are performed on the frame memory ``■''. Its meaning is indicated by a dashed line.

[Embodiment] FIGS. 3 and 4 show operational flowcharts of the hash creation section (2) and the hash search section (2) shown in FIG. 2 as an embodiment of the present invention. In FIG. 3, when starting hash creation, a hash table is created in step (2). Next, in step @, it is determined whether a frame exists. If so, create a hash key using the frame slot value in step 0. Next, in step (2), in addition to the hash table, the process returns to step @ where it is determined whether the next frame exists or not. Table creation ends when there are no frames.

Next, in FIG. 4, when starting a hash search, the answer is set in the empty list in step (3). step [phase]
Create a hash key with "value" in .

In step O, it is determined whether the element exists in the corresponding hash, and if it exists, it is compared by "value" in step 0, and if it matches, it is added to the list. Return to step O and repeat. If there is no element in step O, the process ends.

[Effects of the Invention] According to the present invention, it is possible to search only the relevant frame using the hash table.
Even a huge amount of knowledge data can be searched in a short time by providing a predetermined search key. Although the hash table itself is a well-known fact, applying it to a knowledge data system that handles frames and searching through the hash table is extremely labor intensive, as described above.

[Brief explanation of drawings]

Figure 1 is a diagram showing the basic configuration of the present invention, Figure 2 is an explanatory diagram of the operation of Figure 1, Figures 3 and 4 are flowcharts of the operation of Figure 2, and Figure 5 shows the conventional search method. FIG. 10.20...~Frame management data storage device 11゜1
2.21.22--Link data 1314.23.24--Frame 15--Hatstable Patent applicant Fujitsu Co., Ltd. agent Patent attorney Eisuke Suzuki Figure 1 [Phase] Shoulder section

Claims (1)

[Claims] In a search method for a knowledge data system in which knowledge is expressed in the form of frames, a frame management data storage device (10) is provided with a location (20) for storing data for managing frequency of searches; A knowledge expression characterized in that when the frequency exceeds a predetermined value, a hash table (15) is created based on data values serving as a search key in each frame, and a search is performed via the table (15). Frame search method.