The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Aug. 29, 2023

Filed:

May. 05, 2021
Applicant:

Siemens Aktiengesellschaft, Munich, DE;

Inventors:

Thomas Hubauer, Garching bei München, DE;

Swathi Shyam Sunder, Munich, DE;

Janaki Joshi, Karnataka, IN;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/90 (2019.01); G06F 16/9032 (2019.01); G06F 16/901 (2019.01); G06F 16/953 (2019.01); G06F 11/34 (2006.01); G06F 16/9035 (2019.01); G06F 16/20 (2019.01); G06F 11/30 (2006.01);
U.S. Cl.
CPC ...
G06F 16/90324 (2019.01); G06F 11/3409 (2013.01); G06F 16/9027 (2019.01); G06F 16/9035 (2019.01); G06F 16/953 (2019.01);
Abstract

The disclosed relates to a system for generating a refined query, whereby the system comprises or is coupled with a search engine for searching through a tree of query modification operations, whereby the root node of said tree is an empty node which represents a given initial query, and comprises at least one processor which is configured to perform the following steps: a) defining a set of query modification operators which can be inserted into said tree; b) receiving a second set of reference query results; c) receiving a first set of current query results from a currently given query comprising one or more triple patterns; d) contrasting the first set of query results with the second set of query results by assessing the differences between the two query results; e) running the search engine which is configured to perform the following steps: f) selecting a node of said tree by a computed score derived from the assessed result; g) selecting any query modification operator of the defined set of query modification operators; h) if the selected query modification operator does not correspond to any of the triple patterns of the query represented by the selected node, then continue step f); i) otherwise identifying at least one triple pattern of the query which the selected query modification operator corresponds to; j) generating a refined query by applying the selected query modification operator to the identified triple pattern.


Find Patent Forward Citations

Loading…