JPH0444166A - Retrieval management system - Google Patents

Abstract

PURPOSE:To improve the retrieval efficiency and the workability of retrieval by hierarchically converting data to classification code and registering the data in the systematically classified state. CONSTITUTION:Data, the character code of the first character of data, and the item code are saved in a temporary buffer 5, and plural hierarchical classification item codes are calculated based on the character code in the temporary buffer 5 and are stored in a generation buffer 6 together with data and the item code. Data is read out from the generation buffer 6, and a data code is added to register it in a data buffer 11, and the item code and plural classification item codes are read out from the generation buffer 6 and the data code is added to register them in an item buffer 12. Thus, the data code corresponding to each hierarchical classification item codes detected from the item buffer 12, and the data satisfying a retrieval condition is easily retrieved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a search management method for managing searches of databases and the like.

[Conventional technology]

In general, in a database that stores various documents, etc., when registering each document, data that becomes the corresponding search condition is set in advance, and by inputting the data that becomes the search condition, the specified document, etc. In this case, the operator must memorize in advance the data serving as the search conditions, such as a predetermined document.

However, when a large number of documents, etc. are stored in a database, and the number of data used as search conditions increases, it becomes difficult for the operator to memorize all of them. A problem arose in that a large amount of time had to be spent to find the information without inputting data.

In order to solve such problems, conventionally, the data serving as search conditions corresponding to each document, etc. is registered in advance as a reference table with code numbers assigned to each document in the order of input, and managed collectively. By displaying this reference table, that is, list 1 of data serving as search conditions on the screen, and having the user select data with a predetermined search condition from the table or select and input its code number, the target document, etc. A search management method that allows searching for information is known in some databases.

[Problem to be solved by the invention]

In the search management method using a reference table, the reference table is displayed on the screen as a list of search condition data, so the operator can search for the desired search condition from the screen display without having to remember the search condition data in advance. Data can be found.

However, there is a limit to the amount of data that can be displayed on one screen, and when a large number of documents, etc. are stored in the database, and the number of data for search conditions increases, it is necessary to scroll the screen to see the entire reference table. and in this case,
Since the data for the search conditions are displayed in the order in which they were entered, the operator can find the data for the desired search conditions by
Users had to scroll through the screen one by one and then repeatedly check the displayed search condition data one by one. For this reason, it generally takes a considerable amount of time to find data that meets the desired search conditions, which has the disadvantage of poor work efficiency.

SUMMARY OF THE INVENTION An object of the present invention is to provide a search management method that allows searching of databases and the like to be performed easily and quickly.

[Means to solve the problem]

In order to achieve the above object, the present invention saves a portion of the data, the character code of the first character of the data, and the item code in a buffer when the data of the search condition is input, and stores the characters in the temporary buffer. A plurality of hierarchical classification item codes are determined based on the code, and stored together with data and item codes in a creation buffer, and data is read from the creation buffer and data code is added to the data and registered in the data buffer. The present invention is characterized in that an item code and a plurality of classification item codes are read from the creation buffer and registered in the item buffer with the data code attached thereto.

In addition, when each table of contents related to the data of the target search condition is selected from the hierarchically classified list, the index buffer is referenced to determine the hierarchical classification item code that indicates each table of contents. , detect a data code that matches each of the identified classification item codes and the item code from the item buffer, detect data that matches the detected data code from the data buffer and store it in the table of contents buffer, and store the data that matches the detected data code in the table of contents buffer. It is characterized by displaying the contents as a table of contents.

[Effect]

In the search management method described above, when data for search conditions is input, multiple hierarchical classification item codes are attached to this data, hierarchical classification is performed, and this data is stored in the data buffer as a data code. , and a plurality of classification item codes are registered together with data codes in the item buffer.

When searching for data for a desired search condition, when a table of contents related to the desired search condition is selected from a hierarchically classified list, each hierarchical classification item code indicating the table of contents is assigned. The corresponding data code is detected from the above item buffer, and the data that matches the detected data code is detected from the above data buffer and displayed as a table of contents list. Based on this table of contents list, It is possible to easily search for data based on the desired search conditions.

〔Example〕

Hereinafter, one embodiment of the present invention will be described based on the drawings.

FIG. 1 is a block diagram of a search management system to which the search management method according to the present invention is applied. In the present invention, when registering documents, etc. in a database, etc., the data serving as search conditions that are input corresponding to each document, etc. are systematically classified and registered for each item. A table of contents list is created based on the classified and registered contents, and a search operation is performed based on the created table of contents list.

The search management system shown in FIG. 1 includes a processor 1 that performs search management control, a program memory 2 in which a control program for the processor 1 is stored, and data that serve as search conditions are systematically classified and registered by item. A memory 4 used for registration processing and search processing based on a table of contents list; a temporary buffer 5 for temporarily storing data processed in the registration processing and search processing; and a temporary buffer 5 for temporarily storing data processed in the registration processing and search processing. A creation buffer 6 that stores data information resulting from systematic classification by item, a table of contents buffer 7 that stores data that becomes elements of a table of contents list during search processing, and a display that displays a table of contents list, etc. It has a device 8.

Additionally, within the memory 4, there is a large code conversion buffer 9 in which character codes and large item codes are stored in advance in correspondence with the character type of the first character of data serving as a search condition, and a large code conversion buffer 9 is provided for each large item code. The data information stored in the medium code conversion buffer 10 and the creation buffer 6, in which medium item codes are stored in advance in correspondence with character codes, are allocated and registered into two in a predetermined manner. A data buffer 111 item buffer 12, a large item index buffer 13 that has a large item index table that can index large item codes from character types, and a medium item buffer 13 that has a large item index table that can index medium item codes from each character. A medium item index buffer 14 having an item index table and a layout buffer 15 in which the layout of the table of contents list is developed are provided.

2 and 3, large code conversion buffer 9. An example of a medium code conversion buffer 10 is shown.

In addition, Figures 4 and 5 respectively include a large item index table,
An example of a middle-to-second index table is shown.

Next, the registration process in the search management system with this configuration,
The search process will be explained.

FIG. 6 is a flowchart showing the processing flow when data serving as search conditions inputted at the time of database input are systematically classified and registered by item. It is assumed that the creation buffer 6 can store data for N items, and that the item counter CNT is initially set to "o".

Now, for example, as shown in Figure 7, when the search condition data for eight items I to IN, ``Tokyo, ``Osaka M, II Iwate, Old Paokinawa,'' are input in sequence (step 81), the item counter is incremented by "i" each time each data is input (step S2), and it is determined whether the input data is to be registered in the database (step S3). Data determined to be registered in the database is saved in the temporary buffer 5 with the character code of its first character and item code added (step 34). In other words, if you want to register all the N items of data shown in Figure 7 in the database, along with these data, the first characters ``'' and ``o'''
``I''...Character code for ``O''°'82C6
”, “82A8”, “82A2”, ・・・・・・, “8
2A8''' and item codes A, B, C,...
F are sequentially stored in the temporary buffer 5. Note that the character code is the one before conversion from hiragana to kanji, and also includes alphanumeric characters.

When the item counter CNT becomes 'N'' and all N item data, character codes, and item codes are stored in the temporary buffer 5 (step S5), database registration is executed, and first, the item counter CNT is is initialized to 1'' (step S6), and for each of the N items stored in the temporary buffer 5, large item code and medium item code detection processing, creation buffer 6, data A process for creating the buffer 111 item buffer 12 is performed (steps S7 to 519).

That is, read the character code ``82C6'' of the first item's data pattern ``'' from the temporary buffer 5, refer to the large code conversion buffer 9 in FIG. A large item code °''OO11'' corresponding to a character code smaller than is detected by the binary search method (step S8). When the large item code is detected (step S9), the medium code conversion buffer 10 in FIG. This major item code ``'00''
Referring to the portion corresponding to ``11'', the medium item code ``otoo'', which is a more finely classified large item code, is detected by the dichotomous search method (step 510). When the middle item code can also be detected, steps 88 and 81
Major item code of one item detected in 0 “00”
: +1'', middle item code "o i o o" is put into the creation buffer 6 (step Sl 2), and the data information in the creation buffer 6 is divided into two and stored in the data buffer 11 and item buffer 12, respectively. , create data buffer 11° item buffer 12 (step 8
13°514).

Next, the item counter CNT is incremented by 1'' (step 515), and the process returns to step S7 again to perform the same process for the next item. That is, the data of the next item ``Oozaka'' is transferred from the temporary buffer 5. character code ゛'
82 A 8 ” is read out, and based on this, the large item code “o o o o” is detected, and the medium item code “’0100” is also detected, and these are put into the creation buffer 6, and the data buffer 111 item buffer is Create 12.

Data for N items ``Let's go to Tokyo'', ``''Osaka''
, ``Iwate''', ..., ``Okinawa''', the creation buffer 6 is created as shown in Figure 8, and the data of N items are stored. For each item code, major item code,
The middle item code is set.

In addition, the data in the creation buffer 6 is registered in the data buffer 11 with data codes sequentially attached in ascending order of the character code as shown in FIG. 9, and the data in the item buffer 12 is registered as shown in FIG. A large item code, a medium item code, and a data code created at the time of registration to the data buffer 11 are registered in correspondence with the item code. Note that when input data is already registered in the data buffer 11 when registering data in the data buffer 11, the data code of the registered data is attached to this data without making new registration.

Also, in step S9, the large code conversion buffer 9
As a result of referring to , if the major item code corresponding to the character code cannot be detected, the major item code of the data becomes ``User'', and the major item code of ``User'' is shown in Figure 11 with the major item code ``1110''. A medium item index list as shown is displayed as an input screen (step 516).
). When the medium item index list as shown in FIG. 11 is displayed, the operator selects the medium item code and title of the medium item from this medium item index list (step 517). At this time, if the title of the middle item is to be newly registered (step 518), the title is written (step 519).

As a result, the large item code "User" 1
110” and the selected medium item code, e.g. '00
01'' is entered in the creation buffer (step 5L2), and the newly set title is the medium item code ``'00'' selected in step 317 in the medium item index buffer 14.
01” and is registered in the medium code index table (5th
(see figure). In addition, in Figure 5, the middle item code '0001
The title corresponding to `` is ``Part 1'',
This will contain the actual title.

Further, even if the large item code was detected in step S9, but as a result of referring to the medium code conversion buffer 10 in step 311, the medium item code corresponding to the character code could not be detected, The major item code is “user” and the same processing as above is performed.

In this way, the sequentially input search conditions and data can be systematically classified by item and registered in the data buffer 111 item buffer 12.
Based on this, a table of contents list is displayed and search processing is performed.

FIG. 12 is a flowchart showing the flow of search processing by displaying a table of contents list. When searching the database, if the operator does not know or wants to know the data of the item he or she wants to input, he or she presses a button to display a table of contents list. As a result, processor 1
A command to display a large item table of contents list is issued to the layout buffer 15, and a large item table of contents list as shown in FIG. 13 is displayed on the screen (step 521). Also, part of the item code indicating the item at this time is stored in the buffer 5. In the displayed large item table of contents list, for example, when the table of contents in ``A row'' is selected (step 322), the large item code ``o o o o'' corresponding to this table of contents ``A line'' is the large item index. It is detected from the large item index table (see FIG. 4) in the buffer 13 (step 323), passed to the processor 1, and stored in the temporary buffer 5.

Next, processor 1 detects the detected large item code °'
A command to display the table of contents of the medium items corresponding to "o o o o" is issued to the layout buffer 15, and the 14th
A table of contents of medium items as shown in the figure is displayed on the screen (step 524).

From the medium item table of contents list, for example, the table of contents 'All', which displays all data belonging to the large item, is selected.Step 52
5) Since the medium item code corresponding to this table of contents is the same as the large item code °' o o o o'' (step 526), it is not stored in the temporary buffer 5. At this time, the item code in the temporary buffer 5 code and the large item code 'oooo' in the item buffer 12 of FIG.
From data code "001", "002",...
... is detected (step 328>), and based on the detected data code, the first character from the data buffer 11 in FIG. The content of the data is either ``Aomori'', ``Akita'', etc.
. . , "Okinawa" is detected and stored in the table of contents buffer 7 (step 529).

On the other hand, in step S25, when the table of contents 'o'' is selected from the table of contents for medium items, the medium item code ""oioo" corresponding to this table of contents is detected and stored in the temporary buffer 5. (Step 527). In this case, the data code is read from the item buffer 12 in FIG.
005″ and “006” are detected (step 328>
, Based on the detected data code, the contents of the data whose first character is °゛O'' were detected from the data buffer 11 in Figure 9. stored in buffer 7 (step 52
9).

In this way, depending on whether the table of contents selected from the medium item table of contents list is "all" or, for example, "o", the data code is detected and the table of contents based on the detected data code is detected. After the data contents are detected and stored in the table of contents buffer 7, the processor 1
, depending on whether the selected table of contents is "all" (step 330), issues a vowel-based table of contents list or sub-item table of contents list command to the layout buffer 15, and displays the vowel-based table of contents list or sub-item table of contents. Displays a list.

That is, if the selected table of contents is "All" (step 530), a layout of the table of contents list by vowel is created (step S31, and the contents of the data stored in the table of contents buffer 7 in step S29). ``Aomori'', ``Akita''... ``Okinawa'' are read out, and a table of contents list by vowel as shown in Figure 15 is displayed (step 532).The selected table of contents is also displayed. “Oh”
If so (step 530), the layout of the sub-item table of contents list is created (step 833), and the contents of the data stored in the table of contents buffer 7 in step S29 are ``covered'', . . .・, “Okinawa”
is read out, and a small item table of contents list as shown in FIG. 16 is displayed.

According to this embodiment, by simply inputting search condition data, this data is roughly divided into hierarchical classifications of large items and medium items, coded, and systematically processed. Since the items are registered in a classified state, it is possible to easily create a table of contents for database searches without much effort.

In addition, even if you forget or do not know what kind of data was used as the search condition, a table of contents based on systematic classification will be displayed quickly, so you can easily find the desired search condition. data can be quickly and easily found, search efficiency can be improved, and search workability can be expanded.

〔Effect of the invention〕

As explained above, according to the present invention, simply by inputting search condition data, this data is hierarchically classified and coded, and is registered in a systematically classified state. A table of contents for searching can be created easily and without much effort.

In addition, a table of contents list based on systematic classification is displayed quickly, so even if you forget or don't know what kind of data was the search condition, you can use the table of contents list to find the purpose. It is possible to quickly and easily find data that meets the desired search conditions, and it is possible to improve search efficiency and search workability.

[Brief Description of the Drawings] Figure 1 is a configuration diagram of a search management system to which the search management method according to the present invention is applied, and Figures 2 and 3 are examples of a large code conversion buffer and a medium code conversion buffer, respectively. Figures 4 and 5 are examples of a large item index table and an example of a medium item index table, respectively, and Figure 6 is an example of how data used as search conditions is systematically categorized and registered by item. A flowchart showing the processing flow, Figure 7 shows the N that is about to be registered.
A diagram showing an example of data that is a search condition for mediation, Figure 8 is a diagram showing how the data shown in Figure 7 is systematically classified and stored in a creation buffer, and Figures 9 and 10 are creation buffers. Figure 11 shows an example of the contents of the data buffer and item buffer created based on the contents stored in Figure 8, Figure 11 shows an example of the middle item index list, and Figure 12 shows an example of the contents of the item buffer. A flowchart showing the flow of search processing by displaying a table of contents list. Figures 13 and 14 are examples of a large item table of contents list and a medium item table of contents list, respectively. Figures 15 and 16 are by vowel. Table of contents list. FIG. 7 is a diagram showing an example of a table of contents of small items. ■... Processor, 2... Program memory, 4...
...Memory, 5...Temporary buffer, 6...Creation buffer, 7...Table of contents buffer, 8...Display device, 9...
...Large code conversion buffer, 10...Medium code conversion buffer, 11...Data buffer, 12...Item buffer,
13...Large item index buffer, 14...Medium item index buffer, 15...Layer 1 to buffer figure figure figure figure figure figure mouth y10 figure figure figure figure figure figure figure figure figure figure mouth y10...

Claims (1)

[Claims] 1) When the data of the search condition is input, the data, the character code of the first character of the data, and the item code are saved in a temporary buffer, and based on the character code in the temporary buffer, Determine hierarchical multiple classification item codes, and
Store the data together with the item code in the creation buffer, read the data from the creation buffer, add a data code to the data and register it in the data buffer, and read out the item code and a plurality of classification item codes from the creation buffer and add the data code. A search management method characterized in that the information is registered in an item buffer. 2) When each table of contents related to the data of the target search condition is selected from the hierarchically classified list, each hierarchical classification item code indicated by each table of contents is determined by referring to the index buffer. , detecting a data code that matches each of the identified classification item codes and the item code from the item buffer, detecting data that matches the detected data code from the data buffer and storing it in a table of contents buffer;
2. The search management system according to claim 1, wherein the contents of the table of contents buffer are displayed as a table of contents list.