JPH03244078A - Information retrieval device - Google Patents

Abstract

PURPOSE:To enable speedy retrieval by registering the procedures of information retrieval which are performed in the past optionally by users and narrowing down the retrieval range according to the retrieval procedure when information is retrieved next time. CONSTITUTION:A 1st storage means (a) is stored with various pieces of information which are classified hierarchically, a retrieval means (b) retrieves the information in the 1st storage means (a) in order of the hierarchy, and a 2nd storage means (c) is stored with some of retrieval procedures of respective layers, retrieved by the retrieval means (b), by users regarding operation. A limiting means (d) limits the retrieval range of information for the retrieval means (b) according to the retrieval procedures stored corresponding to the users regarding the operation when new information retrieval is indicated and a permitting means (e) permits the specification of retrieval conditions for lower layers within the limited retrieval range. Consequently, the retrieval range is limited automatically according to the users and the information retrieval is carried out to speedily obtain desired information.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an information retrieval device for personal computers, office computers, and the like.

[Summary of the Invention] This invention provides an information retrieval device in which search procedures for past information searches are arbitrarily registered for each user, and the next time the information is searched, the search range is set according to the above search procedure. By narrowing the search range, it is no longer necessary to repeatedly specify the same search conditions each time a search is made for information in a similar search range, and the search can be performed quickly.

[Prior Art] In a conventional information retrieval device, in order for a user to obtain desired information, the user must specify a series of search conditions such as the field of information and various classification items in that field each time the user performs a search. were specified.

Incidentally, the information desired by the user is often fixed and exhibits a predetermined tendency depending on the user, such as the user's job content, field of expertise, hobbies, level and quality of requested data content, etc. For example, in the relationship between a superior and a secretary, the secretary is well aware of the above tendencies of the superior, so
”The secretary was asked by the second dan to prepare the specified materials,
-1- Even without detailed instructions from the role, the player picks up the most appropriate information for the superior.

However, with conventional information retrieval devices, it has been impossible to quickly perform a search suitable for the user in the same way as a secretary.

[Problem to be solved by the invention 1 Therefore, even when searching for another technical information belonging to the same technical field as the previous one, it is necessary to specify a series of search conditions almost the same as the previous one again. Therefore, it was not possible to search quickly.

This is considered to be due to the fact that all search instructions are dealt with equally, but the search range corresponding to the user is not specified.

It is clear that if the range is automatically limited according to the user and the search can be performed within this limited range, the search can be performed quickly.

An object of the present invention is to automatically limit the search range according to the user and perform an information search.

[Means for Solving the Problems] The means of the present invention are as follows.9 The first storage means a (see the functional block diagram of FIG. Remember information.

The search means 1 sequentially searches the information in the first storage means a in hierarchical order.

The second storage means C is a search means b1. A part of the search procedure for each layer searched is stored for each user involved in the operation.

The limiting means d limits the range of information search by the user (and the search means 1 based on the correspondingly stored search procedure) when a new information search is instructed.

The permitting means e permits the specification of search conditions for lower hierarchies within the search range limited by the limiting means d.

[Effect] The operation of the means of this invention is as follows.

Now, in the first storage means a, various data related to information processing are stored in Part 1, Part 1, Chapter 1, Section 1, Part 1, Chapter 1, Section 1, Part 1, Chapter 1, Section 1. It is assumed that the data is hierarchically classified as Section 1, Part 1, Chapter 2, etc., and is stored linked to the table of contents data in Section 1.

For example, assume that Part 1, Chapter 1, and Section 1 are specified as search conditions for each hierarchy.

Then, the retrieval means outputs the data related to Part 1, Chapter 1, Section 1 to the first storage means a. Here, when a registration operation is performed for the search conditions of each hierarchy, the second storage means C stores a series of search procedures such as Part 1, Chapter 1, and Section 1-, or stores them for each user involved in the operation. be done.

If a new information search is instructed at a later date,
The limiting means d is based on a series of search procedures ``Part 1, Chapter 1, Section 1'' stored corresponding to the user involved in the operation. The search range is limited to the range along the flow of Section 1''.

Based on this limitation, the permissible means e may be, for example, “Part 1,
``Chapter 1'' or °゛Part 1, Chapter 1, Section 1, Section 1''
If a search condition is specified that follows the flow of ``Part 1, Chapter 1, Section 1'' such as ed., Chapter 1,
If a search condition is specified that does not follow the flow of Section 1, the specification is not allowed.

Therefore, the information search can be performed by automatically limiting the search range according to the user.

``Example'' Hereinafter, an example will be described with reference to FIGS. 2 to 7 I\l.

FIG. 2 is a system diagram of the information retrieval system, in which one host machine r-1 and a plurality of terminal machines 'd' are connected via a communication line 1-.

The host machine I] searches the database in response to a data search request from the terminal T, and performs database search processing such as sending search data to the related terminal machine in response to the request. 1ffi H also executes database search processing in response to data search requests by input operations on the host machine H.

The terminal device T has at least a key input section for instructing a data search, and a display section for displaying search data etc. from the host device 1-[.

FIG. 3 is a block diagram of the host machine 1-1,
CPU ], , a key manual section 2, a database 3, a learning memory 4 for each user, a transmission control section 5, a display section 6, a user ID register R1, an output level register R2, and a selection pointer P.

When CPU receives a data search request signal from the terminal T via the transmission control unit 5, it searches the database 3 based on the request signal and sends the search results to the terminal via the transmission control unit 5. Controls various processes such as sending to armor. Note that when searching the database 3, the CPU 1 causes the display unit 6 to display a menu of search conditions and the like for the hierarchical database, and guides the input of the search conditions.

That is, by sequentially specifying search conditions in an interactive format, it is possible to accurately search for desired data without knowing the complicated data classification structure.

In addition to the data input unit J-2a for inputting various data such as a user name, the key input section 2 includes a cursor movement key 2b for moving the cursor downward and left and right, a forward key 2c, a backward key 2d, and a registration key. It has various function keys such as 2e and end key 2f.

Note that the key manual unit 2 of the terminal T also has similar keys.

The database 3 is hierarchically structured as shown in FIG.

In other words, the top menu number is "0", the next menu number is a one-digit number such as "upper"°, and the menu number of the next lower rank is a 2-digit number such as "pa]1°". It is structured in a tree-like manner, such as the numerical value of the digit. Note that A and B in the figure indicate whether the content of the data corresponding to the menu number is advanced content written for experts or content written in a simple manner for the general public.

The user-specific learning memory 4 stores history information of menu selections for each user as shown in FIG. °° means to skip the intermediate menu and display (open) the window of the menu indicated by ``common condition'' first.

Next, the database search operation will be explained with reference to FIGS. 6 and 7.

Enter the user ID by operating the key manual section 2 of the post machine I] or the terminal T (step S1 in FIG. 6), and then:
Step S2): Specify and input whether or not to reuse. Then, the CPU determines whether the input signal is a designated signal indicating reuse (step S3). As a result, if the specified signal is not to be reused, the next specified input level information is set in the output 1 novel register R2 (step S4), and the selection pointer P for the menu (database 3) is set to the initial value "o". Sera 1 through <Step S5>, and the process proceeds to Step S10. ”-Step S1
The manually entered user ID is set in the user ID register R1.

Note that the processing in the case of reuse in steps S6 to S9 will be described later.

In step S10, menu windows of each hierarchy up to the current selection pointer P are sequentially opened (displayed). As shown in FIG. 7, each of these windows P is opened in such a way that the windows of the menus in the lower hierarchy are stacked on top of each other with their vertical and horizontal positions slightly shifted relative to the windows of the menus in the upper hierarchy.

In addition, when using it for the first time, in step S5, the selection pointer P is set to the initial value ``'0°''.
Only the window is displayed. In addition, if there is a menu at a lower level than the lowest level menu currently open on the display screen, the title of the menu at that House level will be displayed as shown in Figure 7. "Selection ~ 0" is displayed corresponding to "Selection No."
]” is initially specified.9 Also, when opening a window with this flowchart 1, the terminal @
When processing in response to a search request from T, the display section of the terminal T is sent to the terminal T associated with the request with data for reading or a window erase signal. However, this means that the same window as the display unit 6 of the host machine 14 is opened.

Next, a key operation is performed (step 511), and if it is an operation of the cursor movement key 2b that instructs the cursor to move downward or downward, the key operation that is currently open on the display screen 1 is performed. Step S2) of determining whether there is a menu in a hierarchy lower than the menu in the lowest hierarchy. As a result, if there is a menu in a lower hierarchy, move the cursor in response to the operation of the ``2 movement key'' or the ``down movement key'' (step 3).
13), return to step S11. On the other hand, if there are no menus in the lower hierarchy, proceed to step S.
] By returning to 1, the cursor movement instruction up or down I\ is invalidated.

When the forward key 2C is operated, similarly to step S12, it is determined whether a menu in a lower hierarchy exists (step 514). As a result, if there is no menu in the lower hierarchy, proceed directly to step Sl]
By returning to , the operation of the forward key 2C is invalidated. On the other hand, if a menu in a lower hierarchy exists, the menu in the lower hierarchy currently designated by the cursor is selected, and the menu number corresponding to that menu is moved to the selection pointer P (Step 515).

] 2 Then, data corresponding to the selected menu and the output level in the output level register R2 is read from the database 3 (Step S) 6).

Then, a stack of windows surrounding the read data is opened on the top layer (step 517), and step Sll
Return to

When the back key 2d is operated, by erasing (closing) one window of the menu currently opened in the top layer, the window of the menu in the binary hierarchy is made to be the second layer. The menu code ~0 corresponding to the top layer menu is set in the selection pointer P (step S], 8), and the process returns to step Sll.

In addition, when the cursor movement key 2b that moves the cursor to the right or left is operated, another menu in the same hierarchy as the menu in the lowest hierarchy currently stacked and open on the display screen is selected, and the selection Set the menu number corresponding to the menu to the selection pointer P (step 5
19). Then, change to the menu at the lowest level and open the selection menu window (step 520).
, step Sl].

When the registration key 2e is operated and the registration range is specified by inputting the menu number (step S2]-), the menu ~0. is registered in the user-specific learning memory 4 as a common condition (step 522), and the process returns to step Sl].

When the end key 2f is operated, the output level register R corresponds to the user TD in the user ID register R1.
2 and the contents of the current selection pointer P are registered in the user-specific learning memory 4 (steps 82B and S
24), end. In this way, only the contents of the selection pointer P at the time of operating the end key 2f, that is, the menu number of the menu last selected by the user, are registered in the user-specific learning memory 4 as a procedure history (
(See Figure 7 ■). Furthermore, when the operation of the end key 2f ends once and another search is performed by entering the user ID again, the menu number of the last menu selected in that search is registered as the procedure history 4. (See Figure 7 ■) 9 steps S3
If it is determined that the item is for reprinting, the output level corresponding to the user ID related to the input in the user registration register R1 is read out from the user-specific learning memory 4 and set in the output level register R2. S6). and,
Step 57)9 Determine whether or not the common condition corresponding to the input user ID is registered in the learning memory 4 for each Neely.As a result, if the common condition is registered, the selection pointer P is The menu numbers related to the conditions are sequentially updated (step S8), and the process proceeds to step SIO. Through this process, for example, menu No. "13" is set as a common condition.
] ] When “B” is registered, the menu number “1゛”13” “13]” is displayed as shown in Figure 7.
"1B]]" Windows up to "13113'" are stacked and opened at once. Therefore, by registering the menu number located at the center of the search range as a common condition through the processing in steps S2] and 22, it is possible to perform a search using the registered menu number as a base. On the other hand, when the common condition is not registered, the selection pointer P is moved to the previous selection position, that is, the previous selection position registered as the procedure history in the user-specific learning memory 4. The menu number is sequentially updated (step S9), and the process proceeds to step 81.0. Therefore, even if you do not intentionally register common conditions, the window of the menu number last searched will be automatically opened in layers, so you can search based on the menu number last searched last time. This makes it possible to quickly search for desired data.

Note that the present invention is not limited to information retrieval systems connected via a network, but can also be applied to stand-alone information retrieval devices.

"Effects of the Invention" According to the present invention, it is possible to perform an information search by automatically limiting the search range according to the user, and it becomes possible to quickly obtain desired information.

[Brief explanation of drawings]

Fig. 1 is a functional block diagram of the present invention, Fig. 2 is a system configuration diagram of an information retrieval system, Fig. 3 is a diagram showing the block configuration of the host machine, and Fig. 4 is a diagram showing the hierarchical structure of the database.
Reference numeral 5171 is a diagram showing the data contents of the learning memory for each user, FIG. 6 is a flowchart showing information search processing, and FIG. 7 is a diagram showing display contents. 1...CPU, 2...Key personnel department, 3...Database, 4...Learning memory for each user, P...Selection pointer.

Claims (1)

[Claims] A first storage means for storing various kinds of hierarchically classified information; a search means for sequentially searching information in the first storage means in hierarchical order; a second storage means that stores a part of the search procedure for each hierarchy according to the user involved in the operation; The present invention is characterized by comprising: a limiting means for limiting the search range of information in the search means; and an allowing means for allowing the specification of search conditions for a lower hierarchy within the search range limited by the limiting means. Information retrieval device.