FAST PATH EVALUATION OF BOOLEAN PREDICATES
First Claim
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;
determine, based at least in part on logical operators of a query, a first instruction for enabling evaluation of a subset of the logical operators of the query;
generate, based at least in part on the first instruction, logic instructions for implementing the query; and
compile at least the logic instructions into machine-readable instructions for implementing the subset of the logical operators of the query.
1 Assignment
0 Petitions
Accused Products
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.
97 Citations
20 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; determine, based at least in part on logical operators of a query, a first instruction for enabling evaluation of a subset of the logical operators of the query; generate, based at least in part on the first instruction, logic instructions for implementing the query; and compile at least the logic instructions into machine-readable instructions for implementing the subset of the logical operators of the query. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A 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 determine, based at least in part on one or more logical operators of a query statement, a first instruction for enabling evaluation of less than all of the one or more logical operators of the query statement; instructions that cause the one or more processors to generate, based at least in part on the first instruction, logic instructions for implementing the query statement; and instructions that cause the one or more processors to compile the logic instructions into machine-readable code. - View Dependent Claims (11, 12, 13)
-
-
14. A computer-implemented method, comprising:
-
receiving, by a computing system, a query statement associated with processing data; generating, based at least in part on one or more logical operators of the query statement, a query graph for enabling evaluation of less than all of the one or more logical operators of the query statement; generating, based at least in part on the query graph, a logical plan for implementing the query statement to process the data; and compiling, by the computing system, the logical plan into machine-readable instructions. - View Dependent Claims (18, 19, 20)
-
- 15. The computer-implemented method of 14, further comprising executing at least a portion of the machine-readable instructions.
-
16. The computer-implemented method of 15, wherein executing at least a portion of the machine-readable instructions includes at least jumping one or more of the machine-readable instructions.
Specification