Fast path evaluation of Boolean predicates

• US 9,563,663 B2
• Filed: 02/11/2013
• Issued: 02/07/2017
• Est. Priority Date: 09/28/2012
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Shukla, Vikram, Srinivasan, Anand
• Primary Examiner(s): Stevens, Robert
• Application Number:
  US13/764,560
• Publication Number:
  US 20140095533A1
• Time in Patent Office: 1,457 Days
• Field of Search: 707/769
• US Class Current: 1/1
• CPC Class Codes: B29D 2030/0682 Inner liners tubeless tyres with impervious liner or coating on the tyre B60C5/14
• CPC Class Codes: B29D 30/0681 Parts of pneumatic tyres; accessories, auxiliary operations
• CPC Class Codes: B32B 27/08 of synthetic resin
• CPC Class Codes: B32B 27/34 comprising polyamides
• CPC Class Codes: B60C 1/0008 Compositions of the inner liner
• CPC Class Codes: B60C 5/14 with impervious liner or coating on the inner wall of the tyre
• CPC Class Codes: G06F 16/242 Query formulation
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/2453 Query optimisation
• CPC Class Codes: G06F 16/24535 of sub-queries or views
• CPC Class Codes: G06F 16/24539 using cached or materialised query results
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/24553 of query operations
• CPC Class Codes: G06F 16/2456 Join operations
• CPC Class Codes: G06F 16/24568 Data stream processing; Continuous queries
• CPC Class Codes: G06F 16/2474 Sequence data queries, e.g. querying versioned data
• CPC Class Codes: G06F 16/2477 Temporal data queries
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/25 Integrating or interfacing systems involving database management systems
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/9024 : Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/951 : Indexing; Web crawling techniques

Abstract

Techniques for managing fast path evaluation of Boolean predicates are provided. In some examples, the fast path evaluation may be based at least in part on received queries and/or query statements associated with a database and/or streaming data. In some examples, a first instruction for enabling execution of a subset of logical operators of the query may be determined. The determination may be based at least in part on the logical operators of the query. Additionally, based at least in part on the first instruction, logical instructions for implementing the query may be generated. Further, the logical instructions may be compiled into machine-readable instructions for implementing only the subset of the logical operators of the query.

Claims

1. A system, comprising:

a memory storing a plurality of instructions; and

one or more processors configured to access the memory, wherein the one or more processors are further configured to execute the plurality of instructions to at least;

receive event data from an event stream;

identify a continuous query language query for querying the event data of the event stream;

generate a first logical plan comprising one or more logical operators of the continuous language query;

determine, based at least in part on the one or more logical operators of the continuous query language query in the first logical plan, a first instruction for enabling evaluation of a subset of the one or more logical operators of the continuous query language query;

generate, based at least in part on the first instruction in the first logical plan, a second logical plan for implementing the continuous query language query, the second logical plan comprising at least one conditional instruction for skipping evaluation of at least one or more expressions associated with the one or more logical operators after a first expression comprising the one or more expressions has been evaluated;

compile at least the second logical plan into machine-readable instructions for implementing the subset of the logical operators of the continuous query language query in the first logical plan; and

execute the machine-readable instructions, the machine-readable instructions comprising the conditional instruction for skipping evaluation, at a runtime, of the one or more expressions associated with the subset of the logical operators of the continuous query language query, the conditional instruction identifying, at the runtime, a function comprising a list of input arguments, and the list of input arguments comprising at least one of an input operand indicating a result of execution of a previous instruction in the second logical plan, a storage parameter indicating a storage location to jump to if an expression represented by the input operand satisfies a condition, or a result parameter indicating a result location of execution of the conditional instruction.

2. The system of claim 1, wherein the first instruction, when executed, is configured to generate a query graph for the continuous query language query.

3. The system of claim 1, wherein the subset includes less than all of the logical operators of the continuous query language query.

4. The system of claim 1, wherein the one or more processors are further configured to execute the plurality of instructions to at least execute at least a portion of the machine-readable instructions.

5. The system of claim 4, wherein executing at least a portion of the machine-readable instructions includes at least skipping execution of one or more of the machine-readable instructions.

6. The system of claim 1, wherein the one or more processors are further configured to execute the plurality of instructions to at least receive the continuous query language query as a query statement including at least a predicate.

7. The system of claim 6, wherein the predicate comprises a clause for evaluating to true or false.

8. The system of claim 7, wherein the clause comprises a “

where”

clause, and wherein the “

where”

clause includes at least one of a logical operator or a Boolean predicate.

9. The system of claim 1, wherein the continuous query language query is configured to reference data corresponding to an event processor.

10. The system of claim 1, wherein the second logical plan further comprises instructions to evaluate at least a first expression of the one or more expressions associated with the one or more logical operators in the first logical plan.

11. A non-transitory computer-readable memory storing a plurality of instructions executable by one or more processors, the plurality of instructions comprising:

instructions that cause the one or more processors to receive event data from an event stream;

instructions that cause the one or more processors to identify a continuous query language query statement for querying the event data of the event stream;

instructions that cause the one or more processors to generate a first logical plan comprising one or more logical operators of the continuous language query statement;

instructions that cause the one or more processors to determine, based at least in part on the one or more logical operators of the continuous query language query statement in the first logical plan, a first instruction for enabling evaluation of less than all of the one or more logical operators of the continuous query language query statement;

instructions that cause the one or more processors to generate, based at least in part on the first instruction in the first logical plan, a second logical plan for implementing the continuous query language query statement, the second logical plan comprising at least one conditional instruction for skipping evaluation of at least one or more expressions associated with the one or more logical operators after a first expression comprising the one or more expressions has been evaluated;

instructions that cause the one or more processors to compile the second logical plan into machine-readable code for implementing the one or more logical operators of the continuous query language query statement in the first logical plan; and

instructions that cause the one or more processors to execute the machine-readable instructions, the machine-readable instructions comprising the conditional instruction for skipping evaluation, at a runtime, of the one or more expressions associated with the subset of the logical operators of the continuous query language query, the conditional instruction identifying, at the runtime, a function comprising a list of input arguments, and the list of input arguments comprising at least one of an input operand indicating a result of execution of a previous instruction in the second logical plan, a storage parameter indicating a storage location to jump to if an expression represented by the input operand satisfies a condition, or a result parameter indicating a result location of execution of the conditional instruction.

12. The computer-readable memory of claim 11, wherein the continuous query language query statement includes at least one predicate.

13. The computer-implemented method of claim 12, wherein the continuous query language query statement is configured to retrieve at least one of historical or streaming data.

14. The computer-implemented method of claim 12, wherein the predicate includes one or more other logical operators.

15. A computer-implemented method, comprising:

receiving event data from an event stream;

receiving, by a computing system, a continuous query language query statement for processing the event data of the event stream;

generating a first logical plan comprising one or more logical operators of the continuous language query;

generating, based at least in part on the one or more logical operators of the continuous query language query statement in the first logical plan, a query graph for enabling evaluation of less than all of the one or more logical operators of the continuous query language query statement;

generating, based at least in part on the query graph, a second logical plan for implementing the continuous query language query statement to process the event data of the event stream, the second logical plan comprising at least one conditional instruction for skipping evaluation of at least one or more expressions associated with the one or more logical operators after a first expression comprising the one or more expressions has been evaluated;

compiling, by the computing system, the second logical plan into machine-readable instructions for implementing the one or more logical operators of the continuous query language query statement in the first logical plan; and

executing the machine-readable instructions, the machine-readable instructions comprising the conditional instruction for skipping evaluation, at a runtime, of the one or more expressions associated with the subset of the logical operators of the continuous query language query, the conditional instruction identifying, at the runtime, a function comprising a list of input arguments, and the list of input arguments comprising at least one of an input operand indicating a result of execution of a previous instruction in the second logical plan, a storage parameter indicating a storage location to jump to if an expression represented by the input operand satisfies a condition, or a result parameter indicating a result location of execution of the conditional instruction.

19. The computer-implemented method of claim 15, wherein the instructions include at least a jump_if_true or a jump_if_false instruction.

20. The computer-implemented method of claim 15, wherein the first logical plan is generated by traversing the query graph upward starting from a bottom node of the query graph.

21. The computer-implemented method of claim 15, wherein the second logical plan includes a jump_if_true statement associated with an “

or”

operator following at least the first expression comprising the one or more expressions or a jump_if_false statement associated with an “

and”

operator following at least the first expression comprising the one or more expressions.

16. The computer-implemented method of 15, further comprising executing at least a portion of the machine-readable instructions.

18. The computer-implemented method of claim 16, wherein executing at least a portion of the machine-readable instructions comprises executing all of the machine-readable instructions except for at least one of the machine-readable instructions.

17. The computer-implemented method of 16, wherein executing at least a portion of the machine-readable instructions includes at least jumping one or more of the machine-readable instructions.