Serving font glyphs
US-2015363400-A1 · Dec 17, 2015 · US
US9613096B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9613096-B2 |
| Application number | US-201414196562-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 4, 2014 |
| Priority date | Mar 4, 2014 |
| Publication date | Apr 4, 2017 |
| Grant date | Apr 4, 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.
According to one embodiment of the present invention, a system for processing a database query stores one or more result sets for one or more first database queries in a data store. The system receives a second database query and compares the second database query to the one or more first database queries to determine presence of a corresponding result set in the data store for the second database query. The system provides the corresponding result set from the data store for the second database query based on the comparison. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manners described above.
Opening claim text (preview).
What is claimed is: 1. A system for processing a database query comprising: at least one processor and a data store, wherein the at least one processor is configured to: process one or more first database queries against a data set to produce corresponding result sets; store one or more result sets for the one or more first database queries in the data store; determine an amount of data changed within the data set for an update applied to data of the data set after processing the one or more first database queries and discarding one or more stored result sets associated with the changed data in response to the amount of changed data exceeding a threshold amount of changed data, wherein discarding one or more stored result sets includes: discarding all stored result sets derived from changed data in response to a bulk update applying changes to entireties of database objects; and discarding one or more result sets based on the amount of changed data in response to an incremental update applying changes to elements of the database objects; receive and process a second database query, wherein processing the second database query comprises: comparing the second database query to the one or more first database queries to determine previous processing of the second database query and presence of a corresponding result set in the data store for the second database query; and reducing a response time of the at least one processor for processing the second database query by providing the corresponding result set from the data store as results for the second database query to avoid repeated query execution based on the comparison indicating the second database query has been previously processed. 2. The system of claim 1 , wherein the one or more first database queries and the second database query are processed by a database accelerator. 3. The system of claim 1 , wherein the threshold amount of changed data includes a user-specified threshold. 4. The system of claim 1 , wherein providing the corresponding result set from the data store includes: providing the corresponding result set from the data store in response to the second database query matching a previously processed one of the first database queries. 5. The system of claim 1 , wherein the data store includes a cache that is allocated a user-specified portion of disk space. 6. The system of claim 1 , wherein storing the one or more result sets comprises determining available space in the data store. 7. The system of claim 6 , wherein determining available space in the data store comprises discarding a result set. 8. A computer program product for processing a database query comprising: a computer readable storage medium having computer readable program code embodied therewith for execution on a processing system including at least one processor and a data store, the computer readable program code comprising computer readable program code configured to cause the at least one processor to: process one or more first database queries against a data set to produce corresponding result sets; store one or more result sets for the one or more first database queries in the data store; determine an amount of data changed within the data set for an update applied to data of the data set after processing the one or more first database queries and discarding one or more stored result sets associated with the changed data in response to the amount of changed data exceeding a threshold amount of changed data, wherein discarding one or more stored result sets includes: discarding all stored result sets derived from changed data in response to a bulk update applying changes to entireties of database objects; and discarding one or more result sets based on the amount of changed data in response to an incremental update applying changes to elements of the database objects; receive and process a second database query, wherein processing the second database query comprises: comparing the second database query to the one or more first database queries to determine previous processing of the second database query and presence of a corresponding result set in the data store for the second database query; and reducing a response time of the at least one processor for processing the second database query by providing the corresponding result set from the data store as results for the second database query to avoid repeated query execution based on the comparison indicating the second database query has been previously processed. 9. The computer program product of claim 8 , wherein the one or more first database queries and the second database query are processed by a database accelerator. 10. The computer program product of claim 8 , wherein the threshold amount of changed data includes a user-specified threshold. 11. The computer program product of claim 8 , wherein providing the corresponding result set from the data store includes: providing the corresponding result set from the data store in response to the second database query matching a previously processed one of the first database queries. 12. The computer program product of claim 8 , wherein the data store includes a cache that is allocated a user-specified portion of disk space. 13. The computer program product of claim 8 , wherein storing the one or more result sets comprises determining available space in the data store. 14. The computer program product of claim 13 , wherein determining available space in the data store comprises discarding a result set.
Physics · mapped topic
in a memory management context, e.g. virtual memory or cache management (memory management G06F12/00; testing of static memory units G11C29/00) · CPC title
Physics · mapped topic
Physics · mapped topic
using cached or materialised query results · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.