JPS62182923A - Retrieving system for index registration of range value data - Google Patents

Abstract

PURPOSE:To perform a processing quickly by providing a pointer value output means which outputs a pointer value indicating a data record storage address from a range value index storage means when it is decided by a condition deciding means that a retrieval condition is satisfied. CONSTITUTION:The start value of the retrieval condition, its end value, a maxi mum range value stored in a maximum range value storage means 6, the repre sentative value of range value index records, and the range value are denoted as (x), (y) (x<=y), (r), (a), and (b) respectively. A condition deciding means 11 compares the representative value (a), the range value (b), the start value (x), and the end value (y); and if x<=a+b and a-b<=y are true, it is decided that the retrieval condition is satisfied, and a pointer value 33 is transferred to a pointer value output means 12 to output the list of pointer values satisfying the retrieval condition. Until the representative value (a) of range value index records is larger than y+r, the pointer value is positioned to the range value index record having the next larger representative value by an index record positioning means, and the operation of the condition deciding means 11 and following operations are repeated.

Description

DETAILED DESCRIPTION OF THE INVENTION (Industrial Application Field) The present invention relates to information processing of data including measurement errors such as scientific and technical data, and particularly to an index registration method and a search method that take range values into consideration.

(Prior Art) FIG. 4 is a configuration diagram showing an example of key information, with a minimum key value of 41. It consists of a maximum key value 42 and a pointer value 43 indicating a data record storage address.

FIG. 5 is a configuration diagram showing an example of search conditions, which are composed of a start value 51 and an end value 52.

FIG. 6 is an explanatory diagram showing an example of a procedure for returning a pointer value indicating a data record storage address in response to the restriction conditions of a start value X and an end value y (a=≦y).

FIG. 7 is a configuration diagram showing an example of index registration search processing according to the prior art.

FIG. 7a is a block diagram showing an example of a conventional index registration search processing device for data having range values.
2, an index registration means 73, an index storage means 74, an index search means 75, a logical operation means 76, a search condition input means F7, an index search control means F8, and a pointer value output means F9. It consists of

FIG. 7 is a configuration diagram showing a row of index records constituting the index storage means 74, and the index record has a key value of 7.
10 and pointer value 7 indicating the data record storage address
It consists of 11.

Conventionally, index registration processing and index search processing when processing data having range values have been performed as follows.

First, index registration processing will be explained.

The key information input means 71 inputs thousand-information consisting of a minimum key value 41, a maximum key value 42, and a pointer value 43 indicating a data record storage address, and the index registration control means 72 is activated.

The index registration control means 72 activates the index registration means 73't- with the minimum key value 41 as a key value, and creates an index record consisting of the minimum key value 41 and a pointer value 711 indicating the data record storage address, It is registered in the index storage means 74. Still, the index registration means 73 is activated using the maximum key value 42 as a key value, and an index record consisting of the maximum key value 42 and a pointer value 711 indicating the data record storage address is created and registered in the index storage means 74. . That is, an index record having the minimum key value 41 as the key value 711 and an index record having the ant large key value 42 as the key value 711 are registered in the index storage means 74 for one data record.

Next, the operation of index search processing will be explained.

Conditional search processing for an index that registers data with a range value can be performed using, for example, ■ to ■ in the same figure for the limiting conditions of start value 2 and end value y (z≦y) as shown in Figure 6. The purpose is to return a pointer value 711 indicating the data record storage address of (1) to (2) as data that satisfies the condition from within the data record having the range value.

The index search process is performed by the following steps (1) to 18).

(1) Search conditions including a start value 51 and an end value 52 are input using the index condition input means f7.

(2) The index search control means 78 performs the following operations (3) to (81).
Activate the operations in sequence.

(3) Φ− of the index record constituting the index storage means 74
Assuming that the value 71G is V, the index search means 75 obtains a list of pointer values 71.1 indicating data record storage addresses satisfying X≦V≦y from the index storage means 74.

(4) The index storage means 74 is searched by the index search means 75.
From V(X), a list of pointer values 7.11 indicating data record storage addresses that satisfy X is obtained.

(5) The index storage means 74 is searched by the index search means 75.
From this, a list of pointer values 7.1.1 indicating data record storage addresses satisfying y<v is obtained.

16) Logical product of the list of pointer values indicating the data record storage addresses created in (4) and the list of pointer values indicating the data record storage addresses created in (5) by the logical operation means 76 get.

+71 The logical operation means 76 obtains the AND of the list of pointer values indicating the data record storage addresses created in +3) and the list of pointer values indicating the data record storage addresses created in (6).

+81 By the pointer value output control means 79, (7)
The list of pointer values indicating the data record storage address created in is returned as output information.

With the above steps, the operation of the index search process is completed.

(Problems to be Solved by the Invention) Since the conventional search processing for data having range values described above is realized by three index search operations and two logical operation operations, it is desirable to increase the processing speed. The drawbacks are that it is difficult to use, and there are problems with high speed.

The purpose of the present invention is to register data with range values in a range value index and perform conditional searches using the range value index, thereby eliminating the above disadvantages and enabling high-speed processing. The object of the present invention is to provide an index registration search method for configured range value data.

(Means for Solving the Problems) The registration search method of a range value index according to the present invention is a range value index registration search method according to the present invention that uses a range value index for storing a representative value of data having a range, a range value, and a pointer value indicating a data record storage address. a value index storage means, a maximum range value storage means for storing the maximum value of the range values, a key information input means for inputting key information given from the outside, and a representative value corresponding to the key information. a key value creation means for creating a range value;
Maximum range value management means for managing the maximum value of the range values created by the key value creation means with the maximum range value storage means, and storage of the range value index based on the representative value created by the key value creation means. An index search means for searching a range value index of the means, and a range value index of the range value index storage means that stores the representative value, range value, and pointer value indicating the data record storage address created by the key value creation means. an index record registration means for registering a search condition, a rounding search condition input means for inputting a search condition, and a search range of the range value index of the range value index storage means according to the search condition and the contents of the maximum range value storage means. a search range setting means for setting a search range; an index and code positioning means for locating a range value index record in the range value index storage means based on the search range set by the index range setting means; a condition determining means for determining whether the index record of the index storage means satisfies the above search condition; and when the condition determining means determines that the above search condition is satisfied, the range value index storage means; and pointer value output means for outputting a pointer value indicating a data record storage address from the means.

(Example) Next, the present invention will be described in detail with reference to the drawings.

Referring to FIG. 1, an embodiment of the index registration search method for range value data according to the present invention includes a key information input means 1, a key value creation means 2, a maximum range value management means 3,
An index search means 4, an index record registration means 5, a maximum range value storage means 6, a range value index storage means 5, a search condition input means 8, a search range setting means 9, and an index record positioning means 10 , condition determination means 11 , and pointer value output means 12 .

Referring to FIG. 2, the range value index storage means 7 is composed of an upper level index block 21 and a lowest level index block 22, and the lowest level index block 22 is
The range consists of direct index records 23.

Referring to FIG. 8, the range value index record 23 includes representative values 31 . It consists of a range value 32 and a pointer value 33 indicating a data record storage address.

First, the operation of index registration processing will be explained.

Key information such as a minimum value 41, a maximum key value 42, and a pointer value 43 indicating a data record storage address as shown in FIG. 4 is inputted from the key information input means l shown in FIG. 2, an intermediate value between the minimum key value 41 and the maximum key value 42 is created as a representative value, a value obtained by subtracting the representative value from the maximum key value is created as a range value, and the maximum range value management means 3 and the index search means 4 make it work.

The maximum range value management means 3 compares the range value created by the key value creation means 2 with the contents of the maximum range value storage means 6, and if the range value created by the key value creation means 2 is larger, The contents of the maximum range value management means 6 are updated with this range value.

The index search means 4 searches the range value index storage means 7 using the representative value created by the key value creation means 2 as a key,
Knowing the storage position of the range value index record 23, the index record registration means 5 is operated.

If the representative value created by the key value creation means 2 has already been registered in the range value index storage means 7, the range value and pointer value 43 are added to the range value index record 23, and if the representative value has not been registered, the key value A range value index record 23 is created from the representative value and range value created by the value creation means 2, and a pointer value 43 indicating a data record storage address, and is registered in the range value index storage means 7.

Next, the operation of index search processing will be explained.

As shown in FIG. 6, the start value 51 of the search condition is 2, the end value 52 is y (z≦y), the maximum range value stored in the maximum range value storage means 6 is r, and the range value index record 23 Let the representative value 31 be a and the range value 32 be b. A start value 51 and an end value 52 are input from the search condition input means 8, and the search range of the range value storage means 7 is set by the search range setting means 9 (,=
r) to (y+r)t, and index record positioning is done by means lO! Position the first range value index record 23 having a representative value equal to or greater than D(, -r), and condition determination means 1
Operate 1.

The condition determining means 11 compares the representative value a, the range value, the starting value X, and the ending value y, and determines that X≦a + b, and
If a-b≦y, it is determined that the search condition is satisfied, and the pointer value 33 is passed to the pointer value output means 12, which outputs a list of pointer values that satisfy the search condition.

The representative value a of the range value index record 23 is a ) y + r
The index record positioning means 10 positions the range value index record 23 having the next largest representative value 31 until the condition determination means 11 and the subsequent operations are repeated.

(Effects of the Invention) As explained above, the present invention registers data with range values in a range value index and performs a conditional search using the range value index, thereby performing a single index search in the first place. Conditional search processing can be performed by operation, which has the effect of eliminating the need for logical operation processing and shortening the time required for search processing.Secondly, in searching data with range values. , this has the effect of eliminating the need to consider range values in search conditions.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of an index registration search method for range value data according to the present invention. FIG. 2 is an explanatory diagram showing the structure of a range value index. FIG. 8 is an explanatory diagram showing the structure of a range value index record. FIG. 4 is an explanatory diagram showing the structure of key information. FIG. 5 is an explanatory diagram showing the structure of search conditions. FIG. 6 is an explanatory diagram showing a specific example of search conditions. FIG. 7 is an explanatory diagram showing conventional index registration search processing for data having range values. 1.71...Key information input means 2...Key value creation means 3...Maximum range value management means 4.75...Index search means 5...-Index record registration means 6...Maximum range Value storage means Φ... Range value index storage means 8.77 -- Search condition input means 9... Search range setting means lO... Index record positioning means 11... Condition determination means 12.79 ...Pointer value output means 21.22...Block 23@...Records 31-33.41-43. Sl, S2.710°711
...11 own data field 72...index registration control means 73...index registration means 74...index storage means 76...logical operation means 78...index search control means

Claims (1)

[Claims] A range value index storage means for storing a representative value of data having a range, a range value, and a pointer value indicating a data record storage address; and a maximum range value storage means for storing a maximum value of the range values. a key information input means for inputting key information provided from the outside; a key value creation means for creating a representative value and a range value corresponding to the key information; and a key value creation means for creating a representative value and a range value corresponding to the key information; maximum range value management means for managing the maximum value of the range values created by the maximum range value storage means; maximum range value management means for managing the maximum value of the range values created by the key value creation means; index searching means for searching the range value index of the range value index storage means based on the representative value;
index record registration means for registering the representative value, range value, and pointer value indicating a data record storage address created by the key value creation means in the range value index of the range value index storage means, and inputting search conditions. search range setting means for setting a search range of the range value index of the range value index storage means based on the search conditions and the contents of the maximum range value storage means; and the index range. an index record positioning means for locating a range value index record in the range value index storage means based on the search range set by the setting means; and whether or not the index record in the range value index storage means satisfies the search condition. and a pointer value output means for outputting a pointer value indicating a data record storage address from the range value index storage means when the condition determination means determines that the search condition is satisfied. An index registration search method for range value data, characterized in that it is configured to include the following.