PATENT CLAIM ANALYSIS

Application Number: 16231380
Application Type: Utility
Filing Date: 2018-12
Publication Date: 2019-05
Patent Classification: ["707", "718000"]

Abstract:
According to one aspect, a query plan is generated for a newly submitted structured query language (SQL) query received by a relational database management system by reusing at least part of an existing query plan that is being kept in memory after execution.

Claim (Index 1):
A non-transitory machine-readable storage medium having stored thereon computer program code, which when executed by a set of one or more processors, causes the processors to perform operations comprising:\n responsive to a newly submitted structured query language (SQL) query received by a relational database management system, generating a query plan for the newly submitted SQL query by incorporating at least part of an existing query plan that is being kept in memory after execution,\n wherein the relational database management system manages a temporal-relational database comprising temporal tables, \n wherein the existing query plan comprises a directed graph of nodes connected by edges representing an ordered set of query plan operators that when executed generate a query result for an earlier submitted SQL query that required accessing data from the temporal-relational database, \n wherein the query plan for the newly submitted SQL query comprises a directed graph of nodes connected by edges representing an ordered set of query plan operators that when executed will generate a query result for the newly submitted SQL query, \n wherein the directed graph for the newly submitted SQL query is connected by at least one of its edges to at least one node of the directed graph for the earlier submitted SQL query such that the directed graphs share at least one node, \n wherein each of the nodes of the directed graphs represents one of the query plan operators, \n wherein at least one of the nodes of each of the directed graphs identifies one of the temporal tables of the temporal-relational database, and \n wherein at least one of the nodes shared by the directed graphs identifies a temporal table that is kept in memory after execution and that was created to store a result of executing the query plan operator represented; \n after modifying contents of a given one of the temporal tables that is part of the temporal-relational database and that at least the existing SQL query requires accessing data from, incrementally updating those of the temporal tables identified by those of the nodes of the existing query plan that store the results of executing the query plan operators and that depend directly or indirectly upon the node that identifies the given one of the temporal tables; and transmitting, to a client that submitted the earlier submitted SQL query, data that identifies the incremental update to the temporal table identified by a root one of the nodes of the directed graph of the existing query plan.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 98.0
- Lexical Diversity: 1.20513
- Patent Class: 707.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['09810167', '14540792', '14307092', '11953935', '14511171']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2290444285776573
- 35 USC 102 Novelty (BERT): 0.491135134090932
- Combined Prediction Score: 0.2552534991289848
- Mean Citation Score: 247.957186
- Max Citation Score: 251.07925
- Similarity Product: 187.65775029394032

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test