IP Library › Granted Patent US 10,956,505
Granted Patent B2
US 10,956,505 · App. 16/447,916 · Granted Mar 23, 2021

Data search method, data search apparatus, and non-transitory computer-readable storage medium storing program for data search

Inventors: Fumihito Nishino (Koto, JP); Hiroaki Morikawa (Kawasaki, JP)
Assignee: FUJITSU LIMITED
G06F16/90335G06F3/0481G06F3/14G06F12/00G06F16/00G06F16/9024G06F16/9032G06F16/9038
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,956,505
App. No.
16/447,916
Filed
Jun 20, 2019
Granted
Mar 23, 2021
Kind
B2
Examiner
LE, UYEN T
Art Unit
2156
USPC
707/769
Abstract

A method for a data search includes: executing a first process of obtaining a query template used for generating a query, the query template including an output definition statement and a search condition statement, the output definition statement indicating one or more data items as search targets, and the search condition statement indicating a relationship between an identifier to be designated by a search request and the one or more data items, the relationship including a parameter to be replaced by the designated identifier when the query is generated using the query template; executing a second process when the search request includes identifiers, the second process including generating a query based on first query templates each of which is the query template obtained by the first process based on each of the identifiers; and executing a third process that includes obtaining a search result searched based on the generated query.

Claims (50)

1. A method for a data search performed by a computer, the method comprising:

executing a first process that includes obtaining a query template used for generating a query, the query template including an output definition statement and a search condition statement, the output definition statement indicating one or more data items which are search targets, the search condition statement indicating a relationship between an identifier to be designated by a search request and the one or more data items, the relationship including a parameter to be replaced by the designated identifier when the query is generated based on the query template;

executing a second process when the search request includes a plurality of identifiers, the second process being configured to generate the query based on first query templates, each of the first query templates being the query template obtained by the first process in accordance with each of the plurality of identifiers included in the search request, the second process including

replacing the parameter included in the relationship in the search condition statement for a first variable, the first variable being a string variable indicating that a value range is a set of the plurality of identifiers, and the value range being a range of possible values as the parameter, and

adding a second data item which is a search target to the output definition statement, the second data item including a data item corresponding to each of the plurality of identifiers included in the search request; and

executing a third process that includes

obtaining a search result searched based on the generated query, the search result including first data corresponding to the one or more data items and second data corresponding to the second data item, and

converting the search result into visual information to be displayed.

2. The method according to claim 1 , further comprising:

executing a fourth process when the number of the identifiers included in the search request is one, the fourth process being configured to generate a query based on the single identifier included in the search request and the query template obtained by the first process,

wherein the fourth process is configured to replace the parameter included in the relationship in the search condition statement for the single identifier.

3. The method according to claim 1 ,

wherein the query template includes a group definition statement indicating that a plurality of data records suitable for the search condition statement is matched with the output definition statement by grouping, and

wherein the second process is configured to correct the group definition statement to classify the first data corresponding to the one or more data items to a group, by associating with each of the plurality of identifiers included in the set indicated by the first variable.

4. The method according to claim 1 ,

wherein the visual information converted from search result data is a single graph obtained by superimposing a plurality of graphs corresponding to the plurality of identifiers.

5. An apparatus for a data search, the apparatus comprising:

a memory; and

a processor coupled to the memory, the processor being configured to

execute a first process that includes obtaining a query template used for generating a query, the query template including an output definition statement and a search condition statement, the output definition statement indicating one or more data items which are search targets, the search condition statement indicating a relationship between an identifier to be designated by a search request and the one or more data items, the relationship including a parameter to be replaced by the designated identifier when the query is generated based on the query template,

execute a second process when the search request includes a plurality of identifiers, the second process being configured to generate the query based on first query templates, each of the first query templates being the query template obtained by the first process in accordance with each of the plurality of identifiers included in the search request, the second process including

replacing the parameter included in the relationship in the search condition statement for a first variable, the first variable being a string variable indicating that a value range is a set of the plurality of identifiers, and the value range being a range of possible values as the parameter, and

adding a second data item which is a search target to the output definition statement, the second data item including a data item corresponding to each of the plurality of identifiers included in the search request, and

execute a third process that includes

obtaining a search result searched based on the generated query, the search result including first data corresponding to the one or more data items and second data corresponding to the second data item, and

converting the search result into visual information to be displayed.

6. The apparatus according to claim 5 , wherein the processor is further configured to

execute a fourth process when the number of the identifiers included in the search request is one, the fourth process being configured to generate a query based on the single identifier included in the search request and the query template obtained by the first process,

wherein the fourth process is configured to replace the parameter included in the relationship in the search condition statement for the single identifier.

7. The apparatus according to claim 5 ,

wherein the query template includes a group definition statement indicating that a plurality of data records suitable for the search condition statement is matched with the output definition statement by grouping, and

wherein the second process is configured to correct the group definition statement to classify the first data corresponding to the one or more data items to a group, by associating with each of the plurality of identifiers included in the set indicated by the first variable.

8. The apparatus according to claim 5 ,

wherein the visual information converted from search result data is a single graph obtained by superimposing a plurality of graphs corresponding to the plurality of identifiers.

9. A non-transitory computer-readable storage medium for storing a program which causes a processor to perform processing for data search, the processing comprising:

executing a first process that includes obtaining a query template used for generating a query, the query template including an output definition statement and a search condition statement, the output definition statement indicating one or more data items which are search targets, the search condition statement indicating a relationship between an identifier to be designated by a search request and the one or more data items, the relationship including a parameter to be replaced by the designated identifier when the query is generated based on the query template;

executing a second process when the search request includes a plurality of identifiers, the second process being configured to generate the query based on first query templates, each of the first query templates being the query template obtained by the first process in accordance with each of the plurality of identifiers included in the search request, the second process including

replacing the parameter included in the relationship in the search condition statement for a first variable, the first variable being a string variable indicating that a value range is a set of the plurality of identifiers, and the value range being a range of possible values as the parameter, and

adding a second data item which is a search target to the output definition statement, the second data item including a data item corresponding to each of the plurality of identifiers included in the search request; and

executing a third process that includes

obtaining a search result searched based on the generated query, the search result including first data corresponding to the one or more data items and second data corresponding to the second data item, and

converting the search result into visual information to be displayed.

10. The non-transitory computer-readable storage medium according to claim 9 , the processing further comprising:

executing a fourth process when the number of the identifiers included in the search request is one, the fourth process being configured to generate a query based on the single identifier included in the search request and the query template obtained by the first process,

wherein the fourth process is configured to replace the parameter included in the relationship in the search condition statement for the single identifier.

11. The non-transitory computer-readable storage medium according to claim 9 ,

wherein the query template includes a group definition statement indicating that a plurality of data records suitable for the search condition statement is matched with the output definition statement by grouping, and

wherein the second process is configured to correct the group definition statement to classify the first data corresponding to the one or more data items to a group, by associating with each of the plurality of identifiers included in the set indicated by the first variable.

12. The non-transitory computer-readable storage medium according to claim 9 ,

wherein the visual information converted from search result data is a single graph obtained by superimposing a plurality of graphs corresponding to the plurality of identifiers.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2019
From: NISHINO, FUMIHITO; MORIKAWA, HIROAKI
To: FUJITSU LIMITED
Reel/Frame 049558/0753 →
Priority Claims (1)
JP JP2017-015567 · Jan 31, 2017 · national
Continuity (2)
Continuation PCTJP2018001281 · Jan 17, 2018
Related Publication 20190303409A1 · Oct 3, 2019