Hybrid execution of continuous and scheduled queries

Description

BACKGROUND

Many companies use business intelligence (BI) systems for strategic and tactical decision making where the decision-making cycle may span a time period of several weeks or months. Competitive pressures, however, are forcing companies to react faster to changing business conditions and customer requirements. As a result, there is now a desire to use BI to help drive and optimize business operations on a daily basis in some cases. Additionally, data associated with a database or streaming data may be stored, managed, and/or processed in many different ways. As noted, some BI data may focus on business events. Other BI data may include historical key performance indicator (KPI) information. In some uses cases, utilizing scheduled and/or tactical queries to retrieve and/or process such business event data may be beneficial. Additionally, in other examples, utilizing continuous queries to retrieve such business event data may make more sense. However, managing the different types of queries as well as memory usage associated with the queries may pose technical challenges to query engines and/or the service providers that implement them.

BRIEF SUMMARY

Techniques for managing the hybrid execution of continuous and scheduled queries are provided. In some examples, a computing system may initialize a query engine with relational data from at least a first source. The first source may include a relational database. The computing system may also enable the query engine to provide query results based at least in part on the relational data from the first source and the streaming data from the second source. In some examples, the second source may be an event processor configured to provide real-time data. The streaming data from the second source may include the real-time data provided by the event processor. Additionally, in some examples, enabling the query engine to provide the query results based at least in part on the relational data and the streaming data may include at least joining the relational data and the streaming data. Alternatively, or in addition, enabling the query engine to provide the query results based at least in part on the relational data and the streaming data may include at least providing a second query that includes the relational data to a continuous query language engine. Further, enabling the query engine to provide the query results based at least in part on the relational data and the streaming data may also include at least receiving the query results from the continuous query language engine based at least in part on the provided second query that includes the relational data.

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 generate a stream associated with a first source. The stream may be generated based at least in part on a data definition language. The stream may also be configured to operate with an event processing engine to the first source, and the first source may be associated with a complex event processor. Additionally, in some examples, the instructions may cause the one or more processors to at least receive a first query result from a second source. Further, the instructions may cause the one or more processors to at least include the first query result from the second source in the generated stream. The instructions may cause the one or more processors to at least provide a second query result based at least in part on the generated stream and the first query result. Additionally, in some examples, the first query result may be received based at least in part on a schedule. Further, including the first query result from the second source in the generated stream may include at least generating the stream to include an identifier associated with the first query result.

Furthermore, in some examples, a method may be provided. The method may be configured to generate a stream associated with an event processor. In some aspects, the method may also be configured to register the generated stream with a query engine. In some examples, the query engine may be configured based at least in part on a continuous query language. The method may also be configured to provide, to a data source, a first query based at least in part on a schedule. In some aspects, the data source may include at least a relational database. The relational database may also include at least historical performance indicators. The method may also be configured to receive, from the data source, a first query result based at least in part on the first query. In some examples, the method may also be configured to include the first query result from the data source in the registered stream. Additionally, in some examples, the method may be configured to provide a second query result based at least in part on the registered stream and the first query result. The first query may be provided to a scheduler of the relational database. Additionally, the scheduler may be configured to perform the first query on the relational database based at least in part on the schedule. Further, in some examples, including the first query result from the data source in the registered stream may include at least generating the stream to include an identifier associated with the first query result.

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 hybrid execution of continuous and scheduled queries, according to at least one example.

FIG. 2 is a simplified block diagram illustrating at least some features of the management of the hybrid execution of continuous and scheduled queries described herein, according to at least one example.

FIG. 3 is a simplified flow diagram illustrating at least some additional features of the management of the hybrid execution of continuous and scheduled queries described herein, according to at least one example.

FIG. 4 is a simplified flow diagram illustrating at least some additional features of the tactical query to continuous query conversion described herein, according to at least one example.

FIG. 5 is a simplified process flow illustrating at least some features of the management of the hybrid execution of continuous and scheduled queries described herein, according to at least one example.

FIG. 6 is another simplified process flow illustrating at least some features of the management of the hybrid execution of continuous and scheduled queries described herein, according to at least one example.

FIG. 7 is another simplified process flow illustrating at least some features of the management of the hybrid execution of continuous and scheduled queries described herein, according to at least one example.

FIG. 8 is a simplified process flow illustrating at least some features of the tactical query to continuous query conversion described herein, according to at least one example.

FIG. 9 is another simplified process flow illustrating at least some features of the tactical query to continuous query conversion described herein, according to at least one example.

FIG. 10 is another simplified process flow illustrating at least some features of the tactical query to continuous query conversion described herein, according to at least one example.

FIG. 11 is a simplified block diagram illustrating components of a system environment that may be used in accordance with an embodiment of the management of the hybrid execution of continuous and scheduled queries described herein, according to at least one example.

FIG. 12 is a simplified block diagram illustrating a computer system that may be used in accordance with embodiments of the management of the hybrid execution of continuous and scheduled queries described herein 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.

In some examples, mechanisms to support the combination of continuous query language (CQL) queries with other queries including, but not limited to, tactical queries (e.g., on a timer), strategic queries, relational queries, etc., may be implemented. The present disclosure may also provide the ability to embed structured query language (SQL) queries (e.g., with a timer) into CQL queries in such a way that the SQL queries can be executed on a timer and the result set used within the CQL statement. Additionally, in some examples, mechanisms to support the conversion of tactical queries to continuous queries may be implemented. For example, a query engine may be configured with one or more tactical queries configured to enable pulling data from a database or other data source. In some aspects, the tactical query may be converted to a continuous query at runtime. In this way, the query engine may then be configured to receive data pushed via a stream or other real-time data source.

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.

In the business event monitoring and analytics platforms, there may be a desire to use historical key performance indicators (KPIs) as thresholds within a continuous query. One example of using such historical KPIs as threshold may include requesting and/or providing a KPI trend in a trend line (e.g., by the hour) along with an average, median, and/or standard deviation (e.g., allowing comparison against a historical timeframe, such as the median value from previous day or the like). In such a case, the historical KPIs may be queried against the database, and the historical KPI may be joined with the results from the function. Alternatively, or in addition, the historical KPI may be shipping to the database with a table in the CQL engine (also referred to herein, as a “CQL engine”). Additionally, in some examples, the historical KPI may be utilized to populate the historical table as a relation in the CQL engine.

Additionally, in some examples, an abstraction of the historical KPI as a stream may be pushed automatically to the CQL engine based at least in part on a schedule from or associated with a business requirement and may provide easy to use language syntax and better resource utilization in terms of computation and memory.

In some aspects, a similar case may be supported by joining streams/relations with an external table and/or shipping the function to a database. The function shipping to the database, however, may be requested to occur for every (or a subset of every) input data of the stream. However, in other examples, a custom adapter may be added to poll the table and push it as the stream. However, this approach may include additional java coding outside of the CQL engine.

Yet, by abstracting the business case of historical KPI within a single query, it may be possible to capture the business case and it may be possible to utilize the business case easily. By having an internal stream that joins to the relation, there is minimum invocation of database queries. Additionally, by encapsulating the stream generation within the single query, a custom adaptor may be avoided.

In some examples, business intelligence (BI) may help drive and optimize business operations at particular intervals (e.g., on a daily basis in some cases). This type of BI is usually called operational business intelligence, real-time business intelligence, or operational intelligence (OI). Operational Intelligence, in some examples, blurs the line between BI and business activity monitoring (BAM). For example, BI may be focused on periodic queries of historic data. As such, it may have a backward-looking focus. However, BI may also be placed into operational applications, and it may therefor expand from a mere strategic analytical tool into the front lines in business operations. As such, BI systems may also be configured to analyze event streams and compute aggregates in real time.

In some examples, a continuous query language service (CQ Service) may be configured to extend a BI analytics server to handle continuous queries and enable real-time alerts. The CQ Service, in some aspects, may provide integration with a BI analytics server and a CQL engine. By way of example only, a BI analytics server may delegate continuous queries to the CQ Service and the CQ Service may also act as a logical database (DB) gateway for a CQL engine. In this way, the CQL engine may be able to leverage the BI analytics server for its analytics capabilities and semantic modeling.

In some examples, the CQ Service may provide, among other things, the following functionalities:

- Remoting service for BI Analytics Server as CQL engine Gateway;
- Event source/sink adapter;
- Generate data definition languages (DDLs) from logical SQL plus CQL extensions;
- Provide unified model for all types of continuous queries and implementation selections;
- Maintain metadata and support restartability; and
- High availability and scalability support.

Additionally, in some examples, OI is a form of real-time dynamic, business analytics that can deliver visibility and insight into business operations. OI is often linked to or compared with BI or real-time BI, in the sense that both help make sense out of large amounts of information. But there are some basic differences: OI may be primarily activity-centric, whereas BI may be primarily data-centric. Additionally, OI may be more appropriate for detecting and responding to a developing situation (e.g., trend and pattern), unlike BI which may traditionally be used as an after-the-fact and report-based approach to identifying patterns.

In some examples, a business event analysis and monitoring (BEAM) system may include a CQL engine to process and/or receive in-flight data. For example, a CQL engine may be an in-memory database engine configured to query or otherwise process incoming real-time information (e.g., BI or OI). The CQL engine may utilize or understand temporal semantics and be configured to allow definition of a window of data to process. Utilizing a CQL engine may, in some cases, involve always running a query on incoming data.

In some aspects, the CQL engine may include a full blown query language. As such, a user may specify computations in terms of a query. Additionally, the CQL engine may be designed for optimizing memory, utilizing query language features, operator sharing, rich pattern matching, rich language constructs, etc. Additionally, in some examples, the CQL engine may process both historical data and streaming data. For example, a user can set a query to send an alert when California sales hit above a certain target. Thus, in some examples, the alert may be based at least in part on historical sales data as well as incoming live (i.e., real-time) sales data.

In some examples, the CQL engine or other features of the below described concepts may be configured to combine a historical context (i.e., warehouse data) with incoming data in a real-time fashion. Thus, in some cases, the present disclosure may describe the boundary of database stored information and in-flight information. Both the database stored information and the inflight information may include BI data. As such, the database may, in some examples, be a BI server or it may be any type of database. Further, in some examples, the features of the present disclosure may enable the implementation of the above features without users knowing how to program or otherwise write code. In other words, the features may be provided in a feature-rich user interface (UI) or other manner that allows non-developers to implement the combination of historical data with real-time data.

Additionally, in some examples, the present disclosure may describe dashboard customization and/or personalization. A CEP engine may be configured to include advanced, continuous analysis of real-time information and historical data. Business process models (BPMs) may include performing model-driven execution of policies and processes defined as BPM notation (BPMN) models. Key result indicators (KRI) may be utilized to tell a user how they have done in a perspective or critical success factor (CSF). For example, it may provide results for many actions, it may cover a longer period of time than key performance indicators (KPIs), and/or it may be reviewed on monthly or quarterly periods. Result indicators (RIs) may be utilized to tell a user what they have done. For example, it may summarize activity, and financial performance measure and/or it may update daily, weekly, or monthly. Further, in some aspects, performance indicators (PIs) may be utilized to inform a user what actions to take or at least make recommendations. Additionally, it may include non-financial information and may, in some cases, complement the KPI.

In some aspects, PI may be reviewed 24/7, daily, weekly, or less regularly. In some cases, KPI may include a set of measures that are most critical for the current and future success of an organization. Some KPIs may be updated daily or even 24/7 while the rest of the information may be reported weekly. Examples of KPI notifications may include, but are not limited to, whether a plane or other service vehicle was delayed or whether a trailer has been sent out underweight the previous day for a distribution company (e.g., to discover better utilization of the trucks).

In some examples, embodiments for managing real-time business events may include integrating (e.g., seamlessly) business activity monitoring, complex event processing, and business intelligence to provide a complex, and real-time set of operational information. Additionally, continuous monitoring of business events may be utilized to gain real-time visibility of business processes and/or workflows. In some examples, OI may be supplemented with traditional business intelligence. As such, operational intelligence may give more insight into business operations versus BI, which, as noted above, is more data centric. For example, OI may get inside to determine how a business is doing in a real-time fashion. Whereas BI may be more akin to data warehousing (e.g., indicating information after the fact).

Examples of KPI may include real-time call processing time. For example, a user may set real time KPI to be 15 minutes, versus weeks or days. As such, users may be enabled to take actions right away. Further, by coupling historical (data centric) information from BI warehouses with current real-time data, users may be able to view how a business is running in the current state (including continuously updated, streaming data). In some examples, advanced continuous analysis of real-time information may be included in the data processing. Additionally, incremental computations may be performed and included in displays, visualizations, user interfaces (UIs), etc.

Additionally, in some examples, the present disclosure may be directed towards enabling the conversion of tactical queries to continuous queries. As noted above, the conversion may be enabled at runtime such that a user may request the conversion while viewing static data and/or historical business event data retrieved via one or more tactical queries. In some aspects, a business event analysis and monitoring (BEAM) composer may be a web application that provides Design Time at Run Time (DT@RT) capabilities to are capable of defining dashboards, KPIs, and/or alerts. It may be built, in some examples, using a Service Oriented Architecture (SOA) common console framework or other suitable framework. It may act as a design time tool to build alerts and business dashboards and it may be configured to hide the complexity of CQL, data controls, ADF task flows, interactions with the analytics server, etc., from user. It may also help users create the data objects (semantic layer) requested by business views in dashboards. As such, methods may be implemented for converting from tactical query (e.g., SQL or other language for querying historical data) to a real-time query (e.g., CQL or other type of continuous query language). In some examples, the conversion may include changing from a data pull model to a data push model. Further, the conversion may also provide the ability to slice and dice the data and/or enable personalization by a user.

In some examples, one or more dashboards or other user interfaces may be provided that may be configured to allow “slice and dice” functionality of the business views at runtime. Through “slice and dice,” functionality, there may be at least three functionalities available to the user including, but not limited to, filters, dimension changes, and/or activation of an active data service (ADS). In some aspects, a user may be able to apply filters on the tactical and/or continuous queries that are already being implemented or have already begun collecting and/or displaying data. For example, a query that is already saved at design time may have a filter applied to it such that the only particular (e.g., relevant as determined by the user) data may be provided. Additionally, in some aspects, a user may also be able to change the dimension (e.g., when the dimension is selected at design time) at runtime (e.g., while viewing the data on the dashboard). Further, in some examples, a user may be able to view real-time changes happening to the data of the original business view's query. For example, the view may be changed from static to active in order to activate a visualization of the changes occurring on the data. In other words, by enabling the ADS, the system may be configured to convert a tactical query into a continuous query to account for real-time data changes. In some examples, each of the above changes may remain implemented for each particular user and may be saved as part of a user personalization (e.g., associated with a user profile or other setting).

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.

FIG. 1 depicts a simplified example system or architecture 100 in which techniques for managing the hybrid execution of continuous and scheduled queries 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 historical data, event data, relations, archived relations, or the like 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 (also referred to as “query statements”) or other requests for data (e.g., historical event data, streaming event data, etc.). Such queries or requests 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 hybrid query module 148 and/or a query conversion module 149. 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 hybrid query module 148 may be configured to generate or otherwise provide one or more hybrid queries 150 for combining and/or executing the combination of continuous queries and scheduled database queries. For example, a continuous query (e.g., a stream) may be instantiated, and the results of a database query (e.g., on a timer) may be pushed to or otherwise included in the continuous query. Further, in some examples, a hybrid query 150 may include one or more tactical query results 152 being included in a continuous query 154. In this way, non-continuous queries (e.g., the tactical query that provides the tactical query result 152) may effectively be performed continuously. Additionally, a few examples of the operations of the hybrid query module 148 and/or the service provider computers 106 are described in greater detail below.

Additionally, in some examples, the query conversion module 149 may be configured to enable conversion of tactical queries into continuous queries. As noted above, the conversion may be performed at runtime and may enable the users 102 to view (via an interface of the user devices 104) real-time changes to historical data was previously displayed statically (e.g., in a non-active way). In some aspects, the user 102 may be able to make visualizations active at runtime while viewing the static data (e.g., from a tactical query) in a dashboard or other user interface displayed by the user devices 104 and/or provided by the service provider computers 106. The user 102, in some examples, may need to be first authenticated and authorized for access to the dashboard and/or the query conversion module 149 functionality. By default, some dashboard views may come with SQL as the query behind the business views. If a user 102 wants to turn a static view into active one, he or she may be able to utilize the query conversion module 149 (e.g., through selection of an icon or other interface element of the dashboard). The query conversion module 149 may then convert the tactical (i.e., the SQL query in this example) into a continuous query (e.g., a CQL query) and the view may be reloaded within the dashboard to handle active changes. Other functionality (e.g., filtering and/or dimension changes) may also be enabled via the dashboard. Additionally, in some examples, the user 102 may be able to active the ADS at runtime and see the active data in the concerned view (e.g., the dashboard). These changes may be specific to the user 102 and may not affect views of other users.

In some examples, when the user 102 activates the ADS at runtime, a pageDef file (or other definition file) may be updated to indicate that the active view has been activated. Additionally, a UI or other interface may provide a popup that may allow the activation of ADS using a checkbox, drop down box, etc. Internally, the query conversion module 149 may convert the tactical query to a continuous query based at least in part on the user 102 selection and/or the pageDef file. A sliding window and/or range may also be specified via the UI. As noted above, changes in a pageDef file may only be implemented for specific users 102 making the request (e.g., checking the box, etc.). As noted, activating ADS at runtime may allow users 102 to change a tactical query into a continuous query at runtime. In some examples, when a business view is rendered in a dashboard, the user 102 may be able to choose a “Make Active” option from a setting section of the UI displaying the dashboard.

Once a user 102 requests that the view become active, some options may enabled that the user 102 can use to setup the active data properties. For example, active data collapsing and/or time window functionality may be offered. The active data collapsing functionality may include, but is not limited to, allowing the user 102 to collapse the data into one or more chunks and update the data within each chunk at once (e.g., in a specified time interval). Additionally, the time window functionality may include, but is not limited to, allowing the user 102 to specify whether the user 102 wants a time window in the data or not. If so, this option may also allow the user 102 to specify the window length and an interval after which the window should be updated. Once the user 102 selects the properties, the user 102 may make a selection (e.g., selecting an “ok” icon or the like) which may setup the data and, after a refresh of the graph, the business view may be made active. In some cases, a managed Java bean, which may be associated with each business view, make take care of populating the data in a popup. It may also handle a popup close event, which may in turn invoke code to make the appropriate changes to the pageDef document of the business view. A data control (DC) layer may then pick the data from the pageDef file and make the view active.

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 illustrates a simplified block diagram 200 with which features of the hybrid execution of continuous queries and scheduled queries may be described. As noted above, in some examples, the hybrid query 150 may be executed by the hybrid query module 148 of FIG. 1 and may include one or more tactical query results 152 and/or one or more continuous queries 154. In some examples, the hybrid query 150 be performed or otherwise managed by a CQL engine 202. The CQL engine 202 may be configured to perform continuous queries (e.g., based at least in part on streaming data, event data, live data, real-time data, etc.). As such, performing the hybrid execution of a tactical query and continuous query may include, but is not limited to, executing the hybrid query 150. In some cases, the hybrid query 150 may be implemented and/or refreshed based at least in part on a schedule or other time interval.

In some aspects, a tactical query may retrieve data from a database similar to or the same as the database 112 of FIG. 1. The tactical query result 152 (i.e., data from the database 112) may then be included in the continuous query 154 (e.g., as an attribute or other value) that is set up to retrieve or otherwise collect events 204 from an event stream. In some examples, the events may be received from the streaming data source computers 110 of FIG. 1 or from other sources and/or streams. However, in some cases, the database 112 and/or the streaming events 204 may be outside or otherwise not accessible by the CQL engine 202. In this way, the CQL engine 202 may depend and/or rely on the hybrid query 150 for the final results. Additionally, in some examples, a continuous query service (also referred to as a “CQ service”) 206 may manage and/or control the CQL engine 202 and/or the hybrid query 150.

In some examples, as noted above, the hybrid query 150 may be implemented to allow a database query language to be utilized in conjunction with continuous queries 154. For example, an SQL query (i.e., a tactical query that may provide the tactical query result 152) may be utilized to get a result 152 from the database 112. This result 152 may then be utilized in a continuous query 154 to run on streaming data (i.e., the events 204). In other words, the hybrid query 150 may provide the ability to query a stream of event data 204 based at least in part on a database query. Further, the hybrid query 150 may provide the ability to run a continuous query 154 at a periodic basis.

The hybrid query 150 may also support queries that combine continuous queries with a historical BI logical query (e.g., this may be another example of a tactical query). For example, when historical KPI data is used within a continuous query model, the historical BI logical query may run with a schedule and the result may get passed to the CQL engine 202 as a stream. In some cases, implementation of the hybrid query 150 may involve a syntax that includes both CQL features and historical BI logical query (e.g., on a schedule) features. In some examples, the syntax may include the following examples:

create query <fully qualified query name > as <cql>

with <fully qualified stream name> as <historical bi logical sql>

<schedule>

Additionally, the stream name may match with the stream in a “where” clause of the continuous query. The stream name may also be fully qualified. The query may be given in the quoted string. The query may be opaque to the CQ service 206 and the CQ service 206 may not attempt to parse it. Further, a schedule syntax may be the same as the one used in the scheduled tactical query without an “expire” clause.

In some aspects, the hybrid query 150 may include three parts, the continuous part, the tactical part, and the schedule part. The following hybrid query 150 illustrates one non-limiting example which sends an alert if the average call processing time is bigger than the average call processing time from yesterday where the average call processing time is calculated every midnight.

create query CALLCENTER.callcenter4hkpi as

istream(

select avg(callProcessingTime) as measure,

avg(callProcessingTime) − max(B.prevDayCPT) as

actualDeviation,

max(B.allowedDeviation) as allowedDeviation from

CALLCENTER.CallCenterFact_DO[range 480 hour on

callClosedTime] as A,

CALLCENTER.CC4HistKPI[rows 1] as B

where callStatus = ‘CLOSED’

)

with CALLCENTER.CC4HistKPI as

“select avg(callProcessingTime) as prevDayCPT,

stddev(callProcessingTime) as allowedDeviation

from CALLCENTER.CallCenterFact_DO

where callStatus = ‘CLOSED’ AND

TIMESTAMPDIFF(SQL_TSI_DAY, callClosedTime,

CURRENT_TIMESTAMP)>0 ”

refresh on “0:0” every 1 day

With the above hybrid continuous query 150 example, the following operations may be occurring:

1. A stream, CALLCENTER.CC4HistKPI is created using a ddl, ‘create

stream CALLCENTER.CC4HistKPI(prevDayCPT double, allowedDeviatin

double)’.

2. The cql part is registered to the CQL engine as the regular cql.

3. The SQL part runs with a scheduler in the beam product following the

given schedule, ‘0:0 AM every 1 days’.

4. The result from the SQL run is pushed to the CQL engine by the beam

product as the stream.

5. The join part in the cql part handles joining between the stream and

relation.

FIG. 3 depicts a simplified flow diagram showing one or more techniques 300 for implementing the hybrid execution of continuous and scheduled queries, 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 event processor computers 302 and/or databases 304. 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 data processing requests (e.g., KPI and/or BI data) from the user devices 104. The queries and/or data requests may be configured to request processing (e.g., retrieval, storage, deletion, etc.) of database data (e.g., data stored by the databases 304) and/or streaming event data (e.g., data being received in real-time from the event processors 302). Additionally, in some examples, the service provider computers 106 may also generate a stream and/or register the stream with a continuous query engine (e.g., but not limited to, the CQL engine 202 of FIG. 2), a service (e.g., but not limited to, the CQ service 206 of FIG. 2), and/or the event processors 302. The stream may be configured to retrieve or otherwise collect real-time KPI data from the event processors 302.

In some examples, the service provider computers 106 may also provide or implement one or more tactical queries (e.g., an SQL query or the like) to retrieve historical data from the database 304 or another storage system. In some examples, the query may be provided or otherwise implemented based at least in part on a schedule. Based at least in part on the tactical query, the service provider computers 106 may receive data from the database 304. In other words, the service provider computers 106 may receive the query results. The service provider computers 106 may then include the tactical query result in the stream such that the continuous query may be processed based at least in part on that tactical query result. The service provider computers 106 may then receive data from the stream (i.e., the continuous query result) and provide the data and/or acknowledgement of processing to the user computers 104.

FIG. 4 illustrates a simplified block diagram 400 with which features of the tactical query to continuous query conversion may be described. As noted above, in some examples, an active data service (ADS) 402 may be executed by the query conversion module 149 of FIG. 1 and may include one or more programming layers (also referred to as modules). The implementation of these features (i.e., the layers and/or the options noted above), may be managed by the DC layer 404. In some examples, the DC layer 404 maybe a binding component of an application development framework (ADF) and may be authored in a JDev Environment. The DC layer 404 may be created at DT@RT and may be equipped with a mechanism to change queries dynamically and re-construct the binding definition on the fly to support run time slice and dice. Furthermore, it may also be the conduit to convert a tactical query to a continuous query. In some cases, personalization may be applied so each instance of the dashboard can support its own slice and dice.

The DC layer 404 may be configured to pick up the values form the pageDef of the business view. The DC layer 404 may also get access of the pageDef of the business view to which it is bound to through the ADF context. It may then make changes to an in-memory modifier 405 and set it up to the next later to fetch the data and return it to the business view. The ADS 402 may also include a UI layer 406, a Meta Data Service 408, a Report Cache layer 410, and/or a Common Query layer 412. The UI layer 406 may provide options to the user 102 for setting up new filters. The UI layer 406 may also capture the information provided by the user 102 and set it up in the metadata files in an appropriate format that can be understood by the next layer. The Meta Data Service layer 408 may be configured to allow the update of the underlying pageDef of the business views to be updated and the values captured from the UI layer 406. Once these changes are made, a request may be ordered which may allow this information to be passed to the next layer for processing. In some examples, the Report Cache layer 410 may listen to the DC layer 404 to get the appropriate modifiers and returns back the actual data 414 after fetching it using the Common Query layer 412.

In some examples, a user 102 may input data 414 to the UI layer 406. This data 414 may be properly structured into information that is requested to be passed on the information to the Data Control layer 404 through the pageDef files of business view. The DC layer 404, through the ADF context, may get this the handle of the pageDef to which it is bound and, and may also get the requested information. For applying filters, a Filter node may be added to the pageDef file which depicts the information gathered from the user. A sample follows:

<Filter xmlns=“http://www.beam.com/datacontrol/personalization”>

<Branch name=“Root” type=“ALL”>

<Branch type=“ANY”>

<Entry type=“EQ”>

<Node type=“COLUMN”>_COMPONENTNAME</Node>

<Node type=“STRING”>ABC</Node>

</Entry>

<Entry type=“EQ”>

<Node type=“COLUMN”>_DEPARTMENT</Node>

<Node type=“STRING”>xyz</Node>

</Entry>

</Branch>

<Branch type=“ANY”>

<Entry type=“EQ”>

<Node type=“COLUMN”>_DEPARTMENT</Node>

<Node type=“STRING”>xyz</Node>

</Entry>

</Branch>

</Branch>

</Filter>

In some examples, this node may not be part of the pageDef of a view in ADF. Thus, in order for it to fit into an extensible markup language (XML) file, the user of a custom namespace be implemented (e.g., highlighted in the node above). This node may then be picked up by the DC layer 404 and set in the in-memory modifier 405 to depict the changes done by the user 102 on top of the modifier that already existed for that query in the business view. When this modifier gets sent to the report cache layer 410 to return the actual data 414 back to the DC layer 404, which may in turn return the data to the UI layer 406.

Similarly, for making group changes, and making views active, the XML of a pageDef may be modified with values of new groups and a “ChangeEventPolicy” attribute may be set to “push,” which may look as follows:

However, this node may not be a part of the ADF framework either. As such, in some examples, it may be used as it is with changes in the group's node to depict the change in the groups done by the user 102 in the UI layer 406. Then a similar approach may be followed to return the data 414 to the UI layer 406 from the DC layer 404. Additionally, in some examples, setting up the active data properties may include the following XML node used in the pageDef file:

Again, this node may not be part of the ADF framework. As such, a custom namespace may be utilized. Additionally, when the slice and dice feature changes the groups it may be internally changing the shape of the query. The structure definition inside the DC layer 404 may be based at least in part on the shape of the query. At the time the DC layer 404 gets access to the pageDef, the structure definition may already be created to the original query, so the DC layer 404 may request to modify the query definition in memory to match the new groups and also recreate dynamically the new structure definition that is expected to be bound to the pageDef that will be accessing/using this instance of the DC layer 404. Then, when the DC layer 404 opens a view on the RC layer 410, it may also use the new query definition that was modified in memory at 405. In some examples, this may ensure that the layers of the ADS 402 will be in sync.

In some examples, when a filter is applied it may change the query definition but not the shape of the query, consequently the structure definition may not change. The filter may change only the query definition in memory where a “where clause” and “parameters” of the query may change. This may get propagated to the RC layer 410 as well. If the DC layer 404 already has a view open with the previous query definition it may request the RC layer 410 to close the old view with the old query definition and open a new view on the RC layer 410 with the new query definition. Additionally, when the attribute “ChangeEventPolicy” is set to “push,” the DC layer 404 may read the ActiveDataProperties node to create an appropriate ViewSetBuilder with the window extension values that is expected by the RC layer 410 when an active data push view is created. At this point the DC layer 404 may close the old tactical view on the RC layer 410 and may create a new active data definition to open a new view on the RC layer 410. After opening the new view on the RC layer 410, the DC layer 404 may register an active data listener onto the RC layer 410 for receiving delta changes. Once the RC layer 410 starts to push data in to the DC listener, the DC layer 404 may start to push data to ADF layer as well.

Further, personalization features may be implemented using a Meta Data Service (MDS) framework. A filter may be setup in a web.xml file of the application before the adfBindings filter. This filter may set up the SessionOptionsFactory which, on every page request (or a subset of the page requests), returns the customization layer which is currently active at that moment. Also at any moment a site layer may be active, but for the personalization feature the user layer may be dynamically made active. For this, an option (ModeContext) may be maintained which tells the SessionOptionsFactory that the user layer may be made active or not. Once the proper layers in the MDS framework are made active then the changes related to filters, groups and active data may be made to the pageDef files of business views which are specific for each user and whenever that pageDef is requested then the right one may be returned to the UI layer 406 and also to DC layer 404 to allow this personalization feature to work.

FIGS. 5-7 illustrate example flow diagrams showing respective processes 500, 600, and 700 for implementing the hybrid execution of continuous and scheduled queries described herein. These processes 500, 600, 700 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 hybrid query module 148 of FIG. 1 and/or the continuous query service 206 of FIG. 2) shown in FIGS. 1-3 may perform the process 500 of FIG. 5. The process 500 may begin by including initializing a query engine with relational data from a first source at 502. In some examples, the first source may be a database (e.g., a relational database). At 504, the process 500 may end by enabling the query engine to provide query results based at least in part on the relational data and streaming data from a second source. The second source may be an event processor or other computing system capable of providing real-time and/or streaming data (e.g., complex events, KPI data, etc.).

FIG. 6 illustrates an example flow diagram showing process 600 for implementing the hybrid execution of continuous and scheduled queries described herein. The one or more service provider computers 106 (e.g., utilizing at least one of the hybrid query module 148 of FIG. 1 and/or the continuous query service 206 of FIG. 2) shown in FIGS. 1-3 may perform the process 600 of FIG. 6. The process 600 may begin at 602 by including generating a stream associated with a first source at 602. In some examples, the first source may be configured as a complex event processing engine or other event stream. At 604, the process 600 may include receiving a first query result from a second source. The second source may be configured as a database or other storage system (e.g., a relational database or the like). As such, the first query result may be received based at least in part on implementation of a tactical query. At 606, the process 600 may also include including (or providing) the first query result from the second source into the stream generated at 602. The process 600 may then end, at 608, by including providing a second query result based at least in part on the generated stream and the first query result. In other words, the second query result may be based on the inclusion of the first query result into the stream. This second query result may be provided to a user (e.g., via a user interface), to a processing engine, and/or to a service provider configured to monitor, alert, and/or provide information associated with business events or the like.

FIG. 7 illustrates an example flow diagram showing process 700 for implementing the hybrid execution of continuous and scheduled queries described herein. The one or more service provider computers 106 (e.g., utilizing at least one of the hybrid query module 148 of FIG. 1 and/or the continuous query service 206 of FIG. 2) shown in FIGS. 1-3 may perform the process 700 of FIG. 7. The process 700 may begin by including generating a stream associated with an event processor (e.g., a complex event processor or the like) at 702. At 704, the process 700 may include registering the generated stream with a query engine (e.g., the CQL engine 702 of FIG. 2). The process 700 may also include providing a first query based at least in part on a schedule to a data source at 706. The data source may be a relational database or other storage system capable of providing historical data in response to queries. At 708, the process 700 may include receiving a first query result from the data source based at least in part on the first query provided. Additionally, in some examples, the process 700 may include including the first query result from the data source in the registered stream at 710. At 712, the process 700 may end by including providing a second query result based at least in part on the registered stream and the first query result. In other words, and as noted above, the second query result may be based at least in part on a combination of the scheduled tactical query and the continuous query (i.e., instantiated by a stream).

FIGS. 8-10 illustrate example flow diagrams showing respective processes 800, 900, and 1000 for implementing the tactical query to continuous query conversion described herein. These processes 800, 900, 1000 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.

In some examples, the one or more service provider computers 106 (e.g., utilizing at least one of the query conversion module 149 of FIG. 1 and/or the active data service 402 of FIG. 4) shown in FIGS. 1-4 may perform the process 800 of FIG. 8. The process 800 may begin by including configuring a query engine with a tactical query at 802. In some examples, the tactical query may be configured to pull data on behalf of the query engine. In other examples, the tactical query may be configured to enabling receipt of pulled data. At 804, the process 800 may end by including enabling conversion of a tactical query to a continuous query. In some examples, the conversion may be enabled at runtime. Additionally, in some aspects, the conversion may include at least configuring a listening service to receive data pushed from the continuous query or by the continuous query. Further, the continuous query may, instead, configure the data to be pushed from a stream to the listening service and/or the query engine.

FIG. 9 illustrates an example flow diagram showing process 900 for implementing the tactical query to continuous query conversion described herein. The one or more service provider computers 106 (e.g., utilizing at least one of the query conversion module 149 of FIG. 1 and/or the active data service 402 of FIG. 4) shown in FIGS. 1-4 may perform the process 900 of FIG. 9. The process 900 may begin at 902 by including determining a tactical query for querying business event data of a user from a database. At 904, the process 900 may include converting the tactical query to a continuous query configured to enable pushing of streaming business event data of the user to a query engine. Further, at 906, the process 900 may end by including providing a user interface configured to display the active visualization based at least in part on data pushed to the query engine.

FIG. 10 illustrates an example flow diagram showing process 1000 for implementing the tactical query to continuous query conversion described herein. The one or more service provider computers 106 (e.g., utilizing at least one of the query conversion module 149 of FIG. 1 and/or the active data service 402 of FIG. 4) shown in FIGS. 1-4 may perform the process 1000 of FIG. 10. The process 1000 may begin by including determining a tactical query configured to enable pulling business event data from a database to a query engine at 1002. The determination may be based at least in part on a query received from a user. At 1004, the process 1000 may include receiving a request associated with generating an active visualization of the data. The process 1000 may also convert the tactical query into a continuous query at 1006. The conversion may take place at runtime. At 1008, the process 1000 may include registering a listening service to receive pushed data (e.g., from a stream). At 1010, the process 1000 may receive a request to apply a filter to or change dimension of the continuous query (e.g., at runtime). Further, the process 1000 may end at 1012, where the process 1000 may include providing a UI configured to display the active visualization of the pushed data.

Illustrative methods and systems for implementing the hybrid execution of continuous and scheduled queries 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-10 above.

FIG. 11 is a simplified block diagram illustrating components of a system environment 1100 that may be used in accordance with an embodiment of the present disclosure. As shown, system environment 1100 includes one or more client computing devices 1102, 1104, 1106, 1108, 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 1110 (such as, but not limited to, networks similar to the networks 108 of FIGS. 1 and 3). In various embodiments, client computing devices 1102, 1104, 1106, and 1108 may interact with a server 1112 over the networks 1110.

Client computing devices 1102, 1104, 1106, 1108 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 1102, 1104, 1106, and 1108 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 1110 described below). Although exemplary system environment 1100 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 1112.

System environment 1100 may include networks 1110. Networks 1110 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 1110 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 1100 also includes one or more server computers 1112 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 1112 may be adapted to run one or more services or software applications described in the foregoing disclosure. For example, server 1112 may correspond to a server for performing processing described above according to an embodiment of the present disclosure.

Server 1112 may run an operating system including any of those discussed above, as well as any commercially available server operating system. Server 1112 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 1100 may also include one or more databases 1114, 1116. Databases 1114, 1116 may reside in a variety of locations. By way of example, one or more of databases 1114, 1116 may reside on a non-transitory storage medium local to (and/or resident in) server 1112. Alternatively, databases 1114, 1116 may be remote from server 1112, and in communication with server 1112 via a network-based or dedicated connection. In one set of embodiments, databases 1114, 1116 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 1112 may be stored locally on server 1112 and/or remotely, as appropriate. In one set of embodiments, databases 1114, 1116 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. 12 is a simplified block diagram of a computer system 1200 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 1200. Computer system 1200 is shown comprising hardware elements that may be electrically and/or communicatively coupled via a bus 1201. The hardware elements may include one or more central processing units (CPUs) 1202, one or more input devices 1204 (e.g., a mouse, a keyboard, etc.), and one or more output devices 1206 (e.g., a display device, a printer, etc.). Computer system 1200 may also include one or more storage devices 1208. By way of example, the storage device(s) 1208 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 1200 may additionally include a computer-readable storage media reader 1212, a communications subsystem 1214 (e.g., a modem, a network card (wireless or wired), an infra-red communication device, etc.), and working memory 1218, which may include RAM and ROM devices as described above. In some embodiments, computer system 1200 may also include a processing acceleration unit 1216, which can include a digital signal processor (DSP), a special-purpose processor, and/or the like.

Computer-readable storage media reader 1212 can further be connected to a computer-readable storage medium 1210, together (and, optionally, in combination with storage device(s) 1208) 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 1214 may permit data to be exchanged with network 1212 and/or any other computer described above with respect to system environment 1200.

Computer system 1200 may also comprise software elements, shown as being currently located within working memory 1218, including an operating system 1220 and/or other code 1222, such as an application program (which may be a client application, Web browser, mid-tier application, RDBMS, etc.). In an exemplary embodiment, working memory 1218 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 1200 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-12 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: execute a hybrid query for combining a continuous query and a scheduled database query, the hybrid query refreshed based at least in part on a schedule or a time interval;generate a stream associated with an event processor configured to provide real-time data;initialize a query engine with relational data from at least a second source;identify the continuous query for querying the generated stream;provide a tactical query to the second source that comprises a relational database, the tactical query configured to pull data elements from the second source based at least in part on a timer;receive, from the second source, a relational query result based at least in part on the tactical query, the tactical query being provided to a scheduler of the relational database, and the scheduler configured to perform the tactical query on the relational database based at least in part on the schedule;include the relational data from the second source in the generated stream by automatically pushing the relational data to the continuous query configured to query the generated stream;enable the query engine to provide a continuous query result based at least in part on an event of the generated stream received by the query engine, the event from a plurality of events of the generated stream including streaming events from the event processor and the relational data; andprovide a user interface configured to display an active visualization based at least in part on data pushed to the query engine.
2. The system of claim 1, wherein the streaming data from at least the first source includes the real-time data provided by the event processor.
3. The system of claim 1, wherein enabling the query engine to provide the continuous query result includes at least joining the relational data and the streaming data.
4. The system of claim 1, wherein enabling the query engine to provide the continuous query result includes at least providing a second query that includes the relational data to a continuous query language engine.
5. The system of claim 4, wherein enabling the query engine to provide the continuous query result includes at least receiving the continuous query result from the continuous query language engine based at least in part on the provided second query that includes the relational data.
6. 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 execute a hybrid query for combining a continuous query and a scheduled database query, the hybrid query refreshed based at least in part on a schedule or a time interval;instructions that cause the one or more processors to generate a stream associated with a complex event processor configured to provide real-time data;instructions that cause the one or more processors to register the generated stream with a query engine;instructions that cause the one or more processors to receive, by the query engine, a relational query result from a data source;instructions that cause the one or more processors to identify the continuous query for querying the generated stream;instructions that cause the one or more processors to provide a tactical query configured to pull data elements from the data source based at least in part on a timer, the data source comprising a relational database;instructions that cause the one or more processors to receive, from the data source, a relational query result based at least in part on the tactical query, the tactical query being provided to a scheduler of the relational database, and the scheduler configured to perform the tactical query on the relational database based at least in part on the schedule;instructions that cause the one or more processors to include the relational query result from the second source in the generated stream by automatically pushing the relational query result to the continuous query configured to query the generated stream;instructions that cause the one or more processors to provide a continuous query result based at least in part on an event of the generated stream received by the query engine, the event from a plurality of events of the generated stream including streaming events from the complex event processor and the relational query result; andinstructions that cause the one or more processors to provide a user interface configured to display an active visualization based at least in part on data pushed to the query engine.
7. The computer-readable memory of claim 6, wherein the stream is generated based at least in part on a data definition language.
8. The computer-readable memory of claim 6, wherein the stream is configured to operate with an event processing engine corresponding to the complex event processor.
9. The computer-readable memory of claim 6, wherein the relational query result is received based at least in part on a schedule.
10. The computer-readable memory of claim 6, wherein including the relational query result from the data source in the generated stream includes at least generating the stream to include an identifier associated with the relational query result.
11. A computer-implemented method, comprising: executing a hybrid query for combining a continuous query and a scheduled database query, the hybrid query refreshed based at least in part on a schedule or a time interval;generating, by a computing system, a stream associated with an event processor configured to provide real-time data;registering, by the computing system, the generated stream with a query engine;identifying the continuous query for querying the registered stream;providing, to a data source that comprises a relational database, a tactical query configured to pull data elements from the data source based at least in part on a timer;receiving, from the data source, a relational query result based at least in part on the tactical query, the tactical query being provided to a scheduler of the relational database, and the scheduler configured to perform the tactical query on the relational database based at least in part on the schedule;including, by the computing system, the relational query result from the data source in the registered stream by automatically pushing the relational query result to the continuous query configured to query the registered stream;providing, by the computing system, a continuous query result based at least in part on an event of the generated stream received by the query engine, the event from a plurality of events of the generated stream including streaming events from the event processor and the relational query result; andproviding a user interface configured to display an active visualization based at least in part on data pushed to the query engine.
12. The computer-implemented method of 11, wherein the query engine is configured based at least in part on a continuous query language.
13. The computer-implemented method of claim 11, wherein the relational database includes at least historical performance indicators.
14. The computer-implemented method of claim 11, wherein including the relational query result from the data source in the registered stream includes at least generating the stream to include an identifier associated with the relational query result.

CROSS REFERENCES TO RELATED APPLICATIONS

The present application is a non-provisional of and claims the benefit and priority under 35 U.S.C. 119(e) of U.S. Provisional Application No. 61/707,641 filed Sep. 28, 2012 entitled REAL-TIME BUSINESS EVENT ANALYSIS AND MONITORING, the entire contents of which are incorporated herein by reference for all purposes. This application is also related to application Ser. No. 13/827,987, filed on the same day herewith, entitled “TACTICAL QUERY TO CONTINUOUS QUERY CONVERSION,” the entire contents of which is hereby incorporated by reference as if fully set forth herein, under 35 U.S.C. §120

US Referenced Citations (461)

Number	Name	Date	Kind
4996687	Hess et al.	Feb 1991	A
5051947	Messenger et al.	Sep 1991	A
5339392	Risberg et al.	Aug 1994	A
5495600	Terry et al.	Feb 1996	A
5706494	Cochrane et al.	Jan 1998	A
5802262	Van De Vanter	Sep 1998	A
5802523	Jasuja et al.	Sep 1998	A
5822750	Jou et al.	Oct 1998	A
5826077	Blakeley et al.	Oct 1998	A
5850544	Parvathaneny et al.	Dec 1998	A
5857182	DeMichiel et al.	Jan 1999	A
5918225	White et al.	Jun 1999	A
5920716	Johnson et al.	Jul 1999	A
5937195	Ju et al.	Aug 1999	A
5937401	Hillegas et al.	Aug 1999	A
6006235	Macdonald et al.	Dec 1999	A
6011916	Moore et al.	Jan 2000	A
6041344	Bodamer et al.	Mar 2000	A
6081801	Cochrane et al.	Jun 2000	A
6092065	Floratos et al.	Jul 2000	A
6108666	Floratos et al.	Aug 2000	A
6112198	Lohman et al.	Aug 2000	A
6128610	Srinivasan et al.	Oct 2000	A
6158045	You	Dec 2000	A
6212673	House et al.	Apr 2001	B1
6219660	Haderle et al.	Apr 2001	B1
6263332	Nasr et al.	Jul 2001	B1
6278994	Fuh et al.	Aug 2001	B1
6282537	Madnick et al.	Aug 2001	B1
6341281	MacNicol et al.	Jan 2002	B1
6353821	Gray et al.	Mar 2002	B1
6367034	Novik et al.	Apr 2002	B1
6370537	Gilbert et al.	Apr 2002	B1
6389436	Chakrabarti et al.	May 2002	B1
6397262	Hayden et al.	May 2002	B1
6418448	Sarkar	Jul 2002	B1
6438540	Nasr et al.	Aug 2002	B2
6438559	White et al.	Aug 2002	B1
6439783	Antoshenkov	Aug 2002	B1
6449620	Draper et al.	Sep 2002	B1
6453314	Chan et al.	Sep 2002	B1
6507834	Kabra et al.	Jan 2003	B1
6523102	Dye et al.	Feb 2003	B1
6546381	Subramanian et al.	Apr 2003	B1
6615203	Lin et al.	Sep 2003	B1
6681343	Nakabo	Jan 2004	B1
6708186	Claborn et al.	Mar 2004	B1
6718278	Steggles	Apr 2004	B1
6748386	Li	Jun 2004	B1
6751619	Rowstron et al.	Jun 2004	B1
6766330	Chen et al.	Jul 2004	B1
6785677	Fritchman	Aug 2004	B1
6826566	Lewak et al.	Nov 2004	B2
6836778	Manikutty et al.	Dec 2004	B2
6850925	Chaudhuri et al.	Feb 2005	B2
6856981	Wyschogrod et al.	Feb 2005	B2
6985904	Kaluskar et al.	Jan 2006	B1
6996557	Leung et al.	Feb 2006	B1
7020696	Perry et al.	Mar 2006	B1
7047249	Vincent	May 2006	B1
7051034	Ghosh et al.	May 2006	B1
7062749	Cyr et al.	Jun 2006	B2
7080062	Leung et al.	Jul 2006	B1
7093023	Lockwood et al.	Aug 2006	B2
7145938	Takeuchi et al.	Dec 2006	B2
7146352	Brundage et al.	Dec 2006	B2
7167848	Boukouvalas et al.	Jan 2007	B2
7203927	Al-Azzawe et al.	Apr 2007	B2
7224185	Campbell et al.	May 2007	B2
7225188	Gai et al.	May 2007	B1
7236972	Lewak et al.	Jun 2007	B2
7305391	Wyschogrod et al.	Dec 2007	B2
7308561	Cornet et al.	Dec 2007	B2
7310638	Blair	Dec 2007	B1
7376656	Blakeley et al.	May 2008	B2
7383253	Tsimelzon et al.	Jun 2008	B1
7403959	Nishizawa et al.	Jul 2008	B2
7430549	Zane et al.	Sep 2008	B2
7451143	Sharangpani et al.	Nov 2008	B2
7475058	Kakivaya et al.	Jan 2009	B2
7483976	Ross	Jan 2009	B2
7516121	Liu et al.	Apr 2009	B2
7519577	Brundage et al.	Apr 2009	B2
7533087	Liu et al.	May 2009	B2
7546284	Martinez et al.	Jun 2009	B1
7552365	Marsh et al.	Jun 2009	B1
7567953	Kadayam et al.	Jul 2009	B2
7580946	Mansour et al.	Aug 2009	B2
7587383	Koo et al.	Sep 2009	B2
7603674	Cyr et al.	Oct 2009	B2
7613848	Amini et al.	Nov 2009	B2
7620851	Leavy et al.	Nov 2009	B1
7630982	Boyce et al.	Dec 2009	B2
7634501	Yabloko	Dec 2009	B2
7636703	Taylor	Dec 2009	B2
7644066	Krishnaprasad et al.	Jan 2010	B2
7653645	Stokes	Jan 2010	B1
7672964	Yan et al.	Mar 2010	B1
7673065	Srinivasan et al.	Mar 2010	B2
7676461	Chkodrov et al.	Mar 2010	B2
7689622	Liu et al.	Mar 2010	B2
7693891	Stokes et al.	Apr 2010	B2
7702629	Cytron et al.	Apr 2010	B2
7702639	Stanley et al.	Apr 2010	B2
7711782	Kim et al.	May 2010	B2
7716210	Ozcan et al.	May 2010	B2
7739265	Jain et al.	Jun 2010	B2
7805445	Boyer et al.	Sep 2010	B2
7814111	Levin	Oct 2010	B2
7818313	Tsimelzon	Oct 2010	B1
7823066	Kuramura	Oct 2010	B1
7827146	De Landstheer et al.	Nov 2010	B1
7827190	Pandya	Nov 2010	B2
7844829	Meenakshisundaram	Nov 2010	B2
7870124	Liu et al.	Jan 2011	B2
7877381	Ewen et al.	Jan 2011	B2
7895187	Bowman	Feb 2011	B2
7912853	Agrawal	Mar 2011	B2
7917299	Buhler et al.	Mar 2011	B2
7930322	Maclennan	Apr 2011	B2
7945540	Park et al.	May 2011	B2
7953728	Hu et al.	May 2011	B2
7954109	Durham et al.	May 2011	B1
7979420	Jain et al.	Jul 2011	B2
7987204	Stokes	Jul 2011	B2
7988817	Son	Aug 2011	B2
7991766	Srinivasan et al.	Aug 2011	B2
7996388	Jain et al.	Aug 2011	B2
8019747	Srinivasan et al.	Sep 2011	B2
8032544	Jing et al.	Oct 2011	B2
8046747	Cyr et al.	Oct 2011	B2
8073826	Srinivasan et al.	Dec 2011	B2
8099400	Haub et al.	Jan 2012	B2
8103655	Srinivasan et al.	Jan 2012	B2
8122006	de Castro Alves et al.	Feb 2012	B2
8134184	Becker et al.	Mar 2012	B2
8145859	Park et al.	Mar 2012	B2
8155880	Patel et al.	Apr 2012	B2
8195648	Zabback et al.	Jun 2012	B2
8204873	Chavan	Jun 2012	B2
8204875	Srinivasan et al.	Jun 2012	B2
8260803	Hsu et al.	Sep 2012	B2
8290776	Moriwaki et al.	Oct 2012	B2
8296316	Jain et al.	Oct 2012	B2
8307343	Chaudhuri et al.	Nov 2012	B2
8315990	Barga et al.	Nov 2012	B2
8316012	Abouzied et al.	Nov 2012	B2
8321450	Thatte et al.	Nov 2012	B2
8346511	Schoning et al.	Jan 2013	B2
8352517	Park et al.	Jan 2013	B2
8370812	Feblowitz et al.	Feb 2013	B2
8386466	Park et al.	Feb 2013	B2
8387076	Thatte et al.	Feb 2013	B2
8392402	Mihaila et al.	Mar 2013	B2
8396886	Tsimelzon	Mar 2013	B1
8447744	De Castro Alves et al.	May 2013	B2
8458175	Stokes	Jun 2013	B2
8498956	Srinivasan et al.	Jul 2013	B2
8521867	Srinivasan et al.	Aug 2013	B2
8527458	Park et al.	Sep 2013	B2
8543558	Srinivasan et al.	Sep 2013	B2
8572589	Cataldo et al.	Oct 2013	B2
8589436	Srinivasan et al.	Nov 2013	B2
8676841	Srinivasan et al.	Mar 2014	B2
8713049	Jain et al.	Apr 2014	B2
8719207	Ratnam et al.	May 2014	B2
8745070	Krishnamurthy et al.	Jun 2014	B2
8762369	Macho et al.	Jun 2014	B2
8775412	Day et al.	Jul 2014	B2
9058360	De Castro Alves et al.	Jun 2015	B2
9098587	Deshmukh et al.	Aug 2015	B2
9110945	Jain	Aug 2015	B2
9189280	Park et al.	Nov 2015	B2
20020023211	Roth et al.	Feb 2002	A1
20020032804	Hunt	Mar 2002	A1
20020038313	Klein et al.	Mar 2002	A1
20020049788	Lipkin	Apr 2002	A1
20020056004	Smith et al.	May 2002	A1
20020073399	Golden	Jun 2002	A1
20020116362	Li et al.	Aug 2002	A1
20020116371	Dodds et al.	Aug 2002	A1
20020133484	Chau et al.	Sep 2002	A1
20020169788	Lee et al.	Nov 2002	A1
20030014408	Robertson	Jan 2003	A1
20030037048	Kabra et al.	Feb 2003	A1
20030046673	Copeland et al.	Mar 2003	A1
20030065655	Syeda-mahmood	Apr 2003	A1
20030065659	Agarwal et al.	Apr 2003	A1
20030120682	Bestgen et al.	Jun 2003	A1
20030135304	Sroub et al.	Jul 2003	A1
20030200198	Chandrasekar et al.	Oct 2003	A1
20030229652	Bakalash et al.	Dec 2003	A1
20030236766	Fortuna et al.	Dec 2003	A1
20040010496	Behrendt et al.	Jan 2004	A1
20040019592	Crabtree	Jan 2004	A1
20040024773	Stoffel et al.	Feb 2004	A1
20040064466	Manikutty et al.	Apr 2004	A1
20040073534	Robson	Apr 2004	A1
20040088404	Aggarwal	May 2004	A1
20040117359	Snodgrass et al.	Jun 2004	A1
20040136598	Le Leannec et al.	Jul 2004	A1
20040151382	Stellenberg et al.	Aug 2004	A1
20040153329	Casati et al.	Aug 2004	A1
20040167864	Wang et al.	Aug 2004	A1
20040168107	Sharp et al.	Aug 2004	A1
20040177053	Donoho et al.	Sep 2004	A1
20040201612	Hild et al.	Oct 2004	A1
20040205082	Fontoura et al.	Oct 2004	A1
20040220896	Finlay et al.	Nov 2004	A1
20040220912	Manikutty et al.	Nov 2004	A1
20040220927	Murthy et al.	Nov 2004	A1
20040243590	Gu et al.	Dec 2004	A1
20040267760	Brundage et al.	Dec 2004	A1
20040268314	Kollman et al.	Dec 2004	A1
20050010896	Meliksetian et al.	Jan 2005	A1
20050055338	Warner et al.	Mar 2005	A1
20050065949	Warner et al.	Mar 2005	A1
20050096124	Stronach	May 2005	A1
20050097128	Ryan et al.	May 2005	A1
20050120016	Midgley	Jun 2005	A1
20050154740	Day et al.	Jul 2005	A1
20050174940	Iny	Aug 2005	A1
20050177579	Blakeley et al.	Aug 2005	A1
20050192921	Chaudhuri et al.	Sep 2005	A1
20050204340	Ruminer et al.	Sep 2005	A1
20050229158	Thusoo et al.	Oct 2005	A1
20050273352	Moffat et al.	Dec 2005	A1
20050273450	McMillen et al.	Dec 2005	A1
20050289125	Liu et al.	Dec 2005	A1
20060007308	Ide et al.	Jan 2006	A1
20060015482	Beyer et al.	Jan 2006	A1
20060031204	Liu et al.	Feb 2006	A1
20060047696	Larson et al.	Mar 2006	A1
20060064487	Ross	Mar 2006	A1
20060080646	Aman	Apr 2006	A1
20060085592	Ganguly et al.	Apr 2006	A1
20060089939	Broda et al.	Apr 2006	A1
20060100957	Buttler et al.	May 2006	A1
20060100969	Wang et al.	May 2006	A1
20060106786	Day et al.	May 2006	A1
20060106797	Srinivasa et al.	May 2006	A1
20060129554	Suyama et al.	Jun 2006	A1
20060147020	Castillo et al.	Jul 2006	A1
20060155719	Mihaeli et al.	Jul 2006	A1
20060167704	Nicholls et al.	Jul 2006	A1
20060167856	Angele et al.	Jul 2006	A1
20060212441	Tang et al.	Sep 2006	A1
20060224576	Liu et al.	Oct 2006	A1
20060230029	Yan	Oct 2006	A1
20060235840	Manikutty et al.	Oct 2006	A1
20060242180	Graf et al.	Oct 2006	A1
20060282429	Hernandez-Sherrington et al.	Dec 2006	A1
20060294095	Berk et al.	Dec 2006	A1
20070016467	John et al.	Jan 2007	A1
20070022092	Nishizawa et al.	Jan 2007	A1
20070039049	Kupferman et al.	Feb 2007	A1
20070050340	Von Kaenel et al.	Mar 2007	A1
20070076314	Rigney	Apr 2007	A1
20070118600	Arora	May 2007	A1
20070136239	Lee et al.	Jun 2007	A1
20070136254	Choi et al.	Jun 2007	A1
20070156787	MacGregor	Jul 2007	A1
20070156964	Sistla	Jul 2007	A1
20070192301	Posner	Aug 2007	A1
20070198479	Cai et al.	Aug 2007	A1
20070214171	Behnen	Sep 2007	A1
20070226188	Johnson et al.	Sep 2007	A1
20070226239	Johnson et al.	Sep 2007	A1
20070271280	Chandasekaran	Nov 2007	A1
20070294217	Chen et al.	Dec 2007	A1
20080005093	Liu et al.	Jan 2008	A1
20080010093	LaPlante et al.	Jan 2008	A1
20080010241	Mcgoveran	Jan 2008	A1
20080010335	Wyler	Jan 2008	A1
20080016095	Bhatnagar et al.	Jan 2008	A1
20080028095	Lang et al.	Jan 2008	A1
20080033914	Cherniack et al.	Feb 2008	A1
20080034427	Cadambi et al.	Feb 2008	A1
20080046401	Lee et al.	Feb 2008	A1
20080071904	Schuba et al.	Mar 2008	A1
20080077570	Tang et al.	Mar 2008	A1
20080077587	Wyschogrod et al.	Mar 2008	A1
20080077780	Zingher	Mar 2008	A1
20080082484	Averbuch et al.	Apr 2008	A1
20080082514	Khorlin et al.	Apr 2008	A1
20080086321	Walton	Apr 2008	A1
20080098359	Ivanov et al.	Apr 2008	A1
20080110397	Son	May 2008	A1
20080114787	Kashiyama et al.	May 2008	A1
20080120283	Liu et al.	May 2008	A1
20080120321	Liu et al.	May 2008	A1
20080162583	Brown et al.	Jul 2008	A1
20080195577	Fan et al.	Aug 2008	A1
20080235298	Lin et al.	Sep 2008	A1
20080243451	Feblowitz et al.	Oct 2008	A1
20080243675	Parsons et al.	Oct 2008	A1
20080250073	Nori et al.	Oct 2008	A1
20080255847	Moriwaki et al.	Oct 2008	A1
20080263039	Van Lunteren	Oct 2008	A1
20080270764	McMillen et al.	Oct 2008	A1
20080281782	Agrawal	Nov 2008	A1
20080301124	Alves et al.	Dec 2008	A1
20080301125	Alves et al.	Dec 2008	A1
20080301135	Alves et al.	Dec 2008	A1
20080301256	Mcwilliams et al.	Dec 2008	A1
20080313131	Friedman et al.	Dec 2008	A1
20090006320	Ding et al.	Jan 2009	A1
20090006346	C N et al.	Jan 2009	A1
20090007098	Chevrette et al.	Jan 2009	A1
20090019045	Amir et al.	Jan 2009	A1
20090024622	Chkodrov et al.	Jan 2009	A1
20090043729	Liu et al.	Feb 2009	A1
20090070355	Cadarette et al.	Mar 2009	A1
20090070785	Alvez et al.	Mar 2009	A1
20090070786	Alves et al.	Mar 2009	A1
20090076899	Gbodimowo	Mar 2009	A1
20090088962	Jones	Apr 2009	A1
20090100029	Jain et al.	Apr 2009	A1
20090106189	Jain et al.	Apr 2009	A1
20090106190	Srinivasan et al.	Apr 2009	A1
20090106198	Srinivasan et al.	Apr 2009	A1
20090106214	Jain et al.	Apr 2009	A1
20090106215	Jain et al.	Apr 2009	A1
20090106218	Srinivasan et al.	Apr 2009	A1
20090106321	Das et al.	Apr 2009	A1
20090106440	Srinivasan et al.	Apr 2009	A1
20090112802	Srinivasan et al.	Apr 2009	A1
20090112803	Srinivasan et al.	Apr 2009	A1
20090112853	Nishizawa et al.	Apr 2009	A1
20090125550	Barga et al.	May 2009	A1
20090125916	Lu et al.	May 2009	A1
20090132503	Sun	May 2009	A1
20090133041	Rahman et al.	May 2009	A1
20090144696	Andersen	Jun 2009	A1
20090172014	Huetter	Jul 2009	A1
20090182779	Johnson	Jul 2009	A1
20090187584	Johnson et al.	Jul 2009	A1
20090216747	Li et al.	Aug 2009	A1
20090216860	Li et al.	Aug 2009	A1
20090222730	Wixson et al.	Sep 2009	A1
20090228431	Dunagan et al.	Sep 2009	A1
20090228434	Krishnamurthy et al.	Sep 2009	A1
20090245236	Scott et al.	Oct 2009	A1
20090248749	Gu et al.	Oct 2009	A1
20090254522	Chaudhuri et al.	Oct 2009	A1
20090257314	Davis et al.	Oct 2009	A1
20090265324	Mordvinov et al.	Oct 2009	A1
20090271529	Kashiyama et al.	Oct 2009	A1
20090282021	Bennett et al.	Nov 2009	A1
20090293046	Cheriton	Nov 2009	A1
20090300093	Griffiths et al.	Dec 2009	A1
20090300181	Marques	Dec 2009	A1
20090300580	Heyhoe et al.	Dec 2009	A1
20090300615	Andrade et al.	Dec 2009	A1
20090313198	Kudo et al.	Dec 2009	A1
20090319501	Goldstein et al.	Dec 2009	A1
20090327102	Maniar et al.	Dec 2009	A1
20090327257	Abouzeid et al.	Dec 2009	A1
20100017379	Naibo et al.	Jan 2010	A1
20100017380	Naibo et al.	Jan 2010	A1
20100023498	Dettinger et al.	Jan 2010	A1
20100036803	Vemuri et al.	Feb 2010	A1
20100036831	Vemuri	Feb 2010	A1
20100049710	Young, Jr. et al.	Feb 2010	A1
20100057663	Srinivasan et al.	Mar 2010	A1
20100057727	Srinivasan et al.	Mar 2010	A1
20100057735	Srinivasan et al.	Mar 2010	A1
20100057736	Srinivasan et al.	Mar 2010	A1
20100057737	Srinivasan et al.	Mar 2010	A1
20100094838	Kozak	Apr 2010	A1
20100106946	Imaki et al.	Apr 2010	A1
20100125574	Navas	May 2010	A1
20100125584	Navas	May 2010	A1
20100138405	Mihaila	Jun 2010	A1
20100161589	Nica et al.	Jun 2010	A1
20100223305	Park et al.	Sep 2010	A1
20100223437	Park et al.	Sep 2010	A1
20100223606	Park et al.	Sep 2010	A1
20100293135	Candea et al.	Nov 2010	A1
20100312756	Zhang et al.	Dec 2010	A1
20100318652	Samba	Dec 2010	A1
20100332401	Prahlad et al.	Dec 2010	A1
20110004621	Kelley et al.	Jan 2011	A1
20110016160	Zhang et al.	Jan 2011	A1
20110022618	Thatte et al.	Jan 2011	A1
20110023055	Thatte et al.	Jan 2011	A1
20110029484	Park et al.	Feb 2011	A1
20110029485	Park et al.	Feb 2011	A1
20110040746	Handa et al.	Feb 2011	A1
20110055192	Tang et al.	Mar 2011	A1
20110055197	Chavan	Mar 2011	A1
20110093162	Nielsen et al.	Apr 2011	A1
20110105857	Zhang et al.	May 2011	A1
20110161321	de Castro Alves et al.	Jun 2011	A1
20110161328	Park et al.	Jun 2011	A1
20110161352	de Castro Alves et al.	Jun 2011	A1
20110161356	de Castro Alves et al.	Jun 2011	A1
20110161397	Bekiares et al.	Jun 2011	A1
20110173231	Drissi et al.	Jul 2011	A1
20110173235	Aman et al.	Jul 2011	A1
20110196839	Smith et al.	Aug 2011	A1
20110196891	de Castro Alves et al.	Aug 2011	A1
20110246445	Mishra	Oct 2011	A1
20110270879	Srinivasan et al.	Nov 2011	A1
20110282812	Chandramouli et al.	Nov 2011	A1
20110302164	Krishnamurthy et al.	Dec 2011	A1
20110313844	Chandramouli et al.	Dec 2011	A1
20110314019	Jimenez Peris et al.	Dec 2011	A1
20110321057	Mejdrich et al.	Dec 2011	A1
20120016866	Dunagan	Jan 2012	A1
20120041934	Srinivasan et al.	Feb 2012	A1
20120072455	Jain et al.	Mar 2012	A1
20120130963	Luo et al.	May 2012	A1
20120131139	Siripurapu et al.	May 2012	A1
20120166417	Chandramouli et al.	Jun 2012	A1
20120166421	Cammert et al.	Jun 2012	A1
20120166469	Cammert et al.	Jun 2012	A1
20120191697	Sherman et al.	Jul 2012	A1
20120233107	Roesch et al.	Sep 2012	A1
20120259910	Andrade et al.	Oct 2012	A1
20120278473	Griffiths	Nov 2012	A1
20120284420	Shukla et al.	Nov 2012	A1
20120290715	Dinger et al.	Nov 2012	A1
20120291049	Park et al.	Nov 2012	A1
20120324453	Chandramouli et al.	Dec 2012	A1
20130014088	Park et al.	Jan 2013	A1
20130031567	Nano et al.	Jan 2013	A1
20130046725	Cammert et al.	Feb 2013	A1
20130117317	Wolf	May 2013	A1
20130144866	Jerzak et al.	Jun 2013	A1
20130191370	Chen et al.	Jul 2013	A1
20130191413	Chen et al.	Jul 2013	A1
20130332240	Patri et al.	Dec 2013	A1
20140095444	Deshmukh et al.	Apr 2014	A1
20140095445	Deshmukh et al.	Apr 2014	A1
20140095446	Deshmukh et al.	Apr 2014	A1
20140095447	Deshmukh et al.	Apr 2014	A1
20140095471	Deshmukh et al.	Apr 2014	A1
20140095473	Srinivasan et al.	Apr 2014	A1
20140095483	Toillion et al.	Apr 2014	A1
20140095525	Hsiao et al.	Apr 2014	A1
20140095529	Deshmukh et al.	Apr 2014	A1
20140095533	Shukla et al.	Apr 2014	A1
20140095535	Deshmukh et al.	Apr 2014	A1
20140095537	Park et al.	Apr 2014	A1
20140095540	Hsiao et al.	Apr 2014	A1
20140095541	Herwadkar et al.	Apr 2014	A1
20140095543	Hsiao et al.	Apr 2014	A1
20140136514	Jain et al.	May 2014	A1
20140156683	de Castro Alves	Jun 2014	A1
20140172506	Parsell et al.	Jun 2014	A1
20140172914	Elnikety et al.	Jun 2014	A1
20140201225	Deshmukh et al.	Jul 2014	A1
20140201355	Bishnoi et al.	Jul 2014	A1
20140236983	Alves et al.	Aug 2014	A1
20140237289	de Castro Alves et al.	Aug 2014	A1
20140358959	Bishnoi et al.	Dec 2014	A1
20140379712	Lafuente Alvarez	Dec 2014	A1
20150156241	Shukla et al.	Jun 2015	A1
20150161214	Kali et al.	Jun 2015	A1
20150227415	Alves et al.	Aug 2015	A1

Foreign Referenced Citations (13)

Number	Date	Country
1 241 589	Sep 2002	EP
2474922	Jul 2012	EP
0049533	Aug 2000	WO
WO0049533	Aug 2000	WO
0118712	Mar 2001	WO
0159602	Aug 2001	WO
0165418	Sep 2001	WO
03030031	Apr 2003	WO
2007122347	Nov 2007	WO
2012037511	Mar 2012	WO
2012050582	Apr 2012	WO
2012154408	Nov 2012	WO
2012158360	Nov 2012	WO

Non-Patent Literature Citations (394)

Entry
Oracle™ Fusion Middleware CQL Language Reference, 11g Release 1 (11.1.1.6.3) E12048-10, Aug. 2012, pp. 6-1 to 6-12.
Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1.4.0) E12048-04, Jan. 2011, pp. 6.1 to 6.12.
Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1) E12048-03, Apr. 2010, sections 18-4 to 18.4.2.
Pattern Recognition With MATCH—RECOGNIZE, Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1) E12048-01, May 2009, pp. 15.1 to 15.20.
Supply Chain Event Management: Real-Time Supply Chain Event Management, product information Manhattan Associates, 2009-2012.
U.S. Appl. No. 11/601,415, Non-Final Office Action mailed on Dec. 11, 2013, 58 pages.
U.S. Appl. No. 11/977,439, Notice of Allowance mailed on Nov. 24, 2010, 8 pages.
U.S. Appl. No. 12/396,464, Non Final Office Action mailed on Dec. 31, 2013, 16 pages.
U.S. Appl. No. 12/548,281, Final Office Action mailed on Oct. 10, 2013, 21 pages.
U.S. Appl. No. 12/548,290, Notice of Allowance mailed on Sep. 11, 2013, 6 pages.
U.S. Appl. No. 12/949,081, Final Office Action mailed on Aug. 27, 2013, 13 pages.
U.S. Appl. No. 13/089,556, Final Office Action mailed on Aug. 29, 2013, 10 pages.
U.S. Appl. No. 13/089,556, Non-Final Office Action mailed on Jan. 9, 2014, 14 pages.
U.S. Appl. No. 13/177,748, Non-Final Office Action mailed on Aug. 30, 2013, 24 pages.
U.S. Appl. No. 13/193,377, Notice of Allowance mailed on Aug. 30, 2013, 19 pages.
Chandramouli et al., High-Performance Dynamic Pattern Matching over Disordered Streams, Proceedings of the VLDB Endowment, vol. 3, Issue 1-2, Sep. 2010, pp. 220-231.
Chapple, Combining Query Results with the Union Command, ask.com Computing Databases, downloaded from: http://databases.about.com/od/sql/a/union.htm.
Chui, WebSphere Application Server V6.1—Class loader problem determination, IBM.com, 2007.
Fantozzi, A Strategic Approach to Supply Chain Event Management, student submission for Masters Degree, Massachusetts Institute of Technology, Jun. 2003.
Komazec et al., Towards Efficient Schema-Enhanced Pattern Matching over RDF Data Streams, Proceedings of the 1st International Workshop on Ordering and Reasoning (OrdRing 2011), Bonn, Germany, Oct. 2011.
Ogrodnek, Custom UDFs and hive, Bizo development blog http://dev.bizo.com, Jun. 23, 2009, 2 pages.
Pradhan, Implementing and Configuring SAP® Event Management, Galileo Press, 2010, pp. 17-21.
Wilson et al., SAP Event Management, an Overview, Q Data USA, Inc., 2009.
U.S. Appl. No. 12/949,081, Non-Final Office Action mailed on Jan. 28, 2015, 20 pages.
U.S. Appl. No. 12/957,201, Notice of Allowance mailed on Jan. 21, 2015, 5 pages.
U.S. Appl. No. 13/107,742, Final Office Action mailed on Jan. 21, 2015, 23 pages.
U.S. Appl. No. 13/177,748, Non-Final Office Action mailed on Feb. 3, 2015, 22 pages.
U.S. Appl. No. 13/770,961, Non-Final Office Action mailed on Feb. 4, 2015, 22 pages.
U.S. Appl. No. 13/770,969, Notice of Allowance mailed on Jan. 22, 2015, 5 pages.
U.S. Appl. No. 13/829,958, Non-Final Office Action mailed on Dec. 11, 2014, 15 pages.
U.S. Appl. No. 13/906,162, Non-Final Office Action mailed on Dec. 29, 2014, 10 pages.
International Application No. PCT/US2014/010832, Written Opinion mailed on Dec. 15, 2014, 5 pages.
International Application No. PCT/US2014/010920, International Search Report and Written Opinion mailed on Dec. 15, 2014, 10 pages.
International Application No. PCT/US2014/017061, Written Opinion mailed on Feb. 3, 2015, 6 pages.
International Application No. PCT/US2014/039771, International Search Report and Written Opinion mailed on Sep. 24, 2014, 12 pages.
Cranor et al. “Gigascope: a stream database for network applications,” Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 647-651 (Jun. 2003).
Oracle® Complex Event Processing EPL Language Reference 11g Release 1 (11.1.1.4.0), E14304-02, Jan. 2011, 80 pages.
De Castro Alves, A General Extension System for Event Processing Languages, DEBS '11, New York, NY, USA, Jul. 11-15, 2011, pp. 1-9.
Takenaka et al., A scalable complex event processing framework for combination of SQL-based continuous queries and C/C++ functions, FPL 2012, Oslo, Norway, Aug. 29-31, 2012, pp. 237-242.
Tomàs et al., RoSeS: A Continuous Content-Based Query Engine for RSS Feeds, DEXA 2011, Toulouse, France, Sep. 2, 2011, pp. 203-218.
Non-Final Office Action for U.S. Appl. No. 13/830,378 dated Feb. 25, 2015, 23 pages.
Non-Final Office Action for U.S. Appl. No. 13/830,129 dated Feb. 27, 2015, 19 pages.
International Application No. PCT/US2014/068641, International Search Report and Written Opinion mailed on Feb. 26, 2015, 11 pages.
European Patent Application No. 12783063.6, Extended Search Report mailed Mar. 24, 2015, 6 pages.
Non-Final Office Action for U.S. Appl. No. 12/913,636 dated Apr. 1, 2015, 22 pages.
Final Office Action for U.S. Appl. No. 13/827,631 dated Apr. 3, 2015, 11 pages.
Notice of Allowance for U.S. Appl. No. 13/839,288 dated Apr. 3, 2015, 12 pages.
Notice of Allowance for U.S. Appl. No. 14/077,230 dated Apr. 16, 2015, 16 pages.
Final Office Action for U.S. Appl. No. 13/764,560 dated Apr. 15, 2015, 19 pages.
U.S. Appl. No. 12/548,187, Non-Final Office Action mailed on Feb. 6, 2014, 54 pages.
U.S. Appl. No. 12/548,281, Non-Final Office Action mailed on Feb. 13, 2014, 16 pages.
U.S. Appl. No. 13/177,748, Final Office Action mailed on Mar. 20, 2014, 23 pages.
PCT Patent Application No. PCT/US2014/010832, International Search Report mailed on Apr. 3, 2014, 9 pages.
Agrawal et al., Efficient pattern matching over event streams, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, Jun. 9-12, 2008, pp. 147-160.
Cadonna et al., Efficient event pattern matching with match windows, Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (Aug. 2012), pp. 471-479.
Nichols et al., A faster closure algorithm for pattern matching in partial-order event data, IEEE International Conference on Parallel and Distributed Systems (Dec. 2007), pp. 1-9.
Oracle Application Server, Enterprise Deployment Guide, 10g Release 3 (10.1.3.2.0), B32125-02, Oracle, Apr. 2007, 120 pages.
Oracle Database, SQL Language Reference 11 g Release 1 (11.1), B28286-02, Oracle, Sep. 2007, 1496 pages.
Esper Reference Documentation, Copyright 2007, Ver. 1.12.0, 2007, 158 pages.
Stream Query Repository: Online Auctions, at URL: http://www-db.stanford.edu/stream/sqr/onauc.html#queryspecsend, Dec. 2, 2002, 2 pages.
Esper Reference Documentation, Copyright 2008, ver. 2.0.0, 2008, 202 pages.
Oracle Database Data Cartridge Developer's Guide, B28425-03, 11 g Release 1 (11.1), Oracle, Mar. 2008, 372 pages.
Oracle Application Server, Administrator's Guide, 10g Release 3 (10.1.3.2.0), B32196-01, Oracle., Jan. 2007, 376 pages.
Oracle Application Server 10g, Release 2 and 3, New Features Overview, An Oracle White Paper, Oracle., Oct. 2005, 48 pages.
Oracle Database, SQL Reference, 10g Release 1 (10.1), Part No. B10759-01, Dec. 2003, pp. 7-1 to 7-17; 7-287 to 7-290; 14-61 to 14-74.
Business Process Management (BPM), Datasheet [online]. IBM, [retrieved on Jan. 28, 2013]. Retrieved from the Internet: <URL: http://www-142.ibm.com/software/products/us/en/category/BPM-SOFTWARE>.
Complex Event Processing in the Real World, An Oracle White Paper., Sep. 2007, 13 pages.
Coral8 Complex Event Processing Technology Overview, Coral8, Inc., Make it Continuous, Copyright 2007 Coral8, Inc., 2007, pp. 1-8.
“Creating WebLogic Domains Using the Configuration Wizard.”, BEA Products, Version. 10.0, Dec. 2007, 78.
“Creating Weblogic Event Server Applications.”, BEA WebLogic Event Server, Version. 2.0, Jul. 2007, 90 pages.
Dependency Injection, Wikipedia, printed on Apr. 29, 2011, at URL: D http:en.wikipedia.org/w/index.php?title=DependencLinjection&0ldid=260831402,, Dec. 30, 2008, pp. 1-7.
Deploying Applications to WebLogic Server, BEA WebLogic Server, ver. D 10.0, Mar. 30, 2007, 164 pages.
Developing Applications with Weblogic Server, BEA WebLogic Server, ver. D 10.0, Mar. 30, 2007, 254 pages.
EPL Reference, BEA WebLogic Event Server, ver. 2.0, Jul. 2007, 82 pages.
Esper Reference Documentation Version 3.1.0, EsperTech, retrieved from internet at URL: http://esper.codehaus.org/esper-3.1.0/doc/reference/en/pdf/esper—reference.pdf, 2009, 293 pages.
Fast Track Deployment and Administrator Guide for BEA WebLogic Server, BEA WebLogic Server 10.0 Documentation, printed on May 10, 2010, at URL:http://download.oracle.com/docs/cd/E13222—01 /wls/docs1 OO/quickstart/quick—start. html, May 10, 2010, 1page.
Getting Started with WebLogic Event Server, BEA WebLogic Event Serverver 2.0, Jul. 2007, 66 pages.
High Availability Guide, Oracle Application Server, 10g Release 3 (10.1.3.2.0), B32201-01, Jan. 2007, 314 pages.
Installing Weblogic Real Time, BEA WebLogic Real Time, Ver. 2.0, Jul. 2007, 64 pages.
Introduction to BEA WebLogic Server and BEA WebLogic Express, BEA WebLogic Server, Ver. 10.0, Mar. 2007, 34 pages.
Introduction to WebLogic Real Time, BEA WebLogic Real Time, , Jul. 2007, 20 pages.
Jboss Enterprise Application Platform 4.3 Getting Started Guide CP03, for Use with Jboss Enterprise Application Platform 4.3 Cumulative Patch 3, Jboss a division of Red Hat, Red Hat Documentation Group, Copyright 2008, Red Hat, Inc., Sep. 2007, 68 pages.
Managing Server Startup and Shutdown, BEA WebLogic Server, ver. 10.0, Mar. 30, 2007, 134 pages.
Matching Behavior, .NET Framework Developer's Guide, Microsoft Corporation, Retrieved on: Jul. 1, 2008, URL: http://msdn.microsoft.com/en-us/library/Oyzc2ybO(pri nter).aspx, 2008, pp. 1-2.
New Project Proposal for Row Pattern Recognition—Amendment to SQL with Application to Streaming Data Queries, H2-2008-027, H2 Teleconference Meeting, Jan. 9, 2008, pp. 1-6.
Oracle CEP Getting Started, Release 11 gR1 (11.1.1) E14476-01, May 2009, 172 pages.
Oracle Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1) E12048-01, Apr. 2010, 540 pages.
OSGI Service Platform Core Specification, The OSGI Alliance, OSGI Alliance, ver. 4.1, release 4, Apr. 2007, 288 pages.
Release Notes, BEA WebLogic Event Server, Ver. 2.0, Jul. 2007, 8 pages.
Spring Dynamic Modules for OSGi Service Platforms product documentation, SpringSource, D, Jan. 2008, 71 pages.
Stream Base New and Noteworthy, Stream Base, Jan. 1, 2010, 878 pages.
Stream Query Repository: Online Auctions (CQL Queries)., Retrieved from: URL: http://www-db.stanford.edu/strem/sqr/cql/onauc.html, Dec. 2, 2002, 4 pages.
Stream: The Stanford Stream Data Manager, IEEE Data Engineering Bulletin., Mar. 2003, pp. 1-8.
Stream: The Stanford Stream Data Manager, Retrieved from: URL: http://infolab.stanford.edu/stream/, Jan. 5, 2006, pp. 1-9.
Understanding Domain Configuration, BEA WebLogic Server, Ver. 10.0, Mar. 30, 2007, 38 pages.
WebLogic Event Server Administration and Configuration Guide, BEA WebLogic Event D Server, Version. 2.0, Jul. 2007, 108 pages.
WebLogic Event Server Reference, BEA WebLogic Event Server, Version. 2.0, Jul. 2007, 52 pages.
Weblogic Server Performance and Tuning, BEA WebLogic Server, Ver. 10.0, Mar. 30, 2007, 180 pages.
WebSphere Application Server V6.1 Problem Determination: IBM Redpaper Collection, WebSphere Software, IBM/Redbooks, Dec. 2007, 634 pages.
What is BPM?, Datasheet [online]. IBM, [retrieved on Jan 28, 2013]. Retrieved from the Internet: <URL: http://www-01.ibm.com/software/info/bpm/whatis-bpm/>.
U.S. Appl. No. 10/948,523, Final Office Action mailed on Jul. 6, 2007, 5 pages.
U.S. Appl. No. 10/948,523, Non-Final Office Action mailed on Dec. 11, 2007, 48 pages.
U.S. Appl. No. 10/948,523, Notice of Allowance mailed on Dec. 1, 2010, 15 pages.
U.S. Appl. No. 10/948,523, Notice of Allowance mailed on Jul. 8, 2008, 30 pages.
U.S. Appl. No. 10/948,523, Non-Final Office Action mailed on Jan. 22, 200731 pages.
U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance mailed on Jul. 17, 2008, 17 pages.
U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance mailed on Aug. 25, 2008, 3 pages.
U.S. Appl. No. 11/601,415, Final Office Action mailed on Jul. 2, 2012, 59 pages.
U.S. Appl. No. 11/601,415, Final Office Action mailed on May 27, 2009, 27 pages.
U.S. Appl. No. 11/601,415, Final Office Action mailed on Jun. 30, 2010, 45 pages.
U.S. Appl. No. 11/601,415, Non-Final Office Action mailed on Sep. 17, 2008, 10 pages.
U.S. Appl. No. 11/601,415, Non-Final Office Action mailed on Nov. 30, 2009, 32 pages.
U.S. Appl. No. 11/601,415, Office Action mailed on Dec. 9, 2011.
U.S. Appl. No. 11/873,407, Final Office Action mailed on Apr. 26, 2010, 11 pages.
U.S. Appl. No. 11/873,407, Non-Final Office Action Nov. 13, 2009, 7 pages.
U.S. Appl. No. 11/873,407, Notice of Allowance mailed on Nov. 10, 2010, 14 pages.
U.S. Appl. No. 11/873,407, Notice of Allowance mailed on Mar. 7, 2011, 8 pages.
U.S. Appl. No. 11/874,197, Final Office Action mailed on mailed on Aug. 12, 2011, 26 pages.
U.S. Appl. No. 11/874,197, Final Office Action mailed on Jun. 29, 2010, 17 pages.
U.S. Appl. No. 11/874,197, Non-Final Office Action mailed on Dec. 22, 2010, 22 pages.
U.S. Appl. No. 11/874,197, Office Action mailed on Nov. 10, 2009, 14 pages.
U.S. Appl. No. 11/874,202, Final Office Action mailed on Jun. 8, 2010, 200 pages.
U.S. Appl. No. 11/874,202, Non-Final Office Action mailed on Dec. 3, 2009, 20 pages.
U.S. Appl. No. 11/874,202, Notice of Allowance mailed on Mar. 31, 2011, 12 pages.
U.S. Appl. No. 11/874,202, Notice of Allowance mailed on Dec. 22, 2010, 29 pages.
U.S. Appl. No. 11/874,850, Notice of Allowance mailed on Jan. 27, 2010, 11 pages.
U.S. Appl. No. 11/874,850, Notice of Allowance mailed on Nov. 24, 2009, 17 pages.
U.S. Appl. No. 11/874,850, Notice of Allowance mailed on Dec. 11, 2009, 5 pages.
U.S. Appl. No. 11/874,896, Final Office Action mailed on Jul. 23, 2010, 28 pages.
U.S. Appl. No. 11/874,896, Non-Final Office Action mailed on Dec. 8, 2009, 19 pages.
U.S. Appl. No. 11/874,896, Non-Final Office Action mailed on Nov. 22, 2010, 25 pages.
U.S. Appl. No. 11/874,896, Notice of Allowance mailed on Jun. 23, 2011, 30 pages.
U.S. Appl. No. 11/927,681, Non-Final Office Action mailed on Mar. 24, 2011, 17 pages.
U.S. Appl. No. 11/927,681, Notice of Allowance mailed on Jul. 1, 2011, 8 pages.
U.S. Appl. No. 11/927,683, Final Office Action mailed on Sep. 1, 2011, 18 pages.
U.S. Appl. No. 11/927,683, Non-Final Office Action mailed on Mar. 24, 2011, 13 pages.
U.S. Appl. No. 11/927,683, Notice of Allowance mailed on Nov. 9, 2011, 10 pages.
U.S. Appl. No. 11/977,437, Final Office Action mailed on Apr. 8, 2010, 18 pages.
U.S. Appl. No. 11/977,437, Non-Final Office Action mailed on Oct. 13, 2009, 9 pages.
U.S. Appl. No. 11/977,437, Notice of Allowance mailed on Mar. 4, 2013, 9 pages.
U.S. Appl. No. 11/977,437, Office Action mailed on Aug. 3, 2012, 17 pages.
U.S. Appl. No. 11/977,439, Non-Final Office Action mailed on Apr. 13, 2010, 7 pages.
U.S. Appl. No. 11/977,439, Notice of Allowance mailed on Mar. 16, 2011, 10 pages.
U.S. Appl. No. 11/977,439, Notice of Allowance mailed on Aug. 18, 2010, 11 pages.
U.S. Appl. No. 11/977,439, Notice of Allowance mailed on Sep. 28, 2010, 6 pages.
U.S. Appl. No. 11/977,440, Notice of Allowance mailed on Oct. 7, 2009, 6 pages.
U.S. Appl. No. 12/193,377, Final Office Action mailed on Jan. 17, 2013, 24 pages.
U.S. Appl. No. 12/395,871, Non-Final Office Action mailed on May 27, 2011, 7 pages.
U.S. Appl. No. 12/395,871, Notice of Allowance mailed on 04, 2012, 27 pages.
U.S. Appl. No. 12/395,871, Office Action mailed on Oct. 9, 2011, 33 pages.
U.S. Appl. No. 12/396,008, Non-Final Office Action mailed on Jun. 8, 2011, 10 pages.
U.S. Appl. No. 12/396,008, Notice of Allowance mailed on Nov. 16, 2011, 5 pages.
U.S. Appl. No. 12/396,464, Final Office Action mailed on Jan. 16, 2013, 17 pages.
U.S. Appl. No. 12/396,464, Non-Final Office Action mailed on Sep. 7, 2012, 18 pages.
U.S. Appl. No. 12/506,891, Notice of Allowance Jul. 25, 2012, 8 pages.
U.S. Appl. No. 12/506,891, Office Action mailed on Dec. 14, 2011, 41 pages.
U.S. Appl. No. 12/506,905, Notice of Allowance mailed on Dec. 14, 2012, 15 pages.
U.S. Appl. No. 12/506,905, Office Action mailed on Aug. 9, 2012, 42 pages.
U.S. Appl. No. 12/506,905, Office Action mailed on Mar. 26, 2012, 61 pages.
U.S. Appl. No. 12/534,384, Notice of Allowance mailed on May 7, 2013, 12 pages.
U.S. Appl. No. 12/534,384, Non-Final Office Action mailed on Feb. 28, 2012, 13 pages.
U.S. Appl. No. 12/534,384, Final Office Action mailed on Feb. 12, 2013, 14 pages.
U.S. Appl. No. 12/534,398, Final Office Action mailed on Jun. 5, 2012, 27 pages.
U.S. Appl. No. 12/534,398, Notice of Allowance mailed on Nov. 27, 2012, 10 pages.
U.S. Appl. No. 12/534,398, Non-Final Office Action mailed on Nov. 1, 2011, 15 pages.
U.S. Appl. No. 12/548,187, Non Final Office Action mailed on Sep. 27, 2011, 19 pages.
U.S. Appl. No. 12/548,187, Non-Final Office Action mailed on Apr. 9, 2013, 17 pages.
U.S. Appl. No. 12/548,187, Final Office Action mailed on Jun. 20, 2012, 22 pages.
U.S. Appl. No. 12/548,209, Notice of Allowance mailed on Oct. 24, 2012, 22 pages.
U.S. Appl. No. 12/548,209, Office Action mailed on Apr. 16, 2012, 40 pages.
U.S. Appl. No. 12/548,222, Non-Final Office Action mailed on Apr. 10, 2013, 16 pages.
U.S. Appl. No. 12/548,222, Non-Final Office Action mailed on Oct. 19, 2011, 19 pages.
U.S. Appl. No. 12/548,222, Office Action mailed on Jun. 20, 2012, 29 pages.
U.S. Appl. No. 12/548,281, Non-Final Office Action mailed on Apr. 12, 2013, 16 pages.
U.S. Appl. No. 12/548,281, Non-Final Office Action mailed on Oct. 3, 2011, 20 pages.
U.S. Appl. No. 12/548,281, Office Action mailed on Jun. 20, 2012, 29 pages.
U.S. Appl. No. 12/548,290, Final Office Action mailed on Jul. 30, 2012, 34 pages.
U.S. Appl. No. 12/548,290, Non-Final Office Action mailed on Oct. 3, 2011, 17 pages.
U.S. Appl. No. 12/548,290, Non-Final Office Action mailed on Apr. 15, 2013, 17 pages.
U.S. Appl. No. 12/874,197, Notice of Allowance mailed on Jun. 22, 2012.
U.S. Appl. No. 12/913,636, Final Office Action mailed on Jan. 8, 2013, 21 pages.
U.S. Appl. No. 12/913,636, Non-Final Office Action mailed on Jun. 7, 2012, 16 pages.
U.S. Appl. No. 12/949,081, Non-Final Office Action mailed on Jan. 9, 2013, 12 pages.
U.S. Appl. No. 12/957,194, Non-Final Office Action mailed on Dec. 7, 2012, 11 pages.
U.S. Appl. No. 12/957,194, Notice of Allowance mailed on Mar. 20, 2013, 9 pages.
U.S. Appl. No. 12/957,201, Final Office Action mailed on Apr. 25, 2013, 11 pages.
U.S. Appl. No. 12/957,201, Office Action mailed on Dec. 19, 2012, 15 pages.
U.S. Appl. No. 13/089,556, Non-Final Office Action mailed on Apr. 10, 2013, 10 pages.
U.S. Appl. No. 13/089,556, Office Action mailed on Nov. 6, 2012, 13 pages.
U.S. Appl. No. 13/102,665, Office Action mailed on Feb. 1, 2013, 14 pages.
U.S. Appl. No. 13/107,742, Non-Final Office Action mailed on Feb. 14, 2013, 16 pages.
U.S. Appl. No. 13/184,528, Notice of Allowance mailed on Mar. 1 2012.
U.S. Appl. No. 13/193,377, Office Action mailed on Jan. 17, 2013, 25 pages.
U.S. Appl. No. 13/193,377, Office Action mailed on Aug. 23, 2012, 48 pages.
U.S. Appl. No. 13/244,272, Final Office Action mailed on Mar. 28, 2013, 29 pages.
U.S. Appl. No. 13/244,272, Non-Final Office Action mailed on Oct. 4, 2012, 30 pages.
U.S. Appl. No. 13/396,464, Office Action mailed on Sep. 7, 2012.
Abadi, et al., Aurora: A Data Stream Management System, International Conference on Management of Data, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003, 4 pages.
Aho, et al., Efficient String Matching: An Aid to Bibliographic Search, Communications of the ACM, vol. 18, No. 6, Association for Computing Machinery, Inc., Jun. 1975, pp. 333-340.
Arasu, et al., An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations, 9th International Workshop on Database programming languages, Sep. 2003, 11 pages.
Arasu, et al., An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations, 9th International Workshop on Database programming languages, Sep. 2003, 12 pages.
Arasu, et al., CQL: A language for Continuous Queries over Streams and Relations, Lecture Notes in Computer Science vol. 2921, 2004, pp. 1-19.
Arasu, et al., Stream: The Stanford Data Stream Management System, Department of Computer Science, Stanford University, 2004, p. 21.
Arasu, et al., The CQL Continuous Query Language: Semantic Foundations and Query Execution, Stanford University, The VLDB Journal—The International Journal on Very Large Data Bases, vol. 15, No. 2, Springer-Verlag New York, Inc., Jun. 2006, pp. 1-32.
Avnur, et al., Eddies: Continuously Adaptive Query Processing, In Proceedings of the 2000 ACM SIGMOD International Conference on Data, Dallas TX, May 2000, 12 pages.
Avnur, et al., Eddies: Continuously Adaptive Query Processing, slide show, believed to be prior to Oct. 17, 2007, 4 pages.
Babcock et al., Models and Issues in Data Streams, Proceedings of the 21st ACM SIGMOD-SIGACT-SIDART symposium on Principles of database systems, 2002, 30 pages.
Babu, et al., Continuous Queries over Data Streams, SIGMOD Record, vol. 30, No. 3, Sep. 2001, pp. 109-120.
Bai, et al., A Data Stream Language and System Designed for Power and Extensibility, Conference on Information and Knowledge Management, Proceedings of the 15th ACM D International Conference on Information and Knowledge Management, Arlington, Virginia, Copyright 2006, ACM Press., Conference on Information and Knowledge Management, Proceedings of the 15th ACM D International Conference on Information and Knowledge Management, Arlington, Virginia, Copyright 2006, ACM Press., Nov. 5-11, 2006, 10 pages.
Bose, et al., A Query Algebra for Fragmented XML Stream Data, 9th International Conference on Data Base Programming Languages (DBPL), Sep. 2003, 11 pages.
Buza, Extension of CQL over Dynamic Databases, Journal of Universal Computer Science, vol. 12, No. 9, Sep. 28, 2006, pp. 1165-1176.
Carpenter, User Defined Functions, Retrieved from: URL: http://www.sqlteam.comitemprint.asp?ItemID=979, Oct. 12, 2000, 4 pages.
Chan, et al., Efficient Filtering of XML documents with Xpath expressions, VLDB Journal D, 2002, pp. 354-379.
Chandrasekaran, et al., TelegraphCQ: Continuous Dataflow Processing for an Uncertain World, Proceedings of CIDR, 2003, 12 pages.
Chen, et al., NiagaraCQ: A Scalable Continuous Query System for Internet Databases, Proceedings of the 2000 SIGMOD International Conference on Management of Data., May 2000, 379-390 pages.
Colyer, et al., Spring Dynamic Modules Reference Guide, Copyright, ver. 1.0.3, 2006-2008, 73 pages.
Colyer, et al., Spring Dynamic Modules Reference Guide, Ver. 1.1.3, 2006-2008, 96 pages.
Conway, An Introduction to Data Stream Query Processing, Truviso, Inc., URL: http://neilconway.org/talks/streamjntro.pdf, May 24, 2007, 71 pages.
Demers, et al., Towards Expressive Publish/Subscribe Systems, Proceedings of the 10th International Conference on Extending Database Technology (EDBT 2006),Munich, Germany, Mar. 2006, pp. 1-18.
Demichiel, et al., JSR 220: Enterprise JavaBeans™, EJB 3.0 Simplified API, EJB 3.0 Expert Group, Sun Microsystems, Ver. 3.0, May 2, 2006, 59 pages.
Deshpande, et al., Adaptive Query Processing, Slide show believed to be prior to Oct. 17, 2007, 27 pages.
Diao, et al., Query Processing for High-Volume XML Message Brokering, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 12 pages.
Diao, Query Processing for Large-Scale XML Message Brokering, University of California Berkeley, 2005, 226 pages.
Dindar, et al., Event Processing Support for Cross-Reality Environments, Pervasive Computing, IEEE CS, Jul.-Sep. 2009, Copyright 2009, IEEE, Jul.-Sep. 2009, pp. 2-9.
Fernandez, et al., Build your own XQuery processor, slide show, at URL: http://www.galaxquery.org/slides/edbt-summer-school2004.pdf, 2014, 116 pages.
Fernandez, et al., Implementing XQuery 1.0: The Galax Experience, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 4 pages.
Florescu, et al., The BEA/XQRL Streaming XQuery Processor, Proceedings of the 29th VLDB Conference, 2003, 12 pages.
Gilani, Design and implementation of stream operators, query instantiator and stream buffer manager, Dec. 2003, 137 pages.
Golab, et al., Issues in Data Stream Management, ACM SIGMOD Record, vol. 32, issue 2, ACM Press, Jun. 2003, pp. 5-14.
Golab, et al., Sliding Window Query Processing Over Data Streams, University of Waterloo, D Waterloo, Ont. Canada, Aug. 2006, 182 pages.
Gosling, et al., The Java Language Specification, Book, copyright , 3rd edition, FG , Sun Microsystems USA. D (due to size, reference will be uploaded in two parts), 1996-2005, 684 pages.
Hao, et al., Achieving high performance web applications by service and database replications at edge servers, Performance Computing and communications conference(IPCCC) IEEE 28th International, IEEE, Piscataway, NJ, USA, XP031622711, ISBN: 978-1-4244-5737-3, 2009, pp. 153-160.
Hopcroft, Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, Copyright 2001, 524 pages.
Hulton, et al., Mining Time-Changing Data Stream, Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2001, 10 pages.
Jin, et al., ARGUS: Efficient Scalable Continuous Query Optimization for Large-Volume Data Streams, 10th International Database Engineering and Applications Symposium (IDEAS'06), 2006, 7 pages.
Kawaguchi, et al., Java Architecture for XML Binding (JAXB) 2.2, Sun Microsystems, Inc., Dec. 10, 1999, 384 pages.
Knuth, et al., Fast Pattern Matching in Strings, Siam J Comput 6(2), Jun. 1977, 323-50 pages.
Lakshmanan, et al., On efficient matching of streaming XML documents and queries, 2002, 18 pages.
Lindholm, et al., Java Virtual Machine Specification, 2nd Edition Prentice Hall, Apr. 1999, 484 pages.
Liu, et al., Efficient XSLT Processing in Relational Database System, Proceeding of the 32nd. International Conference on Very Large Data Bases (VLDB), Sep. 2006, pp. 1106-1116.
Luckham, What's the Difference Between ESP and CEP? Complex Event Processing, downloaded, at URL:http://complexevents.com/?p=103, Apr. 29, 2011, 5 pages.
Madden, et al., Continuously Adaptive Continuous Queries (CACQ) over Streams, SIGMOD, Jun. 4-6, 2002, 12 pages.
Martin, et al., Finding Application Errors and Security Flaws Using PQL, a Program Query Language, OOPSLA'05, Oct. 16, 2005, pp. 1-19.
Motwani, et al., Query Processing Resource Management, and Approximation in a Data 0 Stream Management System, Proceedings of CIDR, Jan. 2003, 12 pages.
Munagala, et al., Optimization of Continuous Queries with Shared Expensive Filters, Proceedings of the 26th ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, Oct. 17, 2007, 14 pages.
Nah, et al., A Cluster-Based TMO-Structured Scalable Approach for Location Information Systems, Object-Oriented Real-Time Dependable Systems, 2003. Words 2003 Fall. Proceedings. Ninth IEEE International Workshop on Date of Conference: Oct. 1-3, 2003, pp. 225-233.
Novick, Creating a User Defined Aggregate with SQL Server 2005, URL: http://novicksoftware.com/Articles/sql-2005-product-user-defined-aggregate.html, 2005, 6 pages.
International Application No. PCT/US2011/052019, International Search Report and Written Opinion mailed on Nov. 17, 2011, 55 pages.
International Application No. PCT/US2012/034970, International Search Report and Written Opinion mailed on Jul. 16, 2012, 13 pages.
International Application No. PCT/US2012/036353, International Search Report and Written Opinion mailed on Sep. 12, 2012, 11 pages.
Peng, et al., Xpath Queries on Streaming Data, 2003, pp. 1-12.
Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981, 301 pages.
PostgresSQL, Manuals: PostgresSQL 8.2: Create Aggregate, believed to be prior to Apr. 21, 2007, 4 pages.
PostgresSQL, Documentation: Manuals: PostgresSQL 8.2: User-Defined Aggregates believed to be prior to Apr. 21, 2007, 4 pages.
Sadri, et al., Expressing and Optimizing Sequence Queries in Database Systems, ACM Transactions on Database Systems, vol. 29, No. 2, ACM Press, Copyright, Jun. 2004, 282-318 pages.
Sadtler, et al., WebSphere Application Server Installation Problem Determination, Copyright 2007, IBM Corp., 2007, 1-48 pages.
Sansoterra, Empower SQL with Java User-Defined Functions, ITJungle.com, Oct. 9, 2003, 9 pages.
Sharaf, et al., Efficient Scheduling of Heterogeneous Continuous Queries, VLDB, Sep. 12-15, 2006, 511-522 pages.
Stolze, et al., User-defined Aggregate Functions in DB2 Universal Database, Retrievd from: <http://www.128. ibm.com/deve10perworks/d b2/1 ibrary/tachartic1e/0309stolze/0309stolze.html>, Sep. 11, 2003, 11 pages.
Stump, et al., Proceedings, The 2006 Federated Logic Conference, IJCAR '06 Workshop, PLPV '06: Programming Languages meets Program Verification, 2006, 1-113 pages.
Terry, et al., Continuous queries over append-only database, Proceedings of ACM SIGMOD, 1992, 321-330 pages.
Ullman, et al., Introduction to JDBC, Stanford University, 2005, 7 pages.
Vajjhala, et al., The Java Architecture for XML Binding (JAXB) 2.0, Sun Microsystem, D Inc., Final Release , Apr. 19, 2006, 384 pages.
Vijayalakshmi, et al., Processing location dependent continuous queries in distributed mobile databases using mobile agents, IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007), Dec. 22, 2007, 1023-1030 pages.
W3C, XML Path Language (Xpath), W3C Recommendation, Version. 1.0, Retrieved from: URL: http://www.w3.org/TR/xpath, Nov. 16, 1999, 37 pages.
Wang, et al., Distributed continuous range query processing on moving objects, DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications, 2006, 655-665 pages.
White, et al., WebLogic Event Server: A Lightweight, Modular Application Server for Event Processing, 2nd International Conference on Distributed Event-Based Systems, Rome, Italy, Copyright 2004., Jul. 2-4, 2008, 8 pages.
Widom, et al., CQL: A Language for Continuous Queries over Streams and Relations, Oct. 17, 2007, 62 pages.
Widom, et al., The Stanford Data Stream Management System, PowerPoint Presentation, Oct. 17, 2007, 110 pages.
Wu, et al., Dynamic Data Management for Location Based Services in Mobile Environments, Database Engineering and Applications Symposium, Jul. 16, 2003, 172-181 pages.
Zemke, XML Query, mailed on Mar. 14, 2004, 29 pages.
Final Office Action for U.S. Appl. No. 14/302,031 dated Apr. 22, 2015, 23 pages.
Non-Final Office Action for U.S. Appl. No. 14/692,674 dated Jun. 5, 2015, 22 pages.
Non-Final Office Action for U.S. Patent Appl. No. 14/037,171 dated Jun. 3, 2015, 15 pages.
Non-Final Office Action for U.S. Appl. No. 14/830,735 dated May 26, 2015, 19 pages.
Final Office Action for U.S. Appl. No. 13/830,428 dated Jun. 4, 2015, 21 pages.
Non-Final Office Action for U.S. Appl. No. 14/838,259 dated Jun. 9, 2015, 37 pages.
Final Office Action for U.S. Appl. No. 14/906,162 dated Jun. 10, 2015, 10 pages.
Non-Final Office Action for U.S. Appl. No. 14/037,153 dated Jun. 19, 2015, 23 pages.
Final Office Action for U.S. Appl. No. 13/829,958 dated Jun. 19, 2015, 17 pages.
Final Office Action for U.S. Appl. No. 13/827,987 dated Jun. 19, 2015, 10 pages.
International Application No. PCT/US2014/039771, International Search Report and Written Opinion mailed on Apr. 29, 2015 6 pages.
International Application No. PCT/US2015/016346, International Search Report and Written Opinion mailed on May 4, 2015, 9 pages.
International Preliminary Report on Patentability dated Apr. 9, 2015 for PCT/US2013/062047, 10 pages.
International Preliminary Report on Patentability dated Apr. 9, 2015 for PCT/US2013/062052, 18 pages.
International Preliminary Report on Patentability dated May 28, 2015 for PCT/US2014/017061, 31 pages.
International Preliminary Report on Patentability dated Jun. 18, 2015 for PCT/US2013/073086, 7 pages.
Call User Defined Functions from Pig, Amazon Elastic MapReduce, Mar. 2009, 2 pages.
Strings in C, retrieved from the internet: <URL: https://web.archive.org/web/20070612231205/http:l/web.cs.swarthmore.edu/-newhall/unixhelp/C—strings.html> [retrieved on May 13, 2014], Swarthmore College, Jun. 12, 2007, 3 pages.
U.S. Appl. No. 11/874,197, Notice of Allowance mailed on Jun. 22, 2012, 20 pages.
U.S. Appl. No. 13/838,259, filed Mar. 15, 2013, Deshmukh et al., Unpublished.
U.S. Appl. No. 13/839,288, filed Mar. 15, 2013, Deshmukh et al., Unpublished.
U.S. Appl. No. 12/396,464, Final Office Action mailed on May 16, 2014, 16 pages.
U.S. Appl. No. 12/548,187, Final Office Action mailed on Jun. 4, 2014, 64 pages.
U.S. Appl. No. 13/089,556, Final Office Action mailed on Jun. 13, 2014, 14 pages.
U.S. Appl. No. 13/107,742, Non-Final Office Action mailed on Jun. 19, 2014, 20 pages.
U.S. Appl. No. 13/244,272, Notice of Allowance mailed on Aug. 12, 2013, 12 pages.
International Application No. PCT/US2011/052019, International Preliminary Report on Patentability mailed on Mar. 28, 2013, 6 pages.
International Application No. PCT/US2012/034970, International Preliminary Report on Patentability mailed on Nov. 21, 2013, 7 pages.
International Application No. PCT/US2012/036353, International Preliminary Report on Patentability mailed on Nov. 28, 2013, 6 pages.
Notice of Allowance for U.S. Appl. No. 12/548,187 dated Aug. 17, 2015, 18 pages.
Notice of Allowance for U.S. Appl. No. 13/107,742 dated Jul. 8, 2015, 9 pages.
Non-Final Office Actio for U.S. Appl. No. 14/037,072 dated Jul. 9, 2015, 12 pages.
Final Office Action for U.S. Appl. No. 13/830,502 dated Jun. 30, 2015, 25 pages.
Non-Final Office Action for U.S. Appl. No. 14/036,659 dated Aug. 13, 2015, 33 pages.
Non-Final Office Action for U.S. Appl. No. 13/830,759 dated Aug. 7, 2015, 23 pages.
International Preliminary Report on Patentability dated Jul. 29, 2015 for PCT/US2014/010920, 30 pages.
International Preliminary Report on Patentability dated Jul. 29, 2015 for PCT/US2014/039771, 24 pages.
SQL Tutorial-In, Tizag.com, http://web.archive.org/web/20090216215219/http://www.tizag.com/sgiTutorial/sqlin.php, Feb. 16, 2009, pp. 1-3.
U.S. Appl. No. 12/548,187, Final Office Action, mailed Jun. 10, 2013, 18 pages.
U.S. Appl. No. 12/548,222, Notice of Allowance, mailed Jul. 18, 2013, 12 pages.
U.S. Appl. No. 13/102,665, Final Office Action, mailed Jul. 9, 2013, 17 pages.
U.S. Appl. No. 13/107,742, Final Office Action, mailed Jul. 3, 2013, 19 pages.
Notice of Allowance for U.S. Appl. No. 11/977,437 dated Jul. 10, 2013, 10 pages.
Bottom-up parsing, Wikipedia, downloaded from: http://en.wikipedia.org/wiki/Bottom-up—parsing, Sep. 8, 2014, pp. 1-2.
Branch Predication, Wikipedia, downloaded from: http://en.wikipedia.org/wiki/Branch—predication, Sep. 8, 2014, pp. 1-4.
Microsoft Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, ©, 2002, pp. 238-239 and 529.
Notice of Allowance for U.S. Appl. No. 13/089,556 dated Oct. 6, 2014, 9 pages.
U.S. Appl. No. 12/396,464, Notice of Allowance mailed on Sep. 3, 2014, 7 pages.
U.S. Appl. No. 12/548,187, Advisory Action mailed on Sep. 26, 2014, 6 pages.
U.S. Appl. No. 12/548,281, Final Office Action mailed on Aug. 13, 2014, 19 pages.
U.S. Appl. No. 12/913,636, Non-Final Office Action mailed on Jul. 24, 2014, 22 pages.
U.S. Appl. No. 12/957,201, Non-Final Office Action mailed on Jul. 30, 2014, 12 pages.
U.S. Appl. No. 13/764,560, Non Final Office Action mailed on Sep. 12, 2014, 23 pages.
U.S. Appl. No. 13/770,969, Non Final Office Action mailed on Aug. 7, 2014, 9 pages.
U.S. Appl. No. 14/302,031, Non-Final Office Action mailed on Aug. 27, 2014, 19 pages.
Abadi et al., Aurora: a new model and architecture for data stream management, the VLDB Journal the International Journal on very large data bases, vol. 12, No. 2, Aug. 1, 2003, pp. 120-139.
Balkesen et al., Scalable Data Partitioning Techniques for Parallel Sliding Window Processing over Data Streams, 8th International Workshop on Data Management for Sensor Networks, Aug. 29, 2011, pp. 1-6.
Chandrasekaran et al., PSoup: a system for streaming queries over streaming data, The VLDB Journal, The International Journal on very large data bases, vol. 12, No. 2, Aug. 1, 2003, pp. 140-156.
Dewson, Beginning SQL Server 2008 for Developers: From Novice to Professional, A Press, Berkeley, CA, 2008, pp. 337-349 and 418-438.
Harish et al., Identifying robust plans through plan diagram reduction, PVLDB '08, Auckland, New Zealand, Aug. 23-28, 2008, pp. 1124-1140.
Krämer, Continuous Queries Over Data Streams—Semantics and Implementation, Fachbereich Mathematik und Informatik der Philipps-Universitat, Marburg, Germany, Retrieved from the Internet: URL:http://archiv.ub.uni-marburg.de/dissjz007/0671/pdfjdjk.pdf, Jan. 1, 2007; 313 pages.
International Application No. PCT/US2013/062047, International Search Report and Written Opinion mailed Jul. 16, 2014, 12 pages.
International Application No. PCT/US2013/062050, International Search Report & Written Opinion mailed on Jul. 2, 2014, 13 pages.
International Application No. PCT/US2013/062052, International Search Report & Written Opinion mailed on Jul. 3, 2014, 12 pages.
International Application No. PCT/US2013/073086, International Search Report mailed on Mar. 14, 2014.
International Application No. PCT/US2014/017061, International Search Report Report & Written Opinion mailed on Sep. 9, 2014, 12 pages.
Rao et al., Compiled Query Execution Engine using JVM, ICDE '06, Atlanta, GA, Apr. 3-7, 2006, 12 pages.
Ray data engineering workshops (ICDEW) 2011 IEEE 27th international conference on IEEE, Apr. 11, 2011, pp. 243-248.
Shah et al., Flux: an adaptive partitioning operator for continuous query systems, Proceedings of the 19th International Conference on Data Engineering, Mar. 5-8, 2003, pp. 25-36.
Stillger et al., LEO—DB2's LEarning Optimizer, Proc. of the VLDV, Roma, Italy, Sep. 2001, pp. 19-28.
Final Office Action for U.S. Appl. No. 13/177,748 dated Aug. 21, 2015, 24 pages.
“Data stream management system”, Wikipedia, downloaded from en.wikipedia.org/wiki/Data—stream—management—system on Sep. 23, 2015, pp. 1-5.
Josifovsky, Vanja, et al., “Querying XML Streams”, The VLDB Journal, vol. 14, © 2005, pp. 197-210.
Purvee, Edwin Ralph, “Optimizing SPARQLeR Using Short Circuit Evaluation of Filter Clauses”, Master of Science Thesis, Univ. of Georgia, Athens, GA, © 2009, 66 pages.
Weidong, Yang, et al., “LeoXSS: An Efficient XML Stream System for Processing Complex XPaths”, CIT 2006, Seoul, Korea, © 2006, 6 pages.
Non-Final Office Action for U.S. Appl. No. 14/036,500 dated Aug. 14, 2015, 26 pages.
Notice of Allowance for U.S. Appl. No. 13/830,129 dated Sep. 22, 2015, 9 pages.
Final Office Action for U.S. Appl. No. 13/770,961 dated Aug. 31, 2015, 28 pages.
Non-Final Office Action for U.S. Appl. No. 13/764,560 dated Oct. 6, 2015, 18 pages.
Non-Final Office Action for U.S. Appl. No. 14/621,098 dated Oct. 15, 2015, 21 pages.
Notice of Allowance for U.S. Appl. No. 14/692,674 dated Oct. 15, 2015, 10 pages.
Notice of Allowance for U.S. Appl. No. 14/037,171 dated Oct. 15, 2015, 14 pages.
Japan Patent Office office actions JPO patent application JP2013-529376 (Aug. 18, 2015).
U.S. Appl. No. 13/193,377, Notice of Allowance mailed Aug. 30, 2013, 19 pages.
Oracle Complex Event Processing Exalogic Performance Study, http://www.oracle.com/technetwork!middleware/complex-event-processing/overview/cepexalogicwhitepaperfinal-498043.pdf, Sep. 2011, pp. 1-16.
Babu et al., “Exploiting k-Constraints to Reduce Memory Overhead in Continuous Queries Over Data Streams”, ACM Transactions on Database Systems (TODS) vol. 29, Issue 3, Sep. 2004.
Tho et al. “Zero-latency data warehousing for heterogeneous data sources and continuous data streams,” 5th International Conference on Information Integrationand Web-based Applications Services (Sep. 2003) 12 pages.
“SQL Subqueries”—Dec. 3, 2011.
“Caching Data with SqiDataSource Control”—Jul. 4, 2011.
“SCD—Slowing Changing Dimensions in a Data Warehouse”—Aug. 7, 2011.
Non-Final Office Action for U.S. Appl. No. 13/838,259 dated Oct. 24, 2014, 21 pages.
Notice of Allowance for U.S. Appl. No. 13/102,665 dated Nov. 24, 2014, 9 pages.
Non-Final Office Action for U.S. Appl. No. 13/827,631 dated Nov. 13, 2014, 10 pages.
Non-Final Office Action for U.S. Appl. No. 13/827,987 dated Nov. 6, 2014, 9 pages.
Non-Final Office Action for U.S. Appl. No. 11/601,415 dated Oct. 6, 2014, 18 pages.
Non-Final Office Action for U.S. Appl. No. 14/077,230 dated Dec. 4, 2014, 30 pages.
Non-Final Office Action for U.S. Appl. No. 13/830,428 dated Dec. 5, 2014, 23 pages.
Non-Final Office Action for U.S. Appl. No. 13/830,502 dated Nov. 20, 2014, 25 pages.
Non-Final Office Action for U.S. Appl. No. 13/839,288 dated Dec. 4, 2014, 30 pages.
Non-Final Office Action for U.S. Appl. No. 14/079,538 dated Oct. 22, 2015, 34 pages.
Non-Final Office Action for U.S. Appl. No. 13/906,162 dated Oct. 28, 2015, 11 pages.
Notice of Allowance for U.S. Appl. No. 14/302,031 dated Nov. 3, 2015, 18 pages.
Final Office Action for U.S. Appl. No. 12/949,081 dated Nov. 17, 2015, 19 pages.
China Patent Office office actions for patent application CN201180053021.4 (Oct. 28, 2015).
Notice of Allowance for U.S. Appl. No. 12/913,636 dated Oct. 27, 2015, 22 pages.
Final Office Action for U.S. Appl. No. 13/830,378 dated Nov. 5, 2015, 28 pages.
Non-Final Office Action for U.S. Appl. No. 13/830,502 dated Dec. 11, 2015, 25 pages.
Non-Final Office Action for U.S. Appl. No. 11/601,415 dated Nov. 13, 2015, 18 pages.
China Patent Office office actions for patent application CN201280022008.7 (Dec. 3, 2015).
International Search Report and Written Opinion dated Dec. 15, 2015 for PCT/US2015/051268, 17 Pages.
“11 Oracle Event Processing NoSQL 1-20 Database Data Cartridge—Ilg Release 1 (11.1.1.7) 11,” Oracle Fusion Middleware CQL Language Reference for Oracle Event Processing 11g Release 1 (11.1.1.7), 4 pages (Sep. 25, 2013).
Oracle Event Processing Hadoop Data Cartridge—11g Release 1(11.1.1.7), Oracle Fusion Middleware CQL LanguageReference for Oracle Event Processing 11g Release 1 (11.1.1.7) 4 pages. (Sep. 25, 2013).
Liu “Hbase Con 2014: HBase Design Patterns @Yahoo!” (May 5, 2014), 20 pages.
Hasan et al. “Towards unified and native enrichment in event processing systems,” Proceedings of the 7th ACM international conference on Distributed event-based systems, pp. 171-182 (Jun. 29, 2013).
Katsov “In-Stream Big Data Processing : Highly Scalable Blog” 20 pages (Aug. 20, 2013).
Katsov “In-Stream Big Data Processing : Highly Scalable Blog” 19 pages (Aug. 29, 2014).
Final Office Action for U.S. Appl. 13/830,735 dated Dec. 21, 2015, 20 pages.
Notice of Allowance for U.S. Appl. 13/827,987 dated Jan. 4, 2016, 16 pages.
Notice of Allowance for U.S. Appl. 13/177,748 dated Jan. 6, 2016, 9 pages.
Non-Final Office Action for U.S. Appl. 13/830,428 dated Jan. 5, 2016, 25 pages.
Ghazal et al., Dynamic plan generation for parameterized queries, Jul. 2009, 7 pages.
Chaudhuri et al., Variance aware optimization of parameterized queries, Jun. 2010, 12 pages.
Seshadri et al., SmartCQL: Semantics to Handle Complex Queries over Data Streams, 2010, 5 pages.

Related Publications (1)

	Number	Date	Country
	20140095462 A1	Apr 2014	US

Provisional Applications (1)

	Number	Date	Country
	61707641	Sep 2012	US

Hybrid execution of continuous and scheduled queries

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

CPC

International Classifications

Disclaimer

Term Extension

Abstract