WO2012127986A1 - Système de recherche d'informations, procédé de recherche d'informations et programme de recherche d'informations - Google Patents

Système de recherche d'informations, procédé de recherche d'informations et programme de recherche d'informations Download PDF

Info

Publication number
WO2012127986A1
WO2012127986A1 PCT/JP2012/054673 JP2012054673W WO2012127986A1 WO 2012127986 A1 WO2012127986 A1 WO 2012127986A1 JP 2012054673 W JP2012054673 W JP 2012054673W WO 2012127986 A1 WO2012127986 A1 WO 2012127986A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
attribute
registration
list
attribute name
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/JP2012/054673
Other languages
English (en)
Japanese (ja)
Inventor
健太郎 山崎
弘司 喜田
正文 渡部
佑嗣 小林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP2013505861A priority Critical patent/JP5928446B2/ja
Publication of WO2012127986A1 publication Critical patent/WO2012127986A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G06F16/24573—Query processing with adaptation to user needs using data annotations, e.g. user-defined metadata

Definitions

  • the present invention relates to an information retrieval technique for retrieving registration information that matches evaluation information by comparing registration information including at least one attribute information having an attribute name and an attribute value with evaluation information.
  • the information search method described in Patent Document 1 is based on a transposed array, a search key, and a relevance evaluation function for one attribute corresponding to the first transposed array in the search order of the transposed array among a plurality of attributes.
  • the data group included in the search range is acquired.
  • the next search process is executed for each attribute according to the search order of the transposed array until a predetermined stop condition is satisfied.
  • a process for acquiring a data group included in the search range is performed for the corresponding attribute based on the transposed array, the search key, and the relevance evaluation function.
  • These acquired data groups are individual solution candidate sets. In this search method, these individual solution candidate sets and the current solution candidate set are merged to generate a new solution candidate set.
  • the information search method described in Patent Document 1 specifies a data search range by using a single method between attributes. Therefore, the information search method described in Patent Document 1 has a problem that the processing cannot be executed with an appropriate calculation amount or memory amount when the load of the data search processing performed for each attribute is large.
  • An object of the present invention is to provide an information search system, an information management apparatus, a method, and a program that can execute a data search process with an appropriate calculation amount or memory amount even when the processing load for each attribute is large. One of them.
  • a first information search system receives registration information including one or more attribute information having an attribute name and an attribute value, and registers each attribute name for each predetermined attribute name.
  • a combination expansion processing means for generating a registration key corresponding to the registration information by performing first information processing that differs depending on whether or not the attribute information included in the information has, and at least one attribute information The evaluation information is received, and each of the attribute information included in the evaluation information is subjected to second information processing that differs depending on whether or not the attribute information has a predetermined attribute name.
  • Information search means for generating a search key for searching for registration information corresponding to the registration key.
  • the first information retrieval method receives registration information including one or more attribute information having an attribute name and an attribute value, and registers each attribute name for each predetermined attribute name. Depending on whether or not the attribute information included in the information has different first information processing, a registration key corresponding to the registration information is generated, and evaluation information including one or more attribute information is received, Each attribute information included in the evaluation information corresponds to the registration key by performing a second information process that differs depending on whether or not the attribute information has a predetermined attribute name. A search key for searching registration information is generated.
  • the first information search program receives registration information including one or more attribute information having an attribute name and an attribute value in a computer, and each attribute name for each predetermined attribute name
  • the evaluation information is received, and each of the attribute information included in the evaluation information is subjected to second information processing that differs depending on whether or not the attribute information has a predetermined attribute name.
  • An example of the effect of the present invention is that data search processing can be executed with an appropriate calculation amount or memory amount even when the processing load for each attribute is heavy.
  • FIG. 1 is a block diagram showing the configuration of the information search system in the first embodiment of the present invention.
  • FIG. 2 is a diagram illustrating an example of registration information and evaluation information.
  • FIG. 3 is a diagram illustrating an example of registration information including a wild card.
  • FIG. 4 is a diagram illustrating an example of registration information that does not include a wild card.
  • FIG. 5 is a block diagram illustrating an example of a configuration included in the combination development determination unit according to the first embodiment of the present invention.
  • FIG. 6 is a diagram illustrating an example of the combination expansion target attribute name designation list.
  • FIG. 7 is a diagram illustrating an example of registration information.
  • FIG. 8 is a diagram illustrating an example of the combination expansion target attribute name list.
  • FIG. 1 is a block diagram showing the configuration of the information search system in the first embodiment of the present invention.
  • FIG. 2 is a diagram illustrating an example of registration information and evaluation information.
  • FIG. 3 is a diagram illustrating an example of registration information including
  • FIG. 9 is a block diagram showing an example of the configuration of the combination development processing unit in the first embodiment of the present invention.
  • FIG. 10 is a diagram illustrating an example of the combination expansion target attribute value list.
  • FIG. 11 is a diagram illustrating an example of registration information after the combination expansion process.
  • FIG. 12 is a block diagram illustrating an example of the configuration of the information registration unit according to the first embodiment of this invention.
  • FIG. 13 is a block diagram showing an example of the configuration of the power set expansion processing unit in the first embodiment of the present invention.
  • FIG. 14 is a diagram illustrating an example of the evaluation information.
  • FIG. 15 is a diagram illustrating an example of the power set expansion target attribute information list.
  • FIG. 16 is a diagram illustrating an example of a non-power set expansion target attribute information list.
  • FIG. 17 is a diagram illustrating an example of a power set expansion target expansion list.
  • FIG. 18 is a diagram illustrating an example of evaluation target information after the power set expansion processing.
  • FIG. 19 is a block diagram showing an example of the configuration of the information search unit in the first embodiment of the present invention.
  • FIG. 20 is a flowchart showing the operation of the information registration flow in the operation of the information search system in the first embodiment of the present invention.
  • FIG. 21 is a flowchart showing the operation of the combination expansion determination process in the information registration flow.
  • FIG. 22 is a flowchart showing the operation of the combination expansion process in the information registration flow.
  • FIG. 23 is a flowchart showing the operation of the information evaluation flow in the operation of the information search system in the first embodiment of the present invention.
  • FIG. 24 is a block diagram showing a configuration of an information search system according to the second embodiment of the present invention.
  • FIG. 25 is a block diagram showing an example of the configuration of the combination expansion target attribute name designation list creation unit in the second embodiment of the present invention.
  • FIG. 26 is a diagram illustrating an example of the attribute value number list.
  • FIG. 27 is a flowchart showing the operation of the combination expansion target attribute name designation list creation unit in the operation of the information search system according to the second embodiment of the present invention.
  • FIG. 28 is a block diagram showing the configuration of the information search system in the third embodiment of the present invention.
  • FIG. 29 is a diagram showing a hardware configuration of the information search system and its peripheral devices according to the third embodiment of the present invention.
  • FIG. 30 is a flowchart showing an outline of the operation of the information search system according to the third embodiment of the present invention.
  • FIG. 1 is a block diagram showing a configuration of an information search system 10 in the first embodiment of the present invention.
  • the information search system 10 includes a registration information receiving unit 101, a combination expansion target attribute name designation list storage unit 102, a combination expansion determination unit 103, a combination expansion processing unit 104, and an information registration unit 105.
  • the information search system 10 receives a registration information registration request, and determines whether or not the attribute information included in the registration information has each attribute name for each of the predetermined attribute names. (First determination). And the information search system 10 produces
  • the information search system 10 receives the evaluation information as a search request, and determines whether or not each attribute information included in the evaluation information has a predetermined attribute name (second determination). And the information search system 10 produces
  • the information search system 10 can search for registration information corresponding to a registration key that matches the search key. With this configuration, the information search system 10 according to the first embodiment can execute data search processing with an appropriate calculation amount or memory amount even when the processing load for each attribute is heavy.
  • FIG. 2 is a diagram illustrating an example of registration information. Referring to FIG. 2, the registration information includes one or more attribute information, and the attribute information includes a combination of an attribute name and an attribute value. The registration information shown in FIG. 2 represents “a 20-year-old man in Tokyo”. FIG. 2 also shows an example of evaluation information. The evaluation information includes one or more attribute information. The information search system 10 in the first embodiment can register registration information including a wild card. FIG.
  • FIG. 3 is a diagram illustrating an example of registration information not including a wild card
  • FIG. 4 is a diagram illustrating an example of registration information including a wild card.
  • the wild card is information indicating that the attribute value of the corresponding attribute information may be arbitrary.
  • the registration information including all attribute information as shown in FIG. 3 does not include a wild card. It is called registration information.
  • registration information that does not include all attribute information as shown in FIG. 4 is referred to as registration information that includes a wild card.
  • the registration information including the wild card shown in FIG. 4 represents “a man in his twenties”.
  • the combination expansion target attribute name designation list storage unit 102 stores a combination expansion target attribute name designation list which is a list in which attribute names to be subjected to combination expansion processing are designated.
  • the combination expansion target attribute name designation list is also referred to as a designation list.
  • the combination expansion target attribute name designation list storage unit 102 is also referred to as a designation list storage unit.
  • the combination expansion process is a process for obtaining all combinations of values that can be taken by each attribute value between predetermined attribute information.
  • the combination expansion determination unit 103 passes the received registration information and a combination expansion target attribute name list described later to the combination expansion processing unit 104 described later.
  • the combination expansion determination unit 103 acquires the combination expansion target attribute name designation list stored in the combination expansion target attribute name designation list storage unit 102.
  • the combination expansion determination unit 103 is information including attribute names excluding the attribute names included in the registration information received by the registration information receiving unit 101 from the attribute names included in the combination expansion target attribute name designation list.
  • a certain combination expansion target attribute name list is generated. In the present invention, this function is called a combination expansion target attribute name list generation function.
  • the function is performed by the combination expansion target attribute name list generation unit 131.
  • FIG. 5 is a diagram illustrating an example of a configuration included in the combination development determination unit 103.
  • the combination development determination unit 103 is also referred to as a determination unit.
  • the combination expansion target attribute name list is also referred to as an attribute name list.
  • FIG. 8 shows combinations when the registration information shown in FIG. 7 is input to the information search system 10 and the combination expansion target attribute name designation list storage unit 102 stores the combination expansion target attribute name designation list shown in FIG. It is a figure which shows an example of an expansion
  • the attribute names included in the registration information shown in FIG. 7 are Interest (interest) and Location (location).
  • the attribute names specified by the combination expansion target attribute name specification list shown in FIG. 6 are Interest (interest), Gender (gender), and Terminal (terminal state).
  • FIG. 9 is a diagram illustrating functions provided in the combination development processing unit 104.
  • the combination expansion processing unit 104 includes a combination expansion target attribute value list storage unit 141 and a combination generation processing unit 142.
  • the combination expansion processing unit 104 stores the combination expansion target attribute value list in the combination expansion target attribute value list storage unit 141.
  • the combination expansion target attribute value list is information in which a list of attribute values that can be taken by each piece of attribute information for performing combination expansion processing is associated with the corresponding attribute name. In the present invention, this function is referred to as a combination expansion target attribute value list storage function. In the present invention, the combination expansion target attribute value list is also referred to as an attribute value list.
  • the combination expansion target attribute value list includes values that can be taken by the attribute values included in the attribute information corresponding to the attribute names specified by the combination expansion target attribute name specification list.
  • the combination expansion target attribute value list shown in FIG. 10 indicates that the attribute “Interest” has 12 kinds of values of Music, Movie, Sports, Shopping, Cooking, Drive, Game, Computer, TV, Outdoor, Novell, and Comics. ing. Further, this combination expansion target attribute value list indicates that the attribute “Gender” has binary values of “Male” and “Female”.
  • the combination expansion target attribute value list indicates that the attribute “Terminal” has two values of open and close.
  • the combination expansion processing unit 104 acquires a combination expansion target attribute value list corresponding to the attribute name included in the combination expansion target attribute name list from the combination expansion target attribute value list storage unit 141. Then, the combination expansion processing unit 104 generates registration information after combination expansion processing in which registration information is combined with combinations of values included in the acquired combination expansion target attribute value list and attribute names of those values. In the present invention, this function is called a combination generation processing function or a combination expansion processing function.
  • the combination generation processing function is performed by the combination generation processing unit 142. For example, the combination generation processing unit 142 receives the registration information shown in FIG. 7 and the combination expansion target attribute name list shown in FIG.
  • the combination generation processing unit 142 passes the generated registration information after the four combination expansion processes to the information registration unit 105.
  • the information registration unit 105 may specify the hash value of the linked attribute information as the registration key.
  • the information registration unit 105 includes a registration unit 153 that sends a registration request including a registration key and registration information to the information storage unit 106 described later.
  • the information storage unit 106 stores registration information using the registration key as a key. That is, the information storage unit 106 stores the registration key and the corresponding registration information in association with each other. Further, the information storage unit 106 accepts a search request including a search key described later.
  • the information storage unit 106 uses the search key as a key, and returns registration information stored in association with the registration key corresponding to the search key.
  • the information storage unit 106 may be a key value store such as a hash table.
  • FIG. 2 is a diagram illustrating an example of evaluation information.
  • the evaluation information received by the evaluation information receiving unit 107 includes one or more attribute information.
  • the attribute information has an attribute name and an attribute value.
  • the power set expansion processing unit 108 passes the evaluation information after the power set expansion processing to the information search unit 109 described later.
  • the power set expansion processing unit 108 is also referred to as a set expansion processing unit. Details of the “evaluation information after the power set expansion process” will be described later.
  • FIG. 13 is a diagram illustrating an example of a configuration included in the power set expansion processing unit 108.
  • the power set expansion processing unit 108 has a function of performing the following processing using the evaluation information received from the evaluation information receiving unit 107 and the combination expansion target attribute name designation list acquired from the combination expansion target attribute name designation list storage unit 102. Prepare.
  • the power set expansion processing unit 108 generates a power set expansion target attribute information list obtained by removing the attribute information corresponding to the attribute name specified by the combination expansion target attribute name specification list from the attribute information included in the evaluation information. To do. Further, the power set expansion processing unit 108 extracts a non-power set expansion target attribute information list obtained by extracting attribute information corresponding to the attribute name specified in the combination expansion target attribute name specification list from the attribute information included in the evaluation information. Generate. In the present invention, these functions are referred to as evaluation information dividing functions.
  • the evaluation information dividing unit 181 performs the evaluation dividing function. Specifically, the evaluation information dividing unit 181 divides the evaluation information into a power set expansion target attribute information list and a non power set expansion target attribute information list.
  • FIG. 15 is an example of a power set expansion target attribute information list generated by the power set expansion processing unit 108.
  • the combination expansion target attribute name designation list storage unit 102 stores the combination expansion target attribute name designation list shown in FIG. 6, the set expansion processing unit 108 that should receive the evaluation information shown in FIG. A set expansion target attribute information list of 15 examples is generated.
  • FIG. 16 is an example of a non-exponent set expansion target attribute information list generated in the same case as the above example.
  • “Interest”, “Gender”, and “Terminal” are designated.
  • the power set expansion processing unit 108 generates a power set of a set having attribute information included in the generated power generation target attribute information list as elements.
  • the power set expansion processing unit 108 generates a set expansion target expansion list that should include each element of the power set as a list.
  • these functions are called partial power generation functions. These functions are realized by the partial power generation unit 182.
  • the partial power set generation unit 182 receives a power set expansion target attribute information list.
  • the partial power set generation unit 182 generates a power set of a set having attribute information included in the received set expansion target attribute information list as an element.
  • the partial power set generation unit 182 generates a power set expansion target expansion list that includes each element of the power set in the list.
  • the power set expansion processing unit 108 identifies the generated power set as a power set expansion target expansion list.
  • FIG. 17 is a diagram illustrating an example of a set expansion target expansion list that should be specified by the power set expansion processing unit 108.
  • the power set expansion processing unit 108 should have combined the power set expansion target attribute information list with the power set expansion target expansion list based on the power set expansion target expansion list and the power set expansion target attribute information list. Evaluation information after the set expansion process is generated.
  • this function is referred to as a non-expansion attribute synthesis function.
  • the function is performed by the non-expansion attribute synthesis unit 183.
  • the information search unit 109 includes a sorting unit 191 that sorts attribute information of evaluation information after power set expansion processing in a specific order.
  • the specific order includes, for example, alphabetical order of attribute names or attribute values, alphabetical order, numerical ascending order, numerical descending order, and the like.
  • the information search unit 109 includes a key generation unit 192 that connects the sorted attribute information and generates a search key based on the connected attribute information.
  • the information search unit 109 may specify the hash value of the linked attribute information as the search key.
  • FIG. 19 the information search unit 109 includes a sorting unit 191 that sorts attribute information of evaluation information after power set expansion processing in a specific order.
  • the specific order includes, for example, alphabetical order of attribute names or attribute values, alphabetical order, numerical ascending order, numerical descending order, and the like.
  • the information search unit 109 includes a key generation unit 192 that connects the sorted attribute information and generates a search key based on the connected attribute information.
  • the information search unit 109 includes a search unit 193 that passes a search request including the generated search key to the information storage unit 106.
  • the combination development determination unit 103, the combination development processing unit 104, and the information registration unit 105 are collectively referred to as a first development processing unit.
  • the power set expansion processing unit 108 and the information search unit 109 are collectively referred to as a second expansion processing unit. The same applies to the second embodiment of the present invention.
  • the operation of the information search system 10 in the first embodiment will be described in detail with reference to the drawings.
  • the overall operation of the information search system 10 in the first embodiment can be broadly divided into an information registration flow for registering registration information and an information evaluation flow for searching for registration information that matches the evaluation information.
  • FIG. 20 is a flowchart showing the operation of the information registration flow in the operation of the information search system 10 in the first embodiment.
  • the registration information receiving unit 101 receives registration information including one or more attribute information (step S-101S).
  • the registration information receiving unit 101 passes the registration information to the combination development determining unit 103.
  • the process of the information search system 10 proceeds to step S102S.
  • the registration information includes one or more attribute information, and the attribute information includes a pair of an attribute name and an attribute value.
  • the information search system 10 in the first embodiment can register registration information including a wild card.
  • the combination development determination unit 103 receives registration information.
  • the combination expansion determination unit 103 performs a combination expansion determination process (step S-102S). Then, the combination expansion determination unit 103 passes the registration information and the combination expansion target attribute name list to the combination expansion processing unit 104. Then, the process of the information search system 10 proceeds to step S-103S.
  • FIG. 21 is a flowchart showing the operation of the combination development determination process. The operation of the combination development determination process will be described below.
  • the combination development determination unit 103 receives registration information (step S-102S-01). Then, the process of the combination development determination unit 103 proceeds to step S-102S-02.
  • the combination expansion determination unit 103 acquires a combination expansion target attribute name designation list stored in the combination expansion target attribute name designation list storage unit 102 (step S-102S-02).
  • the combination development determination unit 103 sets the counter i to 0 (steps S-102S-03). Then, the process of the combination development determination unit 103 proceeds to step S-102S-04.
  • the combination expansion determination unit 103 compares the counter i with the number of attribute names that is the number of attribute names included in the combination expansion target attribute name designation list (step S-102S-04). If the counter i is smaller than the number of attribute names included in the combination expansion target attribute name designation list (“Yes” in step S-102S-04), the processing of the combination expansion determination unit 103 proceeds to step S-102S-05. .
  • the combination expansion determination process of the combination expansion determination unit 103 ends.
  • the combination expansion determination unit 103 extracts the i-th attribute name from the combination expansion target attribute name designation list (step S-102S-05). Then, the process of the combination development determination unit 103 proceeds to step S-102S-06.
  • the combination development determination unit 103 sets the counter j to 0 (steps S-102S-06). Then, the process of the combination development determination unit 103 proceeds to step S-102S-07.
  • the combination development determination unit 103 extracts the attribute name of the jth attribute information from the registration information (step S-102S-07).
  • step S-102S-08 The combination expansion determination unit 103 compares the attribute name acquired in step S-102S-05 with the attribute name acquired in step S-102S-07 (step S-102S-08). If the attribute values match (“Yes” in step S-102S-08), the process of the combination development determination unit 103 proceeds to step S-102S-12. On the other hand, if the attribute values do not match (“No” in step S-102S-08), the process of the combination development determination unit 103 proceeds to step S-102S-09. The combination development determination unit 103 adds 1 to the counter j (steps S-102S-09). Then, the process of the combination development determination unit 103 proceeds to step S-102S-10.
  • the combination development determination unit 103 compares the counter j with the number of attributes that is the number of attribute information included in the registration information (step S-102S-10). When the counter j is smaller than the number of attributes included in the registration information (“Yes” in step S-102S-10), the processing of the combination expansion determination unit 103 proceeds to step S-102S-07. On the other hand, when the counter j is larger than the number of attributes included in the registration information (“No” in step S-102S-10), the process of the combination expansion determination unit 103 proceeds to step S-102S-11. The combination expansion determination unit 103 adds the attribute name determined to have been matched in step S-102S-08 to the combination expansion target attribute name list (step S-102S-11).
  • step S-102S-12 the process of the combination development determination unit 103 proceeds to step S-102S-12.
  • the combination development determination unit 103 adds 1 to the counter i (step S-102S-12).
  • step S-102S-04 the process of the combination development determination unit 103 proceeds to step S-102S-04.
  • the above is the operation of the combination development determination unit 103.
  • the combination expansion determination unit 103 passes the combination expansion target attribute name list including the attribute name added in step S-102S-11 to the combination expansion processing unit 104 when the processing is ended in step S-102S-04.
  • the process of the information search system 10 proceeds to step S-103S.
  • the combination expansion processing unit 104 receives registration information and a combination expansion target attribute name list.
  • step S-103S determines whether or not the combination expansion target attribute name list is empty. If the combination expansion target attribute name list is empty (“Yes” in step S-103S), the processing of the information search system 10 proceeds to step S-106S. On the other hand, when the combination expansion target attribute name list is not empty (“No” in step S-103S), the process of the information search system 10 proceeds to step S-104S.
  • the combination expansion processing unit 104 performs combination expansion processing (step S-104S). Then, the combination expansion processing unit 104 passes the registration information after the combination expansion processing to the information registration unit 105. Then, the processing of the information processing system 10 proceeds to step S-105S.
  • FIG. 22 is a flowchart showing the operation of the combination development process.
  • the combination expansion processing unit 104 receives a combination expansion target attribute name list (step S-104S-01). Then, the processing of the combination development processing unit 104 proceeds to step S-104S-02. The combination development processing unit 104 sets the counter i to 0 (step S-104S-02). Then, the processing of the combination development processing unit 104 proceeds to step S-104S-03. The combination expansion processing unit 104 compares the counter i with the number of attribute names that is the number of attribute names included in the combination expansion target attribute name list (step S-104S-03).
  • step S-104S-03 When the counter i is smaller than the number of attribute names included in the combination expansion target attribute name list (“Yes” in step S-104S-03), the processing of the combination expansion processing unit 104 proceeds to step S-104S-04. On the other hand, when the counter i is larger than the number of attribute names included in the combination expansion target attribute name list (“No” in step S-104S-03), the combination expansion processing unit 104 proceeds to step S-104S-07. move on. The combination expansion processing unit 104 extracts the i-th attribute name from the combination expansion target attribute name list (steps S-104S-04). Then, the process of the combination development processing unit 104 proceeds to step S-104S-05.
  • the combination expansion processing unit 104 acquires a combination expansion target attribute value list corresponding to the attribute name acquired in Step S-104S-04 from the combination expansion target attribute value list storage unit 141 (Step S-104S-05). Then, the process of the combination development processing unit 104 proceeds to step S-104S-06. The combination expansion processing unit 104 adds 1 to the counter i (step S-104S-06). Then, the processing of the combination development processing unit 104 proceeds to step S-104S-03. The combination expansion processing unit 104 generates an attribute value combination list that is a possible combination of the attribute values included in the combination expansion target attribute value list acquired in step S-104S-05 (step S-104S-07). .
  • step S-104S-08 If there is no attribute value list, the attribute value combination list is empty.
  • the combination development processing unit 104 sets the counter j to 0 (steps S-104S-08). Then, the process of the combination development processing unit 104 proceeds to step S-104S-09.
  • the combination expansion processing unit 104 compares the number of possible pairs of values included in the combination list of the counter j and the attribute value (steps S-104S-09). When the counter j is smaller than the number of value pairs included in the attribute value combination list (“Yes” in step S-104S-09), the processing of the combination expansion processing unit 104 proceeds to step S-104S-10. .
  • the combination expansion processing unit 104 ends the combination expansion processing.
  • the combination expansion processing unit 104 acquires the jth attribute value pair from the attribute value combination list (step S-104S-10). Then, the processing of the combination development processing unit 104 proceeds to step S-104S-11.
  • the combination expansion processing unit 104 generates new registration information by combining attribute value pairs and attribute names corresponding to the attribute value pairs into the registration information as attribute information. Then, the combination development processing unit 104 adds the generated registration information to one of the “registration information after the combination development process” (step S-104S-11).
  • step S-104S-12 the processing of the combination development processing unit 104 proceeds to step S-104S-12.
  • the combination development processing unit 104 adds 1 to the counter j (step S-104S-12).
  • step S-104S-09 the processing of the combination development processing unit 104 proceeds to step S-104S-09.
  • the above is the operation of the combination development processing unit 104. That is, when the combination expansion processing unit 104 ends the processing in step S-104S-09, it passes the registration information after the combination expansion processing added in step S-104S-11 to the information registration unit 105. Then, the process of the information search system 10 proceeds to step S-105S.
  • the information registration unit 105 extracts one piece of unregistered registration information from one or more pieces of registration information (step S-105S).
  • step S-106S The information registration unit 105 extracts attribute information from the registration information extracted in step S-105S. Then, the information registration unit 105 arranges the attribute information in a specific order (step S-106S). Then, the process of the information search system 10 proceeds to step S-107S.
  • the specific order may be an order determined based on attribute names included in the attribute information. Further, the specific order may be alphabetical order of the attribute names included in the attribute information, alphabetical order, numerical ascending order, or numerical descending order.
  • the information registration unit 105 extracts attribute information from the registration information, and generates a registration key based on the information obtained by connecting the attribute information (step S-107S). Then, the process of the information search system 10 proceeds to step S-108S.
  • the information registration unit 105 passes the registration request including the registration key and registration information generated in step S-107S to the information storage unit 106.
  • the information storage unit 106 stores the registration information based on the registration key included in the received registration request (step S-108S). Then, the process of the information search system 10 proceeds to step S-109S.
  • the information registration unit 105 determines whether registration processing has been performed for all registration information (step S-109S). If registration processing has been performed for all registration information (“Yes” in step S-109S), the information processing system 10 ends the information registration flow. On the other hand, if the registration process has not been performed for all the registration information (“No” in step S-109S), the process of the information search system 10 proceeds to step S-105S. By performing the process according to the above steps, registration information is stored in the information storage unit 106 based on the registration key generated by the combination expansion process. FIG.
  • the evaluation information receiving unit 107 receives evaluation information including one or more attribute information (step S-101E).
  • the evaluation information receiving unit 107 passes the evaluation information to the power set expansion processing unit 108.
  • the process of the information search system 10 proceeds to step S-102E.
  • the evaluation information includes one or more attribute information, and the attribute information includes a pair of an attribute name and an attribute value.
  • the power set expansion processing unit 108 acquires the combination expansion target attribute name designation list stored in the combination expansion target attribute name designation list storage unit 102 (step S-102E). Then, the process of the information search system 10 proceeds to step S-103E.
  • the power set expansion processing unit 108 generates a set expansion target attribute information list that should be a list of attribute information excluding attribute information corresponding to the attribute name specified in the combination expansion target attribute name specification list from the evaluation information.
  • the power set expansion processing unit 108 generates a non-power set expansion target attribute information list that is a list of attribute information obtained by extracting attribute information corresponding to the attribute name specified in the combination expansion target attribute name specification list from the evaluation information. (Step S-103E). Then, the process of the information search system 10 proceeds to step S-104E.
  • the power set expansion processing unit 108 obtains a power set of a set having attribute information included in the power set expansion target attribute information list as an element.
  • the power set expansion processing unit 108 generates a set expansion target expansion list in which each element of the power set should be an element of the list (step S-104E). Then, the process of the information search system 10 proceeds to step S-105E.
  • the power set expansion processing unit 108 sets the counter i to 0 (step S-105E). Then, the process of the power set expansion processing unit 108 proceeds to step S-106E.
  • the power set expansion processing unit 108 compares the counter i with the number of elements included in the power set expansion target expansion list (step S-106E). When the counter i is smaller than the number of elements in the power set expansion target expansion list (“Yes” in step S-106E), the processing of the information search system 10 proceeds to step S-107E.
  • step S-111E when the counter i is larger than the number of elements in the power set expansion target expansion list (“No” in step S-106E), the processing of the information search system 10 proceeds to step S-111E.
  • the power set expansion processing unit 108 extracts the i-th element of the power set expansion target expansion list (step S-107E). Then, the process of the information search system 10 proceeds to step S-108E.
  • the power set expansion processing unit 108 combines the attribute information included in the non-power set expansion target attribute information list with the element extracted in step S-107E (step S-108E). Then, the process of the information search system 10 proceeds to step S-109E.
  • the power set expansion processing unit 108 adds the element synthesized in step S-108E to one of the “evaluation information after the power set expansion processing” (step S-109E). Then, the process of the information search system 10 proceeds to step S-110E.
  • the power set expansion processing unit 108 adds 1 to the counter i (step S-110E). Then, the process of the information search system 10 proceeds to step S-106E.
  • the information search unit 109 extracts one piece of unsearched evaluation information from one or more pieces of evaluation information (step S-111E). Then, the process of the information search system 10 proceeds to step S-112E.
  • the information search unit 109 extracts attribute information from the evaluation information extracted in step S-111E, and arranges the attribute information in a specific order (step S-112E). Then, the process of the information search system 10 proceeds to step S-113E.
  • the information search unit 109 extracts attribute information from the evaluation information, and generates a search key based on the information obtained by connecting the attribute information (step S-113E). Then, the process of the information search system 10 proceeds to step S-114E.
  • the information search unit 109 passes the search request including the search key generated in step S-113E to the information storage unit 106.
  • the information storage unit 106 outputs the registration information (step S-114E).
  • the processing of the information processing system 10 that has finished the search request processing proceeds to step S-115E.
  • the information search unit 109 determines whether search processing has been performed for all evaluation information (step S-115E). When the search process has been performed for all the evaluation information (“Yes” in step S-115E), the information search system 10 ends the information search flow. On the other hand, when the search process has not been performed for all evaluation information (“No” in step S-115E), the process of the information search system 10 proceeds to step S-111E. By performing the processing according to the above steps, the information search system 10 associates with the registration key that matches the search key generated by the power set expansion processing even when registration information including a wild card is registered. The registered information thus registered can be acquired from the information storage unit 106.
  • the information search system 10 includes a combination expansion determination unit 103, a combination expansion processing unit 104, an information registration unit 105, a power set expansion processing unit 108, and an information search unit 109.
  • the combination expansion determination unit 103 acquires a list (combination expansion target attribute name designation list) indicating attribute information to be subjected to the combination expansion process. Then, the combination expansion determination unit 103 determines that attribute information that is handled by the information search system 10 but is not included in the received registration information is a target of combination expansion processing.
  • the combination expansion determination unit 103 passes a combination expansion target attribute name list indicating the attribute names included in the attribute information determined to be the target of the combination expansion process to the combination expansion processing unit 104.
  • the combination expansion processing unit 104 performs combination expansion processing of attribute values respectively corresponding to the attribute names included in the combination expansion target attribute name list generated by the combination expansion determination unit 103. In the combination expansion process, the combination expansion processing unit 104 generates all combinations of attribute values included in the attribute information determined to be the target of the combination expansion process. Then, the combination expansion processing unit 104 generates registration information after the combination expansion processing by combining each of the generated combinations with attribute information included in the registration information that has not been determined to be the target of the combination expansion processing.
  • the information registration unit 105 generates a registration key based on the registration information. For example, the following conditions are assumed as a specific example.
  • the first condition is a condition that “the information search system 10 handles attribute information including any of four attribute names, ⁇ position, gender, age, physical condition ⁇ as attribute information”.
  • the third condition is a condition that “the target of the combination development process is attribute information having either of two attribute names, gender or physical condition”.
  • the fourth condition is that "attribute values that can be taken by attribute information having an attribute name of gender are ⁇ male, female ⁇ , and attribute values that can be taken by attribute information having an attribute name of physical condition are ⁇ good, bad ⁇ " It is a condition.
  • attribute information having a certain attribute name X is simply represented by the attribute name X.
  • the power set expansion processing unit 108 identifies attribute information that is not the target of the combination expansion processing as the target of the power set expansion processing. Then, the power set expansion processing unit 108 generates a power set of a set having the attribute information as an element for the attribute information subjected to the power set expansion processing.
  • the information search system 10 according to the first embodiment can adjust the balance between the calculation amount and the used memory amount by appropriately adjusting the contents of the list indicating the attribute information for which the combination expansion is performed.
  • the combination expansion determination unit 103 determines that combination expansion is performed only on attribute information with a small number of possible attribute values, thereby preventing an increase in registration keys and combining all the attribute information. In comparison, the amount of memory can be reduced.
  • the amount of memory required for storing the registration key when all the attribute information is expanded in combination is n for the number of attribute information and Xn for the type of attribute value of each attribute information.
  • Equation 1 indicates that the memory amount becomes very large when at least one large numerical value is included in the attribute value type Xn of each attribute information. Therefore, the related art of the present invention has a problem that the amount of calculation in the information evaluation flow is large. In particular, when the number of attributes increases, the increase in calculation amount becomes significant. When a power set is created in the information evaluation flow, the amount of calculation greatly increases depending on the number of attributes, and there is a possibility that the throughput of the system may be reduced.
  • the combination expansion determination unit 103 determines that combination expansion is performed only on attribute information whose number of possible attribute values is equal to or less than T indicating a predetermined number, and performs attribute expansion. Assume that the number of information is a.
  • the information retrieval system 10 can suppress the memory amount necessary for storing the registration key to the value represented by [Equation 2], and can reduce the memory amount.
  • the power set expansion processing unit 108 deletes the attribute information on which the combination expansion is performed from the elements that are the targets of the power set generation processing. Therefore, the information search system 10 can reduce the amount of calculation compared to the case where all the attribute information is expanded into a power set.
  • the system expands all attribute information into a power set without considering the combination expansion process.
  • the order of calculation amount of the power set generation process is expressed by [Expression 3].
  • [Expression 3] means that the amount of calculation increases in an exponential order with respect to the number of attributes, and the technique in the related technology indicates that the technique is very weak against the increase in the number of attributes. .
  • all combinations of possible values of attribute values included in the attribute information included in the registration information are generated and the information is registered in the information registration flow. Then, although the method in the related art reduces the calculation amount, it cannot be processed with a realistic memory amount.
  • the order of calculation amount of the power set generation processing is expressed by [Equation 4].
  • the information search system 10 according to the first embodiment can adjust the balance between the calculation amount and the used memory amount in order to keep the calculation amount as small as possible with the mountable memory amount. That is, the information search system 10 according to the first embodiment can realize a high-speed search with a small amount of memory in searching for registration information including one or more attribute information having a pair of attribute name and attribute value. The reason is as follows.
  • the information search system 10 performs combination expansion processing on predetermined attribute information (for example, the number of possible attribute value types is small) among the attribute information included in the registration information. This is because the information search system 10 can select attribute information with high memory use efficiency and generate a registration key for speeding up the search in advance.
  • the information search system 10 according to the first embodiment can reduce the amount of calculation in the information evaluation flow in searching for registration information including one or more attribute information having a pair of attribute name and attribute value. The reason is as follows. That is, the information search system 10 can omit the power set generation process for the attribute information for which the combination expansion process is performed.
  • the information search system 20 includes a registration information receiving unit 101, a combination expansion target attribute name designation list storage unit 102, a combination expansion determination unit 103, a combination expansion processing unit 104, and an information registration unit 105. , An information storage unit 106, an evaluation information receiving unit 107, a power set expansion processing unit 108, an information search unit 109, and a combination expansion target attribute name designation list generation unit 210.
  • the combination expansion target attribute name designation list generation unit 210 uses a predetermined threshold value so that the memory resource (memory amount) consumed by the information search system 20 and the processing speed ( (Computation amount) is realized.
  • memory amount memory amount
  • processing speed (Computation amount) is realized.
  • the attribute value number list is information including the number of types of attribute values that each attribute information handled by the information search system 20 can take.
  • the threshold is a value for determining whether or not to perform the combination expansion process based on the number of types of attribute values of each attribute information.
  • FIG. 25 is a diagram illustrating an example of a configuration included in the combination expansion target attribute name designation list generation unit 210.
  • the combination expansion target attribute name designation list generation unit 210 includes an attribute value number list reception unit 211, a threshold reception unit 212, and a combination expansion target attribute determination unit 213.
  • the attribute value number list receiving unit 211 receives an attribute value number list including the attribute value number indicating the number of types of attribute values that can be taken by each attribute information shown in FIG.
  • the attribute value number list is a list including, as elements, a combination of an attribute name and the number of types of attribute values that can be taken by attribute information indicated by the attribute name.
  • the threshold receiving unit 212 receives a threshold that is information for determining whether or not to perform the combination expansion process based on the number of attribute value types of each attribute information. Various values may be set as the threshold value.
  • the threshold value may be the maximum value of the types of attribute values included in the attribute information to be expanded.
  • the combination expansion target attribute determination unit 213 executes the combination expansion process on the attribute name corresponding to the attribute information whose type of attribute value that can be taken out of the elements included in the attribute value number list is equal to or less than the threshold value.
  • the attribute name corresponding to the attribute information to be added is added to the combination expansion target attribute name specification list. Then, the combination expansion target attribute determination unit 213 stores the combination expansion target attribute name designation list to which the attribute name is added in the combination expansion target attribute name designation list storage unit 102. Further, for example, the threshold value may be the upper limit number of attribute information on which power set expansion processing is performed. In this case, the combination expansion target attribute determining unit 213 excludes the number of elements indicated by the threshold from the attribute information having a large number of attribute value types from among the elements included in the attribute value number list. Then, the combination expansion target attribute determining unit 213 adds the remaining attribute information as attribute information for executing the combination expansion process, and adds attribute names corresponding to the attribute information to the combination expansion target attribute name designation list.
  • the combination expansion target attribute determining unit 213 selects attribute names from the element name included in the attribute value number list to the number indicated by the threshold value in order from the attribute name associated with the smaller value. It may be added to the specified list.
  • the threshold value may be an upper limit of a memory size used when storing registration information.
  • the combination expansion target attribute determination unit 213 specifies the combination expansion target attribute name from the attribute value list having the smallest number of attribute value types until the memory usage exceeds the threshold value. You may add it to the list.
  • the threshold value is the maximum value of the number of attribute value types included in the attribute information to be expanded.
  • FIG. 27 is a flowchart illustrating an outline of the operation of the combination expansion target attribute name designation list generation unit 210 according to the second embodiment.
  • the combination expansion target attribute name designation list generation unit 210 receives the threshold value (step S-201). Then, the process of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-202.
  • the combination expansion target attribute name designation list generation unit 210 receives the attribute value number list (step S-202). Then, the process of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-203.
  • the combination expansion target attribute name designation list generation unit 210 extracts one unprocessed element from the attribute value number list (step S-203).
  • step S-204 The combination expansion target attribute name designation list generation unit 210 compares the number of attribute values of the element extracted in step S-203 with the threshold acquired in step S-201 (step S-204). If the number of attribute values is equal to or less than the threshold (“Yes” in step S-204), the processing of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-205. On the other hand, if the number of attribute values is greater than the threshold (“No” in step S-204), the processing of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-206.
  • the combination expansion target attribute name designation list generation unit 210 extracts the attribute name of the element extracted in step S-203 and adds it to the combination expansion target attribute name designation list (step S-205). Then, the process of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-206.
  • the combination expansion target attribute name designation list generation unit 210 determines whether or not processing has been performed for all elements in the attribute value number list (step S-206). When processing has been performed for all elements in the attribute value number list (“Yes” in step S-206), the processing of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-207.
  • step S-206 if processing has not been performed for all elements in the attribute value number list (“No” in step S-206), the processing of the combination expansion target attribute name designation list generation unit 210 proceeds to step S-203. move on.
  • the combination expansion target attribute name designation list generation unit 210 stores the combination expansion target attribute name designation list generated in step S-205 in the combination expansion target attribute name designation list storage unit 102 (step S-207). Then, the processing of the combination expansion target attribute name designation list generation unit 210 ends.
  • the information search system 20 can specify the attribute information for combination expansion based on the threshold value for combination expansion processing.
  • the number of attribute values that can be attributed is less than the number of attribute values that can be attributed.
  • 10 entries are required to store registration information.
  • two entries are sufficient for storing registration information.
  • the information search system 20 in the second embodiment includes the same configuration as the information search system 10 in the first embodiment. Therefore, the information search system 20 in the second embodiment has the same effects as the information search system 10 in the first embodiment. Furthermore, the information search system 20 according to the second embodiment can realize generation of an optimum combination expansion target attribute name designation list according to system resources by setting a threshold value.
  • FIG. 28 is a block diagram showing the configuration of the information search system 30 in the third embodiment.
  • the first expansion processing unit 301 determines whether or not the attribute information included in the registration information includes each attribute name for each of the predetermined attribute names.
  • the first expansion processing unit 301 generates a registration key, which is information corresponding to the above-described registration information, by performing first information processing, which is different processing depending on the above-described determination result.
  • the first development processing unit 301 may store information indicating a predetermined attribute name in advance, or may receive and receive information indicating a predetermined attribute name from an external device (not shown) or a function unit included in the information search system 30.
  • the predetermined attribute name may be specified based on the information.
  • the functional means included in the information search system 30 described above may be the combination expansion target attribute name designation list storage unit 102 in the first embodiment.
  • the information indicating the predetermined attribute name may be the combination expansion target attribute name designation list in the first embodiment.
  • the first information processing for example, when the attribute information included in the registration information does not have a predetermined attribute name, values that can be taken by the attribute value corresponding to the attribute name are respectively added to the registration information. And so on.
  • the first information processing is not limited to the above-described processing.
  • the search key is a key for searching for registration information corresponding to the registration key by comparison with the registration key generated by the first expansion processing unit 301.
  • the second expansion processing unit 302 may store information indicating a predetermined attribute name in advance, or may receive and receive information indicating a predetermined attribute name from an external device (not shown) or a function unit included in the information search system 30.
  • the predetermined attribute name may be specified based on the information.
  • the functional means included in the information search system 30 described above may be the combination expansion target attribute name designation list storage unit 102 in the first embodiment.
  • the information indicating the predetermined attribute name may be the combination expansion target attribute name designation list in the first embodiment.
  • FIG. 29 is a diagram showing a hardware configuration of the information search system 30 and its peripheral devices in the third embodiment of the present invention.
  • the information search system 30 includes a CPU 391, a communication I / F 392 (communication interface 392) for network connection, a memory 393, and a storage device 394 such as a hard disk for storing programs.
  • the information retrieval system 30 is connected to an input device 395 and an output device 396 via a bus 397.
  • the CPU 391 operates the operating system to control the entire information search system 30 according to the third embodiment of the present invention. Further, the CPU 391 reads out programs and data from the recording medium 398 mounted on, for example, a drive device to the memory 393, and in accordance therewith, the first expansion processing unit 301 and the second expansion processing unit in the third embodiment. As 302, various processes are executed.
  • the storage device 394 is, for example, an optical disk, a flexible disk, a magnetic optical disk, a hard disk, or a semiconductor memory, and records a computer program so that it can be read by a computer.
  • the computer program may be downloaded from an external computer (not shown) connected to the communication network.
  • the input device 395 is realized by, for example, a mouse, a keyboard, a built-in key button, and the like, and is used for an input operation.
  • the input device 395 is not limited to a mouse, a keyboard, and a built-in key button, but may be a touch panel, an accelerometer, a gyro sensor, a camera, or the like.
  • the output device 396 is realized by a display, for example, and is used for confirming the output.
  • the block diagram (FIG. 28) used in the description of the third embodiment shows functional unit blocks, not hardware unit configurations. These functional blocks are realized by the hardware configuration shown in FIG. However, the means for realizing each unit included in the information search system 30 is not particularly limited.
  • the information search system 30 may be realized by one physically coupled device, or by two or more physically separated devices connected by wire or wirelessly, and realized by the plurality of devices. Also good.
  • the CPU 391 may read a computer program recorded in the storage device 394 and operate as the first expansion processing unit 301 and the second expansion processing unit 302 according to the program.
  • a recording medium (or storage medium) in which the above-described program code is recorded may be supplied to the information retrieval system 30, and the information retrieval system 30 may read and execute the program code stored in the recording medium. That is, the present invention also includes a recording medium 398 that temporarily or non-temporarily stores software (information processing program) to be executed by the information search system 30 according to the third embodiment.
  • the first development processing unit 301 receives registration information (step S-301).
  • the first expansion processing unit 301 selects one of the predetermined attribute names, and determines whether or not the attribute information included in the registration information includes the attribute name (step S-302).
  • the first development processing unit 301 performs different first information processing based on the determination result in step S-302 (step S-303).
  • the first expansion processing unit 301 determines whether all of the predetermined attribute names have been selected (step S-304). If all the attribute names have been selected (“Yes” in step S-304), the processing of the information search system 30 proceeds to step S-305.
  • step S-304 when all the attribute names have not been selected (“No” in step S-304), the process of the information search system 30 proceeds to step S-302.
  • the second development processing unit 302 receives the evaluation information (step S-305).
  • the second expansion processing unit 302 selects one of the attribute information included in the received evaluation information, and determines whether the attribute information has a predetermined attribute name (step S-306).
  • the second development processing unit 302 performs different second information processing based on the determination result in step S-306 (step S-307).
  • step S-308 determines whether all attribute information included in the evaluation information has been selected (step S-308). If all the attribute information has been selected (“Yes” in step S-308), the processing of the information search system 30 ends.
  • the information search system 30 in the third embodiment receives a registration information registration request, and determines whether or not the attribute information included in the registration information has each attribute name for each of the predetermined attribute names. To do. And the information search system 30 produces
  • the information search system 30 receives evaluation information as a search request, and determines whether or not each attribute information included in the evaluation information has a predetermined attribute name.
  • the information search system 30 produces
  • the information search system 30 can search for registration information corresponding to a registration key that matches the search key.
  • the information search system 30 according to the third embodiment can execute a data search process with an appropriate calculation amount or memory amount even when the processing load for each attribute is heavy.
  • An example of the effect of the present invention is that data search processing can be executed with an appropriate calculation amount or memory amount even when the processing load for each attribute is heavy.
  • Each component in each embodiment of the present invention can be realized by a computer and a program as well as its function in hardware.
  • the program is provided by being recorded on a computer-readable recording medium such as a magnetic disk or a semiconductor memory, and is read by the computer when the computer is started up.
  • the read program causes the computer to function as a component in each of the embodiments described above by controlling the operation of the computer.
  • the target attribute name designation list generation unit 210 can be realized by, for example, a dedicated program for realizing the function of each unit, which is read from a recording medium storing the program into the memory, and a processor that executes the program. .
  • the combination expansion target attribute name designation list storage unit 102 and the information storage unit 106 can be realized by a memory or a hard disk device included in the computer.
  • the registration information receiving unit 101, the combination expansion target attribute name designation list storage unit 102, the combination expansion determination unit 103, the combination expansion processing unit 104, the information registration unit 105, the information storage unit 106, and the evaluation information reception Part or all of the unit 107, the power set expansion processing unit 108, the information search unit 109, and the combination expansion target attribute name designation list generation unit 210 can be realized by a dedicated circuit that realizes the function of each unit. .
  • a part or all of each of the above embodiments can be described as in the following supplementary notes, but is not limited thereto.
  • (Appendix 1) Receive registration information including one or more attribute information having an attribute name and an attribute value, and depending on whether or not the attribute information included in the registration information has each attribute name for each of the predetermined attribute names
  • a first expansion processing means for generating a registration key corresponding to the registration information by performing different first information processing; By receiving evaluation information including one or more attribute information and performing second information processing that differs depending on whether or not each attribute information included in the evaluation information has a predetermined attribute name,
  • a second expansion processing means for generating a search key for searching for registration information corresponding to the registration key by comparison with the registration key;
  • An information retrieval system comprising: (Appendix 2) A designation list storage means for storing a designation list indicating a predetermined attribute name;
  • the first expansion processing means is different from the first information for each of the attribute names indicated in the specified list depending on whether or not the attribute information included in the registration information has each attribute name.
  • the second expansion processing means performs the second information processing, which differs depending on whether or not each of the attribute information included in the evaluation information has an attribute name indicated by the specified list.
  • the first expansion processing means includes a determination means for specifying an attribute name list indicating an attribute name specified based on a difference between an attribute name included in the registration information and an attribute name included in the designation list,
  • the first expansion processing means includes Stores an attribute value list that stores attribute values that attribute information corresponding to each attribute name can have in association with the attribute name, and as the first information processing, attribute names included in the attribute name list
  • combination expansion processing means for adding to the registration information an attribute value associated with the attribute name in the attribute value list;
  • the information search system according to claim 2, further comprising: an information registration unit that generates the registration key based on the registration information to which the attribute name and the attribute value are added.
  • the second expansion processing means includes A set expansion processing means for generating a set having the attribute information of the attribute name specified based on the difference between the attribute name included in the evaluation information and the attribute name included in the specified list;
  • the specified list is The information search system according to any one of appendices 2 to 4, further comprising: a specified list creating unit that generates and stores the specified list in the specified list storage unit.
  • the designation list creating means adds an attribute name associated with a value equal to or less than the threshold in the attribute value number list to the designation list.
  • appendix 7 The information according to appendix 5 or 6, wherein the designation list creating means adds the attribute names to the designation list in order from the attribute name associated with a small value in the attribute value number list to the number indicated by the threshold at most.
  • Search system. The specified list creating means includes the value of the attribute value that can be taken until the memory usage specified based on the number of types of the value that can be taken by the attribute value exceeds the threshold.
  • the information search system according to any one of appendices 5 to 7, wherein an attribute name corresponding to the number of types is added to the designation list.
  • the combination expansion processing unit selects any one of attribute values associated with each attribute name for each attribute name included in the attribute name list, and the attribute value and the attribute name are selected as the registration information. And add to the registration information for all combinations of attribute names and attribute values, 4.
  • the information search system according to appendix 3, wherein the information registration unit generates the registration key for each registration information to which the attribute name and the attribute value are added.
  • the set expansion processing unit generates a power set of attribute information having an attribute name specified based on a difference between an attribute name included in the evaluation information and an attribute name included in the specified list,
  • the information search system according to appendix 4, wherein the information search means generates a search key based on a combination of the evaluation information and complementary information including attribute information indicated by each element included in the power set.
  • the information registering unit concatenates the attribute name and attribute value to be added to the registration information and the attribute name and attribute value of the attribute information included in the registration information, and is identified based on the concatenated information 13.
  • the information search system according to any one of appendices 3 to 8, 11 and 12, wherein the registration key is generated based on a value.
  • the information search means includes an attribute name and attribute value included in attribute information corresponding to an attribute name included in the specified list in the evaluation information, and an attribute name included in attribute information indicated by each element included in the set
  • the information search system according to any one of appendices 4 to 8 and 12, wherein the search key is generated based on a hash value specified based on the linked information.
  • (Appendix 15) Comprising information storage means for storing the registration information and the registration key corresponding to the registration information in association with each other;
  • the second expansion processing means searches the registration information corresponding to the registration key by collating the search key with the registration key stored in the information storage means. Additional notes 1 to 8, and 11 to 14.
  • the information search system according to any one of 14 above.
  • the information search system according to the present invention can be applied to a system that executes specific processing at high speed for input evaluation target information such as grouping processing, stream processing, and rule matching.
  • the information search system according to the present invention can be applied to a use such as a similar search in which a search is performed that does not completely match but includes a lot of matching information.
  • the information search system according to the present invention can be applied to a real-time mobile advertisement distribution, recommendation system, and notification system as a specific system.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Library & Information Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Le problème à résoudre est l'incapacité à exécuter un processus en utilisant une complexité de calcul ou une quantité de mémoire appropriée lorsque la charge d'un processus de recherche de données effectué pour chaque attribut est grande. A cet effet, l'invention porte sur un système de recherche d'informations qui reçoit des informations d'enregistrement contenant au moins un élément d'informations d'attribut ayant un nom d'attribut et une valeur d'attribut, et crée une clé d'enregistrement correspondant aux informations d'enregistrement par mise en œuvre d'un premier traitement d'informations sur chaque nom d'attribut parmi de multiples noms d'attribut spécifiés, ledit traitement étant différent selon si les informations d'attribut incluses dans les informations d'enregistrement comprennent ou non chaque nom d'attribut ; et le système reçoit des informations d'évaluation contenant au moins un élément d'informations d'attribut, et crée une clé de recherche pour rechercher des informations d'enregistrement correspondant à la clé d'enregistrement au moyen d'une comparaison à la clé d'enregistrement, ladite clé de recherche étant créée par mise en œuvre d'un second traitement d'informations sur chaque élément d'informations d'attribut incluses dans les informations d'évaluation, ledit traitement étant différent selon si des noms d'attribut spécifiés sont ou non inclus.
PCT/JP2012/054673 2011-03-18 2012-02-20 Système de recherche d'informations, procédé de recherche d'informations et programme de recherche d'informations Ceased WO2012127986A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2013505861A JP5928446B2 (ja) 2011-03-18 2012-02-20 情報検索システム、情報検索方法および情報検索プログラム

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2011-061046 2011-03-18
JP2011061046 2011-03-18

Publications (1)

Publication Number Publication Date
WO2012127986A1 true WO2012127986A1 (fr) 2012-09-27

Family

ID=46879146

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/054673 Ceased WO2012127986A1 (fr) 2011-03-18 2012-02-20 Système de recherche d'informations, procédé de recherche d'informations et programme de recherche d'informations

Country Status (2)

Country Link
JP (1) JP5928446B2 (fr)
WO (1) WO2012127986A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015001740A1 (fr) * 2013-07-01 2015-01-08 日本電気株式会社 Dispositif de traitement d'informations et procédé de recherche
WO2015049804A1 (fr) * 2013-10-04 2015-04-09 富士通株式会社 Programme, procédé et dispositif de recherche
US20220092186A1 (en) * 2019-01-25 2022-03-24 Nec Corporation Security information analysis device, system, method and program

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008102754A1 (fr) * 2007-02-21 2008-08-28 Nec Corporation Système d'association d'informations, procédé et programme d'association d'informations d'utilisateur
JP2010198223A (ja) * 2009-02-24 2010-09-09 Nippon Telegr & Teleph Corp <Ntt> 関連性解析システムおよび関連性解析方法
WO2011004846A1 (fr) * 2009-07-07 2011-01-13 日本電気株式会社 Système de recherche d'informations, dispositif de gestion d'informations, procédé de recherche d'informations, procédé de gestion d'informations, et support d'enregistrement
JP2011053868A (ja) * 2009-09-01 2011-03-17 Fujitsu Ltd 索引管理装置の処理方法および索引管理装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008102754A1 (fr) * 2007-02-21 2008-08-28 Nec Corporation Système d'association d'informations, procédé et programme d'association d'informations d'utilisateur
JP2010198223A (ja) * 2009-02-24 2010-09-09 Nippon Telegr & Teleph Corp <Ntt> 関連性解析システムおよび関連性解析方法
WO2011004846A1 (fr) * 2009-07-07 2011-01-13 日本電気株式会社 Système de recherche d'informations, dispositif de gestion d'informations, procédé de recherche d'informations, procédé de gestion d'informations, et support d'enregistrement
JP2011053868A (ja) * 2009-09-01 2011-03-17 Fujitsu Ltd 索引管理装置の処理方法および索引管理装置

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015001740A1 (fr) * 2013-07-01 2015-01-08 日本電気株式会社 Dispositif de traitement d'informations et procédé de recherche
WO2015049804A1 (fr) * 2013-10-04 2015-04-09 富士通株式会社 Programme, procédé et dispositif de recherche
JPWO2015049804A1 (ja) * 2013-10-04 2017-03-09 富士通株式会社 検索プログラム、検索方法および検索装置
US20220092186A1 (en) * 2019-01-25 2022-03-24 Nec Corporation Security information analysis device, system, method and program

Also Published As

Publication number Publication date
JP5928446B2 (ja) 2016-06-01
JPWO2012127986A1 (ja) 2014-07-24

Similar Documents

Publication Publication Date Title
US9588991B2 (en) Image search device, image search method, program, and computer-readable storage medium
JP5449628B2 (ja) マルチステージを使用したカテゴリ情報の決定
US9727906B1 (en) Generating item clusters based on aggregated search history data
CN107436875A (zh) 文本分类方法及装置
CN105959374A (zh) 一种数据推荐方法及其设备
CN109829073B (zh) 一种图像搜索的方法及装置
CN108268617A (zh) 用户意图确定方法及装置
JP6185379B2 (ja) レコメンド装置およびレコメンド方法
CN103544220A (zh) 应用推荐方法和装置
KR102349522B1 (ko) 장기간 연관성 높은 문서 클러스터링을 위한 방법 및 시스템
EP2862104A1 (fr) Procédé et appareil de recherche
JP5194818B2 (ja) データ分類方法およびデータ処理装置
JP5928446B2 (ja) 情報検索システム、情報検索方法および情報検索プログラム
KR20230159165A (ko) 키워드를 기반으로 유사 상품을 추천하는 방법, 컴퓨터 장치, 및 컴퓨터 프로그램
US20190362187A1 (en) Training data creation method and training data creation apparatus
CN109635072B (zh) 舆情数据分布式存储方法、装置、存储介质和终端设备
JP7354330B2 (ja) 趣向による場所関連推薦を提供する方法、システム、およびコンピュータプログラム
JP6639749B1 (ja) 検索装置、検索方法および機械学習装置
CN115422485A (zh) 信息发送方法、装置、电子设备和存储介质
CN109918595B (zh) 获取公共模块的方法和装置
CN110689383B (zh) 信息推送方法、装置、服务器及存储介质
JP2010271959A (ja) 業務プロセス間の類似度算出方法、プログラム及び装置
CN115934571A (zh) 基于贝叶斯分类算法的接口测试用例生成方法及装置
JP2011108242A (ja) 利用者の要求に応じて動的にもっとも適したイメージを抽出して提供するための方法、システム及びコンピューター判読可能な記録媒体
JP7088656B2 (ja) 情報処理装置、情報処理方法及び情報処理プログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12761046

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2013505861

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12761046

Country of ref document: EP

Kind code of ref document: A1