JPH09101968A - Method and device for retrieving data - Google Patents

Abstract

PROBLEM TO BE SOLVED: To shorten processing time required for data retrieval and to simplify the structure of an application program by automatically detecting the next retrieval key out of related keys. SOLUTION: A storage position managing means 4 is retrieved by a data retrieving means 2, and a record number corresponding to the retrieval key is outputted. Next, a data storage means 5 is retrieved by the data retrieving means 2, and data corresponding to the record number are read out and stored in a data reporting means 3. A next data amount counting means 10 performs counting, the amount of outputted data is increased for '1', an area counting means 7 performs counting, the number of empty areas is decreased for '1', a retrieval hierarchy counting means 8 performs counting, and the number of remaining retrieval hierarchies is decreased for '1'. The area counting means 7 and retrieval hierarchy counting means 8 are referred to by the data retrieving means 2 at all times. When the number of remaining retrieval hierarchies shown by the retrieval hierarchy counting means 8 becomes '0', the end of retrieval is reported to an instruction display means 1 and processing is finished.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data search method, and more particularly, to a data search method which has a related key for searching related data in the searched data and repeatedly searches for related data by the related key. Regarding

[0002]

2. Description of the Related Art FIG. 9 is a block diagram of a data management table.
0 is a configuration diagram of the conventional example, FIG. 11 is a data table configuration diagram of the conventional example, and FIG. 12 is a flowchart diagram of the conventional example.

In FIG. 10, 20 is a processor circuit, 30 'is a memory circuit, 40 is a file circuit, 31 is an application program, 32' is a search program, and 33 is an output area. , 41 is a data management table, 42 is a data table, and 91 and 92 are connection lines.

The processor circuit 20 is connected to the storage circuit 30 'via a connection line 91, is connected to the file circuit 40 via a connection line 92, and is stored by the application program 31 read from the storage circuit 30'. An output area 33 is provided in 30 ′, a search key is designated, a search program 32 ′ read from the storage circuit 30 ′ is instructed to search data, and a search key is designated by the search program 32 ′ to be output from the file circuit 40. It is a circuit that retrieves data and stores the data in the output area 33.

The memory circuit 30 'is a circuit which is connected to the processor circuit 20 via a connection line 91, stores an application program 31 and a search program 32', and stores the searched data in the output area 33.

The file circuit 40 is a large-capacity nonvolatile memory circuit (for example, a disk circuit) connected to the processor circuit 20 via a connection line 92, and the data management table 4
1 and the data table 42 are stored in the circuit.

The application program 31 is read from the memory circuit 30 ', operates the processor circuit 20 and instructs the search program 32' to search data, and the search program 3 '
2'is a program for receiving the completion notification from 2'and reading the retrieved data from the output area 33.

The search program 32 'is a program which is read from the memory circuit 30', operates the processor circuit 20 to read the record number from the file circuit 40, further reads the data, and stores the data in the output area 33. .

The data management table 41 is a list of record numbers stored in the file circuit 40 and corresponding to the search keys as shown in FIG. The data table 42 is a list of data stored in the file circuit 40 and including search keys and related keys corresponding to the record numbers as shown in FIG.

A conventional example will be described with reference to FIGS. 9, 10, 11, and 12. In the following description, the same parts or corresponding parts are denoted by the same reference numerals. In step S1, the application program 31 notifies the search program 32 'of the output area 33 prepared as a data storage area of the search result, the search key is designated, and the data search is instructed.

In step S2, the search program 32 '
The data management table 41 is searched by and the record number of the data table is read from the area corresponding to the search key. In step S3, the data table 42 is searched by the search program 32 ', data including the search key and the related key is read from the area corresponding to the record number,
Stored in the output area 33, the application program 31 is notified of the end of the search, and the processing is completed.

[0012]

As described above, in the data search, when the application program specifies the search key and the search program is instructed, and the data searched by the search key is stored in the output area by the search program. When the related data is diversified and the search hierarchy is multi-layered, the application program generates a search key based on the data every time one data is output, and the search program There was a problem that I had to instruct a search.

According to the present invention, a criterion for selecting a related key as a search key is specified in advance, an order of using related keys as a search key is specified, a search hierarchy is specified, and a capacity of a data output area is specified. , The purpose is to provide a means for automatically searching and outputting by dividing related data into a necessary range and a necessary amount.

[0014]

FIG. 1 is a diagram illustrating the principle of the present invention. In FIG. 1, 1 is an instruction display means, 2 is a data search means, 3 is a data notification means, 4
Is a storage position management means, 5 is a data storage means, 6 is a parameter holding means, 7 is a region number counting means, 8 is a search hierarchy counting means, and 9 is a data amount counting means. 10 is a next data amount counting means,
Reference numerals 1, 12, 13 and 14 are connection lines.

The instruction display means 1 is connected to the data retrieval means 2 via the connection line 11, and is connected to the data notification means 3 and the parameter holding means 6 via the connection line 12 so that the related key is previously set prior to the retrieval instruction. A reference for selecting as a search key is set as a parameter in the parameter holding means 6, and a data notifying means 3 for passing the search result data to the instruction display means 1 is prepared, and the position of the data notifying means 3 together with the search key, The capacity and the number of search layers are notified to the data search means 2 to instruct the data search, and the data of the data search result is read from the data notification means 3.

The data retrieval means 2 is connected to the instruction display means 1 via a connection line 11, is connected to the data notification means 3 and the parameter holding means 6 via a connection line 12, and stores position management via a connection line 13. Means 4 and data storage means 5
Connected to the area number counting means 7, the search hierarchy counting means 8, the data amount counting means 9, and the next data amount counting means 10 via the connection line 14, and the search key designated from the instruction display means 1 or The record number is read from the storage position management means 4 by the related key (that is, the search key) in the data of the search result that satisfies the parameter, and the data is read from the data storage means 5 by the record number to the data notification means 3. If there is no room to store the output data in the data notifying means 3 before the completion of searching for the specified number of layers, the fact is notified to the instruction displaying means 1 and the data is searched by the instruction of the instruction displaying means 1. Is a means of continuing or interrupting.

The data notifying means 3 is a means which is connected to the instruction display means 1 and the data searching means 2 via a connecting line 12 and stores the search result data. Storage location management means 4
Is a means which is connected to the data search means 2 via the connection line 13 and stores the record number corresponding to the search key.

The data storage means 5 is a means which is connected to the data search means 2 via the connection line 13 and stores data corresponding to the record number. The parameter holding unit 6 is connected to the instruction display unit 1 and the data search unit 2 via the connection line 12, and holds the reference for selecting the related key as the search key and the search order between the related keys.

The area number counting means 7 is connected to the data searching means 2 through the connection line 14 and is a means for counting and displaying the free capacity of the data notifying means 3. The search hierarchy counting means 8 is a means that is connected to the data search means 2 via a connection line 14 and displays the number of hierarchies remaining without being searched among the search hierarchy numbers designated by the instruction display means 1.

The data amount counting means 9 is connected to the data searching means 2 and the next data amount counting means 10 through the connection line 14, belongs to the same search hierarchy as the data used for the search, and is not used for the search. This is a means for counting and displaying the remaining number of remaining data.

The next data amount counting means 10 is connected to the data searching means 2 and the data amount counting means 9 via the connection line 14, and the data amount of the data already output and belonging to the same search hierarchy as the data being output is It is a means of counting and displaying.

From the instruction display means 1, the position of the data notifying means 3, the position of the parameter holding means 6, the position and capacity of the data notifying means 3, the number of retrieval layers, and the retrieval key for the first retrieval are designated. And data search is instructed,
The capacity of the data notifying means 3 is set in the area number counting means 7 and the number of search layers is set in the search layer counting means 8 by the data search means 2.

Next, the data retrieval means 2 retrieves the storage location management means 4 and outputs the record number corresponding to the retrieval key. Next, the data retrieval unit 2 retrieves the data storage unit 5, the data corresponding to the record number is read out and stored in the data notification unit 3, and the next data amount counting unit 10 counts and outputs the output data amount. 1, the area number counting means 7 is counted, and the free area is decreased by 1,
The search hierarchy counting means 8 is counted and the number of remaining search hierarchy is decreased by one.

Area number counting means 7 and search hierarchy counting means 8
Is constantly referred to by the data search means 2, and when the number of remaining search hierarchies indicated by the search hierarchy counting means 8 becomes 0, the instruction display means 1 is notified of the end of the search, and the processing ends.
Even when the number of remaining search layers is not 0, when the free area indicated by the area number counting means 7 becomes 0, the instruction display means 1 is notified that the storage capacity of the data notification means 3 is insufficient and the processing is interrupted. .

When the processing is interrupted, the instruction display means 1 waits for an instruction, and the position and capacity of the newly prepared data notification means 3 are notified, and when the instruction display means 1 is instructed to continue the search, the data search means. By 2, the capacity is set in the area number counting means 7 and the processing is restarted. When the end of processing is instructed from the instruction display means 1, the data retrieval means 2 causes the area number counting means 7, the retrieval layer counting means 8, the data amount counting means 9,
The next data amount counting means 10 is set to the initial state and the process is terminated.

When there is an empty area and the number of remaining search layers is not 0, the number of data stored in the data notifying means 3 one layer before in the next data amount counting means 10 every time the number of remaining search layers is decreased by 1. Is transferred to the data amount counting means 9, and the next data amount counting means 10 is set to the initial value.

Then, among the data stored in the data notifying means 3, the data retrieved one by one from the last stored data is located at a position which is traced back by the value indicated by the data amount counting means 9. Read out,
The data amount counting means 9 is decreased by one each time.

On the other hand, the parameter of the search hierarchy indicated by the search hierarchy counting means 8 is read from the parameter holding means 6, and the data and the parameter are compared,
The unprocessed related keys are read out one by one from the related keys designated by the parameter as the search key in the earlier order, and checked based on the selection criteria.

Then, the record number is read out from the storage position managing means 4 by the search key, the data is read out by the record number and the data is stored in the data notifying means 3, and the area number counting means 7 and the search hierarchy counting means 8 are also provided. The data amount counting means 9 and the next data amount counting means 10 are counted.

When there is no relevant key to be read out in one data, the data stored in the data notifying means 3 is traced back by the value indicated by the data amount counting means 9 from the last stored data. The data at the position is read by the data search means 2 one by one, and the data amount counting means 9 is decreased by one each time.

When there is no more data for reading the related key in the same search hierarchy, the value stored in the next data amount counting means 10 is set in the data amount counting means 9, and the next data amount counting means 10 is initialized. The number of remaining search layers set by the value and displayed by the search layer counting means 8 is decreased by one.

When the number of remaining retrieval layers indicated by the retrieval layer counting means 8 becomes 0, the process ends.

[0033]

FIG. 2 is a block diagram of the first embodiment of the present invention, and FIG. 3 is a search parameter format diagram of the first embodiment of the present invention in which there are three related keys. FIG. 4 is a diagram showing a case where there are three related keys, and FIG. 4 is a data table configuration diagram of the first exemplary embodiment of the present invention,
FIG. 5 is a flowchart diagram (No. 1) of the first embodiment of the present invention, FIG. 6 is a flowchart diagram (No. 2) of the first embodiment of the present invention, and FIG. 7 is a first embodiment of the present invention. 8 is a flowchart (No. 3) of the embodiment of the present invention, and FIG. 8 is a flowchart (No. 4) of the first embodiment of the present invention.

In FIG. 2, 20 is a processor circuit, 30 is a memory circuit, 31 is an application program, 32 is a retrieval program, 33 is an output area, 34 is a parameter table, and 40 is. A file circuit, 41 is a data management table, 42 is a data table, 51 is an area number counting circuit, 52 is a hierarchy counting circuit, 53 is a data amount counting circuit, and 54 is the next data. A quantity counting circuit, 55 is a data register, and 5
6 is a parameter register.

The memory circuit 30 is connected to the processor circuit 20 via a connection line 91, an application program 31 and a search program 32 are stored, search parameters used for the search are stored in a parameter table 34, and search result data is stored. Is a circuit stored in the output area 33.

The area number counting circuit 51 is a circuit which is connected to the processor circuit 20 through a connection line 93 and displays the number of empty areas in the output area. The layer counting circuit 52 has a connecting line 93.
It is a circuit that is connected to the processor circuit 20 via the, and counts and displays the number of remaining search hierarchies remaining in the search hierarchies designated by the application program 31.

The data amount counting circuit 53 is connected to the processor circuit 20 and the next data amount counting circuit 54 via the connecting line 93, and the remaining data not belonging to the retrieval among the data belonging to the retrieval layer shown by the layer counting circuit 52. This is a circuit for counting and displaying the number of data.

The next data amount counting circuit 54 is a circuit which is connected to the processor circuit 20 and the data amount counting circuit 53 via a connecting line 93 and counts and displays the number of output data in the output area 33.

The data register 55 is connected to the processor circuit 20 via a connection line 93, and is set with data for one record which is not used for retrieval and is used for extracting the retrieval key from the related key in comparison with the parameter. Circuit.

The parameter register 56 is connected to the processor circuit 20 via a connection line 93, and the parameter table 34
It is a circuit in which a parameter corresponding to the search hierarchy indicated by the hierarchy counting circuit 52 read out from among is set.

Data retrieval according to the present invention is shown in FIG.
This will be described with reference to FIGS. 3, 4, 5, 5, 6, 7, 8 and 9. In step S1, the application program sets the number of data output areas for storing the search result data in the area number counting circuit 51, the number of search layers in the layer counting circuit 52, the position of the parameter table and the position of the data output area. And the search key are notified to the search program 32 to instruct the search.

In step S2, the search program 32 transfers the parameters corresponding to the first search hierarchy from the parameter table to the parameter register 56. In step S3, the data management table 41 by the search program 32.
Is read and the record number of the data table 42 corresponding to the search key is read.

In step S4, the data table 42 is searched by the search program 32, the data of the record corresponding to the record number is read, and the data register 5 is read.
Stored in 5.

In step S5, the data read from the data register 55 by the search program 32 is packed in the output area 33 from the beginning and stored, and the area number counting circuit 5
1 and the layer counting circuit 52 are decremented by 1, the next data amount counting circuit 54 is decremented by 1, and the parameter corresponding to the next retrieval layer is transferred from the parameter table 34 to the parameter register 56.

In step S6, the search program 32 checks the hierarchy counting circuit 52. If it is 0, the search is completed and the process proceeds to step S20. If it is not 0, the process proceeds to step S7.

In step S7, the number-of-areas counting circuit 51 is checked by the search program 32. If the value is 0, the output area is insufficient and the process proceeds to step S21. If the value is not 0, the process proceeds to step S8.

In step S8, the search program 32 compares the parameter register 56 with the data register 55 to check an unprocessed related key having a fast processing order.

In step S9, if no unprocessed related key remains in the data set in the data register 55, the process proceeds to step S15, and if it remains, the process proceeds to step S10.

In step S10, the retrieval program 32
Checks whether the related key satisfies the selection criterion specified by the parameter register 56. If the related key does not satisfy the selection criterion, the process returns to step S8 to check the next related key and set the selection criterion. If so, the process proceeds to step S11.

In step S11, the retrieval program 32
Thus, the data management table 41 is searched and the record number of the data table 42 corresponding to the related key is read. In step S12, the data table 42 is searched by the search program 32, and the data of the record corresponding to the record number is read.

In step S13, the retrieval program 32
The data is stored in the empty area of the output area 33 following the previously stored data by the area count circuit 5
1 is decremented by 1 and the next data amount counting circuit 54 is incremented by 1.

In step S14, the retrieval program 32
Checks the area number counting circuit 51. If 0, the process proceeds to step S21. If it is not 0, step S21 is performed.
Return to 8.

In step S15, the retrieval program 32
Thus, the data amount counting circuit 53 is decremented by one. Step S
In step 16, the data amount counting circuit 53 is checked by the search program 32, and if it is other than 0, step S19.
If 0, the process proceeds to step S17.

In step S17, the retrieval program 32
Causes the layer counting circuit 52 to be decremented by 1, the value of the next data amount counting circuit 54 is set in the data amount counting circuit 53, 0 is set in the next data amount counting circuit 54, and the parameters of the next layer are set in the parameter table 34. To the parameter register 56.

In step S18, the retrieval program 32
Then, the hierarchy counting circuit 52 is checked. If it is 0, the search is completed and the process proceeds to step S20. If it is not 0, the process proceeds to step S19.

In step S19, the retrieval program 32
Thus, the data is read from the area traced back by the value indicated by the data amount counting circuit 53 from the final storage position of the output area 33, set in the data register 55, and the process returns to step S8.

In step S20, the search program 32
Thus, the area number counting circuit 51, the layer counting circuit 52, the data amount counting circuit 53, and the next data amount counting circuit 54 are set to initial values, and the application program 31 is notified of the end of the processing, and the processing is ended.

In step S21, the retrieval program 32
Causes the application program 31 to be notified of the interruption of processing due to lack of an output area, and is required to give an instruction to continue or complete the processing.

In step S22, the retrieval program 32
Waits for an instruction from the application program 31. Step S2
In 3, the search program 32 checks whether or not there is an instruction from the application program 31, and if there is an instruction, the process proceeds to step S24, and if there is no instruction, the step S22.
Return to

In step S24, the search program 32
Checks the instruction contents from the application program 31 and if the end is instructed, the process proceeds to step S25,
If the continuation is instructed, the process returns to step S8.

In step S25, the retrieval program 32
Thus, the area number counting circuit 51, the layer counting circuit 52, the data amount counting circuit 53, and the next data amount counting circuit 54 are set to the initial values, and the process is ended.

In the description of the present embodiment, each of the area number counting means, the search hierarchy counting means, the data amount counting means, and the next data amount counting means is explained as a hardware counting circuit. The same effect can be obtained by providing a counting area corresponding to each of the counting means, storing the value counted by the search program in the counting area, and reading the value of the area.

Further, it is possible to specify specific information in the data as a selection condition for selecting the related key as the search key, and specify the related key used as the search key and the use order of the related keys. In addition to the method of directly specifying the selection criteria for selecting the related key as the search key and the method of specifying the number of search layers, it is also possible to select and specify from preset ones.

[0064]

As described above, according to the present invention, when the related data is diversified and the search hierarchy is multi-layered, the related data is divided into a required range and a required amount with one instruction. Since the data can be automatically divided and output, the processing time required for data retrieval can be shortened and the structure of the application program can be simplified.

[Brief description of the drawings]

FIG. 1 is a principle diagram of the present invention.

FIG. 2 is a configuration diagram of a first embodiment of the present invention.

FIG. 3 is a search parameter format diagram according to the first embodiment of this invention.

FIG. 4 is a data table configuration diagram according to the first embodiment of this invention.

FIG. 5 is a flow chart of the first embodiment of the present invention (No. 1)

FIG. 6 is a flow chart of the first embodiment of the present invention (No. 2)

FIG. 7 is a flowchart of the first embodiment of the present invention (part 3).

FIG. 8 is a flowchart (part 4) of the first embodiment of the present invention.

[Figure 9] Data management table configuration diagram

FIG. 10 is a block diagram of a conventional example

FIG. 11 is a data table configuration diagram of a conventional example.

FIG. 12 is a flowchart of a conventional example.

[Explanation of symbols]

 1 instruction display means 2 data search means 3 data notification means 4 storage position management means 5 data storage means 6 parameter holding means 7 area number counting means 8 search hierarchy counting means 9 data amount counting means 10th data amount counting means 11, 12, 13, 14 Connection line 20 Processor circuit 30 Storage circuit 31 Application program 32 Search program 33 Output area 34 Parameter table 40 File circuit 41 Data management table 42 Data table 51 Area number counting circuit 52 Hierarchical counting circuit 53 Data amount counting circuit 54 Next data Quantity counting circuit 55 Data register 56 Parameter register 91, 92, 93 Connection line

Claims (11)

[Claims] 1. A data search method in which a related key is detected from data searched by a search key, and the next data is subsequently searched by using the related key as a next search key. A data search method characterized by automatically detecting the next search key. 2. The data search method according to claim 1, wherein a plurality of the related keys are included in the data. 3. The data search method according to claim 2, wherein a related key used as a search key can be designated from among the related keys. 4. The data search method according to claim 2, wherein the use order of related keys used as search keys can be specified. 5. The data search method according to claim 2, wherein the related key can be selected as a search key by designating a selection criterion. 6. The data search method according to claim 2, wherein data search of a specified number of search layers is possible. 7. A related key used as a search key,
3. The data search method according to claim 2, wherein the use order of the related keys, the selection criteria for selecting the related keys as the search keys, and the number of search layers can be designated at the time of the data search instruction. 8. The data output as a result of the data search,
The data retrieval method according to claim 2, wherein the data amount can be specified and output in a divided manner. 9. A data retrieval device comprising a data retrieval means, a storage location management means, and a data storage means which are mutually connected via a connection line, wherein a related key is based on a selection criterion set by an instruction display means. Is selected as a search key, and related data is output using the search key. 10. The data amount counting means, the next data amount counting means, and the search hierarchy counting means are connected to the data search means via a connecting line, and the data of the next search hierarchy among the data already output by the data amount counting means. The number of data not used for data retrieval is counted, the number of data belonging to the same retrieval layer as the data being output is counted by the next data amount counting means, and the number of retrieval layers specified by the retrieval layer counting means is calculated. The data search device according to claim 9, wherein the number of remaining search layers for which data search has not been completed is counted. 11. An area number counting means is connected to a data search means via a connection line, and the amount of data output as a result of the search is counted by the area number counting means, and the data amount exceeds the capacity of the data notification means. The data retrieval device according to claim 9, wherein excess capacity is detected when the data retrieval is performed.