JP2000207402A - Information retrieval system, information retrieving method and program recording medium for information retrieval - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve efficiency by reducing a storage area when a set is large in an information retrieval system which stores the set of data satisfying an assumed retrieval condition and performs retrieval processing. SOLUTION: A condition satisfaction set storing means 33 stores with representation by a complementary set when a set is large and stores with representation by a normal set when it is small. An information updating means 22 updates a condition satisfaction set in accordance with information updation and performs conversion with the representation of the normal set and the representation of the complementary set as necessary by using a complementary set adding means 25 so as to make the sets appropriate representation. It also performs processing that correctly maintains a condition satisfaction set represented by the complementation set when data are added or eliminated. Also, a retrieving means 23 performs a set operation by a method that is suitable for the representation of a set.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to an information retrieval system,
More particularly, the present invention relates to a recording medium on which an information retrieval method and an information retrieval program are recorded. Related to a recorded medium.

[0002]

2. Description of the Related Art An example of a conventional information retrieval system is described in Japanese Patent Application Laid-Open No. Hei 10-187745. The information search system described in this publication includes a directory management unit, a group index control unit, an all-match index storage unit, a group index storage unit, a partial match index control unit, a partial match index storage unit, and the like. The conventional information retrieval system having such a configuration finds data that satisfies a search condition without examining all data, and stores an assumed search condition and a set of identification information of data that satisfies the condition. And used for search processing. Hereinafter, the identification information of the data is referred to as ID. As an example, suppose that an information search system that stores information about people is assumed to be searched under a condition related to a name. For example, a condition that “the name is Yamada” and a set of data IDs that satisfy this condition Are stored in association with each other. A set of data IDs satisfying this condition is assumed, assuming a condition such as “including a character string s with a name” for a partial character string search, in addition to the matching condition regarding the attribute of such data. It can also be stored. Thus, various search conditions can be assumed according to the application. Hereinafter, the assumed search condition is called an assumed search condition, and a set of data that satisfies the condition is called a condition satisfaction set.

[0003]

SUMMARY OF THE INVENTION Japanese Patent Application Laid-Open No. Hei 10-1877
The problem with the information retrieval system described in Japanese Patent Publication No. 45 is that when a set of data that satisfies the assumed retrieval condition is large, a large storage area is consumed, and the efficiency becomes poor. The reason is that even when a set of data satisfying the assumed search condition is large, the set is stored as it is and used for search processing. It is an object of the present invention to provide an information search system that can reduce the storage area when the set of data that satisfies the assumed search condition is large, and can increase the efficiency.

[0004]

The information retrieval system according to the present invention comprises a condition satisfying set storage means (33 in FIG. 1), an entire set storage means (32 in FIG. 1), and a search means (23 in FIG. 1).
And By adopting such a configuration, if the set satisfying the condition is large, it is stored in the form of its complement, and if it is small, it is stored in the form of a normal set, and this is used for search processing. The object of the invention can be achieved. The determination as to whether the data set is large is made, for example, by comparing the data amount with a threshold value of a predetermined data amount based on the processing capacity of the system. According to the first aspect of the present invention, in an information search system for storing an assumed search condition and a set of data satisfying the search condition in association with each other, the set of data satisfying the assumed search condition is used. When it is large, it is characterized in that it is stored in the representation of the complement and used for search processing. According to a second aspect of the present invention, in an information search system that stores an assumed search condition and a set of data satisfying the search condition in association with each other, and uses the assumed search condition and data satisfying the set, , A condition set storage means for storing a normal set or a set represented by a complement thereof, an entire set storage means for storing an entire set of data, and a search means for searching for data. It is characterized by: According to a third aspect of the present invention, in the information retrieval system according to the second aspect, an information updating means for adding, deleting, or changing data, or a part thereof, and calculating a complement of a given set of data. In the information search system comprising a complement set calculating means, the information updating means adds, deletes,
When making a change, if the set of data that satisfies the assumed search conditions is large, express this as a complement,
When the size is small, the expression is converted so as to be expressed by a normal set. According to a fourth aspect of the present invention, in the information retrieval system according to the third aspect, a complement set expression object for storing which set is represented by a complement set among data sets satisfying an assumed retrieval condition. A storage unit, wherein the information updating unit acquires a set represented as a complementary set from the complementary set expression target storage unit when adding / deleting data,
Among these, for data whose added / deleted data does not satisfy the corresponding assumed search condition, data is added / deleted to its complement. According to a fifth aspect of the present invention, in the information retrieval system according to the second, third or fourth aspect, a set operation means for performing a set operation of a set of data or a set of intermediate results of the operation satisfying the assumed search condition. If the set operation means takes the intersection of sets A and B, if only A is represented by its complement A ′, calculate B−A ′ and take this as the result,
If only B is represented by its complement B ', then A
Calculate B ′ and make this the result, and if both are represented by their complements A ′ and B ′, calculate the union of A ′ and B ′ and make the complement the result , Sets A and B
If only A is represented by its complement A ', then A'-B is calculated and the complement is obtained, and only B is represented by its complement B' , Compute B'-A and result in its complement, and if both are represented by their complements A 'and B', compute the intersection of A 'and B' Performing at least one of the two operations, that is, making a complement set a result. The invention according to claim 6 is the invention according to claims 2 and 3,
4. The information retrieval system according to 4 or 5, further comprising: set operation means for performing a set operation of a set of data or a set of intermediate results of the operation satisfying the assumed search condition, wherein the set operation means complements the set A. When a set is taken, A is the result if A is represented by its complement A ', and the complement of A is the result if A is represented by an ordinary set. The invention according to claim 7 is
Information of an information retrieval system comprising: a condition satisfying set storing means for storing a search condition and a set of data satisfying the condition; an entire set storing means for storing an entire set of data; and a searching means for searching data. In the search method, an assumed search condition and a set of data satisfying the search condition are stored in the condition-satisfied set storage means by a normal set or its complement expression, and the entire set of data is stored in the entire set storage means. And the retrieval means performs a retrieval process using these. According to an eighth aspect of the present invention, in the information search method according to the seventh aspect, when adding, deleting, or changing data, if a set of data satisfying an assumed search condition is large, the data set is deleted. It is characterized in that the complement is calculated and the expression is converted so that it is represented by a complement and if it is small it is represented by a normal set. According to a ninth aspect of the present invention, in the information search method according to the eighth aspect, of the data sets satisfying the assumed search condition, which set is represented by a complement set is stored, and At the time of addition / deletion, a set represented as a complement set is acquired from the complement set expression target storage means, and among those, the data to be added / deleted does not satisfy the corresponding assumed search condition. It is characterized in that data is added / deleted from the complement set. According to a tenth aspect of the present invention, in the information search method according to the seventh, eighth and ninth aspects, when performing a set operation on a set of data or a set of intermediate results of the operation satisfying the assumed search condition, If the intersection of A and B is taken, if only A is represented by its complement A ′, then B−A ′ is calculated and the result is obtained, and only B has its complement B ′
If it is represented by, calculate AB 'and obtain this result, and if both are represented by its complements A' and B ', calculate the union of A' and B ' If the complement is taken as the result and the union of sets A and B is taken, if A
A'-B if only the complement A 'is represented
To compute its complement, and if only B is represented by its complement B ', compute B'-A and produce its complement, and both have its complement A' And B '
, The common part of A ′ and B ′ is calculated and its complement is set as a result, and at least one of the two is performed. According to an eleventh aspect of the present invention, in the information search method according to the seventh, eighth, ninth and tenth aspects, a set operation of a set of data or a set of intermediate results of the operation that satisfies assumed search conditions is performed. In the case of taking the complement of set A, if A is represented by its complement A ', the result is A', and if it is represented by the ordinary set, the complement of A is the result. Features. According to a twelfth aspect of the present invention, there is provided a condition satisfying set storing means for storing a search condition and a set of data satisfying the condition, an entire set storing means for storing an entire set of data, and a search for performing data search. A storage medium used in an information search system having means for storing an assumed search condition and a set of data that satisfies the search condition in a condition-satisfied-set storage means by expressing a normal set or its complement. And a program for executing a process of storing the entire set of data in the entire set storage unit and a search process using these storage units. According to a thirteenth aspect of the present invention, in the recording medium according to the twelfth aspect, in addition to the processing, an information updating process for adding, deleting, or changing data, or a part thereof, and a set of given data In the process of calculating the complement of, and when adding, deleting, or changing data, if the set of data that satisfies the assumed search conditions is large, this is represented by the complement. Is characterized in that a program for executing a process of converting the expression so as to be expressed as a normal set is recorded. According to a fourteenth aspect of the present invention, in the recording medium according to the thirteenth aspect, in addition to the processing, a set of data that satisfies an assumed search condition is complemented by a complement set. A program for executing a process to be stored in the set representation target storage means is recorded, and in the information updating process, when data is added / deleted, a set expressed as a complement set from the complement set representation target storage means is added. It is characterized in that data is added to / deleted from the complement of the acquired data whose added / deleted data does not satisfy the corresponding assumed search condition. According to a fifteenth aspect of the present invention, in the recording medium according to the twelfth, thirteenth, or fourteenth aspect, in addition to the processing, a set operation of a set of data satisfying an assumed search condition or a set of intermediate results of the operation is performed. In doing so, if the intersection of sets A and B is taken, if only A is represented by its complement A ', then B-A' is computed and this is the result, if only B is its complement B '
If it is represented by, calculate AB 'and obtain this result, and if both are represented by its complements A' and B ', calculate the union of A' and B ' If the union of sets A and B is taken as a result of the complement set,
A'-B if only the complement A 'is represented
To compute its complement, and if only B is represented by its complement B ', compute B'-A and produce its complement, and both have its complement A' And B '
Characterized in that a program for executing at least one of two processes of calculating a common part of A 'and B' and obtaining a complement thereof as a result is recorded. And According to a sixteenth aspect of the present invention, in the recording medium according to the twelfth, thirteenth, thirteenth, or fifteenth aspect, in addition to the processing, a set of data satisfying an assumed search condition or a set of intermediate results of an operation. When performing the operation, when the complement of set A is taken, if A is represented by its complement A ', the result is A', and if it is represented by a normal set, the complement of A is returned. A program for executing the above-mentioned processing is recorded.

[0005]

Next, embodiments of the present invention will be described in detail with reference to the drawings. Referring to FIG.
The first embodiment of the present invention includes a request input unit 1, a data processing device 2 operated under program control, a storage device 3 for storing information, and a result output unit 4. Request input means 1 is a means for inputting a processing request for information.
Keyboards and communication devices. The information storage device 3
Data storage means 31, total set storage means 32, condition satisfaction set storage means 33, complement set expression target storage means 34
And The data storage means 31 stores all data stored in the information search system. The whole set storage means 32 stores IDs of all data. The condition satisfaction set storage unit 33 stores an assumed search condition and a set of IDs of data satisfying the condition in association with each other. The complement set representation target storage means 34 stores which condition satisfying set is represented by the complement set. The data processing device 2 includes a request classifying unit 21 and an information updating unit 2
2, search means 23, condition satisfaction set update means 24,
Complementary set calculation means 25 and set operation execution means 26 are provided. The request classification unit 21 receives a processing request from the request input unit 1 and supplies the request to a unit according to the type of the request. The information updating unit 22 receives the information updating request from the request classifying unit 21 and performs addition, deletion, and change of data.

That is, information is updated in the data storage means 31 and the whole set storage means 32, and an instruction to update the condition satisfaction set accordingly is given to the condition satisfaction set updating means 24. Specifically, the ID of this data is added to the condition satisfaction set corresponding to the assumed search condition that the given data satisfies, and the ID of the data is added from the condition satisfaction set corresponding to the assumed search condition that the given data no longer satisfies. An instruction to delete the data ID is given. Further, when data is added or deleted, in order to maintain the condition satisfying set represented by the complement set in a correct state, the data is referred to the complement set expression storage means 34, and Instruct update. The processing result is output by the result output means 4
Give to. The condition satisfaction set updating means 24 updates the condition satisfaction set storage means 33 according to the instruction given from the information updating means 22. Further, it is determined whether or not the condition-satisfied set is to be represented by a complement set. If necessary, conversion to the complement representation is performed by using the complement calculation means 25, or a normal set is converted from the complement representation. Is converted to the expression by. The complementary set calculating means 25 refers to the entire set storing means 32 and
Find the complement of the set given from 4. Search means 23
Receives a search request from the request classifying unit 21 and refers to the data storage unit 31, the entire set storage unit 32, and the condition satisfaction set storage unit 33 to search for the requested data. When a set operation is required due to a complex condition or the like, the set operation execution means 26 is used. The processing result is output by the result output means 4
Give to. The set operation execution means 26 performs the set operation given from the search means 23. The result output unit 4 is a unit that outputs a result of executing the processing request, and is a display, a communication device, or the like.

Next, the overall operation of the present embodiment will be described in detail with reference to the flowcharts of FIGS. The request received by the request input means 1 is given to the request classification means 21, and the request classification means 21 supplies this request to means according to the type of the request. If the request is an information update request, the request is supplied to the information updating means 22 (step A10 in FIG. 2), and if the request is a search request, the request is supplied to the search means 23 (step A20). First, the operation of the information update request processing will be described. Information updating means 22 having received the information updating request
Updates the data storage means 31 (step A11) and updates the entire set storage means 32 (step A12). Further, a condition satisfying set that needs to be updated is obtained by updating the information, and the condition satisfying set updating unit 24 is instructed to perform a necessary update on the set (step A13). In other words, the assumed search conditions that the data satisfied before the update and the assumed search conditions that were satisfied after the update were obtained, and the results were used to create a condition satisfaction set for the assumed search condition that the data newly satisfied. Is added, and from the condition satisfaction set for the assumed search condition that the data is not satisfied, the I
Delete D.

Here, when the condition satisfying set is represented by its complement, when adding an ID to the condition satisfying set, the ID is deleted from the complement set and when deleting the ID from the condition satisfying set, Will add an ID to this complement. Further, when the update request is to add data, a condition satisfying set expressed as a complementary set is acquired from the complementary set expressing object storage means 34, and among these, the assumed search condition corresponding to the data to be added corresponds to If not, add data to its complement. If the update request is to delete data, a condition satisfying set expressed as a complementary set is acquired from the complementary set expression target storage means 34, and among these, the assumed retrieval condition corresponding to the data to be deleted corresponds to For those that do not satisfy, data is deleted from its complement. These two processes are necessary to correctly maintain a condition satisfaction set that cannot be obtained from the assumed search conditions that the data satisfies before and after the update.

Next, there is a condition satisfying set to be converted from a normal set expression to a complement set expression, or conversely, a condition satisfying set to be converted from a complementary set expression to a normal set expression. It is determined whether or not (Step A14). This determination is made so that the set used for the expression becomes smaller. As an example, when the determination is made based on the number of elements of a set, the number of elements of this set is represented by a normal set, and the number of elements of this complement set is represented by a complement set. Conversion is performed when the number of elements becomes 2/3 or more. The determination may be made in consideration of not only the number of elements but also various points such as the property of the assumed search condition and the property of the stored data. If there is a set to be converted, the expression of the set satisfying the condition is converted according to the determination result using the complementary set calculation means 25 (step A1).
5). Note that the complement set calculation means 25 refers to the whole set storage means 32 in order to obtain a complement set. This is repeated until there is no more condition-satisfiable set for which the expression needs to be converted. When there are no more condition-satisfiable sets for which the expression needs to be converted, the result is output (step A40), and the process ends.

Next, the operation of processing a search request will be described. Upon receiving the search request, the search means 23 first obtains available search conditions from the search conditions (step A21). Next, condition satisfaction sets corresponding to these assumed search conditions are obtained from the condition satisfaction set storage unit 33 (step A22). The ID of the data that does not satisfy the corresponding condition in the condition satisfaction set or intermediate result set obtained here
May be included. Therefore, it is determined whether to delete the ID of the data that does not satisfy the corresponding condition (step A23). This determination may be made in consideration of whether or not a check is necessary to obtain a correct search result, or may be performed in consideration of efficiency or the like. From the set determined to be checked, the I of data that does not satisfy the corresponding condition
D is deleted (step A24).

Next, it is determined whether a final search result has been obtained (step A25). If the final result has not been obtained, that is, if only an intermediate result has been obtained, a necessary set operation is performed on the intermediate result (step A26). For example, when a search condition or a partial condition constituting the search condition is an AND of a plurality of conditions, a common part of a set of intermediate results corresponding to each condition is taken. In the case of OR instead of AND, the union is taken, and in the case of NOT, the complement is taken. Note that it is not always necessary to perform all of the necessary set operations at once, and it is determined whether to perform only a part of the set operations and delete the data that does not satisfy the condition again for the intermediate result (step A23). You can also proceed to).

In the process of performing the set operation (step A26), the set satisfying the condition or an intermediate set obtained therefrom may be represented by a complement set. Therefore, the operation of taking the complement and the operation of the common part or the union including the set represented by the complement are performed as follows. If the intersection of sets A and B is taken, if only A is represented by its complement A ', then B-A' is calculated and this is the result, and only B is its complement B '
If it is represented by, calculate AB 'and obtain this result, and if both are represented by its complements A' and B ', calculate the union of A' and B ' The complement is the result. If the union of sets A and B is taken, if only A is represented by its complement A ', then A'-B is calculated and its complement is the result, if only B is its complement B 'And compute the complement B'-A and represent the complement, and if both are represented by the complements A' and B ', the intersection of A' and B ' Compute and make the complement the result. When taking the complement of set A, if A is represented by its complement A ', A' is the result, and if it is represented by a normal set, the complement of A is the result. When the final result is obtained, the result is output (step A40), and the process ends. If the request is neither an update request nor a search request, a process suitable for the request is performed (step A30), and the process ends.

In the first embodiment, the determination and execution of the expression conversion of the set satisfying the condition (steps A14 and A1)
5) is performed only in the information update processing, but may be performed in other processing. Further, during the search process, the determination and execution of the expression conversion may be performed on an intermediate result set. Also, at the time of updating the condition satisfaction set, the determination and execution of this expression conversion may be performed for each updated condition satisfaction set. In the first embodiment, if data is prepared in advance and updating of information is unnecessary, information updating means 22, condition-satisfied set updating means 24, complement set calculating means 25, complementary set expression object storage Means 34 may be eliminated. In this case, the operation related to updating (steps A10 to A15) is also unnecessary, and the operation starts from step A20. Further, when the type of request is only retrieval, the request classification means 21 may be omitted. In this case, the operation of classifying the request and the operation of other processing (steps A20 and A30) are unnecessary, and the operation starts from step A21.

Next, a second embodiment of the present invention will be described in detail with reference to the drawings. Referring to FIG. 3, the second embodiment of the present invention includes a recording medium 6 on which an information search program is recorded. The recording medium 6 may be a magnetic disk, a semiconductor memory, or another recording medium. The information search program is read from the recording medium 6 into the data processing device 5 and controls the operation of the data processing device 5. The data processing device 5 executes the same processing as the processing by the data processing device 2 in the first embodiment under the control of the information search program.

Next, an embodiment of the present invention will be described with reference to the drawings. Such an example corresponds to the first embodiment of the present invention. In this embodiment, a keyboard is used as a request input device, a personal computer is used as a data processing device, a magnetic disk storage device is used as a storage device,
A display is provided as a result output device. The personal computer includes a request classification unit, an information updating unit,
It has a central processing unit that functions as search means, condition-satisfied set updating means, complement set calculating means, and set operation executing means. The magnetic disk storage device has data, whole sets, condition-satisfied sets, and complement set expressions. The object is stored.

As an example, consider a directory service that stores information on company organizations and employees. It is assumed that the information of the hierarchy of the entry as shown in FIG. 4 is stored, each entry is assigned an ID of 1 to 9 shown in the figure, and data is added in the order of this ID. Each entry is attributed with its name “cn” and an “object” indicating the class of the entry.
class ”and the objectclass of the company and department is“ or
ganization ”, and the objectclass of employees A to F is“ perso
n ”. When a request is entered with the keyboard and an employee E of ID8 is added from a state where the employee D of ID7 is added, the assumed search condition and the condition satisfaction set corresponding thereto are as shown in FIG. That is, the expected search condition “cn
ID8 is added to the condition satisfaction set corresponding to “= E” and “objectclass = person”.

For example, here, when a request for searching for an entry whose name is E is input, the assumed search condition “cn =
By finding the set satisfying the condition corresponding to E ”
The search results are refined, and the final search results are displayed on the display. Normally, the processing is speeded up by using a tree structure, a hash, or the like for a portion indicating the assumed search condition.
Further, when the employee F with the ID 9 is added, “objectcl
Assuming that the central processing unit determines to convert the condition satisfying set corresponding to “ass = person” into a complement set expression, the assumed search condition and the corresponding condition satisfying set change as shown in FIG. The arithmetic unit is “4,5,6,7,8,9”
The complement set “1,2,3” of the set that has been obtained is obtained, and the fact that the condition satisfying set is expressed as a complement set and this complement set are recorded.

[0018]

The effects of the present embodiment will be described.
In this embodiment, when the condition satisfying set is large, the expression is represented by its complement, and when the condition satisfying set is small, the expression is represented by the ordinary set. And the processing efficiency can be improved.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a first embodiment of the present invention.

FIG. 2 is a flowchart showing the operation of the first embodiment.

FIG. 3 is a block diagram showing a configuration of a second embodiment of the present invention.

FIG. 4 is a diagram illustrating an embodiment of the present invention.

FIG. 5 is a diagram illustrating an embodiment of the present invention.

FIG. 6 is a diagram illustrating an embodiment of the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 ... Request input means 2 ... Data processing device 21 ... Request classification means 22 ... Information update means 23 ... Search means 24 ... Condition satisfaction set update means 25 ... Complement set calculation means 26 ... Set operation execution means 3 ... Storage device 31 ... Data Storage means 32 ... Whole set storage means 33 ... Condition satisfying set storage means 34 ... Complementary set representation target storage means 4 ... Result output means 5 ... Data processing device 6 ... Recording medium

Claims (16)

[Claims] 1. An information retrieval system for storing an assumed search condition and a set of data satisfying the search condition in association with each other, and using a search process, when a set of data satisfying the assumed search condition is large, An information retrieval system characterized in that the information is stored in the representation of its complement and used for retrieval processing. 2. An information retrieval system which stores an assumed search condition and a set of data satisfying the search condition in association with each other, and uses the search condition, a set of data satisfying the search condition,
That is, it comprises condition-satisfied set storage means for storing an ordinary set or a set represented by a complement thereof, whole set storage means for storing an entire set of data, and search means for searching for data. Information retrieval system. 3. An information retrieval system comprising: an information updating unit that adds, deletes, or changes data, or a part thereof; and a complement calculating unit that calculates a complement of a given set of data. When the information updating means adds, deletes, or modifies data, if the set of data that satisfies the assumed search condition is large, it is represented by the complement set, and if it is small, it is represented by the normal set. 3. The information retrieval system according to claim 2, wherein the expression is converted so as to be expressed. 4. An information search system comprising a complement set expression storage means for storing which set among data sets satisfying an assumed search condition is represented by a complement set, wherein the information updating means is When adding / deleting data, a set expressed as a complement set is obtained from the complement set expression target storage means, and the data to be added / deleted does not satisfy the corresponding assumed search condition. 4. An information retrieval system according to claim 3, wherein data is added to or deleted from the complement set. 5. An information retrieval system comprising a set operation means for performing a set operation of a set of data or a set of intermediate results of an operation satisfying an assumed search condition, wherein the set operation means is a common part of the sets A and B. If you take
If only A is represented by its complement A ', then B
-A 'is computed and this is the result; if only B is represented by its complement B', then AB 'is computed and this is the result, and both have its complement A' and If it is represented by B ', the union of A' and B 'is calculated and its complement is set as a result. If the set operation means takes the union of A and B, only A If it is represented by its complement A ', then A'
Calculate B and its complement as a result, if only B is represented by its complement B ', compute B'-A and its complement as a result, and if both are its complements 3. The method according to claim 2, wherein, if represented by A 'and B', a common part of A 'and B' is calculated and its complement is set as a result. 3. The information retrieval system according to 3 or 4. 6. An information retrieval system comprising: set operation means for performing a set operation of a set of data or a set of intermediate results of an operation which satisfies an assumed search condition, wherein the set operation means sets a complement of the set A If A is represented by its complement A ', then A' is the result,
6. The information search system according to claim 2, wherein a complement set of A is obtained as a result if the set is represented by a normal set. 7. A condition satisfying set storing means for storing a search condition and a set of data satisfying the condition, an entire set storing means for storing an entire set of data, and a searching means for searching data. In an information search method of an information search system, an assumed search condition and a set of data satisfying the assumed condition are stored in the condition-satisfied set storage means by a normal set or its complement, and the entire set of data is stored. An information search method, comprising the steps of: storing in the entire set storage means; and performing search processing using the search means. 8. When adding, deleting, or changing data,
When the set of data that satisfies the assumed search condition is large, it is represented by a complement, and when it is small, it is represented by a normal set. 8. The information search method according to claim 7, wherein the method is performed. 9. A set of data that satisfies an assumed retrieval condition is stored as to which set is represented by a complement set. Acquiring a set expressed as a set, and adding / deleting data to a complement set of the set whose data to be added / deleted does not satisfy the corresponding assumed search condition. Item 8. The information retrieval method according to Item 8. 10. When performing a set operation on a set of data or a set of intermediate results of an operation that satisfies an assumed search condition, if the intersection of sets A and B is taken, only A has its complement A ′ If B is represented by B ′, the result is calculated, and if only B is represented by its complement B ′, AB ′ is calculated and the result is obtained. If both are represented by their complements A 'and B', then the union of A 'and B' is calculated and the complement is obtained. If the union of sets A and B is taken, If only A is represented by its complement A ', then calculate A'-B and result in its complement; if only B is represented by its complement B', then B'-A And its complement set as the result, and if both are represented by their complements A 'and B', the intersection of A 'and B' 10. The information retrieval method according to claim 7, wherein at least one of the following two operations is performed: calculating the result and obtaining a complement thereof. 11. When performing a set operation on a set of data or a set of intermediate results of an operation that satisfies an assumed search condition, if a complement of the set A is taken, A is represented by its complement A ′. 11. The information retrieval method according to claim 7, wherein A 'is used as a result if the data is present, and a complement of A is used as a result if the data is represented by a normal set. 12. Information comprising a condition satisfying set storing means for storing a search condition and a set of data satisfying the condition, an entire set storing means for storing an entire set of data, and a searching means for searching data. The recording media used in the search system include assumed search conditions, a set of data that satisfies them,
That is, a process of storing a normal set or a set represented by its complement in the condition satisfaction set storage means, a process of storing the entire set of data in the whole set storage means, a search processing using these storage means, A recording medium on which a program for executing the program is recorded. 13. In addition to the above-mentioned processing, information updating processing for adding, deleting, or changing data or a part thereof, processing for calculating a complement of a given set of data, addition and deletion of data When making a change, if the set of data that satisfies the assumed search condition is large, it is represented by a complement set, and if it is small, the representation is converted so that it is represented by a normal set. 13. The recording medium according to claim 12, wherein a program for executing the processing is recorded. 14. In addition to the above-mentioned processing, a processing for storing, in a complement set representation target storage means, which set of data sets satisfying an assumed search condition is represented by a complement set, A program is recorded, and when adding / deleting data in the information updating process,
A set represented as a complement set is acquired from the complement set representation target storage means, and among those, the data to be added / deleted does not satisfy the corresponding assumed search condition, and the data is added to the complement set / 14. The recording medium according to claim 13, wherein the recording medium is deleted. 15. In addition to the above processing, when performing a set operation on a set of data or a set of intermediate results of an operation that satisfies an assumed search condition, if a common part of sets A and B is taken, only A If it is represented by its complement A ', calculate B-A' and give this result; if only B is represented by its complement B ', calculate AB' and And if both are represented by their complements A 'and B', the process of calculating the union of A 'and B' and taking the complement as a result, the union of sets A and B , If only A is represented by its complement A ′, then A′−B is calculated and the complement is obtained, and if only B is represented by its complement B ′, If B'-A is computed and its complement is the result, A 'if both are represented by its complements A' and B ' Claim B 'intersection and the calculation process of the complement results, two programs for executing at least one processing out of the can, characterized in that the recorded 1
15. The recording medium according to 2, 13, or 14. 16. In addition to the processing described above, when performing a set operation on a set of data or a set of intermediate results of an operation that satisfies an assumed search condition, if the complement set of the set A is taken, A is the complement set A A program for executing a process that results in A if represented by ', and a complement of A if represented by a normal set. Item 12, 13, 14, or 1
6. The recording medium according to 5.