Fast path evaluation of Boolean predicates

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.

Description

BACKGROUND

Data associated with a database or streaming data may be stored, managed, and/or processed in many different ways. Currently, there are many different types of database languages, methods, and/or functions for managing such data. Additionally, as data storage becomes increasingly less expensive over time, more and more data is being backed-up, stored, or otherwise managed. However, some databases are so populated with data that performing queries can be very time consuming and/or processor intensive. Additionally, service providers may provide data management services to users for data stored or managed on the user's behalf. Other resources of the service providers may be strained when complex queries are processed. Additionally, in some examples, executing instructions for performing a particular database query or query statement may involve an excessive number of processor cycles and/or instructions due to the complexity of the query and/or the amount of data of the database or stream. For example, some queries may include complex predicates with Boolean operators, conditions, or the like. However, managing queries with such complex predicates may pose challenges to the service providers.

BRIEF SUMMARY

Techniques for managing the fast path evaluation of Boolean predicates are provided. In some examples, a computing system may determine a first instruction for enabling execution of a subset of logical operators of a query. The first instruction may be configured to generate a query graph including nodes for operators and/or values. The determination may be made based at least in part on the logical operator of the query. Additionally, the system may generate logical instructions for implementing the query based at least in part on the determined first instruction. In some examples, the system may also compile the logical instructions into machine-readable instructions for implementing only the subset of the logical operators of the query. The subset may include less than all of the logical operators of the query. The system may also execute at least a portion of the machine-readable instructions which, in some examples, may include at least skipping execution of one or more of the machine-readable instructions. Additionally, in some cases, the system may also receive the query as a query statement including at least one predicate. The predicate may be a clause for evaluating to true or false. The clause may be a “where” clause, and the “where” clause may include at least one or more logical operators and/or Boolean predicates. The query may be configured to reference data corresponding to or otherwise associated with an event processor.

Additionally, in some examples, a computer-readable memory may be provided. The memory may store a plurality of instructions that cause one or more processors to at least determine a first instruction for enabling execution of less than all of one or more logical operators of a query statement. The determination may be based at least in part on the one or more logical operators of the query statement. Additionally, in some examples, the instructions may cause the one or more processors to at least generate logical instructions for implementing the query statement based at least in part on the first instruction. Further, the instructions may cause the one or more processors to at least compile the logical instructions into machine-readable code. Additionally, in some examples, the query statement may include at least one predicate, and the predicate may include at least one clause for evaluating to true or false. Additionally, the query statement may be configured to retrieve historical and/or streaming data. Further, the predicate may include one or more other logical operators.

Furthermore, in some examples, a method may be provided. The method may be configured to generate a query graph for enabling execution of less than all of one or more logical operators of the query statement. In some cases, the determination may be based at least in part on the one or more logical operators of the query statement. In some aspects, the method may also be configured to generate, based at least in part on the query graph, a logical plan for implementing the query statement to process the data. The method may also be configured to compile the logical plan into machine-readable instructions and/or execute at least a portion of the machine-readable instructions. In some examples, executing at least a portion of the machine-readable instructions may include at least jumping one or more of the machine-readable instructions and/or not executing all of the machine-readable instructions. Additionally, in some examples, the instructions may include a jump_if_true or a jump_if_false instruction. The logical plan may include a set of instructions to be compiled. Further, in some examples, the logical plan may include a jump_if_true statement following an “or” operator or a “jump_if_false” statement following an “and” operator.

The foregoing, together with other features and embodiments, will become more apparent upon referring to the following specification, claims, and accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The detailed description is set forth with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the FIG. in which the reference number first appears. The use of the same reference numbers in different FIGS. indicates similar or identical items.

FIG. 1 is a simplified block diagram illustrating an example architecture for managing the fast path evaluation of Boolean predicates, according to at least one example.

FIG. 2 is a simplified block diagram illustrating at least some features of the fast path evaluation of Boolean predicates described herein, according to at least one example.

FIG. 3 is a simplified flow diagram illustrating at least some additional features of the fast path evaluation of Boolean predicates described herein, according to at least one example.

FIG. 4 is a simplified process flow illustrating at least some features of the fast path evaluation of Boolean predicates described herein, according to at least one example.

FIG. 5 is another simplified process flow illustrating at least some features of the fast path evaluation of Boolean predicates described herein, according to at least one example.

FIG. 6 is another simplified process flow illustrating at least some features of the fast path evaluation of Boolean predicates described herein, according to at least one example.

FIG. 7 is a simplified block diagram illustrating components of a system environment that may be used in accordance with an embodiment of the fast path evaluation of Boolean predicates described herein, according to at least one example.

FIG. 8 is a simplified block diagram illustrating a computer system that may be used in accordance with embodiments of the fast path evaluation of Boolean predicates described herein, according to at least one example.

DETAILED DESCRIPTION

In the following description, various embodiments will be described. For purposes of explanation, specific configurations and details are set forth in order to provide a thorough understanding of the embodiments. However, it will also be apparent to one skilled in the art that the embodiments may be practiced without the specific details. Furthermore, well-known features may be omitted or simplified in order not to obscure the embodiment being described.

Embodiments of the present disclosure are directed to, among other things, managing fast path predicate evaluation (e.g., within a query language). In some examples, a query language may be defined by or may at least include one or more predicates. For example, a predicate may be a condition, a complex condition, and/or a combination of complex conditions that are to be evaluated. Examples of predicate clauses may include, but are not limited to, “greater than,” “less than,” or “equals,” “not equals,” “less than or equals,” among others (e.g., >, <, =, !=, <=, respectively). As such, predicate clauses may resolve to either “true,” or “false” based at least in part on inputs associated with the predicates. In some cases, the predicate may include one or more logical operators (e.g., “or,” “and,” “inlist,” etc.). Additionally, the operands of the logical operators and/or (as noted) the predicates themselves may evaluate to “true,” or “false.” In other words, the operators may be Boolean operators. The query language may be configured to manage or otherwise operate with a database, a server of data, and/or streaming data (e.g., utilizing a complex event processing (CEP) engine or server and/or utilizing a messaging service or the like.

Additionally, in some aspects, managing fast path predicate evaluation may include operating one or more processors configured to receive a query. As noted, the query may include one or more predicates to be evaluated, each predicate including one or more logical operators. In some examples, a predicate may be a clause (e.g., a “where” clause) including other predicates or the predicate may be the operators to be evaluated within the “where” clause. As desired, any type of conditional cause (e.g., a “which” clause, “if” clause, etc.) may be utilized in the query. Additionally, the conditional clause (e.g., “greater than,” “less than,” or “equals,” “not equals,” “less than or equals,” etc. (e.g., >, <, =, !=, <=, respectively)) may be part of a “select” operation or other query operation for retrieving (i.e., querying) data from a source. Further, in some examples, based at least in part on the predicates included in the query, a logical plan may be generated (e.g., a set of instructions for implementing the query). For example, the logical plan may include a list of instructions to be performed by the one or more processors (or other processors of different computing systems) to implement or otherwise perform the query. Again, the query may evaluate data from a database and/or streaming data from a source other than the database. Once generated, the logical plan may be compiled such that it executable (e.g., into machine readable code, processor-specific code, or the like). Once compiled, the execution of the logical plan may include skipping or otherwise jumping over instructions at runtime, thereby saving considerable clock cycles especially, in some examples, when particular conditions evaluate to true or false.

In some examples, the logical plan may be determined based at least in part on a single pass of the query, predicates, or operators. Additionally, in some cases, the query operators may first be represented in a data structure (e.g., a tree, graph, etc.). In one non-limiting example, a query tree may be generated with leaf nodes representing expressions to be evaluated and/or parent nodes representing the operators associated with the expressions to be evaluated. Further, in some examples, generating the logical plan may include traversing the tree in a single pass and in a bottom-up fashion. In some cases, the logical plan may include instructions for jumping expressions that would otherwise be evaluated. For example, for each “or” operator in the tree, a “jump if true” condition may be included after the first expression is evaluated. In this way, the other expression associated with the “or” operator may not be evaluated because its evaluation would not be needed. This is because of the fact that for the expression “A or B,” if A is true, it doesn't matter whether B is true; the expression will evaluate to “true.” Alternatively, the opposite is true for “and” operators. As such, for each “and” operator in the tree, a “jump if false” condition may be included after the first expression is evaluated.

Once the logical plan is compiled into machine-readable or machine-executable code, one or more processors may execute the code and effectively skip execution of some of the code when appropriate based at least in part on the “jump” conditions. Additionally, as described above, the data to be queried by the query and/or the machine-executable code generated based at least in part on the logical plan (e.g., generated based at least in part on the query) may include event-specific data from a CEP processor, engine, or server, database data (e.g., warehouse or historical data), business intelligence (BI) data, Operational Intelligence (OI) data, continuous query language (CQL) data, and/or other streaming data (e.g., real-time data). Additional details and/or description of systems and/or methods for managing fast path predicate evaluation are described below.

In some examples, the fast path or short circuit evaluation of a complex predicate may occur when the first predicate in a chain of disjunctive (OR) operators is true or the first predicate in a chain of conjunctive (AND) operators is false. In such cases it is not necessary to evaluate the remaining predicates in the chain as it does not really change the overall result (true or false). For example, in the predicate A OR B OR C it is not necessary to evaluate predicate B and C if A is “true,” as the overall result of A OR B OR C would also be true. Similar reasoning applies to AND operators when the result of the first evaluation is false as in A AND B AND C.

In some scenarios, a complex predicate can be a chain of conjunctions (AND) or disjunctions (OR). For example (A OR B OR C) AND (D OR E OR F). Here, {A, B, C, D, E, F} themselves could be simple expressions or could in turn be complex expressions. The semantic of Boolean predicates is language dependent and could have potential side effects. For example, some languages (C/C++) may explicitly terminate evaluation on finding a “true” condition in a complex disjunctive condition. This means the remaining expressions in the chain may not be evaluated at all. So subsequent computation may not rely on those expressions being always evaluated at runtime.

Additionally, in the context of database systems, unlike in regular programming languages, a logical predicate can evaluate to either “true,” “false,” or “unknown.” The last result usually (“unknown”) may occur in the presence of NULL values. In some cases, this problem may be solved, in the context of database systems, at run time. A predicate may be transformed as a conjunction or a disjunction. Then at run time the predicates may be evaluated in a top down manner, beginning at the root of the tree. If it is a conjunction and the left tree is false then the evaluation of the right expression may be skipped and the whole expression may be returned as “false.” Similarly, if it is a disjunction and the left tree is true then the evaluation of the entire right expression subtree may be skipped and the whole expression may be returned as “true.

However, in the context of a CQL engine, the evaluation of context may be setup at compile time and not at runtime. At the core, any expression may be translated into a series of arithmetic and Boolean instructions as in a language compiler. These instructions may then be evaluated at runtime starting with the first instruction, as desired. This translation and/or execution may be a bottom-up evaluation of an expression. In some examples, fast path predicate evaluation may be implemented by introducing at least two instruction opcodes, called JMP_IF_TRUE and JMP_IF_FALSE. These may be conditional jump instructions which jump to a particular location if the result of the previous instruction execution is found to be “true,” or “false,” respectively.

In one non-limiting example, these conditional instructions may take the following operands/arguments:

(addr, result, input operand)
input operand = input value (result of execution of previous
instruction)
addr = which location in array to jump to if input operand is true
(JMP_IF_TRUE) or false (JMP_IF_FALSE)
result = where the result of this instruction is kept.

The techniques described above and below may be implemented in a number of ways and in a number of contexts. Several example implementations and contexts are provided with reference to the following figures, as described below in more detail. However, the following implementations and contexts are but a few of many.

A continuous data stream (also referred to as an event stream) may include a stream of data or events that may be continuous or unbounded in nature with no explicit end. Logically, an event or data stream may be a sequence of data elements (also referred to as events), each data element having an associated timestamp. A continuous event stream may be logically represented as a bag or set of elements (s, T), where “s” represents the data portion, and “T” is in the time domain. The “s” portion is generally referred to as a tuple or event. An event stream may thus be a sequence of time-stamped tuples or events.

In some aspects, the timestamps associated with events in a stream may equate to a clock time. In other examples, however, the time associated with events in an event stream may be defined by the application domain and may not correspond to clock time but may, for example, be represented by sequence numbers instead. Accordingly, the time information associated with an event in an event stream may be represented by a number, a timestamp, or any other information that represents a notion of time. For a system receiving an input event stream, the events arrive at the system in the order of increasing timestamps. There could be more than one event with the same timestamp.

In some examples, an event in an event stream may represent an occurrence of some worldly event (e.g., when a temperature sensor changed value to a new value, when the price of a stock symbol changed) and the time information associated with the event may indicate when the worldly event represented by the data stream event occurred.

For events received via an event stream, the time information associated with an event may be used to ensure that the events in the event stream arrive in the order of increasing timestamp values. This may enable events received in the event stream to be ordered based upon their associated time information. In order to enable this ordering, timestamps may be associated with events in an event stream in a non-decreasing manner such that a later-generated event has a later timestamp than an earlier-generated event.

As another example, if sequence numbers are being used as time information, then the sequence number associated with a later-generated event may be greater than the sequence number associated with an earlier-generated event. In some examples, multiple events may be associated with the same timestamp or sequence number, for example, when the worldly events represented by the data stream events occur at the same time. Events belonging to the same event stream may generally be processed in the order imposed on the events by the associated time information, with earlier events being processed prior to later events.

The time information (e.g., timestamps) associated with an event in an event stream may be set by the source of the stream or alternatively may be set by the system receiving the stream. For example, in certain embodiments, a heartbeat may be maintained on a system receiving an event stream, and the time associated with an event may be based upon a time of arrival of the event at the system as measured by the heartbeat. It is possible for two events in an event stream to have the same time information. It is to be noted that while timestamp ordering requirement is specific to one event stream, events of different streams could be arbitrarily interleaved.

An event stream has an associated schema “S,” the schema comprising time information and a set of one or more named attributes. All events that belong to a particular event stream conform to the schema associated with that particular event stream. Accordingly, for an event stream (s, T), the event stream may have a schema ‘S’ as (<time_stamp>, <attribute(s)>), where <attributes> represents the data portion of the schema and can comprise one or more attributes. For example, the schema for a stock ticker event stream may comprise attributes <stock symbol>, and <stock price>. Each event received via such a stream will have a time stamp and the two attributes. For example, the stock ticker event stream may receive the following events and associated timestamps:

...
(<timestamp_N>, <NVDA,4>)
(<timestamp_N+1>, <ORCL,62>)
(<timestamp_N+2>, <PCAR,38>)
(<timestamp_N+3>, <SPOT,53>)
(<timestamp_N+4>, <PDCO,44>)
(<timestamp_N+5>, <PTEN,50>)
...

In the above stream, for stream element (<timestamp_N+1>, <ORCL,62>), the event is <ORCL,62> with attributes “stock_symbol” and “stock_value.” The timestamp associated with the stream element is “timestamp_N+1”. A continuous event stream is thus a flow of events, each event having the same series of attributes.

FIG. 1 depicts a simplified example system or architecture 100 in which techniques for managing the fast path evaluation of Boolean predicates may be implemented. In architecture 100, one or more users 102 (e.g., account holders) may utilize user computing devices 104(1)-(N) (collectively, “user devices 104”) to access one or more service provider computers 106 via one or more networks 108. In some aspects, the service provider computers 106 may also be in communication with one or more streaming data source computers 110 and/or one or more databases 112 via the networks 108. For example, the users 102 may utilize the service provider computers 106 to access or otherwise manage data of the streaming data source computers 110 and/or the databases 112. The databases 112 may be relational databases, SQL servers, or the like and may, in some examples, manage archived relations on behalf of the users 102. Additionally, the databases 112 may receive or otherwise store data provided by the streaming data source computers 110. In some examples, the users 102 may utilize the user devices 104 to interact with the service provider computers 106 by providing queries or query statements. Such queries or query statements may then be executed by the service provider computers 106 to process data of the databases 112 and/or incoming data from the streaming data source computers 110. Further, in some examples, the streaming data source computers 110 and/or the databases 112 may be part of an integrated, distributed environment associated with the service provider computers 106.

In some examples, the networks 108 may include any one or a combination of multiple different types of networks, such as cable networks, the Internet, wireless networks, cellular networks, intranet systems, and/or other private and/or public networks. While the illustrated example represents the users 102 accessing the service provider computers 106 over the networks 108, the described techniques may equally apply in instances where the users 102 interact with one or more service provider computers 106 via the one or more user devices 104 over a landline phone, via a kiosk, or in any other manner. It is also noted that the described techniques may apply in other client/server arrangements (e.g., set-top boxes, etc.), as well as in non-client/server arrangements (e.g., locally stored applications, etc.).

The user devices 104 may be any type of computing device such as, but not limited to, a mobile phone, a smart phone, a personal digital assistant (PDA), a laptop computer, a desktop computer, a thin-client device, a tablet PC, etc. In some examples, the user devices 104 may be in communication with the service provider computers 106 via the networks 108, or via other network connections. Further, the user devices 104 may also be configured to provide one or more queries or query statements for requesting data of the databases 112 (or other data stores) to be processed.

In some aspects, the service provider computers 106 may also be any type of computing devices such as, but not limited to, mobile, desktop, thin-client, and/or cloud computing devices, such as servers. In some examples, the service provider computers 106 may be in communication with the user devices 104 via the networks 108, or via other network connections. The service provider computers 106 may include one or more servers, perhaps arranged in a cluster, as a server farm, or as individual servers not associated with one another. These servers may be configured to perform or otherwise host features described herein including, but not limited to, the fast path evaluation of Boolean predicates described herein. Additionally, in some aspects, the service provider computers 106 may be configured as part of an integrated, distributed computing environment that includes the streaming data source computers 110 and/or the databases 112.

In one illustrative configuration, the service provider computers 106 may include at least one memory 136 and one or more processing units (or processor(s)) 138. The processor(s) 138 may be implemented as appropriate in hardware, computer-executable instructions, firmware, or combinations thereof. Computer-executable instruction or firmware implementations of the processor(s) 138 may include computer-executable or machine-executable instructions written in any suitable programming language to perform the various functions described.

The memory 136 may store program instructions that are loadable and executable on the processor(s) 138, as well as data generated during the execution of these programs. Depending on the configuration and type of service provider computers 106, the memory 136 may be volatile (such as random access memory (RAM)) and/or non-volatile (such as read-only memory (ROM), flash memory, etc.). The service provider computers 106 or servers may also include additional storage 140, which may include removable storage and/or non-removable storage. The additional storage 140 may include, but is not limited to, magnetic storage, optical disks, and/or tape storage. The disk drives and their associated computer-readable media may provide non-volatile storage of computer-readable instructions, data structures, program modules, and other data for the computing devices. In some implementations, the memory 136 may include multiple different types of memory, such as static random access memory (SRAM), dynamic random access memory (DRAM), or ROM.

The memory 136, the additional storage 140, both removable and non-removable, are all examples of computer-readable storage media. For example, computer-readable storage media may include volatile or non-volatile, removable or non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules, or other data. The memory 136 and the additional storage 140 are all examples of computer storage media.

The service provider computers 106 may also contain communications connection(s) 142 that allow the identity interface computers 120 to communicate with a stored database, another computing device or server, user terminals, and/or other devices on the networks 108. The service provider computers 106 may also include input/output (I/O) device(s) 144, such as a keyboard, a mouse, a pen, a voice input device, a touch input device, a display, one or more speakers, a printer, etc.

Turning to the contents of the memory 136 in more detail, the memory 136 may include an operating system 146 and one or more application programs or services for implementing the features disclosed herein including at least a fast path module 148. As used herein, modules may refer to programming modules executed by servers or clusters of servers that are part of a service. In this particular context, the modules may be executed by the servers or clusters of servers that are part of the service provider computers 106. In some examples, the fast path module 148 may be configured to generate or otherwise provide one or more query graphs 150 for a query or query statement received from a user 102. For example, consider the following simplified, non-limiting example, where a logical expression is expressed as:(a>5)OR(b<10)OR(c==10).

In some examples, this logical expression may be expressed by the query graph 150 of FIG. 1. Additionally, a few examples of the operations of the fast path module 148 and/or the service provider computers 106 are described in greater detail below.

Additional types of computer storage media (which may also be non-transitory) that may be present in the service provider computers 106 and/or user devices 104 may include, but are not limited to, programmable random access memory (PRAM), SRAM, DRAM, RAM, ROM, electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the service provider computers 106 and/or user devices 104. Combinations of any of the above should also be included within the scope of computer-readable media.

Alternatively, computer-readable communication media may include computer-readable instructions, program modules, or other data transmitted within a data signal, such as a carrier wave, or other transmission. However, as used herein, computer-readable storage media does not include computer-readable communication media.

FIG. 2 depicts a simplified block diagram 200 with which features of the fast path evaluation of Boolean predicates techniques may be described. As noted above, in some examples, the query graph 150 may be a graphical representation of the logical expression:(a>5)OR(b<10)OR(c==10).

In some aspects, based at least in part on the query graph 150, a logical plan may then be generated by a logical plan formation module 202 (e.g., also stored in the memory 136 of the service provider computers 106 of FIG. 1). For example, a first logical plan 204 may be generated to implement each of the predicates and/or logical operators of the query. However, in other examples, “jump” instructions will be utilized to generate the second logical plan 206.

As such, in this non-limiting example, if a >5 is “true” then at runtime the evaluation will jump from [0] to [4] to “true” for the entire expression resulting in a savings of four logical instructions (which in turn can translate to 100s of physical CPU instructions). Additionally, in some examples, the instructions may be added to the logical plan during the code generation phase of query compilation or just before compilation. The algorithm for generating the logical plan can be done in a single pass of the query operators. Further, the tree representing the expressions may be activated at a leaf, such that evaluation may be processed in a bottom-up fashion, reducing the potential for backtracking.

Additionally, in some aspects, the logical plan formation module 202 may be implemented to generate the logical plans 204, 206. For example, in some instances, a filter or other programming application (e.g., a logical plan generation module or the like) may receive or otherwise analyze the source operators of a “select” statement found within a query. For example, the query may be written as such:

	select c1, c2
	from database (or from a stream, or both)
	where	(c1 == 5)	OR
		(c1 == 10)	OR
		(c2 < 8)	AND
		...

Once analyzed, activated, and/or traversed, the filter may generate the logical plan and/or executable instructions based at least in part on the logical plan (or other set of instructions) for implementing the query with fast path capabilities (e.g., utilizing “jump” statements or the like).

FIG. 3 depicts a simplified flow diagram showing one or more techniques 300 for implementing the fast path evaluation of Boolean predicates, according to one example. In FIG. 3, the service provider computers 106 are again shown in communication with the users 102 and/or user devices 104 via the networks 108. Additionally, in some examples, the service provider computers 106 may include or be in communication (e.g., via the networks 108) with one or more compiler computers 302 or compiler modules. While techniques 300 are shown in FIG. 3 in a particular order (including arbitrary sequence numbers), it should be understood that no particular order is necessary and that one or more steps or parts of the techniques 300 may be omitted, skipped, and/or reordered. In at least one non-limiting example, the one or more service provider computers 106 described above with reference to FIGS. 1 and 2 may receive queries and/or query statements from the user devices 104. The query statements may be configured to request processing (e.g., retrieval, storage, deletion, etc.) of database data (e.g., data stored by the databases 112 of FIG. 1). Additionally, in some examples, the service provider computers 106 may also determine a set of instructions for enabling execution of some (but not all) of the logical operators of the query. The set of instructions may be determined based at least in part on the query statement and/or may be based at least in part on a query graph generated from the query (e.g., the query graph 150 of FIGS. 1 and 2). Additionally, in some examples, the instructions may resemble the logical plan 204.

In some examples, the service provider computers 106 may also generate one or more logical plans (e.g., the logical plan 206 of FIG. 2) based at least in part on the set of instructions generated. As desired, however, the service provider computers may generate the logical plan directly from the query graph 150 and/or the query statement. In some instances, the service provider computers 106 may pass the logical plan to the compiler computers 302 for compilation. However, in other examples, a compiler of the service provider computers 106 may be configured to compile the logical plan without passing the plan to a separate computing system. At least in response to compilation of the logical plan, the service provider computers 106 may receive fast path code. The fast path code, in some examples, may enable fast path evaluation of the Boolean predicates from the query statement at runtime, as discussed above. The service provider computers 106 and/or another computing system may execute the fast path code. As such, data of the databases 112 and/or the streaming data source computers 110 may be processed based at least in part on the fast path code. Finally, in some examples, data may be provided (e.g., when the query includes a “get” or other retrieval command) to the users 102 based at least in part on the executed fast path code.

FIGS. 4-6 illustrate example flow diagrams showing respective processes 400, 500, and 600 for implementing the fast path evaluation of Boolean predicates techniques described herein. These processes 400, 500, 600 are illustrated as logical flow diagrams, each operation of which represents a sequence of operations that can be implemented in hardware, computer instructions, or a combination thereof. In the context of computer instructions, the operations represent computer-executable instructions stored on one or more computer-readable storage media that, when executed by one or more processors, perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures and the like that perform particular functions or implement particular data types. The order in which the operations are described is not intended to be construed as a limitation, and any number of the described operations can be combined in any order and/or in parallel to implement the processes.

Additionally, some, any, or all of the processes may be performed under the control of one or more computer systems configured with executable instructions and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) executing collectively on one or more processors, by hardware, or combinations thereof. As noted above, the code may be stored on a computer-readable storage medium, for example, in the form of a computer program comprising a plurality of instructions executable by one or more processors. The computer-readable storage medium may be non-transitory.

In some examples, the one or more service provider computers 106 (e.g., utilizing at least one of the fast path module 148 of FIG. 1 and/or the logical plan formation module 202 of FIG. 2) shown in FIGS. 1-3 may perform the process 400 of FIG. 4. The process 400 may begin by including receiving a query statement including a predicate at 402. As noted, the query statement may be received from a user and correspond to a request to process data of a database, of a stream, or other collection of managed or received data. The predicate may include logical operators and may be configured to evaluate to either “true,” or “false.” In some examples, at 404, the process 400 may include determining an instruction (or set of instructions) for enabling evaluation of a subset of the logical operators of the query statement. In some examples, the subset of the logical operators to be evaluated may be less than all of the logical operators. In other words, utilization of the fast path evaluation methods may include skipping execution of some of the logical operators. At 406, the process 400 may also include generating one or more logical instructions for implementing the query. For example, a logical plan may be formulated based at least in part on the determined instructions.

The process 400 may also include compiling the logical instructions into machine-readable instructions for implementing only a subset of the logical operators at 408. For example, the logical plan may have been generated in such a way as to skip execution of some of the logical operators of a query; however, the compilation of the instructions at 408 may actually enable the skipping at runtime. At 410, the process 400 may include executing at least a portion of the machine-readable instructions. Execution of the machine-readable instructions may include actually performing the steps outlined by the compiled code (e.g., at runtime). Further, in some examples, the process 400 may end at 412 by including skipping execution of one or more machine-readable instructions (e.g., Boolean predicates that do not need to be evaluated at least due to knowledge of the result without executing each instruction).

FIG. 5 illustrates an example flow diagram showing process 500 for implementing the fast path evaluation of Boolean predicates techniques described herein. The one or more service provider computers 106 (e.g., utilizing at least one of the fast path module 148 of FIG. 1 and/or the logical plan formation module 202 of FIG. 2) shown in FIGS. 1-3 may perform the process 500 of FIG. 5. The process 500 may begin at 502 by including determining, based at least in part on logical operators of a query statement, one or more instructions for enabling evaluation of less than all of the logical operators. As noted, determining the instructions may be based at least in part on generating a query graph and/or a logical plan. The logical plan may include the one or more different “jump” instructions described above. Additionally, at 504, the process 500 may include generating, based at least in part on the determined instructions, one or more logic instructions for implementing the query. The process 500 may end at 506 by including compiling the logic instructions into machine-readable code.

FIG. 6 illustrates an example flow diagram showing process 600 for implementing the fast path evaluation of Boolean predicates techniques described herein. The one or more service provider computers 106 (e.g., utilizing at least one of the fast path module 148 of FIG. 1 and/or the logical plan formation module 202 of FIG. 2) shown in FIGS. 1-3 may perform the process 600 of FIG. 6. The process 600 may begin by including receiving a query statement associated with data to be processed on behalf of a user or other computing system at 602. At 604, the process 600 may also include a query graph for enabling evaluation of less than all of the logical operators of the query statement. Additionally, in some examples, the process 600 may also include generating a logical plan for implementing the query statement at 606. In some cases, the logical plan may be generated based at least in part on the query graph (and in a bottom-up fashion). However, in other examples, the logical plan may be generated based at least in part on the query alone, the logical operators of the query, and/or the query graph that represents the query. At 608, the process 600 may end by including compiling the logical plan into machine-readable instructions.

Illustrative methods and systems for implementing the fast path evaluation of Boolean predicates are described above. Some or all of these systems and methods may, but need not, be implemented at least partially by architectures and processes such as those shown at least in FIGS. 1-6 above.

FIG. 7 is a simplified block diagram illustrating components of a system environment 700 that may be used in accordance with an embodiment of the present disclosure. As shown, system environment 700 includes one or more client computing devices 702, 704, 706, 708, which are configured to operate a client application such as a web browser, proprietary client (e.g., Oracle Forms), or the like over one or more networks 710 (such as, but not limited to, networks similar to the networks 108 of FIGS. 1 and 3). In various embodiments, client computing devices 702, 704, 706, and 708 may interact with a server 712 over the networks 710.

Client computing devices 702, 704, 706, 708 may be general purpose personal computers (including, by way of example, personal computers and/or laptop computers running various versions of Microsoft Windows and/or Apple Macintosh operating systems), cell phones or PDAs (running software such as Microsoft Windows Mobile and being Internet, e-mail, SMS, Blackberry, or other communication protocol enabled), and/or workstation computers running any of a variety of commercially-available UNIX or UNIX-like operating systems (including without limitation the variety of GNU/Linux operating systems). Alternatively, client computing devices 702, 704, 706, and 708 may be any other electronic device, such as a thin-client computer, Internet-enabled gaming system, and/or personal messaging device, capable of communicating over a network (e.g., network 710 described below). Although exemplary system environment 700 is shown with four client computing devices, any number of client computing devices may be supported. Other devices such as devices with sensors, etc. may interact with server 712.

System environment 700 may include networks 710. Networks 710 may be any type of network familiar to those skilled in the art that can support data communications using any of a variety of commercially-available protocols, including without limitation TCP/IP, SNA, IPX, AppleTalk, and the like. Merely by way of example, network 710 can be a local area network (LAN), such as an Ethernet network, a Token-Ring network and/or the like; a wide-area network; a virtual network, including without limitation a virtual private network (VPN); the Internet; an intranet; an extranet; a public switched telephone network (PSTN); an infra-red network; a wireless network (e.g., a network operating under any of the IEEE 802.11 suite of protocols, the Bluetooth protocol known in the art, and/or any other wireless protocol); and/or any combination of these and/or other networks.

System environment 700 also includes one or more server computers 712 which may be general purpose computers, specialized server computers (including, by way of example, PC servers, UNIX servers, mid-range servers, mainframe computers, rack-mounted servers, etc.), server farms, server clusters, or any other appropriate arrangement and/or combination. In various embodiments, server 712 may be adapted to run one or more services or software applications described in the foregoing disclosure. For example, server 712 may correspond to a server for performing processing described above according to an embodiment of the present disclosure.

Server 712 may run an operating system including any of those discussed above, as well as any commercially available server operating system. Server 712 may also run any of a variety of additional server applications and/or mid-tier applications, including HTTP servers, FTP servers, CGI servers, Java servers, database servers, and the like. Exemplary database servers include without limitation those commercially available from Oracle, Microsoft, Sybase, IBM and the like.

System environment 700 may also include one or more databases 714, 716. Databases 714, 716 may reside in a variety of locations. By way of example, one or more of databases 714, 716 may reside on a non-transitory storage medium local to (and/or resident in) server 712. Alternatively, databases 714, 716 may be remote from server 712, and in communication with server 712 via a network-based or dedicated connection. In one set of embodiments, databases 714, 716 may reside in a storage-area network (SAN) familiar to those skilled in the art. Similarly, any necessary files for performing the functions attributed to server 712 may be stored locally on server 712 and/or remotely, as appropriate. In one set of embodiments, databases 714, 716 may include relational databases, such as databases provided by Oracle, that are adapted to store, update, and retrieve data in response to SQL-formatted commands.

FIG. 8 is a simplified block diagram of a computer system 800 that may be used in accordance with embodiments of the present disclosure. For example service provider computers 106 may be implemented using a system such as system 800. Computer system 800 is shown comprising hardware elements that may be electrically and/or communicatively coupled via a bus 801. The hardware elements may include one or more central processing units (CPUs) 802, one or more input devices 804 (e.g., a mouse, a keyboard, etc.), and one or more output devices 806 (e.g., a display device, a printer, etc.). Computer system 800 may also include one or more storage devices 808. By way of example, the storage device(s) 808 may include devices such as disk drives, optical storage devices, and solid-state storage devices such as a random access memory (RAM) and/or a read-only memory (ROM), which can be programmable, flash-updateable and/or the like.

Computer system 800 may additionally include a computer-readable storage media reader 812, a communications subsystem 814 (e.g., a modem, a network card (wireless or wired), an infra-red communication device, etc.), and working memory 818, which may include RAM and ROM devices as described above. In some embodiments, computer system 800 may also include a processing acceleration unit 816, which can include a digital signal processor (DSP), a special-purpose processor, and/or the like.

Computer-readable storage media reader 812 can further be connected to a computer-readable storage medium 810, together (and, optionally, in combination with storage device(s) 808) comprehensively representing remote, local, fixed, and/or removable storage devices plus storage media for temporarily and/or more permanently containing computer-readable information. Communications system 814 may permit data to be exchanged with network 812 and/or any other computer described above with respect to system environment 800.

Computer system 800 may also comprise software elements, shown as being currently located within working memory 818, including an operating system 820 and/or other code 822, such as an application program (which may be a client application, Web browser, mid-tier application, RDBMS, etc.). In an exemplary embodiment, working memory 818 may include executable code and associated data structures used for relying party and open authorization-related processing as described above. It should be appreciated that alternative embodiments of computer system 800 may have numerous variations from that described above. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software (including portable software, such as applets), or both. Further, connection to other computing devices such as network input/output devices may be employed.

Storage media and computer readable media for containing code, or portions of code, can include any appropriate media known or used in the art, including storage media and communication media, such as but not limited to, volatile and non-volatile (non-transitory), removable and non-removable media implemented in any method or technology for storage and/or transmission of information such as computer readable instructions, data structures, program modules, or other data, including RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, data signals, data transmissions, or any other medium which can be used to store or transmit the desired information and which can be accessed by a computer.

Although specific embodiments of the disclosure have been described, various modifications, alterations, alternative constructions, and equivalents are also encompassed within the scope of the disclosure. Embodiments of the present disclosure are not restricted to operation within certain specific data processing environments, but are free to operate within a plurality of data processing environments. Additionally, although embodiments of the present disclosure have been described using a particular series of transactions and steps, it should be apparent to those skilled in the art that the scope of the present disclosure is not limited to the described series of transactions and steps.

Further, while embodiments of the present disclosure have been described using a particular combination of hardware and software, it should be recognized that other combinations of hardware and software are also within the scope of the present disclosure. Embodiments of the present disclosure may be implemented only in hardware, or only in software, or using combinations thereof.

The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that additions, subtractions, deletions, and other modifications and changes may be made thereunto without departing from the broader spirit and scope. Illustrative methods and systems for providing features of the present disclosure are described above. Some or all of these systems and methods may, but need not, be implemented at least partially by architectures such as those shown in FIGS. 1-7 above.

Although embodiments have been described in language specific to structural features and/or methodological acts, it is to be understood that the disclosure is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as illustrative forms of implementing the embodiments. Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments could include, while other embodiments do not include, certain features, elements, and/or steps. Thus, such conditional language is not generally intended to imply that features, elements, and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements, and/or steps are included or are to be performed in any particular embodiment.

Claims

1. A system, comprising: a memory storing a plurality of instructions; andone 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; andexecute 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; andinstructions 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; andexecuting 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.

16. The computer-implemented method of 15, further comprising executing at least a portion 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.

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.

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.