# US 2019/0171643 A1 · Information processing system and method and program > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0171643 A1 - Document ID: US20190171643A1 - Status: Published application - Kind: A1 - Application number: 16/215,163 - Filed: 2018-12-10 - Published: 2019-06-06 - Earliest claimed: 2016-06-09 - Assignees: Cygames, Inc. - Applicants: Cygames, Inc. - Inventors: Shuichi Kurabayashi - Web page: https://patentgrep.com/patent/US20190171643A1 ## CPC - G06F 16/24535: {of sub-queries or views} - G06F 16/00: Information retrieval; Database structures therefor; File system structures therefor - G06F 16/2455: Query execution - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract An information processing method executed by an information processing system that executes processing for searching data to be searched by using a query condition that can be entered via a predetermined user interface and in which individual conditions constituting a query satisfy three properties consisting of reductiveness, idempotence, and commutativity, includes a pre-processing executing step of executing processing prior to processing for searching, and a search processing step of executing processing for searching. The pre-processing executing step includes a query extracting step of extracting a plurality of limited kinds of sub-queries constituting minimum units of queries and satisfying the three properties consisting of the reductiveness, the idempotence, and the commutativity by analyzing a set of statically defined kinds of queries, and a query executing step of executing each of the plurality of kinds of sub-queries extracted in the query extracting step. ## Claims ### Claim 1 An information processing system comprising: that executes processing for searching data to be searched by using a query condition that can be entered via a predetermined user interface and in which individual conditions constituting a query satisfy three properties consisting of reductiveness, idempotence, and commutativity, the information processing system comprising: a data-introduction processor that executes processing prior to processing for searching; and a search processor for executing processing for searching, wherein the data-introduction processor performs: extracting a plurality of limited kinds of sub-queries constituting minimum units of queries and satisfying the three properties consisting of the reductiveness, the idempotence, and the commutativity by analyzing a set of statically defined kinds of queries; executing each of the extracted plurality of kinds of sub-queries; generating, as association data for each of the extracted plurality of kinds of sub-queries, data in which a result of execution is associated with information that allows identification of the kind of sub-query associated with the result of execution; and managing the association data for each of the generated plurality of kinds of sub-queries, and wherein the search processor performs: accepting, as a searching query condition, a query condition entered for searching via the user interface; dividing the accepted searching query condition into a set of one or more kinds of sub-queries; extracting, from the association data, the result of execution of each of the one or more kinds of sub-queries resulting from the division and belonging to the set based on the information that allows identification of each of the one or more kinds of sub-queries; and generating, on based on the result of extraction, a search result for the accepted searching query condition. ### Claim 2 (depends on 1) An information processing system according to claim 1, wherein the search processor generates a search result for the accepted searching query condition by performing logical operations with the individual results of execution of the extracted one or more kinds of sub-queries according to a certain order determined for the individual results of execution of the one or more kinds of sub-queries, and wherein the search processor further calculates searching costs for the individual results of execution of the extracted one or more sub-queries in accordance with the amounts of the results of execution of the sub-queries in the data to be searched and for determining the certain order of the logical operations based on the searching costs. ### Claim 3 (depends on 1) An information processing system according to claim 1, wherein the user interface has an operation function for allowing selection of a certain one kind from the plurality of kinds of sub-queries for each of a plurality of kinds of attributes. ### Claim 4 (depends on 3) An information processing system according to claim 3, wherein the result of execution of a certain kind of sub-query involving a certain kind of attribute by the data-introduction processor includes the certain kind of attribute, the certain kind of sub-query, and the amount of the result of execution of the certain kind of sub-query involving the certain kind of attribute in the data to be searched. ### Claim 5 An information processing method executed by an information processing system that executes processing for searching data to be searched by using a query condition that can be entered via a predetermined user interface and in which individual conditions constituting a query satisfy three properties consisting of reductiveness, idempotence, and commutativity, the information processing method comprising: a pre-processing executing step of executing processing prior to processing for searching; and a search processing step of executing processing for searching, wherein the pre-processing executing step includes: a query extracting step of extracting a plurality of limited kinds of sub-queries constituting minimum units of queries and satisfying the three properties consisting of the reductiveness, the idempotence, and the commutativity by analyzing a set of statically defined kinds of queries; a query executing step of executing each of the plurality of kinds of sub-queries extracted in the query extracting step; an associating step of generating, as association data for each of the plurality of kinds of sub-queries extracted in the query extracting step, data in which a result of execution in the query executing step is associated with information that allows identification of the kind of sub-query associated with the result of execution; and a management step of managing the association data for each of the plurality of kinds of sub-queries, generated in the associating step, and wherein the search processing step includes: an accepting step of accepting, as a searching query condition, a query condition entered for searching via the user interface; a dividing step of dividing the searching query condition accepted in the accepting step into a set of one or more kinds of sub-queries; an execution-result extracting step of extracting, from the association data, the result of execution of each of the one or more kinds of sub-queries resulting from the division in the dividing step and belonging to the set based on the information that allows identification of each of the one or more kinds of sub-queries; and a search-result generating step of generating, based on the result of extraction in the execution-result extracting step, a search result for the searching query condition accepted in the accepting step. ### Claim 6 A non-transitory computer readable medium storing a program for a server and a client included in an information processing system that executes processing for searching data to be searched by using a query condition that can be entered via a predetermined user interface and in which individual conditions constituting a query satisfy three properties consisting of reductiveness, idempotence, and commutativity, the program allowing the server to execute control processing including a pre-processing executing step of executing processing prior to processing for searching; and the program allowing the server or the client to execute control processing including a search processing step of executing processing for searching, wherein the pre-processing executing step includes: a query extracting step of extracting a plurality of limited kinds of sub-queries constituting minimum units of queries and satisfying the three properties consisting of the reductiveness, the idempotence, and the commutativity by analyzing a set of statically defined kinds of queries; a query executing step of executing each of the plurality of kinds of sub-queries extracted in the query extracting step; an associating step of generating, as association data for each of the plurality of kinds of sub-queries extracted in the query extracting step, data in which a result of execution in the query executing step is associated with information that allows identification of the kind of sub-query associated with the result of execution; and a management step of managing the association data for each of the plurality of kinds of sub-queries, generated in the associating step, and wherein the search processing step includes: an accepting step of accepting, as a searching query condition, a query condition entered for searching via the user interface; a dividing step of dividing the searching query condition accepted in the accepting step into a set of one or more kinds of sub-queries; an execution-result extracting step of extracting, from the association data, the result of execution of each of the one or more kinds of sub-queries resulting from the division in the dividing step and belonging to the set based on the information that allows identification of each of the one or more kinds of sub-queries; and a search-result generating step of generating, based on the result of extraction in the execution-result extracting step, a search result for the searching query condition accepted in the accepting step.