Patent Grant
9990401
In traditional database systems, data is stored in one or more databases usually in the form of tables. The stored data is then queried and manipulated using a data management language such as a structured query language (SQL). For example, a SQL query may be defined and executed to identify relevant data from the data stored in the database. A SQL query is thus executed on a finite set of data stored in the database. Further, when a SQL query is executed, it is executed once on the finite data set and produces a finite static result. Databases are thus best equipped to run queries over finite stored data sets.
A number of modern applications and systems however generate data in the form of continuous data or event streams instead of a finite data set. Examples of such applications include but are not limited to sensor data applications, financial tickers, network performance measuring tools (e.g. network monitoring and traffic management applications), clickstream analysis tools, automobile traffic monitoring, and the like. Such applications have given rise to a need for a new breed of applications that can process the data streams. For example, a temperature sensor may be configured to send out temperature readings.
Managing and processing data for these types of event stream-based applications involves building data management and querying capabilities with a strong temporal focus. A different kind of querying mechanism is needed that comprises long-running queries over continuous unbounded sets of data. While some vendors now offer product suites geared towards event streams processing, these product offerings still lack the processing flexibility required for handling today's events processing needs.
Methods and systems associated with processing events for continuous queries on archived relations may be provided. In some examples, a system may be provided, the system may include memory storing instructions and/or processors configured to access the memory and execute the instructions to at least identify a query that identifies at least a data object. The system may also execute the instructions to evaluate the query against historical data associated with the data object. Additionally, in some examples, the system may execute the instructions to register a listening service with the data object. Further, the system may also be configured to execute the instructions to evaluate the query based at least in part on the data object and the historical data. In some aspects, the listening service may be registered with the data object prior to evaluating the query against the historical data. The changes identified by the listening service may be processed after completion of evaluation of the query against the historical data.
Additionally, in some examples, the system may execute the instructions to receive a transaction identifier for at least a change identified by the listening service. The transaction identifier may include a monotonically increasing integer that increases for each change associated with the data object. Further, in some examples, the system may execute the instructions to compare the received transaction identifier with a highest transaction identifier associated with the historical data and/or process the change identified by the listening service only when the received transaction identifier is greater than the highest transaction identifier associated with the historical data. In some aspects, the data object manages a stream of incoming business event data. Additionally, the query may comprise a continuous query configured to process data of the stream via the data object. In some examples, the historical data may include business event data from the data stream at a time before initializing the query. The historical data associated with the data object may be stored in a storage system other than the data object. Further, the evaluation of the query against the historical data associated with the data object may be configured to initialize a query engine of the system.
Additionally, in some examples, a computer-readable memory may be provided. The memory may be configured to store instructions that cause one or more processors to receive a continuous query that identifies at least one of a data object associated with a stream of business event data or historical data associated with the stream of business event data. The instructions may also cause the processors to register a listening service with the data object. Additionally, in some examples, the instructions may cause the processors to evaluate the continuous query against the historical data associated with the data object after registration of the listening service with the data object. In some aspects, the instructions may also cause the processors to process changes identified by the listening service after completion of the evaluation of the continuous query against the historical data. Further, in some examples, the instructions may cause the one or more processors to evaluate the continuous query based at least in part on the data object and the processed changes identified by the listening service. The instructions may cause the one or more processors to receive a transaction identifier for at least a change identified by the listening service. The transaction identifier may include a monotonically increasing integer that increases for each change associated with the data object. In some aspects, the plurality of instructions may also include instructions that cause the one or more processors to compare the received transaction identifier with a highest transaction identifier associated with the historical data. Further, in some aspects, the plurality of instructions may also include instructions that cause the one or more processors to compare the received transaction identifier with a highest transaction identifier associated with the historical data.
Further, in some examples, a computer-implemented method may be provided. The method may be configured to register a listening service with the data object. Additionally, the method may be configured to receive a window size configured to identify a bounded range of the archived relation to process. The method may also be configured to evaluate the continuous query against the historical data associated with the data object. Additionally, in some aspects, the method may be configured to receive a transaction identifier for at least a change identified by the listening service. The method may also be configured to compare the received transaction identifier with a highest transaction identifier associated with the historical data. The method may also be configured to process the change identified by the listening service when the received transaction identifier is greater than the highest transaction identifier associated with the historical data and/or evaluate the continuous query based at least in part on the data object. In some aspects, the continuous query may be evaluated against the historical data after registration of the listening service with the data object. Additionally, in some aspects, the method may also be configured to process the changes identified by the listening service after completion of the evaluation of the continuous query against the historical data. Further, the method may also be configured to not process the change identified by the listening service when the received transaction identifier is less than the highest transaction identifier associated with the historical data or equal to the highest transaction identifier associated with the historical data.
The foregoing, together with other features and embodiments, will become more apparent upon referring to the following specification, claims, and accompanying 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.
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 continuous query language (CQL) queries (also referred to as “query statements”) with one or more archived relations, for example, including but not limited to, a CQL relation this may be non-empty when created, may be provided. For example, in some scenarios, a CQL relation may be defined by applying a window on a stream. In other words, a relation may be a bounded dataset. For example, given an event stream, a relation may be first be defined by a window that includes a particular number or set of elements of the stream (e.g., within the window). However, a relation may, in some cases, be created in an empty state. That is, the window may be defined; however no events may be included the relation. On the other hand, an archived relation may include event data upon creation. In some examples, an archiver or other data object may be responsible for managing the real-time data to be utilized in creation of the archived relation and/or may provide this data to an engine configured to generate or otherwise manage the archived relations.
Additionally, in some examples, mechanisms for supporting the CQL queries with archived relations may also enable configuration of particular data windows of the archived relations. These data windows may be configured, generated, managed, updated, and/or otherwise manipulated by a user, administrator, or other entity associated with the archived relation and/or event data (e.g., business event data) of a user. Further, in some examples, archived relations within continuous queries may be implemented in such a way as to avoid missing and/or double counting change notifications. For example, when a query is run, it may initially be run against a data object backing store to establish the current state of the query, and then listen for and process change notification from that data object. However, change notifications may be missed while a complex event process (CEP) implementing the query is running the initial query. Additionally, change notifications may also be double-counted if the change is already in the initial query. Yet, in some examples, missed and/or double-counting change notifications may be avoided by establishing a listener before the initial query and/or utilizing a transaction identifier (TID), a context identifier (CID), or other mechanism for managing change events.
In general, 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:
In the above stream, for stream element (<timestamp_N+1>, <ORCL,62>), the event is <ORCL,62> with attributes “stock_symbol” and “_tock 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.
As noted, a stream may be the principle source of data that CQL queries may act on. A stream S may be a bag (also referred to as a “multi-set”) of elements (s, T), where “s” is in the schema of S and “T” is in the time domain. Additionally, stream elements may be tuple-timestamp pairs, which can be represented as a sequence of timestamped tuple insertions. In other words, a stream may be a sequence of timestamped tuples. In some cases, there may be more than one tuple with the same timestamp. And, the tuples of an input stream may be requested to arrive at the system in order of increasing timestamps. Alternatively, a relation (also referred to as a “time varying relation,” and not to be confused with “relational data,” which may include data from a relational database) may be a mapping from the time domain to an unbounded bag of tuples of the schema R. In some examples, a relation may be an unordered, time-varying bag of tuples (i.e., an instantaneous relation). In some cases, at each instance of time, a relation may be a bounded set. It can also be represented as a sequence of timestamped tuples that may include insertions, deletes, and/or updates to capture the changing state of the relation. Similar to streams, a relation may have a fixed schema to which each tuple of the relation may conform. Further, as used herein, a continuous query may generally be capable of processing data of (i.e., queried against) a stream and/or a relation. Additionally, the relation may reference data of the stream.
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 therefore 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:
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 real-time event processing 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.
In some examples, the above concepts may be utilized to leverage the rich real-time and continuous event processing capabilities associated with complex event processing. Several features may be supported such as, but not limited to, archived relations. As such, in order to leverage such features (e.g., rich, real-time and continuous event processing), the system may be configured to transparently deal with startup state and runtime state of relational data. In other words, the system may be configured to manage a query that is non-empty at the instant of its creation (i.e., an archived relation).
In some examples, an archived relation may be utilized. As such, when a CQL engine sees a query that indicates that it is based on an archived relation; that archived relation may also indicate that there are certain entities it can call to query for historical context, for example. In some examples, a data definition language (DDL) may indicate annotations about the archived relation such as, but not limited to, how do to the query, what are the important columns in the table, and/or where to send the rest of the data. In some examples, once the query is constructed in the CQL engine (e.g., as a graph), the system may analyze the query graph. Additionally, in some aspects, there are certain operators that are stateful, like “distinct,” “group aggr,” “pattern,” and/or “group by.” However, stateless operators may just take input and send it to the parent, for example, down-stream operators. So, one approach is to store this entire table here. However, utilizing archived relations, the system may analyze the query graph and decide which of the lowest stateful operator that it can use to query the archive. In some examples, the system (or one or more computer-implemented methods) may retrieve the state at the lowest stateful operator reached while traversing the graph. For example, the query graph may be analyzed in a topological order from the source. Based at least in part on this first stateful operator, the CQL engine may then determine the optimal amount of data to be fetched in order to initialize the state of the operators for a query defined over an archived relation.
In at least one non-limiting example, source operators like relation and/or source may come first in the topological traversal with query output and/or root coming last. For example, if the CQL query looks like: select sum(c1) from R1 where c2>c25, the plan for this query may look like: RelationSource→SELECT→GroupAggr. Thus, following the topological order, and since RelationSource and SELECT are both stateless, the lowest stateful operator may be GroupAggr. In this way, the stateful operators of a query (GroupAggr in this example) may enable the query engine to populate the query engine with historical data from a data store prior to receiving streaming data. This may be enabled based at least in part on the fact that the query is analyzing an archived relation and the archived relation has been indicated as such.
In some examples, a window size for a given archive relation may be specified by a user. A window, in some aspects, in relation to an archived relation, may include a node in a query graph that analyzes or otherwise evaluates incoming streamed content. In other words, the window may define the amount of streamed content that me analyzed and/or processed by the query engine and/or the amount of historical data that will be included in the archived relation.
At a high level, once a window is applied on a Stream it becomes a Relation and then regular relational logic may be applied, as with relational databases. As tuples arrive and leave the window, the Relation under consideration changes with queries compiled against it emitting results at the same time. CQL may support RANGE (up to nanoseconds granularity), ROWS, PARTITION BY and extensible windows. These windows are examples of stream-to-relation operators. On the other hand, ISTREAM (i.e., insert stream), DSTREAM (i.e., delete stream) and RSTREAM (i.e., relation stream) are relation-to-stream operators. In some examples, a user, developer, and/or manager may set the window size (e.g., via a UI) provided by the query engine or one or more computing systems operating or hosting the query engine. In some examples, a window on a stream may be a time-based range window. For example, a configurable value window on an archived relation may be specified using window size and the attribute on which the window is calculated. When there is a configurable value window specified on top of archived relation, a snapshot query may be computed and the snapshot tuples which are within window limits may be output. Additionally, after state initialization, the value window may be applied on incoming active data. In some examples, only the incoming active data will be inserted into window whose window attribute's value is differing from current event time for less than the window size.
Additionally, in some examples, features of the present disclosure may also leverage the continuous query processing capabilities of the CQL engine and/or CEP engine to support real-time data analysis. In some aspects, the CQL engine and/or CEP engine may have traditionally been a stream-oriented analysis engine; however, it may be enhanced to support stream-oriented data that is backed by a durable store (e.g., the archived relation described above). For example, the present disclosure describes features that may support the notion of a data object (DO) which is a durable store (database and/or table). Modifications made to a DO may cause change notifications to be broadcast to interested listeners creating, in effect, a data stream. This data stream may be consumed by the CQL engine and/or CEP engine in support of any running queries; however, the CQL engine and/or CEP engine may not have been designed to take into account the existing data in the DO backing store. For example, the CQL engine and/or CEP engine may request that the initial state of the query running in the CQL engine and/or CEP engine reflect the current state of the DO including all the data currently in the DO backing store. Once this query is so initialized, the CQL engine and/or CEP engine only need to concern itself with the stream of DO change notifications from that point on in traditional stream-oriented style.
In some aspect, the CQL engine and/or CEP engine may traditionally process streams or non-archived relations, so there may be no initial state. For example, a query may be loaded, wherein it may start running and listening for changes, etc. In some cases, if a user asks for sales by state, in a bar chart, and then somebody makes a new sale, the table may get updated and the user may expect to see a change in the graph, pushed out to them. However, if they close the dashboard and come back a week later and bring up some sales, the user may expect to have the sum of sales according to the table of summed sales data. In other words, the query may need to bring the query up to the state of the archive and then listen for active changes.
In some aspects, for example, the CQL engine may be pre-initialized with the archived data. Once initialized, the CQL engine may listen to a Java Messaging Service (JMS) or other messenger for change notifications (e.g., based at least in part on API calls for inserting, deleting, etc., data from the archive). Thus, services can listen and if the JMS publishes on the same topic that the listening service is listening on, it may receive the data. The services don't have to know who is publishing or whether they are, or not. The listening service can just listen, and if something happens, the listening service may hear it. In some examples, this is how persistence is decoupled, for instance, from its consumers. Additionally, in some examples, an alert engine may raise alerts based on what the alert engine hears, potentially, and further, a SQL engine, that may be listening in on process queries of relevance to the listener.
In some examples, a query may be started in CQL, SQL, and/or CEP engine and instructions may be configured to get the archive data (e.g., to prime the pump) and then start listening to these JMS messages. However, with numerous inserts, deletes, etc., this could include a large amount of information. Additionally, there could be a lag time before the message is heard by the listener and the listening may, in some examples, jump in, query the archive, come back, and start listening. Thus, there is a potential for missing and/or double counting an event.
Additionally, if the engine merely runs the query, while it's running the query things can go into JMS and be published where the engine wasn't listening. So, the engine may be configured to setup the listener first, run the archive query, and then come back and actually start pulling out of the queue, so that it doesn't miss anything. Thus, the JMS may queue things up and, if things back up it's okay while the engine is doing a query because it can catch up later and it doesn't have to worry about whether it's synchronous. If it's not here, listening, it won't miss it, it just gets queued until the engine comes back, as long as it has its listener established.
Additionally, in some examples, a system column may be added to a user's data. This system column may be for indicating transaction IDs to attempt to handle the double counting and/or missing operation problem. However, in other examples, the system may provide or otherwise generate a transaction context table. Additionally, there may be two additional columns TRANSACTION_CID and TRANSACTION_TID. The context table may always be maintained by persistence service so as to know thread (context) wise of the last committed transaction ID. The transaction IDs may be guaranteed to be committed in ascending order for a thread (context). For example, when a server comes up, it may run the persistence service. Each one may allocate a set of context IDs and transaction IDs for determining whether data of the pre-initialized information includes all of the data that has passed through the JMS. Additionally, in some cases, multiple output servers may be utilized (in compliance with JTA and/or to implement high availability (HA), wherein each server may manage a single set of context/transaction tables that are completely separate from the other tables managed by the other servers.
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.
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 management of archived relations, configurable data windows associated with archived relations, and/or accurately counting change events associated with managing archived relations 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 an archived relation module 148, a configurable window module 150, and/or an event counting module 152. 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 archived relation module 148 may be configured to, receive, identify, generate, or otherwise provide one or more archived relations 154 that may include reference to one or more event stream entries s1, s2, . . . , sN. For example, an archived relation may be defined by applying a window on at the stream including these entries (i.e., s1 through sN). As such, the archived relation may be the bounded dataset including these entries. However, the entries may be non-empty upon generation including, but not limited to, having one or more of the entries (e.g., s1 and/or s2, more entries, or less) of the relation pre-loaded from Persistence or some other database of historical data. As such, these pre-loaded entries may include the historical data, and the remainder of the relation may include incoming streaming data. In some examples, the archived relation 154 may first be identified as {s3, s4}. However, when the window moves from w1 to w2, the archived relation 154 may be identified as {s4, s5} and may have been changed by a delete of s3 and/or an insert of s5.
As noted above, an archived relation 154 may be a CQL relation that is (possibly) non-empty at the “instant” of its creation. This is in contrast with a “normal” CQL relations which have empty contents at the “instant” when they are created. In some examples, it is imagined as if the contents of the archived relation 154 as of the instant of its creation existed from the “beginning of time” (Long.MIN_VALUE). In the BEAM context, it is useful to note that the objects (in some examples, all the objects) of a CQL engine 156 may be created every time on server startup. In some respects, an archived relation 154 may be similar to a “normal” CQL internal relation. In particular, operations (Relation-to-Relation operations like JOIN, GROUP AGGR, ORDER BY TOP N as well as Relation-to-Stream operations like I/D/RSTREAM) may retain the same semantics as they have over “normal” CQL internal relations. Additionally, in some examples, an “archiver” may be a Java class that implements a specific contract with the CQL engine 156. It may implement the IArchiver interface or some other interface capable of enabling an archiver. This “archiver” along with the identity of the logical entity managed by the “archiver” that corresponds to the archived relation 154 (for example, the name of the Data Object) may be specified as part of the DDL statement used to create the archived relation 154.
In some aspects, the archiver may be implemented based at least in part on a contract with the CQL engine 156 to at least provide the contents of an archived relation 154 at the time of its creation. Additionally, the archiver may be expected to maintain the “time-varying” contents of the archived relation 154 on its own (e.g., external to the CQL engine 156). However, in some examples, the archiver may be stateless. In this example, the archiver may implement a method (e.g., “execute( )”) that executes the query handed to it by the archived relation framework. The archiver may then give the contents back to the archived relation framework once the method is executed. The archiver may also be configured to provide querying capabilities on the archived relation 154 (e.g., expressed as an SQL-99 query). Additionally, in some examples, FROM clause item(s) in the query presented to the “archiver” may be the name of the “archiver” entity and/or the name of the DataObject (e.g., maintained on the durable store). When the FROM clause items are the DataObject names, they may be mapped to the archived relation in the creation DDL. Additionally, or alternatively, the archiver name may be used to lookup the archiver instance (there could be more than one archiver) and then call execute(query) on that archiver instance. The attribute names used in the query may be the column names specified in a CREATE ARCHIVED RELATION DDL or other appropriate DDL, as desired. While executing a query, the “archiver” may run the query on a snapshot of the Data Object(s) that contains committed changes as of t×n T_n where T_n is not earlier than the latest transaction for which events for the Data Object have been presented as streaming input. In particular, there may have been no streaming Data Object events that have been provided as input corresponding to “later” transactions.
Further, the “archiver” may return the ID of the transaction as of which this query was executed. This ID may be a monotonically increasing number (not necessarily contiguous) such that later transactions have larger IDs as compared to earlier transactions. For UPDATE events, the “archiver” may provide as part of the streaming event, the OLD as well as the NEW values. Additionally, or alternatively, in some examples, a persistence service may send the change notifications with both OLD and NEW values to the CQ Service. In this way, the CQ Service may be able to perform the appropriate operations on the archived relations. For DELETE events, the “archiver” may provide the DELETE event as a streaming event if (in some examples, “if and only if”) it passes validation (i.e., it matches with an existing Data Object record). In some examples, the functionality of the archiver may enable a scenario where there are no Data Object events that the query does not process. The CQL engine 156 may also enable a scenario where no duplicate events are processed by skipping the processing of all Data Object events with transaction identifiers<=the transaction identifier returned by the “archiver” as part of executing a “Snapshot” query. In some examples, the archiver may be comparable to a Persistence Serivce. Alternatively, or in addition, snapshot information at the querying instant may also be derived from the transaction context table. This snapshot information may be maintained in the CQL Engine and a snapshotID (increasing identifier) may be associated with it. The same may be set in the input queues of some selected operators in that query's plan. These are called ‘connector’ operators and they may represent the place at which a local query plan may join the global (overall) query plan. When an event arrives in CQL Engine, a snapshotID may be computed for that event using the context ID and transaction ID values in it. The snapshotID may be computed using the snapshot information maintained in CQL Engine. The snapshotID of the event may then be compared with the snapshotID of the input queue. If the ID in the event >ID in the queue then it may be processed otherwise it may have already been accounted for before and may therefore ignored to avoid double-counting.
The introduction of the archived relation 154 as a native CQL concept enables the CQL engine 156 to determine the optimal amount of data to be fetched in order to initialize the state of the operators for a query defined over the archived relation 154. In some examples, as the final step of query compilation, following the query plan generation (and/or merging with the global plan) a state initialization phase may be introduced to determine an optimal set of queries to be run against the “archiver” (e.g., for the purposes of operator state initialization). In some cases, the state initialization algorithm that is used to determine a set of queries (e.g., an optimal set) may defer materialization of state up the operator chain until a stateful operator is encountered (which aggregates data and hence may retrieve less data as compared to materialization of all details/facts in memory). The first step in query execution, even before the state initialization queries are run, may be the execution of a snapshot query and/or the delivery of the results to the client. In some examples, the snapshot query (also referred to as the “archiver query”) may be part of the state initialization where the operators may be initialized with the contents of the results. These results may then be propagated to downstream operators (e.g., all downstream operators), thus outputting the result. The queries determined by the state initialization algorithm may then be run next. At the end of this first step, all the operators may have their state appropriately initialized and the query may be ready to process the streaming events.
When a CQL query refers an archived relation 154, during system restart, the CQL engine 156 may be configure to enable a scenario where the states of execution operators in the query are initialized to the values that they had prior to a shutdown. Alternatively, or in addition, each time a query is (re)started, whether as part of shutdown or voluntarily, the query may issue a fresh or new archiver query to initialize state again. In some examples, this may be different at time t0+delta than it was at t0. In some cases, a state initialization algorithm may be configured to handle this functionality. In some examples, each (or every) archived relation 154 may map to an archiver object that keeps track of the events forming the relation and may be able to answer the SQL queries (similar to a database table) issued to it. Additionally, initializing the state of an execution operator in a CQL query may a two-step process, including at least: issuing an appropriate SQL query to the archiver that maps to the archived relation 154 on which the CQL query depends; and use the returned results to initialize the state of the operator. Deferring materialization of the events (obtained from the archiver) may result in lesser memory and/or processing time consumption. Additionally, or in the alternative, memory savings may be due to finding the appropriate operators that minimize the memory. For example, aggregated/summarized data may be brought into memory, resulting in significant memory savings.
In some examples, the state initialization process (which may be one step in the overall process, and may be implemented when a CQL query is started and is referring an archived relation(s)) may include: obtaining a logical plan for the query using the metadata object, constructing a physical plan form the logical plan, optimizing the local physical plan using an optimizer, sharing operating to get a global physical plan, adding auxiliary structures (e.g., synopsis, store, queue, etc.), and instantiating the query (e.g., constructing execution operators and/or supporting execution structures). Additionally, the appropriate location from where to call the state initialization algorithm may be right after the local physical plan optimization. In some examples, the state initialization algorithm may only be called when the query depends on or more archived relations 154.
In some examples, given binary operators, children operators may be marked as query operators. Also if after traversing the entire query plan, no query operator is identified, the root may be marked as the query operator. Once the operators are identified as query operators, during the instantiation phase if the is QueryOperator flag is set then a method to execute the constructed archiver query would be called from the Operator Factory code. The returned result set may then be converted into a set of tuples and the list may be set in the execution operator instance. In this way, upon instantiation execution operators that need a state may have a list of tuples that may be sufficient for initializing its state. Upon instantiation, one more pass may be made over the query plan in topological order in which a method that would use these tuples to initialize state and propagate it downstream may be called. This method may be operator-specific and/or the initialization processing may be similar to populating synopsis, maintaining internal data-structures, and so on.
In some examples, the following CQL query on top of a “sales” archived relation 154 may be implemented:
In some examples, the query plan when compiled in the CQL engine 156 may described as:
In some examples, when the CQL engine 156 compiles the aforementioned query, it may determine that the query is expressed against a relation (e.g., the archived relation 154) whose state at startup is available externally and could potentially be large. There may be a set of operators in CQL that are stateful (e.g., GROUP BY, PATTERN) while others (e.g., FILTER, PROJECT, OUTPUT) may not be stateful. The state initialization algorithm may work as follows for the scenario in consideration: a REL_SOURCE operator may skip calling the archiver since it is stateless for archived relations. Next up is FILTER, which may also be stateless so it may skip calling the archiver for state too. Next, the GROUP BY operator may encountered, and it may invoke the archiver to fill up its state using the following SQL query (as desired, the archiver query may be a SQL query formed by using a sub-query based approach and may be more complicated than the following):
Note that even though the user's query may not include the COUNT aggregate, the GROUP BY may issue a SQL query that has a COUNT aggregate. This may be because this piece of information may be requested by the GROUP BY operator (as part of its state) to determine whether a group (corresponding to a “productid” in this example) becomes empty so that it can release any resources (like memory) that it might be using related to the group.
Now, considering the situation where a −ve tuple arrives. In the above scenario REL_SOURCE may not maintain any state so it may let the next operator in the chain decide (rather than throw an exception as it might for a “regular” CQL relation). The FILTER operator also may not maintain any state, and it may do the same. Next, the GROUP BY operator may see the tuple. Since its state has been initialized it may be able to successfully locate the corresponding group and proceed with the rest of the processing. For example, if it is a tuple with region=“APAC” and productid=“Mobile Phones,” the SUM aggregation function may reduce the running total for “Mobile Phones” by the amount present in the tuple.
In some examples, the following CQL query on top of a “sales” archived relation 154 may be implemented for determining the median as opposed to sum, in the above example:
In some examples, the query plan when compiled in the CQL engine 156 may described as:
In some examples, the state initialization algorithm works as follows for the scenario in consideration. The REL_SOURCE operator may skip calling the archiver since it may be stateless for archived relations. Next up is FILTER, which may also be stateless so it may skip calling the archiver for state too. Next, the GROUP BY operator may be encountered. This operator may be stateful and thus may request state initialization. Here the query involves at least one holistic function (MEDIAN), so it is may not be sufficient to bring aggregated/summary state from the database. The entire set of values over which the MEDIAN is to be calculated may be requested for the GROUP BY state.
Thus, at this stage, having identified the lowest stateful operator and determined that more detail may be requested to make up its state, the operator plan may be traversed in the opposite direction (i.e., “down”). That is, the plan may be traversed from the top down from this stage on. In some examples, the responsibility to construct the state will fall on the next operator down the tree, which in this case may be FILTER and it may issue the following SQL query (to the “archiver”) that may bring the requested set of values into memory:
In some examples, once these tuples are retrieved, the FILTER may propagate these values upstream and the GROUP BY may build its state by constructing a tree or graph (e.g., but not limited to, an Augmented Red-Black tree or the like). This data structure may enable very fast subsequent (O(log n)time) incremental MEDIAN calculation. In some examples, if the FILTER were absent in the above query, the responsibility to construct state may have fallen on the REL_SOURCE operator and the entire contents of the relation (as an optimization, only the relevant fields accessed by the query would be retrieved for each row as opposed to the entire row. Of course, if all fields are accessed, the entire row would be fetched) may have been brought into memory.
In some aspects, for handling minus events reaching a query based on an archived relation 154, additional support may be useful. Some of the CQL Engine 156 operators like Project, Binary operator like join maintain a lineage synopsis. The lookup in this lineage synopsis is based on a TupleId. When a PLUS tuple comes it may be inserted into the synopsis. When a MINUS tuple comes to that operator we look up the lineage synopsis which happens on the tupleId. The problem that can come in the context of an archived relation 154 is as follows:
As such, a BEAM Persistence layer may assign an event ID to each event and INSERT (PLUS), DELETE (MINUS), and UPDATE notifications of an event may all have the same value of this ID. This facility may be utilized to avoid the problem mentioned above. Thus, one more clause may be added to the archived relation 154 DDL to specify an EVENT IDENTIFIER clause. This may be a column of type CQL bigint and this column may have the same value for plus, minus, and update tuples for an event
In some cases, within the CQL Engine 156, the column specified in the EVENT IDENTIFIER clause may be utilized. For example, when the archiver is queried, this field is may be forced to be present in the SELECT list and use the values of this field to set the tupleId while converting the records into tuples. Also when a normal input event comes (e.g., when the query is running) the value in this field may be assigned as the tupleId while converting the TupleValue into ITuple in the Relation Source code. This may enable a configuration for ensuring that PLUS and MINUS of an event have the same tuple ID.
In some examples, the following syntax may be utilized for an archived relation DDL:
This DDL to create the Archived Relation may be invisible to the end users and also also other components. For example, the creation of the archived relation may be handled “under the covers” by the CQL processor code when the EPN contains the Data Object node connected to a CQL processor node. For example, consider the following EPN:
(SalesDataObjectNode for SALES_DO)→(SalesDataObjectChannel)→(CQL Processor)
This EPN code may use the field names of the Data Object as the column names of the archived relation that it creates in the CQL engine 156 thereby ensuring that the names of the fields and the order of the fields match.
Additionally, in some examples, archived streams may be enabled via the CQL engine 156 and/or other engines. Conceptually, an archived stream may be very similar to the Archived Relations feature. But owing to the semantic difference between a stream and a relation, certain changes may be made to the design and syntax of the archived stream as compared to the archived relation feature. For example, relation contents may undergo changes when additions, updates, or deletions occur. As such, the contents can grow or shrink in size with time. However, for a stream, by definition, updates and deletions are not possible. So the stream size may only keep increasing. Thus, the size of the past contents of a stream may be prohibitively large and most of the times a user would be interested in only a subset of the immediate past maintained by the archiver.
As such, the following syntax may be utilized for an archived stream DDL:
Here, the ARCHIVER and ENTITY clause may have the same meaning as with the archived relation 154. However, the EVENT IDENTIFIER clause may not needed since it is generally only for handling MINUS events which cannot come as input for a stream. Additionally, the REPLAY LAST clause may allow a user to specify the part of the immediate past that is of interest. The user can specify it either as a time range or in terms of number of rows. So, for example, the REPLAY clause can be REPLAY LAST 30 MINUTES (in which case the records that have arrived in the past 30 minutes may be fetched from the archiver) or REPLAY LAST 50 ROWS (in which case latest 50 records ordered by arrival time may be fetched from the archiver).
The TIMESTAMP COLUMN clause may be utilized for identification of records that may be returned while querying the archiver. This may be used in the WHERE clause of the archiver query that determines the records that are part of the result set of the archiver query. The values in this column may also be utilized while assigning the timestamp to the tuples (which may be obtained by querying the archiver) inside the CQL Engine 156. This column name could be the name of the column in the DO that has the creation timestamps assigned by BEAM persistence.
Additionally, in some examples, the configuration window module 150 may be configured to generate, receive, and/or determine a window size 158 for configuring one or morean archived relation 154 of the CQL engine 156. However, in some examples, defining different windows over an archived relation may not create separate archived relation instances. Instead, when a window is applied, there be only a single archived relation instance, and the window may determine the data in that archived relation which is of “interest” for that particular query. As noted above, the window size 158 may configure the size of the window w1, w2, and/or wN of the archived relation 154. In this way, the user may have control of the window size and may designate the size based at least in part on information associated with the business event data and/or personal concerns, business goals, and/or other factors, as desired.
Further, in some examples, the event counting module 152 may be configured to implement one or more listening services 160 within the CQL engine 156 or other engine configured to enable correct counting of change events within a stream or archived relation 154. As discussed briefly, when a continuous query 162 indicates a dependency on a stream and/or archived relation 164 managed by the CQL engine 156, the CQL engine 156 may implement the listening service 160. In at least some examples, the timing of the implementation of the listening service may determine whether or not change events in the stream/relation 164 are counted correctly. Additionally, as noted, in some examples, the continuous query 162 may be configured to initialize data of the archived relation 164 by querying against a data store 166 of historical and/or warehouse data.
In some examples, when a query is run in the CQL engine 156 it may initially run the query against the a DataObject backing store to establish the current state of the DataObject and then listen for and process change notifications from that DataObject. This creates two problems: change notifications may be missed while the CQL engine 156 is running the initial query; change notifications might be double-counted if the change is already in the initial query.
Missing change notifications can be eliminated by establishing the change notification listener before the initial query is started but not processing them until the archiver query execution is complete and/or the state initialization is done. These change notifications may be buffered in the messaging service (JMS) until the CQL engine 156 is ready to process them. In some cases, eliminating double-counting of change notifications may be performed by supplying additional information to a Persistence Service to allow the CQL engine 156 to determine which change notifications are included in the initial query result and which are not.
In some examples, an additional column may be added (e.g. DATAOBJECT_ID) to each DataObject that contains the transaction ID of the last transaction to affect that DataObject instance (row). However, in other examples, no additional column is added and, instead, a transaction context may be utilized. This transaction ID may be an internal BEAM artifact not to be confused with any other transaction mechanism such as JTA. This transaction ID may, in some examples, be a monotonically increasing integer. Some (or all) DataObject instances (e.g., rows) modified by the same JTA transaction may be tagged with the same transaction ID. Additionally, transaction IDs may be committed in ascending order. This same column may be included in DataObject change notifications. Given the above, if a query includes MAX(DATAOBJECT_TID), then the highest transaction ID present in our query result may be known. As such, the transaction ID value in any change notifications may be compared against the highest value because a value less than or equal may be ignored (i.e., because it may already be counted) and a value greater than may be processed (i.e., because it may not yet be counted).
However, in some cases, in order to have transaction IDs committed in ascending order, the DataObject transactions may be serialized. Yet, this may have a detrimental affect on concurrency. Still, concurrency may be increased by introducing the notation of a context ID. In some examples, each context ID may maintain its own transaction ID. Exclusive access to a BEAM context may then be acquired by JTA transactions that perform operations against BEAM DataObjects. This same BEAM context may then be used for operations (e.g., all operations) performed by that JTA transaction and ultimately released upon commit or rollback of the JTA transaction. This may allow processing to proceed in parallel across BEAM contexts. The level of concurrency may then be proportionate to the allocation of BEAM contexts. An additional column (DATAOBJECT_CID) can be added to each DataObject to hold the ID of the last context to modify that DataObject instance (row). However, in other examples, no additional column is added and, instead, a transaction context may be utilized. Context IDs, like transaction IDs, may also be included in DataObject change notifications. Yet, this may change the requirements on the query side in that one may need to obtain the MAX(DATAOBJECT_TID) for context IDs in order to eliminate double-counting.
In some examples, the same level of concurrency can be achieved without adding additional columns to the DataObject if the notion of a Transaction Context entity is introduced. A new Java class and associated JPA entity may then be created to maintain the state of context IDs in the database. The transaction context entity may contain a context ID and its associated (highest, last used) transaction ID. The context ID may be generated as a sequence and may be the primary key for the entity.
When a Persistence Service is initialized it may create a configured number of transaction context instances. These transaction context instances may be for the sole use of that Persistence Service. If another Persistence Service is initialized on another Server, it too may create a configured number of transaction context instances. In this fashion each Persistence Service may be guaranteed to have a unique set of contexts. The Persistence Service may create instances of transaction context and may persist them via JPA. Since this is a sequenced entity and the sequence is the context ID the transaction context instances created may be automatically unique. Each transaction context created may get the next sequence number. When a Persistence Service is shutdown it may delete the transaction context instances that it created. In some cases, this may remove them from the database.
In some examples, DataObject operations (e.g., all or some DataObject operations) may ultimately be made through an EJB method (e.g., called processDataObjectOperations). This method may take a collection of DataObjectOperations of which there is a derivation for insert, update, upsert, and/or delete. Each DataObjectOperations may specify a target DataObject by name, a particular operation, and the required data for that operation. The DataObjectOperations can contain any combination of DataObjectOperation targeting and/or any number of DataObjects. The DataObjectOperation may be executed in the order in which they were added to the DataObjectOperations. The processDataObjectOperations method may be defined as TransactionAttributeType.REQUIRED which means that if called within a JTA transaction, it may participate in that transaction. However, if called outside a JTA transaction, the application server may start a JTA transaction for the duration of the method call. In some instances, this means that processDataObjectOperations may always be operating within a JTA transaction. Additionally, all or some operations against a DataObject may occur within a JTA transaction.
In some examples, eliminating double counting of change events may be enabled by the following operations (which may be performed in any appropriate order, as desired. For example, when processDataObjectOperations are called (while the following operations are numbered, these numbers are merely to aid in explanation and shall not limit the set of operations to any particular order or to any operation being required):
In some example, when executing a query to obtain the initial state from the DataObject backing store they query may be executed atomically to also include UNION in the transaction context table. In this fashion query results plus the highest committed transaction ID for each BEAM context for all the data in our query result may be received. The transaction context information allows any DataObject change notifications to be checked to eliminate double-counting by checking the IDs in the change notification against the IDs in the transaction context table. Alternatively, or in addition, snapshot information at the querying instant may also be derived from the transaction context table. This snapshot information may be maintained in the CQL Engine and a snapshotID (increasing identifier) may be associated with it. The same may be set in the input queues of some selected operators in that query's plan. These are called ‘connector’ operators and they may represent the place at which a local query plan may join the global (overall) query plan. When an event arrives in CQL Engine, a snapshotID may be computed for that event using the context ID and transaction ID values in it. The snapshotID may be computed using the snapshot information maintained in CQL Engine. The snapshotID of the event may then be compared with the snapshotID of the input queue. If the ID in the event >ID in the queue then it may be processed otherwise it may have already been accounted for before and may therefore ignored to avoid double-counting.
In some examples, the persistence layer may supply a context ID (worker identifier) and a transaction ID (transaction identifier) with each change event notification and/or the persistence layer may maintain the transaction context table. Additionally, at query start time, the CQL Engine may query the ‘snapshot’ information (worker identifier, transaction identifier pairs) from the transaction context table and associate an increasing snapshot ID with it. The CQL Engine may also set the snapshot ID at the input queue of the “connector” operator at start time. Additionally, at query run time, the CQL Engine may use the worker identifier and/or transaction identifier fields in the input event and the maintained “snapshot” information to compute a Snapshot Id for each input event. At query runtime, the CQL Engine may also compare the snapshot ID of the input event and the one set in the input queue (at query start) to decide whether to process or ignore an event. The following is an example of general form of a DDL for worker and transaction ID clauses:
In some examples, an Archiver may be maintained by the CQ Service; an Entity may be the name of the Data Object as a quoted string; the Event ID may be a column of type long which may act as a unique event ID column for this relation; the Worker ID may be a column of type long which may map to the context ID column in persistence generated change notification; and the Transaction ID may be a column of type long which may map to the transaction ID column in persistence generated change notification. The following is an example implementation:
Similarly, in some examples, these two clauses may be added after a REPLAY clause for archived streams.
As previously mentioned, there may be no need to actually tag each DataObject instance with the last context and transaction ID that modified it. In some examples, this information can be received instead from the transaction context entity. One way to accomplish this, as stated previously, is to atomically query both the desired data from the DataObject(s) as well as the contents of the transaction context entity. For atomicity, this may be performed using only one query. For example, using the UNION clause which allows the resultset from two disparate queries to be appended in a single query. In some examples, the DataObject(s) and/or the Persistence service described above may be embodied by the data store 166 of
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.
In one embodiment, EPS 302 may be implemented as a Java server comprising a lightweight Java application container, such as one based upon Equinox OSGi, with shared services. In some embodiments, EPS 302 may support ultra-high throughput and microsecond latency for processing events, for example, by using JRockit Real Time. EPS 302 may also provide a development platform (e.g., a complete real time end-to-end Java Event-Driven Architecture (EDA) development platform) including tools (e.g., Oracle CEP Visualizer and Oracle CEP IDE) for developing event processing applications.
An event processing application is configured to listen to one or more input event streams, execute logic (e.g., a query) for selecting one or more notable events from the one or more input event streams, and output the selected notable events to one or more event sources via one or more output event streams.
Although event processing application 320 in
Due to its unbounded nature, the amount of data that is received via an event stream is generally very large. Consequently, it is generally impractical and undesirable to store or archive all the data for querying purposes. The processing of event streams requires processing of the events in real time as the events are received by EPS 302 without having to store all the received events data. Accordingly, EPS 302 provides a special querying mechanism that enables processing of events to be performed as the events are received by EPS 302 without having to store all the received events.
Event-driven applications are rule-driven and these rules may be expressed in the form of continuous queries that are used to process input streams. A continuous query may comprise instructions (e.g., business logic) that identify the processing to be performed for received events including what events are to be selected as notable events and output as results of the query processing. Continuous queries may be persisted to a data store and used for processing input streams of events and generating output streams of events. Continuous queries typically perform filtering and aggregation functions to discover and extract notable events from the input event streams. As a result, the number of outbound events in an output event stream is generally much lower than the number of events in the input event stream from which the events are selected.
Unlike a SQL query that is run once on a finite data set, a continuous query that has been registered by an application with EPS 302 for a particular event stream may be executed each time that an event is received in that event stream. As part of the continuous query execution, EPS 302 evaluates the received event based upon instructions specified by the continuous query to determine whether one or more events are to be selected as notable events, and output as a result of the continuous query execution.
The continuous query may be programmed using different languages. In certain embodiments, continuous queries may be configured using the CQL provided by Oracle Corporation and used by Oracle's Complex Events Processing (CEP) product offerings. Oracle's CQL is a declarative language that can be used to program queries (referred to as CQL queries) that can be executed against event streams. In certain embodiments, CQL is based upon SQL with added constructs that support processing of streaming events data.
In one embodiment, an event processing application may be composed of the following component types:
(1) One or more adapters that interface directly to the input and output stream and relation sources and sinks Adapters are configured to understand the input and output stream protocol, and are responsible for converting the event data into a normalized form that can be queried by an application processor. Adapters may forward the normalized event data into channels or output streams and relation sinks Event adapters may be defined for a variety of data sources and sinks.
(2) One or more channels that act as event processing endpoints. Among other things, channels are responsible for queuing event data until the event processing agent can act upon it.
(3) One or more application processors (or event processing agents) are configured to consume normalized event data from a channel, process it using queries to select notable events, and forward (or copy) the selected notable events to an output channel.
(4) One or more beans are configured to listen to the output channel, and are triggered by the insertion of a new event into the output channel. In some embodiments, this user code is a plain-old-Java-object (POJO). The user application can make use of a set of external services, such as JMS, Web services, and file writers, to forward the generated events to external event sinks.
(5) Event beans may be registered to listen to the output channel, and are triggered by the insertion of a new event into the output channel. In some embodiments, this user code may use the Oracle CEP event bean API so that the bean can be managed by Oracle CEP.
In one embodiment, an event adapter provides event data to an input channel. The input channel is connected to a CQL processor associated with one or more CQL queries that operate on the events offered by the input channel. The CQL processor is connected to an output channel to which query results are written.
In some embodiments, an assembly file may be provided for an event processing application describing the various components of the event processing application, how the components are connected together, event types processed by the application. Separate files may be provided for specifying the continuous query or business logic for selection of events.
It should be appreciated that system 300 depicted in
The one or more of the components depicted in
Alternatively, or in addition, in some examples, the query graph 402 (also referred to as a plan) may be traversed in topological order starting from the source (here, the Relational Source operator 408). As such, in this example, the traversal may be in a bottom up fashion. In this traversing when the first stateful operator is reached, it may be marked as query operator and then the graph 402 may not need to be traversed further in that branch. Note that for some CQL queries like aggregate distinct, the query plan may have more than one branch. In the current example, Relational Source 408 may be stateless so the traversal may move up and see Group By 406. Since Group By 406 may be stateful it may be marked as the query operator. As such, the traversal may be complete, and may not need to go up to the Project operator 404 since Group By 406 would query the archiver, populate its state, and also propagate the snapshot output to Project 404, and further to downstream operators if any.
In one non-limiting example, if a second Persistence Service started at this point, that also created 10 context instances for its own use, the Table 02 may illustrate 10 new entries with TRANSACTION_CID values of 11-20. Now that the Persistence Service is running a DataObject named “Alpha” containing one of each of the DataObject column data types may be created. In some examples, whenever a DataObject is created the Persistence Service may create a corresponding database View representing the persistent store for that DataObject. In one example, once the DataObject is generated, insert commands may be performed against it. In order to best illustrate the processing of context and transaction IDs, two insert operations per thread using 12 threads for a total of 24 inserts may be performed. Each thread may start a JTA transaction, perform one insert operation, perform a second insert operation and then commit the transaction. The reason for using multiple threads is that it may create multiple JTA transactions executing in parallel which will better illustrate how the context ID comes into play. This also demonstrates the scenario where multiple (two per thread in this example) DataObject operation method calls are made within the same JTA transaction and where that JTA transaction was started and committed outside of Persistence.
For this example, 12 threads may be running the code simultaneously. Each thread may start a transaction outside of the server, make two insert calls to Persistence and then commit the transaction. Since Persistence has allocated 10 context IDs, 10 of these threads may obtain a context while 2 may initially be blocked. Two JTA transactions may be blocked until another JTA transaction completes and releases the context. The blocked JTA transaction may then grab the released context and process the Persistence API call. In some examples, after the insert operations are completed an examination of the Table 504 (after insert) shows this very result. Transaction contexts 1 and 2 show transaction ID 2 as the “last committed” transaction IDs while all other transaction contexts show transaction ID 1 as their last committed transaction.
In some examples, DataObject change notifications may be broadcast via JMS as a result of the insert operations performed in this example. Remember, two inserts were performed per JTA transaction and 12 transactions were executed for a total of 24 insert operations. Transaction contexts 1 and 2 were used for two transactions each so we should see 4 change notifications from contexts 1 and 2 having transaction ID 1 for two inserts and transaction ID 2 for the other two inserts. All other contexts were used for only one transaction and should have generated two inserts both with transaction ID 1.
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 the archived relation module 148) shown in at least
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 the configurable window module 150) shown in at least
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 the event counting module 152) shown in at least
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
Client computing devices 1502, 1504, 1506, 1508 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 1502, 1504, 1506, and 1508 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 1510 described below). Although exemplary system environment 1500 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 1512.
System environment 1500 may include networks 1510. Networks 1510 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 1510 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 1500 also includes one or more server computers 1512 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 1512 may be adapted to run one or more services or software applications described in the foregoing disclosure. For example, server 1512 may correspond to a server for performing processing described above according to an embodiment of the present disclosure.
Server 1512 may run an operating system including any of those discussed above, as well as any commercially available server operating system. Server 1512 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 1500 may also include one or more databases 1514, 1516. Databases 1514, 1516 may reside in a variety of locations. By way of example, one or more of databases 1514, 1516 may reside on a non-transitory storage medium local to (and/or resident in) server 1512. Alternatively, databases 1514, 1516 may be remote from server 1512, and in communication with server 1512 via a network-based or dedicated connection. In one set of embodiments, databases 1514, 1516 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 1512 may be stored locally on server 1512 and/or remotely, as appropriate. In one set of embodiments, databases 1514, 1516 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.
Computer system 1600 may additionally include a computer-readable storage media reader 1612, a communications subsystem 1614 (e.g., a modem, a network card (wireless or wired), an infra-red communication device, etc.), and working memory 1618, which may include RAM and ROM devices as described above. In some embodiments, computer system 1600 may also include a processing acceleration unit 1616, which can include a digital signal processor (DSP), a special-purpose processor, and/or the like.
Computer-readable storage media reader 1612 can further be connected to a computer-readable storage medium 1610, together (and, optionally, in combination with storage device(s) 1608) 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 1614 may permit data to be exchanged with network 1612 and/or any other computer described above with respect to system environment 1600.
Computer system 1600 may also comprise software elements, shown as being currently located within working memory 1618, including an operating system 1620 and/or other code 1622, such as an application program (which may be a client application, Web browser, mid-tier application, RDBMS, etc.). In an exemplary embodiment, working memory 1618 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 1600 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
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.
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/829,958, filed on the same day herewith, entitled “MANAGING CONTINUOUS QUERIES WITH ARCHIVED RELATIONS” and application Ser. No. 13/830,129, filed on the same day herewith, entitled “CONFIGURABLE DATA WINDOWS FOR ARCHIVED RELATIONS,” the entire contents of each is hereby incorporated by reference as if fully set forth herein, under 35 U.S.C. § 120.
| 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 |
| 5691917 | Harrison | Nov 1997 | A |
| 5706494 | Cochrane et al. | Jan 1998 | A |
| 5802262 | Van De | 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 | 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 | Sakar | 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 |
| 6633867 | Kraft et al. | Oct 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 |
| 6904019 | Heinen et al. | Jun 2005 | B2 |
| 6985904 | Kaluskar et al. | Jan 2006 | B1 |
| 6986019 | Bagashev 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 |
| 7284041 | Nakatani et al. | Oct 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 |
| 7440461 | Sahita et al. | Oct 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 |
| 7519962 | Aman | Apr 2009 | B2 |
| 7526804 | Shelest 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 | Dec 2009 | B2 |
| 7634501 | Yabloko | Dec 2009 | B2 |
| 7636703 | Taylor et al. | 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 et al. | Nov 2010 | B2 |
| 7844829 | Meenakshisundaram | Nov 2010 | B2 |
| 7870124 | Liu et al. | Jan 2011 | B2 |
| 7870167 | Lu 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 |
| 7984043 | Waas | Jul 2011 | B1 |
| 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 et al. | Feb 2012 | B2 |
| 8134184 | Becker et al. | Mar 2012 | B2 |
| 8145686 | Raman et al. | Mar 2012 | B2 |
| 8145859 | Park et al. | Mar 2012 | B2 |
| 8155880 | Patel et al. | Apr 2012 | B2 |
| 8190738 | Ruehle | May 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 |
| 8307197 | Koch, III | Nov 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 |
| 8332502 | Neuhaus et al. | Dec 2012 | B1 |
| 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 |
| 8595840 | Malibiran et al. | Nov 2013 | B1 |
| 8676841 | Srinivasan et al. | Mar 2014 | B2 |
| 8713038 | Cohen et al. | Apr 2014 | B2 |
| 8713049 | Jain et al. | Apr 2014 | B2 |
| 8719207 | Ratnam et al. | May 2014 | B2 |
| 8738572 | Bird et al. | May 2014 | B2 |
| 8745070 | Krisnamurthy | Jun 2014 | B2 |
| 8762369 | Macho et al. | Jun 2014 | B2 |
| 8775412 | Day et al. | Jul 2014 | B2 |
| 8880493 | Chen et al. | Nov 2014 | B2 |
| 9015102 | van Lunteren | Apr 2015 | 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 |
| 9244978 | Alves et al. | Jan 2016 | B2 |
| 9256646 | Deshmukh et al. | Feb 2016 | B2 |
| 9262258 | Alves et al. | Feb 2016 | B2 |
| 9262479 | Deshmukh et al. | Feb 2016 | B2 |
| 9286352 | Park et al. | Mar 2016 | B2 |
| 9292574 | Hsiao et al. | Mar 2016 | B2 |
| 9305057 | De Castro Alves et al. | Apr 2016 | B2 |
| 9305238 | Srinivasan et al. | Apr 2016 | B2 |
| 9329975 | Park et al. | May 2016 | B2 |
| 9361308 | Deshmukh et al. | Jun 2016 | B2 |
| 9390135 | Alves et al. | Jul 2016 | B2 |
| 9418113 | Bishnoi et al. | Aug 2016 | B2 |
| 9430494 | Park et al. | Aug 2016 | B2 |
| 9535761 | Park et al. | Jan 2017 | B2 |
| 9563663 | Shukla et al. | Feb 2017 | B2 |
| 9703836 | Hsiao et al. | Jul 2017 | B2 |
| 9712645 | de Castro Alves et al. | Jul 2017 | B2 |
| 9715529 | Park et al. | Jul 2017 | B2 |
| 9756104 | Shukla et al. | Sep 2017 | B2 |
| 9804892 | Park et al. | Oct 2017 | B2 |
| 9805095 | Deshmukh et al. | Oct 2017 | B2 |
| 9852186 | Herwadkar et al. | Dec 2017 | B2 |
| 9886486 | De Castro Alves et al. | Feb 2018 | B2 |
| 20020023211 | Roth et al. | Feb 2002 | A1 |
| 20020032804 | Hunt | Mar 2002 | A1 |
| 20020038306 | Griffin et al. | 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 |
| 20030212664 | Breining et al. | Nov 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 |
| 20050027698 | Collet et al. | Feb 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 |
| 20050108368 | Mohan | 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 |
| 20060155719 | Mihaeli et al. | Jul 2006 | A1 |
| 20060166704 | Benco et al. | Jul 2006 | A1 |
| 20060167704 | Nicholls et al. | Jul 2006 | A1 |
| 20060167856 | Angele et al. | Jul 2006 | A1 |
| 20060167869 | Jones | 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 |
| 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 |
| 20070168154 | Ericson | Jul 2007 | A1 |
| 20070192301 | Posner | Aug 2007 | A1 |
| 20070198479 | Cai et al. | Aug 2007 | A1 |
| 20070022092 | Nishizawa et al. | Sep 2007 | A1 |
| 20070214171 | Behnen et al. | Sep 2007 | A1 |
| 20070226188 | Johnson et al. | Sep 2007 | A1 |
| 20070226239 | Johnson et al. | Sep 2007 | A1 |
| 20070250487 | Reuther | Oct 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 |
| 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 |
| 20080098370 | Fontoura 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 |
| 20080275891 | Park et al. | Nov 2008 | A1 |
| 20080281782 | Agrawal | Nov 2008 | A1 |
| 20080301086 | Gupta | Dec 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 | Kanthi 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 |
| 20090112779 | Wolf 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 et al. | 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 |
| 20090192981 | Papaemmanouil 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 |
| 20090228465 | 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 | Bennet et al. | Nov 2009 | A1 |
| 20090292979 | Aggarwal | 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 |
| 20100022627 | Scherer 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 |
| 20100106710 | Nishikawa | Apr 2010 | A1 |
| 20100106946 | Imaki et al. | Apr 2010 | A1 |
| 20100125572 | Poblete et al. | May 2010 | A1 |
| 20100125574 | Navas | May 2010 | A1 |
| 20100125584 | Navas | May 2010 | A1 |
| 20100138405 | Mihaila | Jun 2010 | A1 |
| 20100161589 | Nica et al. | Jun 2010 | A1 |
| 20100223283 | Lee et al. | Sep 2010 | A1 |
| 20100223305 | Park et al. | Sep 2010 | A1 |
| 20100223437 | Park et al. | Sep 2010 | A1 |
| 20100223606 | Park et al. | Sep 2010 | A1 |
| 20100250572 | Chen | 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 |
| 20110016123 | Pandey 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 |
| 20110035253 | Mason et al. | Feb 2011 | A1 |
| 20110040746 | Handa et al. | Feb 2011 | A1 |
| 20110040827 | Katsunuma et al. | Feb 2011 | A1 |
| 20110055192 | Tang et al. | Mar 2011 | A1 |
| 20110055197 | Chavan | Mar 2011 | A1 |
| 20110084967 | De Pauw et al. | Apr 2011 | A1 |
| 20110093162 | Nielsen et al. | Apr 2011 | A1 |
| 20110105857 | Zhang et al. | May 2011 | A1 |
| 20110131588 | Allam et al. | Jun 2011 | A1 |
| 20110161321 | De Castro et al. | Jun 2011 | A1 |
| 20110161328 | Park et al. | Jun 2011 | A1 |
| 20110161352 | De Castro et al. | Jun 2011 | A1 |
| 20110161356 | De Castro 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 et al. | Aug 2011 | A1 |
| 20110213802 | Singh et al. | Sep 2011 | A1 |
| 20110246445 | Mishra | Oct 2011 | A1 |
| 20110270879 | Srinivasan et al. | Nov 2011 | A1 |
| 20110282812 | Chandramouli et al. | Nov 2011 | A1 |
| 20110295841 | Sityon et al. | Dec 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 |
| 20120116982 | Yoshida et al. | May 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 |
| 20130262399 | Eker et al. | Oct 2013 | A1 |
| 20130275452 | Krishnamurthy et al. | Oct 2013 | A1 |
| 20130332240 | Patri et al. | Dec 2013 | A1 |
| 20140019194 | Anne et al. | Jan 2014 | A1 |
| 20140059109 | Jugel et al. | Feb 2014 | A1 |
| 20140082013 | Wolf et al. | Mar 2014 | A1 |
| 20140095425 | Sipple et al. | Apr 2014 | 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 |
| 20140095462 | Park et al. | Apr 2014 | A1 |
| 20140095471 | Deshmukh et al. | Apr 2014 | A1 |
| 20140095473 | Srinivasan 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 |
| 20140237487 | Prasanna et al. | Aug 2014 | A1 |
| 20140324530 | Thompson et al. | Oct 2014 | A1 |
| 20140358959 | Bishnoi et al. | Dec 2014 | A1 |
| 20140379712 | Lafuente Alvarez | Dec 2014 | A1 |
| 20150007320 | Liu et al. | Jan 2015 | A1 |
| 20150156241 | Shukla et al. | Jun 2015 | A1 |
| 20150161214 | Kali et al. | Jun 2015 | A1 |
| 20150227415 | Alves et al. | Aug 2015 | A1 |
| 20150363464 | Alves et al. | Dec 2015 | A1 |
| 20150381712 | De Castro Alves et al. | Dec 2015 | A1 |
| 20160034311 | Park et al. | Feb 2016 | A1 |
| 20160085809 | De Castro et al. | Mar 2016 | A1 |
| 20160085810 | De Castro et al. | Mar 2016 | A1 |
| 20160103882 | Deshmukh et al. | Apr 2016 | A1 |
| 20160127517 | Shcherbakov et al. | May 2016 | A1 |
| 20160140180 | Park et al. | May 2016 | A1 |
| 20160154855 | Hsiao et al. | Jun 2016 | A1 |
| 20160283555 | Alves et al. | Sep 2016 | A1 |
| 20170024912 | De Castro et al. | Jan 2017 | A1 |
| 20170075726 | Park et al. | Mar 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 101866353 | Oct 2010 | CN |
| 102135984 | Jul 2011 | CN |
| 102665207 | Sep 2012 | CN |
| 102892073 | Jan 2013 | CN |
| 104885077 | Sep 2015 | CN |
| 104937591 | Sep 2015 | CN |
| 105074698 | Nov 2015 | CN |
| 105308592 | Feb 2016 | CN |
| 105379183 | Mar 2016 | CN |
| 1 241 589 | Sep 2002 | EP |
| 2474922 | Jul 2012 | EP |
| 2946314 | Nov 2015 | EP |
| 2946527 | Nov 2015 | EP |
| 2959408 | Dec 2015 | EP |
| 2002-251233 | Sep 2002 | JP |
| 2006338432 | Dec 2006 | JP |
| 2007-328716 | Dec 2007 | JP |
| 2008-541225 | Nov 2008 | JP |
| 2009-134689 | Jun 2009 | JP |
| 2009171193 | Jul 2009 | JP |
| 2010-108073 | May 2010 | JP |
| 2011-039818 | Feb 2011 | JP |
| 2015536001 | Dec 2015 | JP |
| 2016500167 | Jan 2016 | JP |
| 2016500168 | Jan 2016 | JP |
| 2016503216 | Feb 2016 | JP |
| 2016504679 | Feb 2016 | JP |
| 0049533 | Aug 2000 | WO |
| 0118712 | Mar 2001 | WO |
| 1059602 | Aug 2001 | WO |
| 0165418 | Sep 2001 | WO |
| 03030031 | Apr 2003 | WO |
| 2007122347 | Nov 2007 | WO |
| WO2009119811 | Oct 2009 | WO |
| 2010050582 | May 2010 | WO |
| 2012037511 | Mar 2012 | WO |
| 2012050582 | Apr 2012 | WO |
| 2012154408 | Nov 2012 | WO |
| 2012158360 | Nov 2012 | WO |
| 2014000819 | Jan 2014 | WO |
| 2015191120 | Dec 2015 | WO |
| WO2016048912 | Mar 2016 | WO |
| Entry |
|---|
| Babu et al., “Continuous queries over data streams.” ACM Sigmod Record 30.3 (2001): 109-120., [retrieved from the internet Nov. 14, 2014], retrieved from <URL:http://dl.acm.org/citation.cfm?id=603884>. |
| Chen et al. “NiagaraCQ: A scalable continuous query system for internet databases.” ACM SIGMOD Record. vol. 29. No. 2. ACM, 2000., [retrieved from the internet Nov. 21, 2014], retrieved from <URL:http://dl.acm.org/citation.cfm?id=335432>. |
| 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. 2003., [retrieved from the internet Nov. 21, 2014]. |
| Buza, Antal. “Extension of CQL over Dynamic Databases.” J. UCS 12, No. 9 (2006): 1165-1176, [retrieved on Dec. 14, 2015], [retrieved on the internet URL<http://www.jucs.org/jucs_12_9/extension_of_cql_over%20/jucs_12_09_1165_1176_buza.pdf>]. |
| U.S. Appl. No. 12/548,281, Non-Final Office Action dated Feb. 13, 2014, 16 pages. |
| U.S. Appl. No. 13/177,748, Final Office Action dated Mar. 20, 2014, 23 pages. |
| PCT Patent Application No. PCT/US2014/010832, International Search Report dated Apr. 3, 2014, 9 pages. |
| 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. |
| 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 pages. |
| 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/docs1OO/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, , ver. 2.0,, 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. |
| U.S. Appl. No. 10/948,523, Final Office Action dated Jul. 6, 2007, 37 pages. |
| U.S. Appl. No. 10/948,523, Non-Final Office Action dated Dec. 11, 2007, 47 pages. |
| U.S. Appl. No. 10/948,523, Notice of Allowance dated Dec. 1, 2010, 17 pages. |
| U.S. Appl. No. 10/948,523, Notice of Allowance dated Jul. 8, 2008, 30 pages. |
| U.S. Appl. No. 10/948,523, Office Action dated Jan. 22, 2007, 31 pages. |
| U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance dated Jul. 17, 2008, 17 pages. |
| U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance dated Aug. 25, 2008, 3 pages. |
| U.S. Appl. No. 11/601,415, Advisory Action dated Aug. 18, 2009, 3 pages. |
| U.S. Appl. No. 11/601,415, Final Office Action dated Jul. 2, 2012. |
| U.S. Appl. No. 11/601,415, Final Office Action dated May 27, 2009, 26 pages. |
| U.S. Appl. No. 11/601,415, Final Office Action dated Jun. 30, 2010, 45 pages. |
| U.S. Appl. No. 11/601,415, Non-Final Office Action dated Sep. 17, 2008, 10 pages. |
| U.S. Appl. No. 11/601,415, Non-Final Office Action dated Nov. 30, 2009, 32 pages. |
| U.S. Appl. No. 11/601,415, Office Action dated Dec. 9, 2011. |
| U.S. Appl. No. 11/873,407, Final Office Action dated Apr. 26, 2010, 11 pages. |
| U.S. Appl. No. 11/873,407, Non-Final Office Action dated Nov. 13, 2009, 7 pages. |
| U.S. Appl. No. 11/873,407, Notice of Allowance dated Nov. 10, 2010, 14 pages. |
| U.S. Appl. No. 11/873,407, Notice of Allowance dated Mar. 7, 2011, 8 pages. |
| U.S. Appl. No. 11/874,197, Final Office Action dated Aug. 12, 2011, 26 pages. |
| U.S. Appl. No. 11/874,197, Final Office Action dated Jun. 29, 2010, 17 pages. |
| U.S. Appl. No. 11/874,197, Non-Final Office Action dated Dec. 22, 2010, 22 pages. |
| U.S. Appl. No. 11/874,197, Office Action dated Nov. 10, 2009, 14 pages. |
| U.S. Appl. No. 11/874,202, Final Office Action dated Jun. 8, 2010, 200 pages. |
| U.S. Appl. No. 11/874,202, Non-Final Office Action dated Dec. 3, 2009, 20 pages. |
| U.S. Appl. No. 11/874,202, Notice of Allowance dated Mar. 31, 2011, 12 pages. |
| U.S. Appl. No. 11/874,202, Notice of Allowance dated Dec. 22, 2010, 29 pages. |
| U.S. Appl. No. 11/874,850, Notice of Allowance dated Jan. 27, 2010, 11 pages. |
| U.S. Appl. No. 11/874,850, Notice of Allowance dated Nov. 24, 2009, 17 pages. |
| U.S. Appl. No. 11/874,850, Notice of Allowance dated Dec. 11, 2009, 5 pages. |
| U.S. Appl. No. 11/874,896, Final Office Action dated Jul. 23, 2010, 28 pages. |
| U.S. Appl. No. 11/874,896, Non-Final Office Action dated Dec. 8, 2009, 19 pages. |
| U.S. Appl. No. 11/874,896, Non-Final Office Action dated Nov. 22, 2010, 25 pages. |
| U.S. Appl. No. 11/874,896, Notice of Allowance dated Jun. 23, 2011, 30 pages. |
| U.S. Appl. No. 11/927,681, Non-Final Office Action dated Mar. 24, 2011, 17 pages. |
| U.S. Appl. No. 11/927,681, Notice of Allowance dated Jul. 1, 2011, 8 pages. |
| U.S. Appl. No. 11/927,683, Final Office Action dated Sep. 1, 2011, 18 pages. |
| U.S. Appl. No. 11/927,683, Non-Final Office Action dated Mar. 24, 2011, 13 pages. |
| U.S. Appl. No. 11/927,683, Notice of Allowance dated Nov. 9, 2011, 10 pages. |
| U.S. Appl. No. 11/977,437, Final Office Action dated Apr. 8, 2010, 18 pages. |
| U.S. Appl. No. 11/977,437, Non-Final Office Action dated Oct. 13, 2009, 9 pages. |
| U.S. Appl. No. 11/977,437, Notice of Allowance dated Mar. 4, 2013, 9 pages. |
| U.S. Appl. No. 11/977,437, Office Action dated Aug. 3, 2012. |
| U.S. Appl. No. 11/977,439, Non-Final Office Action dated Apr. 13, 2010, 7 pages. |
| U.S. Appl. No. 11/977,439, Notice of Allowance dated Mar. 16, 2011, 10 pages. |
| U.S. Appl. No. 11/977,439, Notice of Allowance dated Aug. 18, 2010, 11 pages. |
| U.S. Appl. No. 11/977,439, Notice of Allowance dated Sep. 28, 2010, 6 pages. |
| U.S. Appl. No. 11/977,439, Notice of Allowance dated Nov. 24, 2010, 8 pages. |
| U.S. Appl. No. 11/977,440, Notice of Allowance dated Oct. 7, 2009, 6 pages. |
| U.S. Appl. No. 12/193,377, Final Office Action dated Jan. 17, 2013, 24 pages. |
| U.S. Appl. No. 12/395,871, Non-Final Office Action dated May 27, 2011, 7 pages. |
| U.S. Appl. No. 12/395,871, Notice of Allowance dated May 4, 2012, 27 pages. |
| U.S. Appl. No. 12/395,871, Office Action dated Oct. 19, 2011, 33 pages. |
| U.S. Appl. No. 12/396,008, Non-Final Office Action dated Jun. 8, 2011, 10 pages. |
| U.S. Appl. No. 12/396,008, Notice of Allowance dated Nov. 16, 2011, 5 pages. |
| U.S. Appl. No. 12/396,464, Final Office Action dated Jan. 16, 2013, 17 pages. |
| U.S. Appl. No. 12/396,464, Non-Final Office Action dated Sep. 7, 2012, 18 pages. |
| U.S. Appl. No. 12/506,891, Notice of Allowance dated Jul. 25, 2012, 8 pages. |
| U.S. Appl. No. 12/506,891, Office Action dated Dec. 14, 2011, 41 pages. |
| U.S. Appl. No. 12/506,905, Advisory Action dated Nov. 6, 2012, 6 pages. |
| U.S. Appl. No. 12/506,905, Notice of Allowance dated Dec. 14, 2012, 15 pages. |
| U.S. Appl. No. 12/506,905, Office Action dated Aug. 9, 2012, 42 pages. |
| U.S. Appl. No. 12/506,905, Office Action dated Mar. 26, 2012, 86 pages. |
| U.S. Appl. No. 12/534,384, Notice of Allowance dated May 7, 2013, 12 pages. |
| U.S. Appl. No. 12/534,384, Office Action dated Feb. 28, 2012, 38 pages. |
| U.S. Appl. No. 12/534,384, Office Action dated Feb. 12, 2013, 14 pages. |
| U.S. Appl. No. 12/534,398, Final Office Action dated Jun. 6, 2012, 27 pages. |
| U.S. Appl. No. 12/534,398, Notice of Allowance dated Nov. 27, 2012, 10 pages. |
| U.S. Appl. No. 12/534,398, Office Action dated Nov. 1, 2011, 32 pages. |
| U.S. Appl. No. 12/548,187, Non Final Office Action dated Sep. 27, 2011, 19 pages. |
| U.S. Appl. No. 12/548,187, Non-Final Office Action dated Apr. 9, 2013, 17 pages. |
| U.S. Appl. No. 12/548,187, Office Action dated Jun. 20, 2012, 31 pages. |
| U.S. Appl. No. 12/548,209, Notice of Allowance dated Oct. 24, 2012, 22 pages. |
| U.S. Appl. No. 12/548,209, Office Action dated Apr. 16, 2012, 40 pages. |
| U.S. Appl. No. 12/548,222, Non-Final Office Action dated Apr. 10, 2013, 16 pages. |
| U.S. Appl. No. 12/548,222, Non-Final Office Action dated Oct. 19, 2011, 19 pages. |
| U.S. Appl. No. 12/548,222, Office Action dated Jun. 20, 2012, 29 pages. |
| U.S. Appl. No. 12/548,281, Non-Final Office Action dated Apr. 12, 2013, 16 pages. |
| U.S. Appl. No. 12/548,281, Non-Final Office Action dated Oct. 3, 2011, 20 pages. |
| U.S. Appl. No. 12/548,281, Office Action dated Jun. 20, 2012, 29 pages. |
| U.S. Appl. No. 12/548,290, Final Office Action dated Jul. 30, 2012, 34 pages. |
| U.S. Appl. No. 12/548,290, Non-Final Office Action dated Oct. 3, 2011, 17 pages. |
| U.S. Appl. No. 12/548,290, Non-Final Office Action dated Apr. 15, 2013, 17 pages. |
| U.S. Appl. No. 12/874,197, Notice of Allowance dated Jun. 22, 2012. |
| U.S. Appl. No. 12/913,636, Final Office Action dated Jan. 8, 2013, 21 pages. |
| U.S. Appl. No. 12/913,636, Office Action dated Jun. 7, 2012. |
| U.S. Appl. No. 12/949,081, filed Nov. 18, 2010. |
| U.S. Appl. No. 12/949,081, Non-Final Office Action dated Jan. 9, 2013, 12 pages. |
| U.S. Appl. No. 12/957,194, filed Nov. 30, 2010. |
| U.S. Appl. No. 12/957,194, Non-Final Office Action dated Dec. 7, 2012, 11 pages. |
| U.S. Appl. No. 12/957,194, Notice of Allowance dated Mar. 20, 2013, 9 pages. |
| U.S. Appl. No. 12/957,201, filed Nov. 30, 2010. |
| U.S. Appl. No. 12/957,201, Final Office Action dated Apr. 25, 2013, 11 pages. |
| U.S. Appl. No. 12/957,201, Office Action dated Dec. 19, 2012, 15 pages. |
| U.S. Appl. No. 13/089,556, Non-Final Office Action dated Apr. 10, 2013, 10 pages. |
| U.S. Appl. No. 13/089,556, Office Action dated Nov. 6, 2012, 13 pages. |
| U.S. Appl. No. 13/089,556, filed Apr. 19, 2011. |
| U.S. Appl. No. 13/102,665, Office Action dated Feb. 1, 2013, 14 pages. |
| U.S. Appl. No. 13/107,742, Non-Final Office Action dated Feb. 14, 2013, 16 pages. |
| U.S. Appl. No. 13/184,528, Notice of Allowance dated Mar. 1, 2012. |
| U.S. Appl. No. 13/193,377, Office Action dated Jan. 17, 2013, 25 pages. |
| U.S. Appl. No. 13/193,377, Office Action dated Aug. 23, 2012, 48 pages. |
| U.S. Appl. No. 13/244,272, Final Office Action dated Mar. 28, 2013, 29 pages. |
| U.S. Appl. No. 13/244,272, Office Action dated Oct. 4, 2012. |
| U.S. Appl. No. 13/396,464, Office Action dated Sep. 7, 2012. |
| Abadi, et al., Yes 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. |
| 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, pp. 379-390. |
| 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, 2004, 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, pp. 323-350. |
| 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. |
| 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. |
| 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 dated Nov. 17, 2011, 55 pages. |
| International Application No. PCT/US2012/034970, International Search Report and Written Opinion dated Jul. 16, 2012, 13 pages. |
| International Application No. PCT/US2012/036353, International Search Report and Written Opinion dated 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, pp. 282-318. |
| Sadtler, et al., WebSphere Application Server Installation Problem Determination, Copyright 2007, IBM Corp., 2007, pp. 1-48. |
| 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, pp. 511-522. |
| 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, pp. 1-113. |
| Terry, et al., Continuous queries over append-only database, Proceedings of ACM SIGMOD, 1992, pp. 321-330. |
| 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, pp. 1023-1030. |
| 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, pp. 655-665. |
| 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, pp. 172-181. |
| Zemke, XML Query, mailed on Mar. 14, 2004, 29 pages. |
| 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>. |
| 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. 12/548,281, Final Office Action dated Oct. 10, 2013, 21 pages. |
| U.S. Appl. No. 12/548,290, Notice of Allowance dated Sep. 11, 2013, 6 pages. |
| U.S. Appl. No. 12/949,081, Final Office Action dated Aug. 27, 2013, 13 pages. |
| U.S. Appl. No. 13/089,556, Final Office Action dated Aug. 29, 2013, 10 pages. |
| U.S. Appl. No. 13/177,748, Non-Final Office Action dated Aug. 30, 2013, 24 pages. |
| U.S. Appl. No. 13/193,377, Notice of Allowance dated Aug. 30, 2013, 19 pages. |
| 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. |
| 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. 11/601,415, Non-Final Office Action dated Dec. 11, 2013, 58 pages. |
| U.S. Appl. No. 12/396,464, Non Final Office Action dated Dec. 31, 2013, 16 pages. |
| U.S. Appl. No. 13/089,556, Non-Final Office Action dated Jan. 9, 2014, 14 pages. |
| Non-Final Office Action for U.S. Appl. No. 12/548,187 dated Feb. 6, 2014, 53 pages. |
| Agrawal et al. “Efficient pattern matching over event streams,” Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp. 147-160 (Jun. 2008). |
| 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 (no date, printed on Oct. 14, 2013). |
| 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. |
| 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 dated Jun. 22, 2012, 20 pages. |
| U.S. Appl. No. 13/838,259, filed Mar. 15, 2013, Deshmukh et al. |
| U.S. Appl. No. 13/839,288, filed Mar. 15, 2013, Deshmukh et al. |
| U.S. Appl. No. 12/396,464, Final Office Action dated May 16, 2014, 16 pages. |
| U.S. Appl. No. 12/548,187, Final Office Action dated Jun. 4, 2014, 64 pages. |
| U.S. Appl. No. 13/089,556, Final Office Action dated Jun. 13, 2014, 14 pages. |
| U.S. Appl. No. 13/107,742, Non-Final Office Action dated Jun. 19, 2014, 20 pages. |
| U.S. Appl. No. 13/244,272, Notice of Allowance dated Aug. 12, 2013, 12 pages. |
| International Application No. PCT/US2011/052019, International Preliminary Report on Patentability dated Mar. 28, 2013, 6 pages. |
| International Application No. PCT/US2012/034970, International Preliminary Report on Patentability dated Nov. 21, 2013, 7 pages. |
| International Application No. PCT/US2012/036353, International Preliminary Report on Patentability dated Nov. 28, 2013, 6 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. |
| U.S. Appl. No. 13/089,556, Notice of Allowance dated Oct. 6, 2014, 9 pages. |
| U.S. Appl. No. 12/396,464, Notice of Allowance dated Sep. 3, 2014, 7 pages. |
| U.S. Appl. No. 12/548,187, Advisory Action dated Sep. 26, 2014, 6 pages. |
| U.S. Appl. No. 12/548,281, Final Office Action dated Aug. 13, 2014, 19 pages. |
| U.S. Appl. No. 12/913,636, Non-Final Office Action dated Jul. 24, 2014, 22 pages. |
| U.S. Appl. No. 12/957,201, Non-Final Office Action dated Jul. 30, 2014, 12 pages. |
| U.S. Appl. No. 13/764,560, Non-Final Office Action dated Sep. 12, 2014, 23 pages. |
| U.S. Appl. No. 13/770,969, Non-Final Office Action dated Aug. 7, 2014, 9 pages. |
| U.S. Appl. No. 14/302,031, Non-Final Office Action dated 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 D et al., Identifying robust plans through plan diagram reduction, PVLDB '08, Auckland, New Zealand, Aug. 23-28, pp. 1124-1140. |
| Krämer, Continuous Queries Over Data Streams—Semantics and Implementation, Fachbereich Mathematik and 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 dated Jul. 16, 2014, 12 pages. |
| International Application No. PCT/US2013/062050, International Search Report & Written Opinion dated Jul. 2, 2014, 13 pages. |
| International Application No. PCT/US2013/062052, International Search Report & Written Opinion dated Jul. 3, 2014, 12 pages. |
| International Application No. PCT/US2013/073086, International Search Report and Written Opinion dated Mar. 14, 2014. |
| International Application No. PCT/US2014/017061, International Search Report dated Sep. 9, 2014, 12 pages. |
| Rao et al., Compiled Query Execution Engine using JVM, ICDE '06, Atlanta, GA, Apr. 3-7, 2006, 12 pages. |
| Medhabi et al., Optimizing complex sequence pattern extraction using caching, 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 VLDB, Roma, Italy, Sep. 2001, pp. 19-28. |
| SQL Tutorial-In, Tizag.com, http://web.archive.org/web/20090216215219/http://www.tizag.com/sqiTutorial/sqlin.php, Feb. 16, 2009, pp. 1-3. |
| U.S. Appl. No. 12/548,187, Final Office Action, dated Jun. 10, 2013, 18 pages. |
| U.S. Appl. No. 12/548,222, Notice of Allowance, dated Jul. 18, 2013, 12 pages. |
| U.S. Appl. No. 13/102,665, Final Office Action, dated Jul. 9, 2013, 17 pages. |
| U.S. Appl. No. 13/107,742, Final Office Action, dated Jul. 3, 2013, 19 pages. |
| Notice of Allowance for U.S. Appl. No. 11/977,437 dated Jul. 10, 2013, 10 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 dated Feb. 26, 2015, 11 pages. |
| European Patent Application No. 12783063.6, Extended Search Report dated 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/949,081, Non-Final Office Action dated Jan. 28, 2015, 20 pages. |
| U.S. Appl. No. 12/957,201, Notice of Allowance dated Jan. 21, 2015, 5 pages. |
| U.S. Appl. No. 13/107,742, Final Office Action dated Jan. 21, 2015, 23 pages. |
| U.S. Appl. No. 13/177,748, Non-Final Office Action dated Feb. 3, 2015, 22 pages. |
| U.S. Appl. No. 13/770,961, Non-Final Office Action dated Feb. 4, 2015, 22 pages. |
| U.S. Appl. No. 13/770,969, Notice of Allowance dated Jan. 22, 2015, 5 pages. |
| U.S. Appl. No. 13/829,958, Non-Final Office Action dated Dec. 11, 2014, 15 pages. |
| U.S. Appl. No. 13/906,162, Non-Final Office Action dated Dec. 29, 2014, 10 pages. |
| International Application No. PCT/US2014/010832, Written Opinion dated Dec. 15, 2014, 5 pages. |
| International Application No. PCT/US2014/010920, International Search Report and Written Opinion dated Dec. 15, 2014, 10 pages. |
| International Application No. PCT/US2014/017061, Written Opinion dated Feb. 3, 2015, 6 pages. |
| International Application No. PCT/US2014/039771, International Search Report and Written Opinion dated Sep. 24, 2014, 12 pages. |
| 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, 36 pages. |
| “SQL Subqueries”—Dec. 3, 2011, 2 pages. |
| “Caching Data with SqiDataSource Control”—Jul. 4, 2011, 3 pages. |
| “SCD—Slowing Changing Dimensions in a Data Warehouse”—Aug. 7, 2011, one page. |
| 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/828,640 dated Dec. 2, 2014, 11 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. |
| International Application No. PCT/US2014/039771, International Search Report and Written Opinion dated Apr. 29, 2015 6 pages. |
| International Application No. PCT/US2015/016346, International Search Report and Written Opinion dated 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. |
| 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 (dated 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. |
| 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. |
| Japan Patent Office office actions JPO patent application JP2013-529376 (dated Aug. 18, 2015). |
| Final Office Action for U.S. Appl. No. 13/177,748 dated Aug. 21, 2015, 24 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. |
| “Oracle Complex Event Processing Exalogic Performance Study” an Oracle White Paper, Sep. 2011, 16 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. |
| 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. |
| 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. 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. |
| 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. |
| Final Office Action for U.S. Appl. No. 13/828,640 dated Jun. 17, 2015, 11 pages. |
| China Patent Office office actions for patent application CN201280022008.7 (dated Dec. 3, 2015). |
| European Application No. 12783063.6, Office Action dated Nov. 11, 2015, 8 pages. |
| Notice of Allowance for U.S. Appl. No. 12/548,187, dated Feb. 2, 2016, 15 pages. |
| Notice of Allowance for U.S. Appl. No. 14/037,072 dated Feb. 16, 2016, 17 pages. |
| Final Office Action for U.S. Appl. No. 13/830,735 dated Dec. 21, 2015, 20 pages. |
| Notice of Allowance for U.S. Appl. No. 13/827,987 dated Jan. 4, 2016, 16 pages. |
| Notice of Allowance for U.S. Appl. No. 13/177,748 dated Jan. 6, 2016, 9 pages. |
| Notice of Allowance for U.S. Appl. No. 13/828,640 dated Jan. 6, 2016, 16 pages. |
| Final Office Action for U.S. Appl. No. 14/037,153 dated Jan. 21, 2016, 31 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/829,958 dated Feb. 1, 2016, 20 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/827,631 dated Feb. 11, 2016, 12 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. |
| 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—IIg 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. No. 13/830,759 dated Feb. 18, 2016, 18 pages. |
| Japan Patent Office office actions JPO patent application JP2014-509315 (dated Mar. 15, 2016). |
| Notice of Allowance for U.S. Appl. No. 13/770,961 dated Apr. 4, 2016, 8 pages. |
| Final Office Action for U.S. Appl. No. 13/838,259 dated Feb. 19, 2016, 47 pages. |
| Notice of Allowance for U.S. Appl. No. 13/906,162 dated Apr. 5, 2016, 7 pages. |
| Final Office Action for U.S. Appl. No. 14/036,500 dated Mar. 17, 2016, 34 pages. |
| Final Office Action for U.S. Appl. No. 13/764,560 dated Apr. 14, 2016, 20 pages. |
| Final Office Action for U.S. Appl. No. 14/621,098 dated Apr. 21, 2016, 16 pages. |
| Watanabe et al., Development of a Data Stream Integration System with a Multiple Query Optimizer, Journal articles of the 15th Data Engineering Workshop (DEWS2004), The Institute of Electronics, Information and Communication Engineers, Technical Committee on Data Engineering, Aug. 11, 2009, pp. 1-8. |
| Kuwata et al., Stream Data Analysis Application for Customer Behavior with Complex Event Processing, IEICE Technical Report, The Institute of Electronics, Information and Communication Engineers, Jun. 21, 2010, vol. 110, No. 107, pp. 13-18. |
| Kitagawa et al., Sensing Network, Information Processing, Information Processing Society of Japan, Sep. 15, 2010, vol. 51, No. 9, pp. 1119-1126. |
| Hirzel et al., “SPL Stream Processing Language Report”, IBM Research Report RC24897 (W0911-044), IBM Research Division, Thomas J. Watson Research center, Yorktown Heights, NY, Nov. 5, 2009, 19 pages. |
| Map Reduce, Wikipedia, The Free Encyclopedia, 2016, 11 pages. |
| Pig (programming tool), Wikipedia, The Free Encyclopedia, 2016, 4 pages. |
| U.S. Appl. No. 13/764,560, Notice of Allowance dated Sep. 30, 2016, 10 pages. |
| U.S. Appl. No. 14/079,538, Final Office Action dated Jul. 27, 2016, 28 pages. |
| U.S. Appl. No. 13/827,631, Final Office Action dated Oct. 20, 2016, 12 pages. |
| U.S. Appl. No. 14/883,815, Notice of Allowance dated Aug. 30, 2016, 13 pages. |
| U.S. Appl. No. 13/829,958 Non-Final Office Action, dated Dec. 27, 2016, 20 pages. |
| U.S. Appl. No. 13/838,259 Non-Final Office Action, dated Jan. 4, 2017, 65 pages. |
| U.S. Appl. No. 14/610,971 Non-Final Office Action, dated Dec. 19, 2016, 10 pages. |
| U.S. Appl. No. 14/621,098 Non-Final Office Action, dated Nov. 14, 2016, 17 pages. |
| U.S. Appl. No. 15/003,646 Non-Final Office Action, dated Dec. 2, 2016, 9 pages. |
| U.S. Appl. No. 15/015,933, Non-Final Office Action dated Jan. 30, 2017, 11 pages. |
| U.S. Appl. No. 13/830,759, Non-Final Office Action dated Feb. 10, 2017, 23 pages. |
| U.S. Appl. No. 13/827,631, Non-Final Office Action dated Feb. 16, 2017, 16 pages. |
| Mahlke et al., Comparison of Full and Partial Predicated Execution Support for ILP Processors, ICSA '95, Santa Margherita Ligure, 1995, pp. 138-149. |
| Olston et al., Pig Latin, A Not-So-Foreign Language for Data Processing, 2008, 12 pages. |
| International Application No. PCT/US2015/016346, International Preliminary Report on Patentability dated Sep. 30, 2016, 6 pages. |
| International Application No. PCT/US2015/051268, Written Opinion dated Aug. 18, 2016, 7 pages. |
| International Application No. PCT/US2015/051268 International Preliminary Report on Patentability dated Dec. 8, 2016, 12 pages. |
| Yang et al., Map-Reduce-Merge, Simplified Relational Data Processing on Large Clusters, 2007, 12 pages. |
| Cooperativesystems: “Combined WLAN and Inertial Indoor Pedestrian Positioning System” URL:https://www.youtube.com/watch?v=mEt88WaHZvU. |
| Frank et al “Development and Evaluation of a Combined WLAN & Inertial Indoor Pedestrian Positioning System” Proceedings of the 22nd International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS 2009). (Sep. 25, 2009) pp. 538-546. |
| International Preliminary Report on Patentabiilty dated Jun. 16, 2016 for PCT/US2014/068641, 7 pages. |
| International Application No. PCT/RU2015/000468, International Search Report and Written Opinion dated Apr. 25, 2016, 9 pages. |
| International Application No. PCT/US2015/016346, International Search Report and Written Opinion dated May 24, 2016, 5 pages. |
| China Patent Office office action for patent application CN201180053021.4 (dated May 27, 2016). |
| Bestehorn Fault-tolerant query processing in structured P2P-systems, Springer Science+Business Media LLC Distrib Parallel Databases 28:33-66 (May 8, 2010). |
| Kramer “Semantics and Implementation of Continuous Sliding Window Queries over Data Streams” ACM Transactions on Database Systems, vol. 34, pp. 4:1 to 4:49 (Apr. 2009). |
| Final Office Action for U.S. Appl. No. 11/601,415 dated May 17, 2016, 17 pages. |
| Final Office Action for U.S. Appl. No. 14/036,659 dated Apr. 22, 2016, 38 pages. |
| Non-Final Office Action for U.S. Appl. No. 14/883,815 dated May 10, 2016, 32 pages. |
| Notice of Allowance for U.S. Appl. No. 12/949,081 dated May 3, 2016, 6 pages. |
| Final Office Action for U.S. Appl. No. 13/829,958 dated Jun. 30, 2016, 19 pages. |
| Final Office Action for U.S. Appl. No. 13/830,502 dated Jul. 6, 2016, 28 pages. |
| U.S. Appl. No. 13/829,958, Final Office Action dated Jun. 26, 2017, 22 pages. |
| U.S. Appl. No. 13/830,378, Non-Final Office Action dated Jul. 5, 2017, 44 pages. |
| U.S. Appl. No. 13/838,259, Final Office Action dated Jul. 7, 2017, 69 pages. |
| U.S. Appl. No. 14/036,500, Notice of Allowance dated Jun. 30, 2017, 14 pages. |
| U.S. Appl. No. 14/036,659, Non-Final Office Action dated Jun. 2, 2017, 28 pages. |
| U.S. Appl. No. 14/559,550, Final Office Action dated Jul. 12, 2017, 21 pages. |
| U.S. Appl. No. 14/559,550, Non-Final Office Action dated Jan. 27, 2017, 16 pages. |
| U.S. Appl. No. 14/621,098, Notice of Allowance dated May 3, 2017, 9 pages. |
| U.S. Appl. No. 14/755,088, Non-Final Office Action dated Jun. 14, 2017, 13 pages. |
| U.S. Appl. No. 15/003,646, Notice of Allowance dated May 19, 2017, 16 pages. |
| U.S. Appl. No. 15/015,933, Notice of Allowance dated May 17, 2017, 16 pages. |
| U.S. Appl. No. 15/360,650, Notice of Allowance dated Jul. 24, 2017, 13 pages. |
| Akama et al., Design and Evaluation of a Data Management System for WORM Data Processing, Journal of Information Processing, Information Processing Society of Japan, vol. 49, No. 2, Feb. 15, 2008, pp. 749-764. |
| Chinese Application No. 201380056012.X, Office Action dated Jun. 1, 2017, 22 pages (10 pages for the original document and 12 pages for the English translation). |
| Japanese Application No. 2015-534676, Office Action dated Jun. 27, 2017, 9 pages. |
| Sadana “Interactive Scatterplot for Tablets,” The 12th International Working Conference on Advanced Visual Interfaces, available from https://vimeo.com/97798460 (May 2014). |
| U.S. Appl. No. 13/830,502, Non-Final Office Action dated Apr. 7, 2017, 28 pages. |
| U.S. Appl. No. 14/036,500, Non-Final Office Action dated Feb. 9, 2017, 34 pages. |
| U.S. Appl. No. 14/079,538, Non-Final Office Action dated Mar. 31, 2017, 24 pages. |
| U.S. Appl. No. 15/360,650, Non-Final Office Action dated Mar. 9, 2017, 34 pages. |
| U.S. Appl. No. 13/830,735, Non-Final Office Action dated Apr. 4, 2017, 16 pages. |
| U.S. Appl. No. 15/177,147, Non-Final Office Action dated Apr. 7, 2017, 12 pages. |
| U.S. Appl. No. 14/866,512, Non-Final Office Action dated Apr. 10, 2017, 24 pages. |
| U.S. Appl. No. 14/610,971, Notice of Allowance dated Apr. 12, 2017, 11 pages. |
| China Patent Application No. CN201480030482.3, Office Action dated Feb. 4, 2017, 5 pages. |
| U.S. Appl. No. 13/829,958, Non-Final Office Action dated Jan. 8, 2018, 22 pages. |
| U.S. Appl. No. 13/830,502, Final Office Action dated Nov. 8, 2017, 27 pages. |
| U.S. Appl. No. 13/830,735, Notice of Allowance dated Jan. 26, 2018, 9 pages. |
| U.S. Appl. No. 13/838,259, Non-Final Office Action dated Nov. 27, 2017, 69 pages. |
| U.S. Appl. No. 14/036,659, Notice of Allowance dated Nov. 30, 2017, 13 pages. |
| U.S. Appl. No. 14/079,538, Final Office Action dated Nov. 16, 2017, 26 pages. |
| U.S. Appl. No. 14/559,550, Notice of Allowance dated Dec. 5, 2017, 6 pages. |
| U.S. Appl. No. 14/973,377, Non-Final Office Action dated Nov. 30, 2017, 17 pages. |
| U.S. Appl. No. 14/866,512, Notice of Allowance dated Feb. 15, 2018, 5 pages. |
| Chinese Application No. 201380056017.2, Office Action dated Jul. 17, 2017, 25 pages (9 pages of English translation and 16 pages of Original document). |
| Chinese Application No. 201380056099.0, Office Action dated Jul. 4, 2017, 26 pages (14 pages of English translation and 12 pages of Original document). |
| Chinese Application No. 201480004736.4, Office Action dated Nov. 29, 2017, 13 pages (7 pages of English translation and 6 pages of Original document). |
| European Application No. 14825489.9, Office Action dated Jul. 28, 2017, 7 pages. |
| Japanese Application No. 2015-534676, Office Action dated Jan. 23, 2018, 9 pages. |
| Japanese Application No. 2015-552781, Office Action dated Nov. 21, 2017, 3 pages. |
| Japanese Application No. 2015-558217, Office Action dated Jan. 9, 2018, 3 pages. |
| Japanese Application No. 2015-552765, Office Action dated Dec. 5, 2017, 2 pages. |
| U.S. Appl. No. 13/827,631, Final Office Action dated Aug. 30, 2017, 18 pages. |
| U.S. Appl. No. 13/830,735, Final Office Action dated Sep. 29, 2017, 16 pages. |
| U.S. Appl. No. 13/830,759, Notice of Allowance dated Aug. 23, 2017, 14 pages. |
| U.S. Appl. No. 14/037,153, Non-Final Office Action dated Aug. 10, 2017, 45 pages. |
| U.S. Appl. No. 14/755,088, Notice of Allowance dated Oct. 11, 2017, 5 pages. |
| U.S. Appl. No. 14/861,687, Non-Final Office Action dated Oct. 11, 2017, 10 pages. |
| U.S. Appl. No. 14/866,512, Final Office Action dated Sep. 13, 2017, 25 pages. |
| U.S. Appl. No. 15/177,147, Non-Final Office Action dated Nov. 3, 2017, 6 pages. |
| Japanese Application No. 2015-534678, Office Action dated Aug. 29, 2017, 3 pages. |
| Japanese Application No. 2015-534680, Office Action dated Aug. 22, 2017, 10 pages. |
| U.S. Appl. No. 13/827,631, Notice of Allowance dated Mar. 13, 2018,10 pages. |
| U.S. Appl. No. 15/177,147, Notice of Allowance dated Mar. 22, 2018, 7 pages. |
| U.S. Appl. No. 13/830,502, Notice of Allowance dated Apr. 2, 2018, 8 pages. |
| Chinese Application No. CN201380063379.4, Office Action dated Feb. 2, 2018 12 pages with translation. |
| International Patent Application PCT/RU2015/000468, International Preliminary Report on Patentability dated Feb. 8, 2018, 9 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20140095483 A1 | Apr 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61707641 | Sep 2012 | US |
