Identification of intents from query reformulations in search
US-2015379074-A1 · Dec 31, 2015 · US
US9535949B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9535949-B2 |
| Application number | US-201414228336-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 28, 2014 |
| Priority date | Mar 28, 2014 |
| Publication date | Jan 3, 2017 |
| Grant date | Jan 3, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
One or more processors apply rules to a first query to generate a modified query such that processing of the modified query is improved for a first set of processing conditions. One or more processors measure a degree of latency experienced during processing of the modified query under a second set of processing conditions. One or more processors generate other rules to be applied to queries based, at least in part, on the measured degree of latency.
Opening claim text (preview).
What is claimed is: 1. A computer program product for applying rules to queries, the computer program product comprising: a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising: program instructions to apply one or more first rules to a first query to generate a modified query such that processing of the modified query is optimized for a first set of processing conditions; program instructions to measure a degree of latency experienced during processing of the modified query under a second set of processing conditions; program instructions to generate one or more second rules based, at least in part, on the degree of latency; program instructions to update a set of latency trees that represent latencies measured during execution of a third set of query processes; program instructions to generate one or more modified rules based, at least in part, on the updated set of latency trees; program instructions to determine whether one or both of the first rules and the second rules are to be applied to a third query for data residing in a hierarchical structure; program instructions to respond to a determination that one or both of the first rules and the second rules are to be applied to the third query, by determining whether one or both of the first rules and the second rules have been applied to the third query; and program instructions to respond to a determination that one or both of the first rules and the second rules have not been applied to the third query, by applying one or both of the first rules and the second rules to modify the third query such that the third query is optimized for a third set of processing conditions. 2. The computer program product of claim 1 , the program instructions further comprising: program instructions to identify a second query; and program instructions to apply the one or more second rules to the second query such that processing of the second query is optimized for the second set of processing conditions. 3. The computer program product of claim 1 , the program instructions further comprising: program instructions to parse a received query to identify a first set of query processes that will, when executed, yield the result to the query; and program instructions to determine which possible pathways can be used to process the received query and generate a result based, at least in part, on the first set of query processes. 4. The computer program product of claim 3 , the program instructions further comprising: program instructions to analyze a latency model to determine which pathways can be used to process the received query and which pathways can be used to generate the result, wherein such pathways are determined based, at least in part, on a predicted degree of latency produced by the analysis of the latency model. 5. The computer program product of claim 4 , the program instructions further comprising: program instructions to determine a second set of query processes that follow the specific pathway and will generate, when executed, the same result as the first set of query processes. 6. A computer system for applying rules to queries, the computer system comprising: one or more computer processors; one or more computer readable storage media; program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to apply one or more first rules to a first query to generate a modified query such that processing of the modified query is optimized for a first set of processing conditions; program instructions to measure a degree of latency experienced during processing of the modified query under a second set of processing conditions; program instructions to generate one or more second rules based, at least in part, on the degree of latency; program instructions to update a set of latency trees that represent latencies measured during execution of a third set of query processes; program instructions to generate one or more modified rules based, at least in part, on the updated set of latency trees; program instructions to determine whether one or both of the first rules and the second rules are to be applied to a third query for data residing in a hierarchical structure; program instructions to respond to a determination that one or both of the first rules and the second rules are to be applied to the third query, by determining whether one or both of the first rules and the second rules have been applied to the third query; and program instructions to respond to a determination that one or both of the first rules and the second rules have not been applied to the third query, by applying one or both of the first rules and the second rules to modify the third query such that the third query is optimized for a third set of processing conditions. 7. The computer system of claim 6 , the program instructions further comprising: program instructions to identify a second query; and program instructions to apply the one or more second rules to the second query such that processing of the second query is optimized for the second set of processing conditions. 8. The computer system of claim 6 , the program instructions further comprising: program instructions to parse a received query to identify a first set of query processes that will, when executed, yield the result to the query; and program instructions to determine which possible pathways can be used to process the received query and generate a result based, at least in part, on the first set of query processes. 9. The computer system of claim 8 , the program instructions further comprising: program instructions to analyze a latency model to determine which pathways can be used to process the received query and which pathways can be used to generate the result, wherein such pathways are determined based, at least in part, on a predicted degree of latency produced by the analysis of the latency model. 10. The computer system of claim 9 , the program instructions further comprising: program instructions to determine a second set of query processes that follow the specific pathway and will generate, when executed, the same result as the first set of query processes.
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Applying rules; Deductive queries · CPC title
Plan optimisation · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.