http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-9734201-B2
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_7542cdde926ccc0ad7b27ea92c083088 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24532 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30486 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24573 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24544 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30445 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24554 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30466 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30525 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
| filingDate | 2015-11-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2017-08-15-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_f534d8770b90996308ec4bca65ed5def http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ef073300535d600fb54c511a5eeedb49 |
| publicationDate | 2017-08-15-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | US-9734201-B2 |
| titleOfInvention | Optimizing parallel queries using interesting distributions |
| abstract | The present invention extends to methods, systems, and computer program products for optimizing parallel queries using interesting distributions. For each logical operator in an SQL server MEMO, in a top down manner from a root operator to the leaf operators, interesting distributions for the operators can be identified based on the properties of the operators. Identified interesting distributions can be propagated down to lower operators by annotating the lower operators with the interesting distributions. Thus, a SQL server MEMO can be annotated with interesting distributions propagated top down from root to leaf logical operators to generate an annotated SQL server MEMO. Parallel query plans can then be generated from the annotated SQL server MEMO in a bottom up manner from leaf operators to a root operator. Annotated interesting properties can be used to prune operators, thereby facilitating a more tractable search space for a parallel query plan. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11429611-B2 |
| priorityDate | 2012-12-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 25.