Abstract:
A related-word candidate group (12b) obtained by extracting candidates of a related word on the basis of a predetermined condition from a search query log (12a) is generated (S1 to S4), a search query of a search word entered by the user is received (S10), a partial character string is generated from a character string of the search word (S13), on the basis of the partial character strings, a candidate character string is extracted from the related-word candidate group (S14), a suitability score of the candidate character string is calculated (S16), the candidate character strings are ranked in order of the scores (S17), a reference line L1 of a suitability score for the ranking is generated on the basis of the suitability score and the ranking (S18), a candidate character string whose suitability score is apart from the reference line by a preset threshold or larger is extracted as a registration character string to be registered as a related word (S19), and the extracted registration character string and the search word are registered as related words into the related-word DB 12c (S20).
Abstract:
A related-word candidate group (12b) obtained by extracting candidates of a related word on the basis of a predetermined condition from a search query log (12a) is generated (S1 to S4), a search query of a search word entered by the user is received (S10), a partial character string is generated from a character string of the search word (S13), on the basis of the partial character strings, a candidate character string is extracted from the related-word candidate group (S14), a suitability score of the candidate character string is calculated (S16), the candidate character strings are ranked in order of the scores (S17), a reference line L1 of a suitability score for the ranking is generated on the basis of the suitability score and the ranking (S18), a candidate character string whose suitability score is apart from the reference line by a preset threshold or larger is extracted as a registration character string to be registered as a related word (S19), and the extracted registration character string and the search word are registered as related words into the related-word DB 12c (S20).
Abstract:
PROBLEM TO BE SOLVED: To improve the efficiency of data retrieval when adopting index technology for high-traffic technology.SOLUTION: A retrieval request control device 1 comprises: a retrieval request set division unit 11 for dividing a retrieval request set including a plurality of retrieval requests acquired in a predetermined period into a plurality of subsets based on the degree of overlapping of data retrieved by each retrieval request; an average response calculation unit 12 for calculating an average response of retrieval requests included in the retrieval request set according to the processing order of the plurality of subsets divided by the retrieval request set division unit 11; and a retrieval processing unit 13 for, regarding a plurality of subsets having the quickest average response calculated by the average response calculation unit 12, performing the batch processing of retrieval requests included in the subsets according to the processing order.
Abstract:
PROBLEM TO BE SOLVED: To provide a stream data processing method and a system enabling general data processing including recursive processing with low latency. SOLUTION: The stream data processing system 900 establishes a single operator graph 931 from an execution tree of a plurality of queries, determines the execution order of operators so that execution of stream operations advance in one way toward output from input, and supervises the ignition times of an outer ignition operator inputting the data outside the system and of an inner ignition operator generating the data in a timed manner. An operator execution control part 916 repeats a process to complete the processes in the operator graph 931 at the corresponding time according to the determined execution order using the earliest ignition time as the start point. COPYRIGHT: (C)2010,JPO&INPIT