Patent Grant
9934279
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 continuously.
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.
In certain embodiments, techniques are provided (e.g., a method, a system, a non-transitory computer-readable medium storing code or instructions executable by one or more processors) for detecting patterns across multiple input data streams related to one or more applications.
In accordance with one embodiment, a method for detecting patterns across multiple input data streams related to one or more applications is disclosed. The method includes receiving a plurality of input data streams comprising a first input data stream and a second input data stream. The method further includes generating a first dynamic data type for the first input data stream and generating a second dynamic data type for the second input data stream. In some embodiments, the first dynamic data type may be generated by identifying a first attribute of the first input data stream as not being present in the second data stream. The first dynamic data type is then generated for the first attribute. The second dynamic data type may be generated by identifying a second attribute of the second input data stream as not being present in the first data stream. The second dynamic data type is then generated for the second attribute. In an embodiment, the first dynamic data type may be configured to store a first data value corresponding to the first attribute of the first input data stream and the second dynamic data type may be configured to store a second data value corresponding to the second attribute of the second input data stream.
In some embodiments, the method may include combining the first input data stream and the second input data stream to generate a combined data stream based on the first dynamic data type and the second dynamic data type. In an embodiment, the method may then include processing a continuous query over the combined data stream to detect a pattern. In some embodiments, a ‘pattern’ may constitute an occurrence of a first event in a first data stream followed by the occurrence of another event in a second data stream.
In accordance with another embodiment, a system for detecting patterns across multiple input data streams related to one or more applications is disclosed. The system includes a memory for storing a plurality of instructions and a processor configured to access the memory. In an embodiment, the processor is configured to execute instructions to receive a continuous query identifying a first input data stream and a second input data stream. The processor is further configured to execute instructions to identify a first dynamic data type for a first attribute of the first input data stream and a second dynamic data type for a second attribute of the second input data stream. In some embodiments, the processor is configured to generate a combined data stream based on the first dynamic data type and the second dynamic data type and execute the continuous query over the combined data stream to detect a pattern.
In accordance with some embodiments, a non-transitory computer-readable media storing computer executable instructions executable by one or more processors is disclosed. The computer-executable instructions comprise instructions that cause the one or more processors to receive a plurality of input data streams comprising at least a first input data stream and a second input data stream. The computer-executable instructions further comprise instructions that cause the one or more processors to generate a first dynamic data type for the first input data stream and a second dynamic data type for the second input data stream. In some embodiments, the computer-executable instructions comprise instructions to combine the first input data stream and the second input data stream to generate a combined data stream based on the first dynamic data type and the second dynamic data type and process a continuous query over the combined data stream to detect a pattern.
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 applications, data may take the form of continuous, unbounded data streams, rather than finite stored data sets. Examples of such data streams may include stock tickers in financial applications, performance measurements in network monitoring and traffic management, log records or click-streams in web tracking and personalization, data feeds from sensor applications, network packets and messages in firewall-based security, call detail records in telecommunications, and the like. Due to their continuous nature, these data streams may typically be queried using continuous queries rather than traditional one-time SQL queries.
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 a sequence of 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, etc.) 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 is specific to one event stream, events of different streams could be arbitrarily interleaved.
An event stream may have 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 “stock value.” The timestamp associated with the stream element is “timestamp N+1”. A continuous event stream is thus a flow of events, each event having the same series of attributes.
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 data 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 certain embodiments, events received in a continuous data stream may be processed at run time to detect occurrences of a specified pattern in the data stream. A ‘pattern’ may constitute a sequence of consecutive events or tuples in the continuous data stream, each satisfying certain conditions. As an example, an occurrence of an event such as a change in the trading volume of a stock that results in the occurrence of another event such as a change in pricing of the stock value and may constitute a ‘pattern’ in a continuous data stream that receives ‘stock tick’ events related to a financial application.
In the context of multiple continuous data streams, a ‘pattern’ may constitute an occurrence of a first event in a first data stream followed by the occurrence of another event in a second data stream, and so on. As an example, consider a first business process that is driven by a first sequence of events, wherein the events relate to a car rental reservation application. Similarly, consider a second business process that is driven by a second sequence of events, wherein the events relate to a flight reservation application. Additionally, assume that the first sequence of events is received via a first continuous input data stream and that the second sequence of events is received via a second continuous input data stream. In such a situation, it may be desirable to output a pattern match when the arrival of an event (e.g., a car reservation by a user) in the first continuous input data stream is followed by the arrival of another event (e.g., a flight ticket issuance to the user) in the second continuous input data stream.
In one embodiment, pattern matching across multiple continuous input data streams may be performed by applying a continuous query (e.g., a CQL query) to the incoming input data streams. In one approach, pattern matching across multiple continuous input data streams may be performed by first performing a UNION of all or a subset of all of the relevant input data streams over which pattern matching is to be performed with the result defining a view corresponding to an intermediate stream. The pattern to be matched can then be specified over this single intermediate stream. In one embodiment, the CQL language construct MATCH_RECOGNIZE clause may be used for performing pattern recognition in a CQL query that identifies multiple input data streams. The pattern may then be matched to all the streams included in the view.
As an example, consider the following CQL query, Q1, wherein Q1 is a continuous query that specifies a pattern to be matched across a first input data stream S1 and a second input data stream, S2.
Additionally, assume that stream S1 is defined by a first schema: S1 (int p1, int clientId) and stream S2 is defined by a second schema: S2 (int p2, int clientId), where p1, p2 and clientId correspond to one or more attributes of stream S1 and S2.
Query Q1 comprises a FROM clause that specifies a UNION of the streams S1 and S2. In order for the UNION ALL query to combine the result sets of the streams 1 and S2, each CQL SELECT statement within the CQL UNION ALL query is typically required to have the same number of fields in the results sets with similar data types. In the example of query Q1 shown above, the schema of stream S1 is different from the schema of stream S2. In one approach, the streams S1 and S2 may be combined by normalizing the schemas of streams S1 and S2.
In one example, the normalization of the schemas may be performed by adding an additional column to each of the schemas of streams S1 and S2. In the example of query Q1 shown above, a column is added to each of the schemas of streams S1 and S2 and populated with a hard coded value such as ‘−1L’ to normalize the schemas. However, introducing hard-coded data values into each stream is a manual process which is prone to error since hard-coded values have to be entered each time a CQL query that identifies multiple input data streams with different schemas is processed.
In one embodiment of the present disclosure, a homogeneous schema representing one or more participating input data streams is generated. In some embodiments, the homogeneous schema may be generated by creating one or more dynamic data types for one or more attributes of the participating input data streams. The generation of the dynamic data types and the homogenous schema enables each SELECT statement within the UNION ALL sub-query to include the same number of fields and similar data types so that the result sets of the streams S1 and S2 may be combined using the SELECT statements. Additionally, the generation of the dynamic data type for the attributes of the participating input data streams is performed in real-time, and hard-coded values need not be introduced into the participating input data streams each time a CQL query is processed. In one example, and as will be discussed in detail below, the dynamic data types may refer to a composite data type identified for one or more attributes of the input data streams.
In certain embodiments, the input data streams may then be combined to generate a combined data stream based on the homogenous schema. A continuous query may then be processed over the combined data stream to detect a pattern across the input data streams. In one embodiment, the CQL language construct MATCH_RECOGNIZE clause may be used for performing pattern recognition in a CQL query that identifies multiple input data streams. Additional details of the manner in which the homogeneous schema and the dynamic data types may be generated and utilized to perform pattern recognition in a CQL query that identifies multiple input data streams is discussed in detail in
Using a MATCH_RECOGNIZE clause, a user can define conditions on the attributes of incoming events and identify conditions for pattern matching by using identifiers called correlation variables. As discussed above, a sequence of consecutive events or tuples in an input data stream, each satisfying certain conditions constitutes a pattern. The pattern recognition functionality allows a user to define conditions on the attributes of incoming events or tuples and to identify these conditions by using string names called correlation variables.
In the query Q1 shown above, ‘A’ and ‘B’ are the correlation variables. The pattern to be matched is specified as a regular expression over these correlation variables and it determines the sequence or order in which conditions should be satisfied by different incoming events to be recognized as a valid match. A sequence of consecutive events in the input data stream satisfying these conditions constitutes a pattern. In one embodiment, the output of a MATCH_RECOGNIZE query is a stream. In the query Q1 shown above, the MATCH_RECOGNIZE clause also includes several sub-clauses.
The DEFINE sub-clause specifies the Boolean condition for each correlation variable. This may be specified as any logical or arithmetic expression and may apply any single-row or aggregate function to the attributes of events that match a condition. On receiving a new event via the input data stream, the conditions of the correlation variables that are relevant at that point in time are evaluated. An event is said to have matched a correlation variable if it satisfies its defining condition. A particular input can match zero, one, or more correlation variables. The relevant conditions to be evaluated on receiving an input event are determined by the processing logic governed by the PATTERN clause regular expression and the state in the pattern recognition process that has been reached after processing the earlier inputs. The condition can refer to any of the attributes of the schema of the stream or view that evaluates to a stream on which the MATCH_RECOGNIZE clause is being applied. A correlation variable in the PATTERN clause need not be specified in the DEFINE clause: the default for such a correlation variable is a predicate that is always true. Such a correlation variable matches every event.
The PARTITION BY sub-clause specifies the stream attributes by which a MATCH_RECOGNIZE clause should partition its results. Without a PARTITION BY clause, all stream attributes belong to the same partition. When a PARTITION BY clause is present along with pattern matching, the input data stream is logically divided based on the attributes mentioned in the partition list and pattern matching is done within a partition. In the query Q1 shown above, the ‘clientId’ attribute (which is an attribute that is common to the streams S1and S2) is specified in the PARTITION BY clause by which the MATCH_RECOGNIZE clause may partition its results.
The MEASURES sub-clause exports (e.g., makes available for inclusion in the SELECT clause) one or more attribute values of events that successfully match the pattern specified and also enables expressions to be specified on those attribute values. This clause may be used to define expressions over attributes of the events in the event stream that match the conditions (correlation variables) in the DEFINE clause and to alias these expressions so that they can suitably be used in the SELECT clause of the main query of which this MATCH_RECOGNIZE condition is a part. The attributes of an event stream may be referred to either directly or via a correlation variable.
The PATTERN sub-clause specifies the pattern to be matched as a regular expression over one or more correlation variables. Incoming events must match these conditions in the order given (from left to right). The regular expression may be composed of correlation variables and pattern qualifiers such as:
In certain embodiments, the one-character pattern quantifiers shown above are maximal or “greedy”; they will attempt to match as many instances of the regular expression on which they are applied as possible. The pattern quantifiers can also be two characters, which are minimal or “reluctant”; they will attempt to match as few instances of the regular expression on which they are applied as possible. Examples of two character quantifiers include without limitation:
As an example of pattern matching, consider the following pattern:
The states State 1, State 2, and State 3 may represent the various states for the pattern (AB*C), with State 3 being the final state for the pattern. When a pattern match is in a particular state and can either remain in the same particular state or can transition from the particular state to the next state due to the next event, it may imply that the binding can grow. A pattern may be considered matched if the binding is in the final state. While in state 2, if a tuple or event arrives that matches both the correlation variables B and C (since it satisfies the defining conditions of both of them) then as the quantifier * for B is greedy, that tuple may be considered to have matched B instead of C. Accordingly, due to the greedy property B may get preference over C and a greater number of B may be matched. Had the pattern expression be A B*? C, one that uses a lazy or reluctant quantifier over B, then a tuple matching both B and C may be treated as matching C only. Thus, in that example, C may get preference over B and a fewer number of B may be matched.
In the query Q1 shown above, the pattern (AB) is matched when:
State 1: Exactly one event tuple matches the condition that defines correlation variable A, is followed by
State 2 (Final state): Exactly one tuple that matches correlation variable B.
The states State 1 and State 2 represent the various possible states for the pattern (AB), with State 2 being the final state for the pattern.
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 CQL relations, generation of input relations, configurable window operators associated with the input relations, and the generation of output 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 114 and one or more processing units (or processor(s)) 134. The processor(s) 134 may be implemented as appropriate in hardware, computer-executable instructions, firmware, or combinations thereof. Computer-executable instruction or firmware implementations of the processor(s) 134 may include computer-executable or machine-executable instructions written in any suitable programming language to perform the various functions described.
The memory 114 may store program instructions that are loadable and executable on the processor(s) 134, as well as data generated during the execution of these programs. Depending on the configuration and type of service provider computers 106, the memory 114 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 136, which may include removable storage and/or non-removable storage. The additional storage 136 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 114 may include multiple different types of memory, such as static random access memory (SRAM), dynamic random access memory (DRAM), or ROM.
The memory 114, the additional storage 136, 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 114 and the additional storage 136 are all examples of computer storage media.
The service provider computers 106 may also contain communications connection(s) 138 that allow the service provider computers 106 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) 140, 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 114 in more detail, the memory 114 may include an operating system 124 and one or more application programs or services for implementing the features disclosed herein including at least an input data stream module 116, a dynamic data type generation module 118, a combined data stream generation module 120 and a pattern detection module 122. 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 other embodiments, the modules may be executed by a CQL Engine and/or a CQ Service 200 (shown in
In one embodiment, the input data stream module 116 may be configured to, receive, identify, generate, or otherwise provide one or more input data stream(s) 126. In one example, the input data stream(s) 126 may include an incoming continuous data stream of data or events related to one or more applications. In some embodiments, the input data streams 126 may be received from the data source computers 110 and/or the database 112.
In some examples, the input data stream(s) 126 may include a sequence of time stamped tuples or data records related to one or more applications. For example, each data record in the input data stream(s) 126 may include an event stream entry that may be represented by the following schema: (<time_stamp>, <attribute(s)>), where <attributes> represents the data portion of the schema and can comprise one or more attributes.
As an example, consider that the input data stream(s) 126 include a first data stream and a second data stream. For purposes of this example, further consider that the first input data stream includes a first set of events related to a first application (e.g., a car rental reservation application) and that the second input data stream includes a second set of events related to a second application (e.g., a flight reservation application). Additionally consider that the first input data stream is defined by a first schema, S1: (c1, integer, c2 integer) and that the second input data stream is defined by a second schema, S2: (c1, integer, c3 integer).
In one embodiment, the first input data stream and the second input data stream may be analyzed to detect a pattern, wherein a ‘pattern’ may constitute the occurrence of an event in a first data stream followed by the occurrence of another event in a second data stream. In one example, pattern matching may be performed by applying a continuous query (e.g., a CQL query) to the incoming continuous data streams.
In some embodiments, the analysis of the input data streams may initially be performed by the dynamic data type generation module 118. In one embodiment, the dynamic data type generation module 118 may be configured to receive the first input data stream and the second input data stream from the input data stream module 116 and identify one or more attributes in the input data streams. In some examples, the dynamic data type generation module 118 may be configured to identify a first attribute of the first data stream and a second attribute of the second data stream. In one example, the first attribute may be identified as an attribute that is not present in the second data stream and the second attribute may be identified as an attribute that is not present in the first data stream.
Per the example of the data streams S1 and S1 discussed above, in one embodiment, the dynamic data type generation module 118 may identify a first attribute ‘c2’ as an attribute in the first data stream S1 that is not present in the second data stream S2. Similarly, the dynamic data type generation module 118 may identify a second attribute ‘c3’ as an attribute in the second data stream S2 that is not present in the first data stream S1. Although the above discussion relates to a first attribute and a second attribute identified in streams S1 and S2, it is to be appreciated that the dynamic data type generation module 118 may be configured to identify additional attributes from the streams S1 and S2, in other embodiments.
In some embodiments, the dynamic data type generation module 118 may then be configured to generate a first dynamic data type for the first attribute and a second dynamic data type for the second attribute. In one example, the first dynamic data type is configured to store a first data value corresponding to the first attribute of the first data stream and the second dynamic data type is configured to store a second data value corresponding to the second attribute of the second data stream.
In some embodiments, the dynamic data type may be implemented as a composite data type that includes one or more member types, referred to herein as ‘fields.’ In one example, a member field may include a name and an associated type. The field type may be any CQL native type, such as, for example, a CQL extensible type. In some examples, a service (e.g., the CQL Engine and/or CQ Service 200 shown in
In certain embodiments, the dynamic data type generation module 118 may be configured to identify a common attribute, which may be identified as an attribute that is present in both the first data stream and the second data stream. In one embodiment, the dynamic data type generation module 118 may then be configured to generate a homogeneous schema 128 to represent the first input data stream and the second input data stream. In one example, the homogeneous schema 128 may include a representation of one or more attributes of the first input data stream and the second input data stream including the common attribute and the first dynamic data type and the second dynamic data type.
Per the example of the first input data stream S1 and the second input data stream S2 shown above, in one embodiment, a homogeneous schema S for the streams S1 and S2 may be generated as follows:
Homogeneous Schema S: ($streamName char, c1 int, S1 Typ1 @DynamicTypeCartridge, S2 Typ2@DynamicTypeCartridge)
Here, ‘$streamName’ refers to an attribute having a data type char in the homogenous schema. The ‘$streamName’ attribute identifies the input data stream source of the received input tuple (event) from the input data stream. For an event ‘e’, the ‘$streamName’ attribute may store the name of the stream alias in which ‘e’ is an event. Thus, the ‘$streamName’ attribute enables the identification of a particular input data stream to which the current input event (tuple) belongs. ‘c1’ refers to a common attribute in the homogeneous schema, wherein the common attribute is identified as an attribute that has the same datatype and the same name in every participating input data stream. For example, the common attribute ‘c1’ may refer to a user attribute that identifies a user accessing the first application and the second application related to the input data streams S1 and S2. In some examples, a homogeneous schema including a common attribute may enable the specification of a PARTITION by clause to create a sub-stream which itself could contains events from different input data streams.
In addition, ‘Typ1@DynamicTypeCartridge’ refers to a first dynamic data type configured to store a first data value corresponding to the first attribute of the first data stream. In one example, the ‘Typ1@DynamicTypeCartridge’ may be used to store data values corresponding to the first attribute ‘c2’ in the first input data stream S1. As an example, the first attribute ‘c2’ in the first input data stream S1 may refer to a car reservation attribute that stores a car reservation identification number from a user accessing the first application (e.g., the car rental reservation application).
Similarly, ‘Typ2@DynamicTypeCartridge’ refers to a second dynamic data type configured to store a second data value corresponding to the second attribute of the second data stream. In one example, the ‘Typ2@DynamicTypeCartridge’ may be used to store data values corresponding to the second attribute ‘c3’ in the second input data stream S2. As an example, the second attribute ‘c3’ in the second input data stream S2 may refer to a flight reservation attribute that stores a flight reservation identification number for the user accessing the second application (e.g., the flight reservation application).
For the above example, it may be observed that there is one attribute (e.g., ‘c2 ’) for S1 of type, ‘Typ1@DynamicTypeCartridge’ and one attribute (e.g., ‘c3’) for S2 of type ‘Typ2@DynamicTypeCartridge.’ ‘Typ1@DynamicTypeCartridge’ may include one public field for each attribute of stream S1 of the same datatype. Similarly, ‘Typ2@DynamicTypeCartridge’ may include one public field for each attribute of stream S2. It may be noted that the Typ1 and Typ2 are internal types and may not be visible to the end user. For the example considered, Typ1 may include public fields ‘c1’ and ‘c2’ while Typ2 may include public fields ‘c1’ and ‘c 3.’
Based on the homogeneous schema thus generated, in one embodiment, the combined data stream generation module 120 may be configured to generate a combined data stream. In one example, the combined data stream may be generated by performing a UNION of the first input data stream and the second input data stream, wherein the first input data stream and the second input data stream are represented by the homogenous schema S. In one example, a CQL UNION ALL sub-query may be applied to the first data stream S1 and the second data stream S2 to combine the result sets of the streams S1 and S2 based on the homogeneous schema. The generation of a homogeneous schema enables each CQL SELECT statement within the UNION ALL sub-query to have the same number of fields and similar data types in the results sets. Accordingly, the result sets of the streams S1 and S2 may be combined using the SELECT statements in the UNION ALL sub-query based on the homogeneous schema. The manner in which a first data stream and a second data stream may be combined using a UNION ALL sub-query to generate a combined data stream is discussed in
In some embodiments, the pattern detection module 122 may then be configured to detect a pattern 132 based on the combined data stream. In one embodiment, the pattern detection module may be configured to output a pattern match by applying a MATCH_RECOGNIZE clause to the combined data stream. As an example, a detected pattern may include the arrival of a first event (e.g., a car reservation by a user) in the first input data stream S1 followed by the arrival of a second event (e.g., a flight ticket issuance to the user) in the second input data stream S2. The manner in which the pattern detection module may be configured to perform pattern recognition in a CQL query that identifies multiple input data streams is discussed in
The input data streams S1 and S2 may then be combined to generate a combined data stream based on the homogenous schema. In one embodiment, the combined data stream may be generated by the combined data stream module 120. The pattern detection module 122 may then process a continuous query (e.g., a CQL query) over the combined data stream to detect a pattern across the input data streams. In one embodiment, the pattern detection module may be configured to output a pattern match by applying a MATCH_RECOGNIZE clause to the combined data stream. In some examples, the CQL Engine and/or CQ Service 200 may then store the detected pattern in an output destination 212, such as for example, in the databases 112 shown in
When streams S1 and S2 are specified using a comma separated list as discussed above, each of the participating streams may need to be identified with a distinct alias. So, for example, if a MATCH_RECOGNIZE clause is applied over {S, S} then the FROM clause may need to be specified as (S, S AS S1) MATCH_RECOGNIZE. That is, an optional AS clause may need to be introduced to alias the second stream S to ensure distinct alias names. It may be noted that if no explicit AS clause is specified, the stream name may be considered as the alias name, in other examples.
In some embodiments, the expression of the streams S1 and S2 as a comma separated list may evaluate to a UNION of the input data streams S1 and S2, wherein the streams S1 and S2 are defined by a homogeneous schema. In one embodiment, and as discussed in detail in
As discussed above, using the MATCH_RECOGNIZE clause, a user can define conditions on the attributes of incoming events and identify conditions for pattern matching by using identifiers called correlation variables. The pattern recognition functionality allows a user to define conditions on the attributes of incoming events or tuples and to identify these conditions by using string names called correlation variables.
In the query 300, ‘A’ is a correlation variable. The pattern to be matched is specified as a regular expression over this correlation variable and it determines the sequence or order in which conditions should be satisfied by different incoming events to be recognized as a valid match. In one example, a sequence of consecutive events in the input data streams S1 and S2 satisfying these conditions constitutes a pattern. In one embodiment, the output of a MATCH_RECOGNIZE query is a stream.
For the example shown in
Homogeneous Schema S: ($streamName char, c1 int, ELEMENT_TIME int, S1Typ1@DynamicTypeCartridge, S2 Typ2@DynamicTypeCartridgeCartridge)
Here, ‘Typ1@DynamicTypeCartridge’ represents a first dynamic data type generated for an attribute of stream S1 that is not present in stream S2. Similarly, ‘Typ2@DynamicTypeCartridge’ represents a second dynamic data type generated for an attribute of stream S2 that is not present in stream S1. For the example shown in
In one embodiment, the generation of the dynamic data types and the homogenous schema discussed above may enable individual stream specific attributes of the streams S1 and S2, to be accessed as follows. At runtime, for an event received from stream S1, the ‘Typ1@DynamicTypeCartridge’ dynamic data type may be configured to represent the first attribute ‘c2’ from stream S1 that is not in S2 using the expression: ‘Typ1@DynamicTypeCartridge(c1, c2) AS S1’, while the ‘Typ2@DynamicTypeCartridge’ dynamic data type may be configured to represent the second attribute ‘c3’ from stream S2 that is not in S1 using the expression: ‘Typ2@DynamicTypeCartridge( ) AS S2.’ In one example, the ‘Typ2@DynamicTypeCartridge’ may store a NULL value for the second attribute ‘c3’ of stream S2 for the received event.
Similarly, for an event received from stream S2, the ‘Typ1@DynamicTypeCartridge’ dynamic data type may be configured to represent the first attribute (c2′) from stream S1 that is not in S2 as ‘Typ1@DynamicTypeCartridge( ) AS S1’ and store a NULL value for the attribute ‘c2.’ Additionally, the ‘Typ2@DynamicTypeCartridge’ may be configured to represent the second attribute ‘c3’ from stream S2 that is not in S1 using the expression: ‘Typ2@DynamicTypeCartridge(c1 c3) AS S2.’ In one embodiment, using the dynamic data type representations discussed above, the attribute ‘c2’ may be accessed in a CQL query as S1 .c2 and the attribute ‘c3’ may be accessed in the CQL query as S2.c3.
Additionally, in the example shown in
It may be appreciated that the generation of a homogeneous schema and the dynamic data types discussed above enables each CQL SELECT statement within the UNION ALL query to have the same number of fields and similar data types in the results sets. Additionally, the dynamic data types enable the assignment of ‘NULL’ values to attributes that do not belong to a specific stream. In one embodiment, the result sets of the streams S1 and S2 may then be combined to generate a combined data stream based on the homogeneous schema by applying a CQL UNION ALL sub-query to combine the result sets of the streams S1 and S2. The manner in which a combined data stream may be generated may be explained using the following non-limiting example.
As an example, consider that the first input data stream S1 receives the following events and associated timestamps:
Similarly, consider that the second input data stream S2 receives the following events and associated timestamps:
The result sets of the streams S1 and S2 shown above may be combined to generate a combined data stream as shown below. In one example, the combined data stream includes the result sets of the streams S1 and S2 that may be combined using the SELECT statements in the UNION ALL sub-query based on the homogeneous schema as discussed above. In one example, the combined data stream may be identified by the following homogenous schema ($streamName, c1, S1.c2, S2,c3) and may include the following events and associated timestamps:
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.
At 504, the process 500 may include generating a homogeneous schema to represent the first input data stream and the second input data stream. The process by which a homogeneous schema may be generated is discussed in detail in
At 506, the process 500 may include combining the first input data stream and the second input data stream to generate a combined data stream based on the homogeneous schema. In one embodiment, generating a combined data stream may include selecting a first set of tuples (via a first CQL SELECT statement) from the first input data stream, selecting a second set of tuples (via a first CQL SELECT statement) from the second input stream and processing a sub-query (e.g., a UNION all sub-query) over the first set of tuples and the second set of tuples to generate the combined data stream. As discussed above, the generation of a homogeneous schema enables each CQL SELECT statement within the UNION ALL sub-query to have the same number of fields and similar data types in the results sets. Accordingly, the result sets of the streams S1 and S2 may be combined using the SELECT statements in the UNION ALL sub-query based on the homogeneous schema to generate the combined data stream.
At 508, the process 500 may include processing a continuous query (e.g., a CQL query) over the combined data stream to identify a pattern. In one embodiment, the combined data stream generated based upon the execution of the UNION ALL sub-query may be provided as an input to the MATCH_RECOGNIZE clause. As discussed in
At 602, the process 600 may include identifying a first attribute of the first input data stream.
At 604, the process may include identifying a second attribute of the second input data stream. In one embodiment, the first attribute may be identified as an attribute that is not present in the second input data stream and the second attribute may be identified as an attribute that is not present in the first input data stream.
At 606, the process 600 may include generating a first dynamic data type to represent the first attribute of the first input data stream. At 608, the process 600 may include generating a second dynamic data type to represent the second attribute of the second input data stream.
At 610, the process 600 may include identifying a common attribute. In one embodiment, the common attribute may be identified as an attribute that is present in the first input data stream and the second input data stream.
At 612, the process 600 may include generating a homogeneous schema. In one embodiment, and as described in
In one embodiment, EPS 702 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 702 may support ultra-high throughput and microsecond latency for processing events, for example, by using JRockit Real Time. EPS 702 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 720 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 702 without having to store all the received events data. Accordingly, EPS 702 provides a special querying mechanism that enables processing of events to be performed as the events are received by EPS 702 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 702 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 702 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 700 depicted in
The one or more of the components depicted in
Systems depicted in some of the figures may be provided in various configurations. In some embodiments, the systems may be configured as a distributed system where one or more components of the system are distributed across one or more networks in a cloud computing system.
In various embodiments, server 812 may be adapted to run one or more services or software applications provided by one or more of the components of the system. The services or software applications can include nonvirtual and virtual environments. Virtual environments can include those used for virtual events, tradeshows, simulators, classrooms, shopping exchanges, and enterprises, whether two- or three-dimensional (3D) representations, page-based logical environments, or otherwise. In some embodiments, these services may be offered as web-based or cloud services or under a Software as a Service (SaaS) model to the users of client computing devices 802, 804, 806, and/or 808. Users operating client computing devices 802, 804, 806, and/or 808 may in turn utilize one or more client applications to interact with server 812 to utilize the services provided by these components.
In the configuration depicted in the figure, the software components 818, 820 and 822 of system 800 are shown as being implemented on server 812. In other embodiments, one or more of the components of system 800 and/or the services provided by these components may also be implemented by one or more of the client computing devices 802, 804, 806, and/or 808. Users operating the client computing devices may then utilize one or more client applications to use the services provided by these components. These components may be implemented in hardware, firmware, software, or combinations thereof. It should be appreciated that various different system configurations are possible, which may be different from distributed system 800. The embodiment shown in the figure is thus one example of a distributed system for implementing an embodiment system and is not intended to be limiting.
Client computing devices 802, 804, 806, and/or 808 may be portable handheld devices (e.g., an iPhone®, cellular telephone, an iPad®, computing tablet, a personal digital assistant (PDA)) or wearable devices (e.g., a Google Glass® head mounted display), running software such as Microsoft Windows Mobile®, and/or a variety of mobile operating systems such as iOS, Windows Phone, Android, BlackBerry 10, Palm OS, and the like, and being Internet, e-mail, short message service (SMS), Blackberry®, or other communication protocol enabled. The client computing devices can be general purpose personal computers including, by way of example, personal computers and/or laptop computers running various versions of Microsoft Windows®, Apple Macintosh®, and/or Linux operating systems. The client computing devices can be 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, such as for example, Google Chrome OS. Alternatively, or in addition, client computing devices 802, 804, 806, and 808 may be any other electronic device, such as a thin-client computer, an Internet-enabled gaming system (e.g., a Microsoft Xbox gaming console with or without a Kinect® gesture input device), and/or a personal messaging device, capable of communicating over network(s) 810.
Although exemplary distributed system 800 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 812.
Network(s) 810 in distributed system 800 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 (transmission control protocol/Internet protocol), SNA (systems network architecture), IPX (Internet packet exchange), AppleTalk, and the like. Merely by way of example, network(s) 810 can be a local area network (LAN), such as one based on Ethernet, Token-Ring and/or the like. Network(s) 810 can be a wide-area network and the Internet. It can include a virtual network, including without limitation a virtual private network (VPN), 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 Institute of Electrical and Electronics (IEEE) 802.11 suite of protocols, Bluetooth®, and/or any other wireless protocol); and/or any combination of these and/or other networks.
Server 812 may be composed of one or more general purpose computers, specialized server computers (including, by way of example, PC (personal computer) servers, UNIXO servers, mid-range servers, mainframe computers, rack-mounted servers, etc.), server farms, server clusters, or any other appropriate arrangement and/or combination. Server 812 can include one or more virtual machines running virtual operating systems, or other computing architectures involving virtualization. One or more flexible pools of logical storage devices can be virtualized to maintain virtual storage devices for the server. Virtual networks can be controlled by server 812 using software defined networking. In various embodiments, server 812 may be adapted to run one or more services or software applications described in the foregoing disclosure. For example, server 812 may correspond to a server for performing processing described above according to an embodiment of the present disclosure.
Server 812 may run an operating system including any of those discussed above, as well as any commercially available server operating system. Server 812 may also run any of a variety of additional server applications and/or mid-tier applications, including HTTP (hypertext transport protocol) servers, FTP (file transfer protocol) servers, CGI (common gateway interface) servers, JAVA® servers, database servers, and the like. Exemplary database servers include without limitation those commercially available from Oracle, Microsoft, Sybase, IBM (International Business Machines), and the like.
In some implementations, server 812 may include one or more applications to analyze and consolidate data feeds and/or event updates received from users of client computing devices 802, 804, 806, and 808. As an example, data feeds and/or event updates may include, but are not limited to, Twitter® feeds, Facebook® updates or real-time updates received from one or more third party information sources and continuous data streams, which may include real-time events related 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. Server 812 may also include one or more applications to display the data feeds and/or real-time events via one or more display devices of client computing devices 802, 804, 806, and 808.
Distributed system 800 may also include one or more databases 814 and 816. Databases 814 and 816 may reside in a variety of locations. By way of example, one or more of databases 814 and 816 may reside on a non-transitory storage medium local to (and/or resident in) server 812. Alternatively, databases 814 and 816 may be remote from server 812 and in communication with server 812 via a network-based or dedicated connection. In one set of embodiments, databases 814 and 816 may reside in a storage-area network (SAN). Similarly, any necessary files for performing the functions attributed to server 812 may be stored locally on server 812 and/or remotely, as appropriate. In one set of embodiments, databases 814 and 816 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.
It should be appreciated that cloud infrastructure system 902 depicted in the figure may have other components than those depicted. Further, the embodiment shown in the figure is only one example of a cloud infrastructure system that may incorporate an embodiment of the invention. In some other embodiments, cloud infrastructure system 902 may have more or fewer components than shown in the figure, may combine two or more components, or may have a different configuration or arrangement of components.
Client computing devices 904, 906, and 908 may be devices similar to those described above for 802, 804, 806, and 808.
Although exemplary system environment 900 is shown with three client computing devices, any number of client computing devices may be supported. Other devices such as devices with sensors, etc. may interact with cloud infrastructure system 902.
Network(s) 910 may facilitate communications and exchange of data between clients 904, 906, and 908 and cloud infrastructure system 902. Each network 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 those described above for network(s) 810.
Cloud infrastructure system 902 may comprise one or more computers and/or servers that may include those described above for server 812.
In certain embodiments, services provided by the cloud infrastructure system may include a host of services that are made available to users of the cloud infrastructure system on demand, such as online data storage and backup solutions, Web-based e-mail services, hosted office suites and document collaboration services, database processing, managed technical support services, and the like. Services provided by the cloud infrastructure system can dynamically scale to meet the needs of its users. A specific instantiation of a service provided by cloud infrastructure system is referred to herein as a “service instance.” In general, any service made available to a user via a communication network, such as the Internet, from a cloud service provider's system is referred to as a “cloud service.” Typically, in a public cloud environment, servers and systems that make up the cloud service provider's system are different from the customer's own on-premises servers and systems. For example, a cloud service provider's system may host an application, and a user may, via a communication network such as the Internet, on demand, order and use the application.
In some examples, a service in a computer network cloud infrastructure may include protected computer network access to storage, a hosted database, a hosted web server, a software application, or other service provided by a cloud vendor to a user, or as otherwise known in the art. For example, a service can include password-protected access to remote storage on the cloud through the Internet. As another example, a service can include a web service-based hosted relational database and a script-language middleware engine for private use by a networked developer. As another example, a service can include access to an email software application hosted on a cloud vendor's web site.
In certain embodiments, cloud infrastructure system 902 may include a suite of applications, middleware, and database service offerings that are delivered to a customer in a self-service, subscription-based, elastically scalable, reliable, highly available, and secure manner. An example of such a cloud infrastructure system is the Oracle Public Cloud provided by the present assignee.
‘Big data’ can be hosted and/or manipulated by the infrastructure system on many levels and at different scales. Extremely large data sets can be stored and manipulated by analysts and researchers to visualize large amounts of data, detect trends, and/or otherwise interact with the data. Tens, hundreds, or thousands of processors linked in parallel can act upon such data in order to present it or simulate external forces on the data or what it represents. These data sets can involve structured data, such as that organized in a database or otherwise according to a structured model, and/or unstructured data (e.g., emails, images, data blobs (binary large objects), web pages, complex event processing). By leveraging an ability of an embodiment to relatively quickly focus more (or fewer) computing resources upon an objective, the cloud infrastructure system may be better available to carry out tasks on large data sets based on demand from a business, government agency, research organization, private individual, group of like-minded individuals or organizations, or other entity.
In various embodiments, cloud infrastructure system 902 may be adapted to automatically provision, manage and track a customer's subscription to services offered by cloud infrastructure system 902. Cloud infrastructure system 902 may provide the cloud services via different deployment models. For example, services may be provided under a public cloud model in which cloud infrastructure system 902 is owned by an organization selling cloud services (e.g., owned by Oracle) and the services are made available to the general public or different industry enterprises. As another example, services may be provided under a private cloud model in which cloud infrastructure system 902 is operated solely for a single organization and may provide services for one or more entities within the organization. The cloud services may also be provided under a community cloud model in which cloud infrastructure system 902 and the services provided by cloud infrastructure system 902 are shared by several organizations in a related community. The cloud services may also be provided under a hybrid cloud model, which is a combination of two or more different models.
In some embodiments, the services provided by cloud infrastructure system 902 may include one or more services provided under Software as a Service (SaaS) category, Platform as a Service (PaaS) category, Infrastructure as a Service (IaaS) category, or other categories of services including hybrid services. A customer, via a subscription order, may order one or more services provided by cloud infrastructure system 902. Cloud infrastructure system 902 then performs processing to provide the services in the customer's subscription order.
In some embodiments, the services provided by cloud infrastructure system 902 may include, without limitation, application services, platform services and infrastructure services. In some examples, application services may be provided by the cloud infrastructure system via a SaaS platform. The SaaS platform may be configured to provide cloud services that fall under the SaaS category. For example, the SaaS platform may provide capabilities to build and deliver a suite of on-demand applications on an integrated development and deployment platform. The SaaS platform may manage and control the underlying software and infrastructure for providing the SaaS services. By utilizing the services provided by the SaaS platform, customers can utilize applications executing on the cloud infrastructure system. Customers can acquire the application services without the need for customers to purchase separate licenses and support. Various different SaaS services may be provided. Examples include, without limitation, services that provide solutions for sales performance management, enterprise integration, and business flexibility for large organizations.
In some embodiments, platform services may be provided by the cloud infrastructure system via a PaaS platform. The PaaS platform may be configured to provide cloud services that fall under the PaaS category. Examples of platform services may include without limitation services that enable organizations (such as Oracle) to consolidate existing applications on a shared, common architecture, as well as the ability to build new applications that leverage the shared services provided by the platform. The PaaS platform may manage and control the underlying software and infrastructure for providing the PaaS services. Customers can acquire the PaaS services provided by the cloud infrastructure system without the need for customers to purchase separate licenses and support. Examples of platform services include, without limitation, Oracle Java Cloud Service (JCS), Oracle Database Cloud Service (DBCS), and others.
By utilizing the services provided by the PaaS platform, customers can employ programming languages and tools supported by the cloud infrastructure system and also control the deployed services. In some embodiments, platform services provided by the cloud infrastructure system may include database cloud services, middleware cloud services (e.g., Oracle Fusion Middleware services), and Java cloud services. In one embodiment, database cloud services may support shared service deployment models that enable organizations to pool database resources and offer customers a Database as a Service in the form of a database cloud. Middleware cloud services may provide a platform for customers to develop and deploy various business applications, and Java cloud services may provide a platform for customers to deploy Java applications, in the cloud infrastructure system.
Various different infrastructure services may be provided by an IaaS platform in the cloud infrastructure system. The infrastructure services facilitate the management and control of the underlying computing resources, such as storage, networks, and other fundamental computing resources for customers utilizing services provided by the SaaS platform and the PaaS platform.
In certain embodiments, cloud infrastructure system 902 may also include infrastructure resources 930 for providing the resources used to provide various services to customers of the cloud infrastructure system. In one embodiment, infrastructure resources 930 may include pre-integrated and optimized combinations of hardware, such as servers, storage, and networking resources to execute the services provided by the PaaS platform and the SaaS platform.
In some embodiments, resources in cloud infrastructure system 902 may be shared by multiple users and dynamically re-allocated per demand. Additionally, resources may be allocated to users in different time zones. For example, cloud infrastructure system 930 may enable a first set of users in a first time zone to utilize resources of the cloud infrastructure system for a specified number of hours and then enable the re-allocation of the same resources to another set of users located in a different time zone, thereby maximizing the utilization of resources.
In certain embodiments, a number of internal shared services 932 may be provided that are shared by different components or modules of cloud infrastructure system 902 and by the services provided by cloud infrastructure system 902. These internal shared services may include, without limitation, a security and identity service, an integration service, an enterprise repository service, an enterprise manager service, a virus scanning and white list service, a high availability, backup and recovery service, service for enabling cloud support, an email service, a notification service, a file transfer service, and the like.
In certain embodiments, cloud infrastructure system 902 may provide comprehensive management of cloud services (e.g., SaaS, PaaS, and IaaS services) in the cloud infrastructure system. In one embodiment, cloud management functionality may include capabilities for provisioning, managing and tracking a customer's subscription received by cloud infrastructure system 902, and the like.
In one embodiment, as depicted in the figure, cloud management functionality may be provided by one or more modules, such as an order management module 920, an order orchestration module 922, an order provisioning module 924, an order management and monitoring module 926, and an identity management module 928. These modules may include or be provided using one or more computers and/or servers, which may be general purpose computers, specialized server computers, server farms, server clusters, or any other appropriate arrangement and/or combination.
In exemplary operation 934, a customer using a client device, such as client device 904, 906 or 908, may interact with cloud infrastructure system 902 by requesting one or more services provided by cloud infrastructure system 902 and placing an order for a subscription for one or more services offered by cloud infrastructure system 902. In certain embodiments, the customer may access a cloud User Interface (UI), cloud UI 912, cloud UI 914 and/or cloud UI 916 and place a subscription order via these UIs. The order information received by cloud infrastructure system 902 in response to the customer placing an order may include information identifying the customer and one or more services offered by the cloud infrastructure system 902 that the customer intends to subscribe to.
After an order has been placed by the customer, the order information is received via the cloud UIs, 912, 914 and/or 916.
At operation 936, the order is stored in order database 918. Order database 918 can be one of several databases operated by cloud infrastructure system 918 and operated in conjunction with other system elements.
At operation 938, the order information is forwarded to an order management module 920. In some instances, order management module 920 may be configured to perform billing and accounting functions related to the order, such as verifying the order, and upon verification, booking the order.
At operation 940, information regarding the order is communicated to an order orchestration module 922. Order orchestration module 922 may utilize the order information to orchestrate the provisioning of services and resources for the order placed by the customer. In some instances, order orchestration module 922 may orchestrate the provisioning of resources to support the subscribed services using the services of order provisioning module 924.
In certain embodiments, order orchestration module 922 enables the management of business processes associated with each order and applies business logic to determine whether an order should proceed to provisioning. At operation 942, upon receiving an order for a new subscription, order orchestration module 922 sends a request to order provisioning module 924 to allocate resources and configure those resources needed to fulfill the subscription order. Order provisioning module 924 enables the allocation of resources for the services ordered by the customer. Order provisioning module 924 provides a level of abstraction between the cloud services provided by cloud infrastructure system 900 and the physical implementation layer that is used to provision the resources for providing the requested services. Order orchestration module 922 may thus be isolated from implementation details, such as whether or not services and resources are actually provisioned on the fly or pre-provisioned and only allocated/assigned upon request.
At operation 944, once the services and resources are provisioned, a notification of the provided service may be sent to customers on client devices 904, 906 and/or 908 by order provisioning module 924 of cloud infrastructure system 902.
At operation 946, the customer's subscription order may be managed and tracked by an order management and monitoring module 926. In some instances, order management and monitoring module 926 may be configured to collect usage statistics for the services in the subscription order, such as the amount of storage used, the amount data transferred, the number of users, and the amount of system up time and system down time.
In certain embodiments, cloud infrastructure system 900 may include an identity management module 928. Identity management module 928 may be configured to provide identity services, such as access management and authorization services in cloud infrastructure system 900. In some embodiments, identity management module 928 may control information about customers who wish to utilize the services provided by cloud infrastructure system 902. Such information can include information that authenticates the identities of such customers and information that describes which actions those customers are authorized to perform relative to various system resources (e.g., files, directories, applications, communication ports, memory segments, etc.) Identity management module 928 may also include the management of descriptive information about each customer and about how and by whom that descriptive information can be accessed and modified.
Bus subsystem 1002 provides a mechanism for letting the various components and subsystems of computer system 1000 communicate with each other as intended. Although bus subsystem 1002 is shown schematically as a single bus, alternative embodiments of the bus subsystem may utilize multiple buses. Bus subsystem 1002 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. For example, such architectures may include an Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus, which can be implemented as a Mezzanine bus manufactured to the IEEE P1386.1 standard.
Processing unit 1004, which can be implemented as one or more integrated circuits (e.g., a conventional microprocessor or microcontroller), controls the operation of computer system 1000. One or more processors may be included in processing unit 1004. These processors may include single core or multicore processors. In certain embodiments, processing unit 1004 may be implemented as one or more independent processing units 1032 and/or 1034 with single or multicore processors included in each processing unit. In other embodiments, processing unit 1004 may also be implemented as a quad-core processing unit formed by integrating two dual-core processors into a single chip.
In various embodiments, processing unit 1004 can execute a variety of programs in response to program code and can maintain multiple concurrently executing programs or processes. At any given time, some or all of the program code to be executed can be resident in processor(s) 1004 and/or in storage subsystem 1018. Through suitable programming, processor(s) 1004 can provide various functionalities described above. Computer system 1000 may additionally include a processing acceleration unit 1006, which can include a digital signal processor (DSP), a special-purpose processor, and/or the like.
I/O subsystem 1008 may include user interface input devices and user interface output devices. User interface input devices may include a keyboard, pointing devices such as a mouse or trackball, a touchpad or touch screen incorporated into a display, a scroll wheel, a click wheel, a dial, a button, a switch, a keypad, audio input devices with voice command recognition systems, microphones, and other types of input devices. User interface input devices may include, for example, motion sensing and/or gesture recognition devices such as the Microsoft Kinect® motion sensor that enables users to control and interact with an input device, such as the Microsoft Xbox® 360 game controller, through a natural user interface using gestures and spoken commands. User interface input devices may also include eye gesture recognition devices such as the Google Glass® blink detector that detects eye activity (e.g., ‘blinking’ while taking pictures and/or making a menu selection) from users and transforms the eye gestures as input into an input device (e.g., Google Glass®). Additionally, user interface input devices may include voice recognition sensing devices that enable users to interact with voice recognition systems (e.g., Siri® navigator), through voice commands.
User interface input devices may also include, without limitation, three dimensional (3D) mice, joysticks or pointing sticks, gamepads and graphic tablets, and audio/visual devices such as speakers, digital cameras, digital camcorders, portable media players, webcams, image scanners, fingerprint scanners, barcode reader 3D scanners, 3D printers, laser rangefinders, and eye gaze tracking devices. Additionally, user interface input devices may include, for example, medical imaging input devices such as computed tomography, magnetic resonance imaging, position emission tomography, medical ultrasonography devices. User interface input devices may also include, for example, audio input devices such as MIDI keyboards, digital musical instruments and the like.
User interface output devices may include a display subsystem, indicator lights, or non-visual displays such as audio output devices, etc. The display subsystem may be a cathode ray tube (CRT), a flat-panel device, such as that using a liquid crystal display (LCD) or plasma display, a projection device, a touch screen, and the like. In general, use of the term “output device” is intended to include all possible types of devices and mechanisms for outputting information from computer system 1000 to a user or other computer. For example, user interface output devices may include, without limitation, a variety of display devices that visually convey text, graphics and audio/video information such as monitors, printers, speakers, headphones, automotive navigation systems, plotters, voice output devices, and modems.
Computer system 1000 may comprise a storage subsystem 1018 that comprises software elements, shown as being currently located within a system memory 1010. System memory 1010 may store program instructions that are loadable and executable on processing unit 1004, as well as data generated during the execution of these programs.
Depending on the configuration and type of computer system 1000, system memory 1010 may be volatile (such as random access memory (RAM)) and/or non-volatile (such as read-only memory (ROM), flash memory, etc.) The RAM typically contains data and/or program modules that are immediately accessible to and/or presently being operated and executed by processing unit 1004. In some implementations, system memory 1010 may include multiple different types of memory, such as static random access memory (SRAM) or dynamic random access memory (DRAM). In some implementations, a basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within computer system 1000, such as during start-up, may typically be stored in the ROM. By way of example, and not limitation, system memory 1010 also illustrates application programs 1012, which may include client applications, Web browsers, mid-tier applications, relational database management systems (RDBMS), etc., program data 1014, and an operating system 1016. By way of example, operating system 1016 may include various versions of Microsoft Windows®, Apple Macintosh®, and/or Linux operating systems, a variety of commercially-available UNIX® or UNIX-like operating systems (including without limitation the variety of GNU/Linux operating systems, the Google Chrome® OS, and the like) and/or mobile operating systems such as iOS, Windows® Phone, Android® OS, BlackBerry® 10 OS, and Palm® OS operating systems.
Storage subsystem 1018 may also provide a tangible computer-readable storage medium for storing the basic programming and data constructs that provide the functionality of some embodiments. Software (programs, code modules, instructions) that when executed by a processor provide the functionality described above may be stored in storage subsystem 1018. These software modules or instructions may be executed by processing unit 1004. Storage subsystem 1018 may also provide a repository for storing data used in accordance with the present invention.
Storage subsystem 1000 may also include a computer-readable storage media reader 1020 that can further be connected to computer-readable storage media 1022. Together and, optionally, in combination with system memory 1010, computer-readable storage media 1022 may comprehensively represent remote, local, fixed, and/or removable storage devices plus storage media for temporarily and/or more permanently containing, storing, transmitting, and retrieving computer-readable information.
Computer-readable storage media 1022 containing code, or portions of code, can also 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, removable and non-removable media implemented in any method or technology for storage and/or transmission of information. This can include tangible, non-transitory computer-readable storage media such as RAM, ROM, electronically erasable programmable 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, or other tangible computer readable media. When specified, this can also include nontangible, transitory computer-readable media, such as data signals, data transmissions, or any other medium which can be used to transmit the desired information and which can be accessed by computing system 1000.
By way of example, computer-readable storage media 1022 may include a hard disk drive that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive that reads from or writes to a removable, nonvolatile magnetic disk, and an optical disk drive that reads from or writes to a removable, nonvolatile optical disk such as a CD ROM, DVD, and Blu-Ray® disk, or other optical media. Computer-readable storage media 1022 may include, but is not limited to, Zip® drives, flash memory cards, universal serial bus (USB) flash drives, secure digital (SD) cards, DVD disks, digital video tape, and the like. Computer-readable storage media 1022 may also include, solid-state drives (SSD) based on non-volatile memory such as flash-memory based SSDs, enterprise flash drives, solid state ROM, and the like, SSDs based on volatile memory such as solid state RAM, dynamic RAM, static RAM, DRAM-based SSDs, magnetoresistive RAM (MRAM) SSDs, and hybrid SSDs that use a combination of DRAM and flash memory based SSDs. 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 computer system 1000.
Communications subsystem 1024 provides an interface to other computer systems and networks. Communications subsystem 1024 serves as an interface for receiving data from and transmitting data to other systems from computer system 1000. For example, communications subsystem 1024 may enable computer system 1000 to connect to one or more devices via the Internet. In some embodiments communications subsystem 1024 can include radio frequency (RF) transceiver components for accessing wireless voice and/or data networks (e.g., using cellular telephone technology, advanced data network technology, such as 3G, 4G or EDGE (enhanced data rates for global evolution), WiFi (IEEE 802.11 family standards, or other mobile communication technologies, or any combination thereof), global positioning system (GPS) receiver components, and/or other components. In some embodiments communications subsystem 1024 can provide wired network connectivity (e.g., Ethernet) in addition to or instead of a wireless interface.
In some embodiments, communications subsystem 1024 may also receive input communication in the form of structured and/or unstructured data feeds 1026, event streams 1028, event updates 1030, and the like on behalf of one or more users who may use computer system 1000.
By way of example, communications subsystem 1024 may be configured to receive data feeds 1026 in real-time from users of social media networks and/or other communication services such as Twitter® feeds, Facebook® updates, web feeds such as Rich Site Summary (RSS) feeds, and/or real-time updates from one or more third party information sources.
Additionally, communications subsystem 1024 may also be configured to receive data in the form of continuous data streams, which may include event streams 1028 of real-time events and/or event updates 1030, that may be continuous or unbounded in nature with no explicit end. Examples of applications that generate continuous data may include, for example, 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.
Communications subsystem 1024 may also be configured to output the structured and/or unstructured data feeds 1026, event streams 1028, event updates 1030, and the like to one or more databases that may be in communication with one or more streaming data source computers coupled to computer system 1000.
Computer system 1000 can be one of various types, including a handheld portable device (e.g., an iPhone® cellular phone, an iPad® computing tablet, a PDA), a wearable device (e.g., a Google Glass® head mounted display), a PC, a workstation, a mainframe, a kiosk, a server rack, or any other data processing system.
Due to the ever-changing nature of computers and networks, the description of computer system 1000 depicted in the figure is intended only as a specific example. Many other configurations having more or fewer components than the system depicted in the figure are possible. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, firmware, software (including applets), or a combination. Further, connection to other computing devices, such as network input/output devices, may be employed. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will appreciate other ways and/or methods to implement the various embodiments.
In the foregoing specification, aspects of the invention are described with reference to specific embodiments thereof, but those skilled in the art will recognize that the invention is not limited thereto. Various features and aspects of the above-described invention may be used individually or jointly. Further, embodiments can be utilized in any number of environments and applications beyond those described herein without departing from the broader spirit and scope of the specification. The specification and drawings are, accordingly, to be regarded as illustrative rather than restrictive.
This application claims priority under 35 U.S.C. 119(e), to U.S. Provisional Patent Application No. 61/912,344, filed on Dec. 5, 2013, entitled “PATTERN MATCHING ACROSS MULTIPLE INPUT DATA STREAMS,” the entire contents of which is incorporated by reference in its entirety for all purposes.
| 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 Vanter | Sep 1998 | A |
| 5802523 | Jasuja et al. | Sep 1998 | A |
| 5822750 | Jou et al. | Oct 1998 | A |
| 5826077 | Blakeley et al. | Oct 1998 | A |
| 5850544 | Parvathaneny et al. | Dec 1998 | A |
| 5857182 | Demichiel et al. | Jan 1999 | A |
| 5918225 | White et al. | Jun 1999 | A |
| 5920716 | Johnson et al. | Jul 1999 | A |
| 5937195 | Ju et al. | Aug 1999 | A |
| 5937401 | Hillegas | Aug 1999 | A |
| 6006235 | Macdonald et al. | Dec 1999 | A |
| 6011916 | Moore et al. | Jan 2000 | A |
| 6041344 | Bodamer et al. | Mar 2000 | A |
| 6081801 | Cochrane et al. | Jun 2000 | A |
| 6092065 | Floratos et al. | Jul 2000 | A |
| 6108666 | Floratos et al. | Aug 2000 | A |
| 6112198 | Lohman et al. | Aug 2000 | A |
| 6128610 | Srinivasan et al. | Oct 2000 | A |
| 6158045 | You | Dec 2000 | A |
| 6212673 | House et al. | Apr 2001 | B1 |
| 6219660 | Haderle et al. | Apr 2001 | B1 |
| 6263332 | Nasr et al. | Jul 2001 | B1 |
| 6278994 | Fuh et al. | Aug 2001 | B1 |
| 6282537 | Madnick et al. | Aug 2001 | B1 |
| 6341281 | MacNicol et al. | Jan 2002 | B1 |
| 6353821 | Gray et al. | Mar 2002 | B1 |
| 6367034 | Novik et al. | Apr 2002 | B1 |
| 6370537 | Gilbert et al. | Apr 2002 | B1 |
| 6389436 | Chakrabarti et al. | May 2002 | B1 |
| 6397262 | Hayden et al. | May 2002 | B1 |
| 6418448 | Sarkar | Jul 2002 | B1 |
| 6438540 | Nasr et al. | Aug 2002 | B2 |
| 6438559 | White et al. | Aug 2002 | B1 |
| 6439783 | Antoshenkov | Aug 2002 | B1 |
| 6449620 | Draper et al. | Sep 2002 | B1 |
| 6453314 | Chan et al. | Sep 2002 | B1 |
| 6507834 | Kabra et al. | Jan 2003 | B1 |
| 6523102 | Dye et al. | Feb 2003 | B1 |
| 6546381 | Subramanian et al. | Apr 2003 | B1 |
| 6615203 | Lin et al. | Sep 2003 | B1 |
| 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 | Jun 2005 | B2 |
| 6985904 | Kaluskar et al. | Jan 2006 | B1 |
| 6986019 | Bagashev | 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 |
| 7348981 | Buck | Mar 2008 | 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 | 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 | Apr 2009 | B2 |
| 7533087 | Liu et al. | May 2009 | B2 |
| 7546284 | Martinez et al. | Jun 2009 | B1 |
| 7552365 | Marsh et al. | Jun 2009 | B1 |
| 7567953 | Kadayam et al. | Jul 2009 | B2 |
| 7580946 | Mansour et al. | Aug 2009 | B2 |
| 7587383 | Koo et al. | Sep 2009 | B2 |
| 7603674 | Cyr et al. | Oct 2009 | B2 |
| 7613848 | Amini et al. | Nov 2009 | B2 |
| 7620851 | Leavy et al. | Nov 2009 | B1 |
| 7630982 | Boyce et al. | Dec 2009 | B2 |
| 7634501 | Yabloko | Dec 2009 | B2 |
| 7636703 | Taylor 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 |
| 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 |
| 8099400 | Haub et al. | Jan 2012 | B2 |
| 8122006 | De Castro Alves 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 |
| 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 | Alves et al. | May 2013 | B2 |
| 8458175 | Stokes | Jun 2013 | B2 |
| 8498956 | Srinivasan et al. | Jul 2013 | B2 |
| 8527458 | Park et al. | Sep 2013 | B2 |
| 8572589 | Cataldo et al. | Oct 2013 | B2 |
| 8589436 | Srinivasan | Nov 2013 | B2 |
| 8595840 | Malibiran | 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 | May 2014 | B2 |
| 8745070 | Krisnamurthy | Jun 2014 | B2 |
| 8762369 | Macho et al. | Jun 2014 | B2 |
| 8880493 | Chen | Nov 2014 | B2 |
| 9015102 | van Lunteren | Apr 2015 | B2 |
| 9047249 | de Castro Alves et al. | Jun 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 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 |
| 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 et al. | 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 | 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 | Dec 2006 | A1 |
| 20060294095 | Berk et al. | Dec 2006 | A1 |
| 20070016467 | John et al. | Jan 2007 | A1 |
| 20070022092 | Nishizawa et al. | Jan 2007 | A1 |
| 20070039049 | Kupferman et al. | Feb 2007 | A1 |
| 20070050340 | Von Kaenel et al. | Mar 2007 | A1 |
| 20070076314 | Rigney | Apr 2007 | A1 |
| 20070118600 | Arora | May 2007 | A1 |
| 20070136239 | Lee et al. | Jun 2007 | A1 |
| 20070136254 | Choi et al. | Jun 2007 | A1 |
| 20070156787 | MacGregor | Jul 2007 | A1 |
| 20070156964 | Sistla | Jul 2007 | A1 |
| 20070168154 | Ericson | Jul 2007 | A1 |
| 20070192301 | Posner | Aug 2007 | A1 |
| 20070198479 | Cai et al. | Aug 2007 | A1 |
| 20070214171 | Behnen | Sep 2007 | A1 |
| 20070226188 | Johnson et al. | Sep 2007 | A1 |
| 20070226239 | Johnson et al. | Sep 2007 | A1 |
| 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 |
| 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 | Chevrette 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 | 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 | 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 |
| 20110055192 | Tang et al. | 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 | 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 | Sep 2011 | A1 |
| 20110246445 | Mishra et al. | 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 | Feb 2014 | A1 |
| 20140082013 | Wolf et al. | Mar 2014 | A1 |
| 20140095425 | Sipple | 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 |
| 20140095483 | Toillion et al. | Apr 2014 | A1 |
| 20140095525 | Hsiao et al. | Apr 2014 | A1 |
| 20140095529 | Deshmukh et al. | Apr 2014 | A1 |
| 20140095533 | Shukla et al. | Apr 2014 | A1 |
| 20140095535 | Deshmukh et al. | Apr 2014 | A1 |
| 20140095537 | Park et al. | Apr 2014 | A1 |
| 20140095540 | Hsiao et al. | Apr 2014 | A1 |
| 20140095541 | Herwadkar | 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 | Bishnoi et al. | Jul 2014 | A1 |
| 20140201355 | Bishnoi et al. | Jul 2014 | A1 |
| 20140236983 | de Castro Alves et al. | Aug 2014 | A1 |
| 20140237289 | de Castro Alves et al. | Aug 2014 | A1 |
| 20140237487 | Prasanna | Aug 2014 | A1 |
| 20140324530 | Thompson | Oct 2014 | A1 |
| 20140358959 | Bishnoi | Dec 2014 | A1 |
| 20140379712 | Lafuente Alvarez | Dec 2014 | A1 |
| 20150007320 | Liu | 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 |
|---|---|---|
| 101059688 | Oct 2007 | CN |
| 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 |
| 105593854 | May 2016 | CN |
| 1241589 | 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 |
| 2001018712 | Mar 2001 | WO |
| 0159602 | 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 |
| WO 2014000819 | Jan 2014 | WO |
| 2014193943 | Dec 2014 | WO |
| 2015191120 | Dec 2015 | WO |
| 2016048912 | Mar 2016 | WO |
| Entry |
|---|
| 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. |
| Final Office Action for U.S. Appl. No. 13/830,428 dated Jun. 4, 2015, 21 pages. |
| Non-Final Office Action for U.S. Appl. No. 14/838,259 dated Jun. 9, 2015, 37 pages. |
| Final Office Action for U.S. Appl. No. 14/906,162 dated Jun. 10, 2015, 10 pages. |
| Non-Final Office Action for U.S. Appl. No. 14/037,153 dated Jun. 19, 2015, 23 pages. |
| Final Office Action for U.S. Appl. No. 13/829,958 dated Jun. 19, 2015, 17 pages. |
| Final Office Action for U.S. Appl. No. 13/827,987 dated Jun. 19, 2015, 10 pages. |
| International Application No. PCT/US2014/039771, International Search Report and Written Opinion 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. |
| Notice of Allowance for U.S. Appl. No. 12/548,187 dated Aug. 17, 2015, 18 pages. |
| Notice of Allowance for U.S. Appl. No. 13/107,742 dated Jul. 8, 2015, 9 pages. |
| Non-Final Office Actio for U.S. Appl. No. 14/037,072 dated Jul. 9, 2015, 12 pages. |
| Final Office Action for U.S. Appl. No. 13/830,502 dated Jun. 30, 2015, 25 pages. |
| Non-Final Office Action for U.S. Appl. No. 14/036,659 dated Aug. 13, 2015, 33 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/830,759 dated Aug. 7, 2015, 23 pages. |
| International Preliminary Report on Patentability dated Jul. 29, 2015 for PCT/US2014/010920, 30 pages. |
| International Preliminary Report on Patentability dated Jul. 29, 2015 for PCT/US2014/039771, 24 pages. |
| European Application No. 12783063.6, Extended European Search Report dated Mar. 24, 2015, 6 pages. |
| Japan Patent Office office actions JPO patent application JP2013-529376 (dated Aug. 18, 2015). |
| U.S. Appl. No. 13/828,640, Final Office Action dated Jun. 17, 2015, 11 pages. |
| 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. |
| De Castro Alves, A General Extension System for Event Processing Languages, DEBS '11, New York, NY, USA, Jul. 11-15, 2011, pp. 1-9. |
| Josifovsky, Vanja, et al., “Querying XML Streams”, The VLDB Journal, vol. 14, © 2005, pp. 197-210. |
| Purvee, Edwin Ralph, “Optimizing SPARQLeR Using Short Circuit Evaluation of Filter Clauses”, Master of Science Thesis, Univ. of Georgia, Athens, GA, © 2009, 66 pages. |
| Weidong, Yang, et al., “LeoXSS: An Efficient XML Stream System for Processing Complex XPaths”, CIT 2006, Seoul, Korea, © 2006, 6 pages. |
| Non-Final Office Action for U.S. Appl. No. 14/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. |
| 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. 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. |
| Non-Final Office Action for U.S. Appl. No. 13/830,428 dated Jan. 15, 2016, 25 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. |
| Bestehorn Fault-tolerant query processing in structured P2P-systems, Springer Science+Business Media LLC Distrib Parallel Databases 28:33-66 (May 8, 2010). |
| 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. |
| 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. 13/830,428 dated May 26, 2016, 26 pages. |
| 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. |
| 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). |
| 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. 14/883,815, Notice of Allowance dated Aug. 30, 2016, 13 pages. |
| U.S. Appl. No. 13/827,631, Final Office Action dated Oct. 20, 2016, 12 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. |
| Yang et al., Map-Reduce-Merge, Simplified Relational Data Processing on Large Clusters, 2007, 12 pages. |
| Chui, WebSphere Application Server V6.1—Class loader problem determination, IBM.com, 2007. |
| 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. |
| Oracle® Complex Event Processing EPL Language Reference 11g Release 1 (11.1.1.4.0), E14304-02, Jan. 2011, 80 pages. |
| OracleTM Complex Event Processing CQL Language Reference, 11g Release 1(11.1.1) E12048-03, Apr. 2010, pp. 18-1 to 18.9.5. |
| 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. |
| 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. |
| U.S. Appl. No. 12/913,636, Non-Final Office Action dated Apr. 1, 2015, 22 pages. |
| U.S. Appl. No. 13/764,560, Final Office Action dated Apr. 15, 2015, 19 pages. |
| U.S. Appl. No. 13/827,631, Final Office Action dated Apr. 3, 2015, 11 pages. |
| U.S. Appl. No. 13/830,129, Non-Final Office Action dated Feb. 27, 2015, 19 pages. |
| U.S. Appl. No. 13/830,378, Non-Final Office Action dated Feb. 25, 2015, 23 pages. |
| U.S. Appl. No. 13/839,288, Notice of Allowance dated Apr. 3, 2015, 12 pages. |
| U.S. Appl. No. 14/077,230, Notice of Allowance dated Apr. 16, 2015, 16 pages. |
| International Application No. PCT/US2014/068641, International Search Report and Written Opinion dated Feb. 26, 2015, 11 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). |
| 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. |
| “Bottom-up parsing”, Wikipedia, downloaded from: http://en.wikipedia.org/wiki/Bottom-up_parsing on Sep. 8, 2014, pp. 1-2. |
| “Branch Predication”, Wikipedia, downloaded from: http://en.wikipedia.org/wiki/Branch_predication on Sep. 8, 2014, pp. 1-4. |
| “Caching Data with SqiDataSource Control”—Jul. 4, 2011, 3 pages. |
| “Call User Defined Functions from Pig,” Amazon Elastic MapReduce Developer Guide (Mar. 2009) 2 pages. |
| “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. |
| “SCD—Slowing Changing Dimensions in a Data Warehouse”—Aug. 7, 2011, one page. |
| “SQL Subqueries”—Dec. 3, 2011, 2 pages. |
| “Strings in C,” Swarthmore College, retreived from internet: http://web.cs.swarthmore.edu/˜newhall/unixhelp/C_strings.html (Jun. 12, 207) 3 pages. |
| “Supply Chain Event Management: Real-Time Supply Chain Event Management,” product information Manhattan Associates (copyright 2009-2012) one page. |
| 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. |
| 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. |
| Advisory Action for U.S. Appl. No. 12/548,187 dated Sep. 26, 2014, 6 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). |
| 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, 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, 2007, 4 pages. |
| 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. |
| Babcock et al., Models and Issues in Data Streams, Proceedings of the 21st ACM SIGMOD-SEGACT-SIDART symposium on Principles database systems, 2002, 30 pages. |
| Babu et al., “Exploiting κ-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. |
| 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., Nov. 5-11, 2006, 10 pages. |
| 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. 2011). |
| Bose et al., A Query Algebra for Fragmented XML Stream Data, 9th International Conference on Data Base Programming Languages (DBPL), Sep. 2003, 11 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>. |
| Buza , Extension of CQL over Dynamic Databases, Journal of Universal Computer Science, vol. 12, No. 9, Sep. 28, 2006, pp. 1165-1176. |
| 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. |
| Carpenter, User Defined Functions, Retrieved from: URL: http://www.sglteam.comitemprint.asp?ItemID=979, Oct. 12, 2000, 4 pages. |
| Chan et al., Efficient Filtering of XML documents with Xpath expressions, 2002, pp. 354-379. |
| Chandramouli et al. “High-Performance Dynamic Pattern Matching over Disordered Streams,” Proceedings of the VLDB Endowment, vol. 3 Issue 1-2, pp. 220-231 (Sep. 2010). |
| 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. |
| Chandrasekaran et al., TelegraphCQ: Continuous Dataflow Processing for an UncertainWorld, Proceedings of CIDR, 2003, 12 pages. |
| 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). |
| 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. |
| Complex Event Processing in the Real World, An Oracle White Paper, Sep. 2007, 13 pages. |
| Conway, An Introduction to Data Stream Query Processing, Truviso, Inc., May 24, 2007, 71 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. |
| 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. |
| Dependency Injection, Dec. 30, 2008, pp. 1-7. |
| Deploying Applications to WebLogic Server, Mar. 30, 2007, 164 pages. |
| Deshpande et al., Adaptive Query Processing, Slide show believed to be prior to Oct. 17, 2007, 27 pages. |
| Developing Applications with Weblogic Server, Mar. 30, 2007, 254 pages. |
| Dewson Beginning SQL Server 2008 for Developers: From Novice to Professional, A Press, Berkeley, CA, © 2008, pp. 337-349 and 418-438. |
| Diad 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. |
| EPL Reference, 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. |
| Esper Reference Documentation, Copyright 2007, Ver. 1.12.0, 2007, 158 pages. |
| Esper Reference Documentation, Copyright 2008, ver. 2.0.0, 2008, 202 pages. |
| Fantozzi “A Strategic Approach to Supply Chain Event Management,” student submission for Masters Degree, Massachusetts Institute of Technology (Jun. 2003) 36 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/docs100/quickstart/quick_start. html, May 10, 2010, 1 page. |
| 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. |
| Final Office Action for U.S. Appl. No. 12/396,464 dated May 16, 2014, 15 pages. |
| Final Office Action for U.S. Appl. No. 12/548,187 dated Jun. 4, 2014, 63 pages. |
| Final Office Action for U.S. Appl. No. 12/548,281 dated Aug. 13, 2014, 19 pages. |
| Final Office Action for U.S. Appl. No. 13/089,556 dated Jun. 13, 2014, 13 pages. |
| Florescu et al., The BEA/XQRL Streaming XQuery Processor, Proceedings of the 29th VLDB Conference, 2003, 12 pages. |
| Getting Started with WebLogic Event Server, BEA WebLogic Event Server version 2.0, Jul. 2007, 66 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, Aug. 2006, 182 pages. |
| Gosling et al. , The Java Language Specification, 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, 2009, pp. 153-160. |
| Harish et al., “Identifying Robust Plans through Plan Diagram Reduction”, PVLDB '08, Auckland, New Zealand, Aug. 23-28, 2008,pp. 1124-1140. |
| High Availability Guide, Oracle Application Server, 10g Release 3 (10.1.3.2.0), B32201-01, Jan. 2007, 314 pages. |
| Hopcroft , Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, Copyright 2001, 524 pages. |
| Hulten 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. |
| Installing Weblogic Real Time, BEA WebLogic Real Time, Ver. 2.0, Jul. 2007, 64 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. |
| International Search Report and Written Opinion dated Jul. 16, 2014 for PCT/US2013/062047. |
| International Search Report and Written Opinion dated Jul. 2, 2014 for PCT/US2013/062050. |
| International Search Report and Written Opinion dated Jul. 3, 2014 for PCT/US2013/062052. |
| International Search Report and Written Opinion dated Mar. 14, 2014 for PCT/US2013/073086. |
| International Search Report and Written Opinion dated Sep. 12, 2014 for PCT/US2014/017061. |
| Introduction to BEA WebLogic Server and BEA WebLogic Express, BEA WebLogic Server, Ver. 10.0, Mar. 2007, 34 pages. |
| Introduction to WebLogic Real Time, Jul. 2007, 20 pages. |
| Jboss Enterprise Application Platform 4.3 Getting Started Guide CP03, for Use with Jboss Enterprise Application Platform 4.3 Cumulative Patch 3, Jboss a division of Red Hat, Red Hat Documentation Group, Copyright 2008, Red Hat, Inc., Sep. 2007, 68 pages. |
| 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. vol. 6(2), Jun. 1977, pp. 323-350. |
| 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). |
| 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. |
| 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 2002, Jun. 4-6, 2002, 12 pages. |
| Managing Server Startup and Shutdown, BEA WebLogic Server, ver. 10.0, Mar. 30, 2007, 134 pages. |
| Martin et al., Finding Application Errors and Security Flaws Using PQL, a Program Query Language, OOPSLA'05, Oct. 16, 2005, pp. 1-19. |
| Matching Behavior, .NET Framework Developer's Guide, Microsoft Corporation, Retrieved on: Jul. 1, 2008, URL: http://msdn.microsoft.com/en-us/library/Oyzc2ybO(printer).aspx, 2008, pp. 1-2. |
| Microsoft Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, @ 2002, pp. 238-239 and 529. |
| Motwani et al., Query Processing Resource Management, and Approximation in a Data Stream Management System, 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. |
| 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. |
| 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. |
| Non-Final Office Action for U.S. Appl. No. 11/601,415 dated Dec. 11, 2013, 57 pages. |
| Non-Final Office Action for U.S. Appl. No. 12/396,464 dated Dec. 31, 2013, 15 pages. |
| Non-Final Office Action for U.S. Appl. No. 12/548,187 dated Feb. 6, 2014, 53 pages. |
| Non-Final Office Action for U.S. Appl. No. 12/548,281 dated Feb. 13, 2014, 19 pages. |
| Non-Final Office Action for U.S. Appl. No. 12/913,636 dated Jul. 24, 2014, 21 pages. |
| Non-Final Office Action for U.S. Appl. No. 12/957,201 dated Jul. 30, 2014, 12 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/089,556 dated Jan. 9, 2014, 13 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/107,742 dated Jun. 19, 2014, 20 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/764,560 dated Sep. 12, 2014, 23 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/770,969 dated Aug. 7, 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. 13/828,640 dated Dec. 2, 2014, 11 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/830,428 dated Dec. 5, 2014, 23 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/830,502 dated Nov. 20, 2014, 25 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/838,259 dated Oct. 24, 2014, 21 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/839,288 dated Dec. 4, 2014, 30 pages. |
| Non-Final Office Action for U.S. Appl. No. 13/906,162 dated Dec. 29, 2014, 10 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. 14/302,031 dated Aug. 27, 2014, 19 pages. |
| Non-Final Office Action for U.S. Appl. No. 11/601,415 dated Oct. 6, 2014, 18 pages. |
| Notice of Allowance for U.S. Appl. No. 12/396,464 dated Sep. 3, 2014, 7 pages. |
| Notice of Allowance for U.S. Appl. No. 13/089,556 dated Oct. 6, 2014, 9 pages. |
| Notice of Allowance for U.S. Appl. No. 13/102,665 dated Nov. 24, 2014, 9 pages. |
| 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. |
| Ogrodnek “Custom UDFs and hive,” Bizo development blog http://dev.bizo.com (Jun. 23, 3009) 2 pages. |
| Oracle Application Server 10g, Release 2 and 3, New Features Overview, An Oracle White Paper, Oracle., Oct. 2005, 48 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, Enterprise Deployment Guide, 10g Release 3 (10.1.3.2.0), B32125-02, Oracle, Apr. 2007, 120 pages. |
| 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-03, Apr. 2010, 540 pages. |
| Oracle Database Data Cartridge Developer's Guide, B28425-03, 11 g Release 1 (11.1), Oracle, Mar. 2008, 372 pages. |
| Oracle Database, SQL Language Reference 11 g Release 1 (11.1), B28286-02, Oracle, Sep. 2007, 1496 pages. |
| Oracle Database, SQL Reference, 10g Release 1 (10.1), Part No. B10759-01, Dec. 2003, 7-1 to 7-17; 7-287 to 7-290; 14-61 to 14-74. |
| Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1.4.0) E12048-04,(Jan. 2011), pp. title page, iii-xxxviii, 1-1 to 4-26, 6-1 to 6-12, 18-1 to 20-26, Index-1 to Index-14. |
| Oracle™ Fusion Middleware CQL Language Reference, 11g Release 1 (11.1.1.6.3) E12048-10, (Aug. 2012) pp. title page, iii-xxxvi, 1-1 to 4-26, 6-1 to 6-12, 18-1 to 20-26, Index-1 to Index-14. |
| OSGI Service Platform Core Specification, The OSGI Alliance, OSGI Alliance, Apr. 2007, 288 pages. |
| PCT Patent Application No. PCT/US2014/010832, International Search Report dated Apr. 3, 2014, 9 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, Documentation: Manuals: PostgresSQL 8.2: User-Defined Aggregates believed to be prior to Apr. 21, 2007, 4 pages. |
| Pradhan “Implementing and Configuring SAP® Event Management” Galileo Press, pp. 17-21 (copyright 2010). |
| Rao et al., “Compiled Query Execution Engine using JVM”, ICDE '06, Atlanta, GA, Apr. 3-7, 2006, 12 pages. |
| Ray 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. |
| Release Notes, BEA WebLogic Event Server, Ver. 2.0, Jul. 2007, 8 pages. |
| Sadri et al., Expressing and Optimizing Sequence Queries in Database Systems, ACM Transactions on Database Systems, vol. 29, No. 2, ACM Press, Copyright 2004, 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. |
| 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. |
| Sharaf et al., Efficient Scheduling of Heterogeneous Continuous Queries, VLDB '6, Sep. 12-15, 2006, pp. 511-522. |
| Spring Dynamic Modules for OSGi Service Platforms product documentation, Jan. 2008, 71 pages. |
| SQL Tutorial-In, Tizag.com, http://web.archive.org/web/20090216215219/http://www.tizag.com/sqiTutorial/sqlin.php,, Feb. 16, 2009, pp. 1-3. |
| Stillger et al., “LEO-DB2's LEarning Optimizer”, Proc. of the VLDB, Roma, Italy, Sep. 2001, pp. 19-28. |
| Stolze et al., User-defined Aggregate Functions in DB2 Universal Database, Retrieved from: <http://www.128.ibm.com/deve10perworks/db2/library/tachartic1e/0309stolze/0309stolze.html>, Sep. 11, 2003, 11 pages. |
| Stream Base New and Noteworthy, Stream Base, Jan. 12, 2010, 878 pages. |
| Stream Query Repository: Online Auctions, at URL: http://www-db.stanford.edu/stream/sqr/onauc.html#queryspecsend, Dec. 2, 2002, 2 pages. |
| Stream: The Stanford Stream Data Manager, Retrieved from: URL: http://infolab.stanford.edu/stream/, Jan. 5, 2006, pp. 1-9. |
| 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. |
| The Stanford Stream Data Manager, IEEE Data Engineering Bulletin, Mar. 2003, pp. 1-8. |
| Tho et al. “Zero-latency data warehousing for heterogeneous data sources and continuous data streams,” 5th International Conference on Information Integrationand Web-based Applications Services (Sep. 2003) 12 pages. |
| 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, 48 pages. |
| U.S. Appl. No. 10/948,523, Notice of Allowance dated Dec. 1, 2008, 17 pages. |
| U.S. Appl. No. 10/948,523, Notice of Allowance dated Jul. 8, 2008, 28 pages. |
| U.S. Appl. No. 10/948,523, Office Action dated Jan. 22, 2007, 32 pages. |
| U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance dated Jul. 17, 2008, 4 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, Final Office Action dated May 27, 2009, 26 pages. |
| U.S. Appl. No. 11/601,415, Final Office Action dated Jul. 2, 2012, 58 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, 44 pages. |
| 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, 21 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, Notice of Allowance dated Jun. 22, 2012, 20 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, 18 pages. |
| U.S. Appl. No. 11/874,202, Non-Final Office Action dated Dec. 3, 2009, 15 pages. |
| U.S. Appl. No. 11/874,202, Notice of Allowance dated Mar. 31, 2011, 9 pages. |
| U.S. Appl. No. 11/874,202, Notice of Allowance dated Dec. 22, 2010, 13 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, 12 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, 15 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, 5 pages. |
| U.S. Appl. No. 11/927,681, Non-Final Office Action dated Mar. 24, 2011, 14 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, 10 pages. |
| U.S. Appl. No. 11/927,683, Notice of Allowance dated Nov. 9, 2011, 7 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 Jul. 10, 2013, 10 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, 16 pages. |
| 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/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, 5 pages. |
| U.S. Appl. No. 12/395,871, Office Action dated Oct. 19, 2011, 8 pages. |
| U.S. Appl. No. 12/396,008, Non-Final Office Action dated Jun. 8, 2011, 9 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, 16 pages. |
| U.S. Appl. No. 12/396,464, Non-Final Office Action dated Sep. 7, 2012, 17 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, 17 pages. |
| U.S. Appl. No. 12/506,905, Notice of Allowance dated Dec. 14, 2012, 8 pages. |
| U.S. Appl. No. 12/506,905, Office Action dated Aug. 9, 2012, 33 pages. |
| U.S. Appl. No. 12/506,905, Office Action dated Mar. 26, 2012, 60 pages. |
| U.S. Appl. No. 12/534,384, Notice of Allowance dated May 7, 2013, 11 pages. |
| U.S. Appl. No. 12/534,384, Office Action dated Feb. 28, 2012, 12 pages. |
| U.S. Appl. No. 12/534,384, Office Action dated Feb. 12, 2013, 13 pages. |
| U.S. Appl. No. 12/534,398, Final Office Action dated Jun. 5, 2012, 16 pages. |
| U.S. Appl. No. 12/534,398, Notice of Allowance dated Nov. 27, 2012, 9 pages. |
| U.S. Appl. No. 12/534,398, Office Action dated Nov. 1, 2011, 14 pages. |
| U.S. Appl. No. 12/548,187, Final Office Action dated Jun. 10, 2013, 17 pages. |
| U.S. Appl. No. 12/548,187, Non Final Office Action dated Sep. 27, 2011, 17 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, 12 pages. |
| U.S. Appl. No. 12/548,209, Office Action dated Apr. 16, 2012, 16 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, 17 pages. |
| U.S. Appl. No. 12/548,222, Notice of Allowance dated Jul. 18, 2013, 12 pages. |
| U.S. Appl. No. 12/548,222, Office Action dated Jun. 20, 2012, 20 pages. |
| U.S. Appl. No. 12/548,281, Final Office Action dated Oct. 10, 2013, 21 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, 18 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, 21 pages. |
| U.S. Appl. No. 12/548,290, Non-Final Office Action dated Oct. 3, 2011, 15 pages. |
| U.S. Appl. No. 12/548,290, Non-Final Office Action dated Apr. 15, 2013, 17 pages. |
| U.S. Appl. No. 12/548,290, Notice of Allowance dated Sep. 11, 2013, 6 pages. |
| 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, Final Office Action dated Aug. 27, 2013, 12 pages. |
| U.S. Appl. No. 12/949,081, Non-Final Office Action dated Jan. 9, 2013, 12 pages. |
| 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, Final Office Action dated Apr. 25, 2013, 10 pages. |
| U.S. Appl. No. 12/957,201, Office Action dated Dec. 19, 2012, 13 pages. |
| U.S. Appl. No. 13/089,556, Final Office Action dated Aug. 29, 2013, 10 pages. |
| U.S. Appl. No. 13/089,556, Non-Final Office Action dated Apr. 10, 2013, 9 pages. |
| U.S. Appl. No. 13/089,556, Office Action dated Nov. 6, 2012, 12 pages. |
| U.S. Appl. No. 13/102,665, Final Office Action dated Jul. 9, 2013, 16 pages. |
| U.S. Appl. No. 13/102,665, Office Action dated Feb. 1, 2013, 13 pages. |
| U.S. Appl. No. 13/107,742, Final Office Action dated Jul. 3, 2013, 19 pages. |
| U.S. Appl. No. 13/107,742, Non-Final Office Action dated Feb. 14, 2013, 16 pages. |
| U.S. Appl. No. 13/177,748, Non-Final Office Action dated Aug. 30, 2013, 23 pages. |
| U.S. Appl. No. 13/184,528, Notice of Allowance dated Mar. 1, 2012, 16 pages. |
| U.S. Appl. No. 13/193,377, Notice of Allowance dated Aug. 30, 2013, 18 pages. |
| U.S. Appl. No. 13/193,377, Office Action dated Aug. 23, 2012, 20 pages. |
| U.S. Appl. No. 13/193,377, Office Action dated Jan. 17, 2013, 24 pages. |
| U.S. Appl. No. 13/244,272, Final Office Action dated Mar. 28, 2013, 29 pages. |
| U.S. Appl. No. 13/244,272, Notice of Allowance dated Aug. 12, 2013, 12 pages. |
| U.S. Appl. No. 13/244,272, Office Action dated Oct. 4, 2012, 29 pages. |
| U.S. Appl. No. 13/177,748, Final Office Action dated Mar. 20, 2014, 23 pages. |
| International Search Report and Written Opinion dated Dec. 15, 2014 for PCT/US2014/010920, 10 pages. |
| Ullman et al. , Introduction to JDBC, Stanford University, 2005, 7 pages. |
| Understanding Domain Configuration, BEA WebLogic Server, Ver. 10.0, Mar. 30, 2007, 38 pages. |
| Vajjhala et al., The Java Architecture for XML Binding (JAXB) 2.0, 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. |
| WebLogic Event Server Administration and Configuration Guide, BEA WebLogic Event D Server, Version. 2.0, Jul. 2007, 108 pages. |
| WebSphere Application Server V6.1 Problem Determination: IBM Redpaper Collection, Dec. 2007, 634 pages. |
| What is BPM? Datasheet [online]. IBM, [retrieved on Jan. 28, 2013]. Retrieved from the Internet: <URL: http://www-01.ibm.com/software/info/bpm/whatis-bpm/>. |
| 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. |
| Wilson “SAP Event Management, an Overview,” Q Data USA, Inc.( copyright 2009) 16 pages. |
| Wu et al., Dynamic Data Management for Location Based Services in Mobile Environments, Database Engineering and Applications Symposium, 2003, Jul. 16, 2003, pp. 172-181. |
| ZEMKE, XML Query, Mar. 14, 2004, 29 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. |
| International Application No. PCT/US2015/051268 International Preliminary Report on Patentability dated Dec. 8, 2016, 12 pages. |
| U.S. Appl. No. 13/827,631, Final Office Action dated Aug. 30, 2017, 18 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/830,428, Final Office Action dated Oct. 5, 2017, 33 pages. |
| U.S. Appl. No. 13/830,428, Non-Final Office Action dated Mar. 22, 2017, 25 pages. |
| U.S. Appl. No. 13/830,502, Non-Final Office Action dated Apr. 7, 2017, 28 pages. |
| U.S. Appl. No. 13/830,735, Final Office Action dated Sep. 29, 2017, 16 pages. |
| U.S. Appl. No. 13/830,735, Non-Final Office Action dated Apr. 4, 2017, 16 pages. |
| U.S. Appl. No. 13/830,759, Notice of Allowance dated Aug. 23, 2017, 14 pages. |
| U.S. Appl. No. 13/838,259, Final Office Action dated Jul. 7, 2017, 69 pages. |
| U.S. Appl. No. 14/036,500, Non-Final Office Action dated Feb. 9, 2017, 34 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/037,153, Non-Final Office Action dated Aug. 10, 2017, 45 pages. |
| U.S. Appl. No. 14/079,538, Non-Final Office Action dated Mar. 31, 2017, 24 pages. |
| U.S. Appl. No. 14/610,971, Notice of Allowance dated Apr. 12, 2017, 11 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. 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. 14/866,512, Non-Final Office Action dated Apr. 10, 2017, 24 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/177,147, Non-Final Office Action dated Apr. 7, 2017, 12 pages. |
| U.S. Appl. No. 15/360,650, Non-Final Office Action dated Mar. 9, 2017, 34 pages. |
| U.S. Appl. No. 15/360,650, Notice of Allowance dated Jul. 24, 2017, 13 pages. |
| U.S. Appl. No. 15/177,147, Non-Final Office Action dated Nov. 3, 2017, 6 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). |
| Chinese Application No. 201380056017.2, Office Action dated Jul. 17, 2017, 25 pages (16 pages for the original document and 9 pages for the English translation). |
| Chinese Application No. 201380056099.0, Office Action dated Jul. 4, 2017, 26 pages (14 pages for the original document and 12 pages for the English translation). |
| Chinese Application No. 201480030482.3, Office Action dated Feb. 4, 2017, 5 pages. |
| Japanese Application No. 2015-534676, Office Action dated Jun. 27, 2017, 9 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. |
| Sadana, Interactive Scatterplot for Tablets, AVI, Available Online at: https://vimeo.com/97798460, 2014, 2 pages. |
| European Patent Application EP14825489.9, Office Action dated Jul. 28, 2017, 7 pages. |
| Chinese Application CN201480004736.4, Office Action dated Nov. 29, 2017, 13 pages. |
| Japanese Application No. 2015-534676, Office Action dated Jan. 23, 2018, 9 pages. |
| Japanese Application JP2015-552765, Office Action dated Dec. 5, 2017, 3 pages. |
| Japanese Application JP2015-552781, Office Action dated Nov. 21, 2017, 3 pages. |
| Japanese Application No. 2015-5523217, Office Action dated Jan. 9, 2018, 3 pages. |
| U.S. Appl. No. 13/829,958, Non-Final Office Action dated Jan. 8, 2018, 22 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/973,377, Non-Final Office Action dated Nov. 30, 2017, 17 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20150161214 A1 | Jun 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61912344 | Dec 2013 | US |
