The disclosed embodiments relate generally to data processing systems, and more specifically to techniques for processing continuous event streams using variable duration windows.
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 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. For example, a temperature sensor may be configured to send out temperature readings. Such applications have given rise to a need for a new breed of applications that can process the data streams.
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.
Certain embodiments of the present invention relate generally to data processing systems, and more specifically to techniques for processing continuous event streams using variable duration windows.
In certain embodiments, the duration of the time that an event is eligible for remaining in a time-based window can be variable for different events received via the same event stream. For example, for a first input event received via the event stream, the duration of time that the first event is eligible for remaining in a time-based range window may be “X”, and for a second event received via the same event stream, the duration of time that the second event is eligible to remain in the time-based window may be “Y”, where X is not the same as Y. The first and second events may have the same associated timestamp or different timestamps. Embodiments of the present invention thus enable the amount of time that an event spends in a time-based window to be controlled.
In certain embodiments, the duration of time that an input event spends in a time-based window is a function of one or more values of one or more attributes of the event. Since different events can have different one or more attribute values, the different events can spend different amounts of time in a time-based window. This enables the amount of time that an event spends in a time-based window to be controlled via one or more attributes of the event.
In one embodiment, multiple events may be received by a computing device via an event stream. For example, a first event and a second event may be received via the event stream. A first duration of time may be determined for the first event, where the first duration of time indicates a time duration that the first event is eligible to remain in a time-based window specified for the event stream. A second duration of time may be determined for the second event, where the second duration of time indicates a time duration that the second event is eligible to remain in the time-based window, wherein the second time duration is different from the first time duration.
In certain embodiment, the first and second events may be added to the time-based window specified for the event stream. The first event remains in the time-based window for the first duration of time and is then removed or deleted from the time-based window. The second event remains in the time-based window for the second duration of time and is then removed or deleted from the time-based window. In this manner, the duration of time that the first event spends in the time-based window may be different from the duration of time that the second event spends in the time-based window.
In the first and second events example embodiment described above, the first event may have an associated first time and the second event may have an associated second time. In one instance, the first time and the second time may be the same. In a second instance, the first time may be different from the second time.
In certain embodiments, the duration of time that an event is eligible to spend in the time-based window may be based upon values of one or more attributes of the event.
In certain embodiments, row-time range windows may be different partitions. The partition to which an event belongs may be based upon a value of an attribute of the first event. The amount of time that an event is eligible to spend in a row-time range window for a partition may be based upon one or more values of one or more attributes of the event. Accordingly, for events belonging to a particular partition, different events may be eligible to spend different durations of time in the row-time range window for the particular partition.
In certain embodiments, a first expiration time maybe computed for the first event based upon a first time associated with the first event and the first duration of time. A second expiration time may be determined for the second event based upon a second time associated with the second event and the second duration of time. The first event is removed or deleted from the time-based window at or after the occurrence of the first expiration time. Likewise, the second event may be removed or deleted from the time-based window at or after the occurrence of the second expiration time.
The following detailed description together with the accompanying drawings will provide a better understanding of the nature of embodiments of the present invention.
In the following description, for the purposes of explanation, specific details are set forth in order to provide a thorough understanding of embodiments of the invention. However, it will be apparent that various embodiments may be practiced without these specific details. The figures and description are not intended to be restrictive.
Certain embodiments are described that provide improved techniques for processing streams of data. The duration of the time that an event is eligible for remaining in a time-based window can be variable for different events received via the same event stream. In certain embodiments, the duration of time that an input event spends in a time-based window is a function of one or more values of one or more attributes of the event. Since different events can have different one or more attribute values, the different events can spend different amounts of time in the time-based window for that event stream. The amount of time that an event spends in a time-based window can be controlled via the one or more attributes of the event.
A continuous data stream (also referred to as an event stream) is a stream of data or events that may be continuous or unbounded in nature with no explicit end. Logically, an event or data stream is 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 is thus a sequence of time-stamped tuples or events.
In some embodiments, the timestamps associated with events in a stream may equate to a clock time. In other embodiments, however, the time associated with events in an event stream may be defined by the application domain and may not correspond to clock time but may, for example, be represented by sequence numbers instead. Accordingly, the time information associated with an event in an event stream may be represented by a number, a timestamp, or any other information that represents a notion of temporal sequence. 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 embodiments, an event in an event stream may represent an occurrence of some worldly event (e.g., when a temperature sensor changed value to a new value, when the price of a stock symbol changed) and the time information associated with the event may indicate when the worldly event represented by the data stream event occurred.
For events received via an event stream, the time information associated with an event is used to ensure that the events in the event stream arrive in the order of increasing timestamp values. This enables events received in the event stream to be ordered and processed based upon their associated time information. In order to enable this ordering, timestamps are 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 is greater than the sequence number associated with an earlier-generated event. Events belonging to the same event stream are generally processed in the order imposed on the events by the associated time information, with earlier events being processed prior to later events. In some embodiments, 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. In these situations, the events are processed in the order received.
The time information (e.g., timestamps) associated with an event in an event stream may be set by the source of the stream or alternatively may be set by the system receiving the stream. For example, in certain embodiments, a heartbeat may be maintained on a system receiving an event stream, and the time associated with an event may be based upon a time of arrival of the event at the system as measured by the heartbeat. It is possible for two events in an event stream to have the same time information. It is to be noted that while timestamp ordering requirement is specific to one event stream, events of different streams could be arbitrarily interleaved.
An event stream has an associated schema “S”, the schema comprising time information and a set of one or more named attributes. All events that belong to a particular event stream conform to the schema associated with that particular event stream. Accordingly, for an event stream (s, T), the event stream may have a schema ‘S’ as (<time_stamp>, <attribute(s)>), where <attributes> represents the data portion of the schema and can comprise one or more attributes. For example, the schema for a stock ticker event stream may comprise attributes <stock symbol>, and <stock price>. Each event received via such a stream will have a time_stamp and the two attributes. For example, the stock ticker event stream may receive the following events and associated timestamps:
In the above stream, for stream element (<timestamp_N+1>, <ORCL,62>), the event values for attributes “stock_symbol” and “stock_value” are ORCL and 62, respectively. The timestamp associated with the stream element is “timestamp_N+1”. A continuous event stream is thus a flow of events, each event having the same series of attributes.
In one embodiment, EPS 102 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 102 may support ultra-high throughput and microsecond latency for processing events, for example, by using JRockit Real Time. EPS 102 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 120 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 102 without having to store all the received events data. Accordingly, EPS 102 provides a special querying mechanism that enables processing of events to be performed as the events are received by EPS 102 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 may specify 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 102 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 102 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.
A continuous query may be programmed using different languages. In certain embodiments, continuous queries may be configured using the Continuous Query Language (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:
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 100 depicted in
The one or more of the components depicted in
Examples of Events and Applications
(1) Financial algorithmic trading application for automating stock trading based on market movement. Sample query: if, within any 20 second window, StockB rises by more than 2% and StockA does not, then automatically buy StockA.
(2) Transportation: Security and Fraud Detection application for discovering fraudulent activity by detecting patterns among events. Sample query: if a single ID card is used twice in less than 5 seconds to gain access to a city's subway system, alert security for piggybacking.
(3) Energy and telecommunications alarm correlation application for reducing false positive alarms. Sample query: When 15 alarms are received within any 5 second window, but less than 5 similar alarms detected within 30 seconds, then do nothing.
(4) Health care patient monitoring application for monitoring the vital signs of a patient and performing some task if a particular event happens. Sample query: When a change in medication is followed by a rise in blood pressure within 20% of maximum allowable for this patient within any 10 second window, alert nearest nurse.
Window-Based Processing
As another example, an event processing application may be configured to collate and process data or events for a certain time range. For example, EPS 102 may receive a temperature event stream of events comprising a “temp” attribute and an associated time. The “temp” data may indicate the temperature at the associated time. A CQL query may be formulated for such an event stream to obtain the average temperature for the previous ten seconds. The query may be specified as follows:
Since an event stream represents a potentially endless stream of tuples, in order to process tuples as they are received, a CQL query (or a continuous query in general) identifies a subset of the received events that is to be used for processing at each execution of the CQL query. A CQL query accomplishes this by specifying a window, where the window defines a subset (or portion) of the received events to be used for processing purposes when the CQL query is executed. A window is a bound subset of zero or more events from the events stream.
In Oracle Event Processing CQL semantics, a window is defined as a stream-to-relation operator, where, at every instant in time, a relation is an unordered, time-varying bounded set (or bag) of events. In one embodiment, the stream-to-relationship operator provides a sliding window over a stream and is defined using a window specification. In some embodiments, a window can be
For purposes of processing an event stream, a time-based window is defined using a time parameter that controls the events that are included within that window. In some embodiments, the time parameter may specify a range of time for the window. For example, a CQL query may specify a time range-based window for an input stream S as follows:
In previous implementations of time-based range windows, the time parameter “T” used for specifying the duration of the time window in a CQL was constant or fixed. Accordingly, in prior implementations, the amount of time each event spends in a time-based window does not vary with the event itself. All events are treated the same with all events staying in the time-based window for the same duration of time. For example, in the temperature average example CQL query described earlier, the range was specified as “[range 10], where the value of “T” is set to a fixed value “10” denoting 10 seconds. Due to the fixed non-variable nature of the range window, at time “t”, the window evaluates a relation set of events received in the last 10 seconds (i.e., between “t” and “t−10”). It is to be noted that while the window itself slides with “t”, the duration of the window is always fixed to 10 seconds. Due to the fixed time duration, previously, events in a time-based window always expired after the same duration of time in the time window.
In addition to fixed or constant time-based range windows, certain embodiments of the present invention, allow the duration of the time-based window to be variable for different events received via the same event stream. In such embodiments, the value of time duration parameter “T” used for defining the duration of the sliding time-based range window can be different, and thus variable, for different events. Accordingly, for a query registered with EPS 102 for a particular event stream, the duration of time that events received via the event stream may be different for different events. For example, as shown in
For example, for a first input event received via the event stream, the duration of time that the first event is eligible for remaining in a time-based range window may be “X”, and for a second event received via the same event stream, the duration of time that the second event is eligible to remain in the time-based window may be “Y”, where X is not the same as Y. The first and second events may have the same associated timestamp or different timestamps. Embodiments of the present invention thus enable the amount of time that an event spends in a time-based window to be controlled.
There are various ways in which the value of the variable range duration parameter T can be set for an event. In some embodiments, the duration parameter T may be user-configurable. In certain embodiments, the value of T (i.e., the duration of the time-based range window) is a function of the event itself. For example, the value of T for a received event may be set based upon values of one or more attributes of the received event. For example, assume an event stream with an associated schema having two attributes <attr_1, attr_2>. In one embodiment, in a CQL query directed to the event stream, the time that an event can spend in a time-based range window may be programmed to be set to the value of attribute “attr_2”. For example, if the event stream receives events as follows:
When the event with timestamp_N is received, the duration of time that the event can remain in the time-based range window is computed to be 5 time units since the value of attr_2 of the tuple is 5; for the event with timestamp_N+1, the duration of time that the event can remain in the time-based range window is computed to be 2 time units; for the event with timestamp_N+2, the duration of time that the event can remain in the time-based range window is computed to be 2 time units; for the event with timestamp_N+3, the duration of time that the event can remain in the time-based range window is computed to be 4 time units; and so on. In this manner, the duration of time that an event is eligible to remain in the time-based window for the event stream can vary from one event to another. In the example above, the duration changes based upon the value of the “attr_2” attribute of the received events.
In some other embodiments, the time parameter T may be expressed as a mathematical expression as follows:
As another example, suppose a stream is defined as:
CREATE STREAM S (DATA INTEGER, RANGE_COLUMN BIGINT);
Per this definition, each stream event contains two attributes (also referred to as columns), a first attribute “DATA” that takes an integer data value and a second attribute “RANGE_COLUMN” that takes a bigint (long) value. The “RANGE_COLUMN” attribute may then be used to specify the duration of a time-based range window.
A CQL query specifying a variable duration time-based range window may be specified on stream S as follows:
CREATE QUERY Q1 AS SELECT * FROM S [RANGE <range_expression>]
This creates a continuous query Q1 with a time-based range window where the duration of the time-based window is specified as an expression “range_expression”.
In one embodiment, the range_expression can be based upon one or more attributes from stream S. For example:
The following example shows the effects of a variable duration time-based range window as events are received. For this example, it is assumed that an input event stream S has a schema (<timestamp>,<attributes>) with three attributes c1, c2, and c3: (c1 integer, c2 bigint, c3 double). A continuous CQL query may be specified for stream S as follows:
Table A below shows an input stream of tuples and the contents of a time-based range window at various time points as events are received via input event stream S.
In Table A shown above, the left column shows a stream of events received via stream S having schema (timestamp,c1,c2,c3). The timestamp is shown in milliseconds (msecs), where 1 second=1000 msecs. The timestamp may, for example, be the time when the event is received or when the event occurred. The right column of Table A show the contents (i.e., the events) in the time-based range window at various time points (shown in milliseconds (msecs), where 1 second=1000 msecs). A “+” notation in front of an event is used to indicate that the event is added to the time-based window. A “−” notation in front of an event is used to indicate that the event has been deleted from the time-based window due to expiration of the event.
In one embodiment, upon receiving an event, an expiration time is calculated for the event. The expiration time computed for an event indicates the time when the event expires and is to be deleted from the time-based window. The event is then added to the time-based window. The time-based window is also checked to determine if any events in the window have expired and need to be removed from the window.
For an event arriving at time “t” and having a time range or duration “T”, the expiration time for the event is (t+T). For the query
It is assumed that the time-based window (i.e., the relation set output by the time-based window) is empty before the arrival of the event at 1000 msecs, i.e., before the arrival of the event with associated timestamp 1000 msecs. As shown in Table A, event (1000,10,1,10.0) is received first. The expiration time for the event is computed to be 2 seconds (timestamp of event+value of c2, i.e., 1+1=2 seconds). The event is then added (denoted by the “+”) to the time-based window. Event (1000,10,1,10.0) is to stay in the time-based window for 1 second and is to be deleted from the window at the 2 second mark. At this point the time-based range window comprises one event (1000,10,1,10.0).
An event (2000,20,2,20.0) is received next. In one embodiment, a timestamp of 2000 msecs may denote the time the event was received. The contents of the time-based window are checked to see if any events in the window have expired. It is determined that event (1000,10,1,10.0) has expired and is deleted (denoted by the “−”) from the time-based window. An expiration time for event (2000,20,2,20.0) is computed to be 4 seconds (timestamp of event+value of c2, i.e., 2+2=4 seconds). The event is then added to the time-based window. The event is to stay in the window for 2 seconds and is to be deleted from the window at the 4 second mark. At this time point the time-based range window comprises one event (2000,20,2,20.0).
An event (3000,30,3,30.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that none have expired. The expiration time for event (3000,30,3,30.0) is computed to be 6 seconds (timestamp of event+value of c2, i.e., 3+3=6 seconds). The event is added to the time-based window. The event is to stay in the window for 3 seconds and is to be deleted from the window at the 6 second mark. At this time point the time-based range window comprises two events (2000,20,2,20.0) and newly added event (3000,30,3,30.0).
An event (4000,40,4,40.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired. It is determined that event (2000,20,2,20.0) has expired and is deleted (denoted by the “−”) from the time-based window. An expiration time for event (4000,40,4,40.0) is computed to be 8 seconds (timestamp of event+value of c2, i.e., 4+4=8 seconds). The event is then added to the time-based window. The event is to stay in the window for 4 seconds and is to be deleted from the window at the 8 second mark. At this time point the time-based range window comprises two events (3000,30,3,30.0) and newly added event (4000,40,4,40.0).
An event (5000,50,5,50.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that none have expired. The expiration time for event (5000,50,5,50.0) is computed to be 10 seconds (timestamp of event+value of c2, i.e., 5+5=10 seconds). The event is then added to the time-based window. The event is to stay in the window for 5 seconds and is to be deleted from the window at the 10 second mark. At this time point the time-based range window comprises three events (3000,30,3,30.0), (4000,40,4,40.0), and newly added event (5000,50,5,50.0).
An event (6000,60,6,60.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that event (3000,30,3,30.0) has expired and is deleted (denoted by the “−”) from the time-based window. An expiration time for event (6000,60,6,60.0) is computed to be 12 seconds (timestamp of event+value of c2, i.e., 6+6=12 seconds). The event is then added to the time-based window. The event is to stay in the window for 6 seconds and is to be deleted from the window at the 12 second mark. At this time point the time-based range window comprises three events (4000,40,4,40.0), (5000,50,5,50.0), and newly added event (6000,60,6,60.0).
An event (7000,70,7,70.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that none have expired. An expiration time for event (7000,70,7,70.0) is computed to be 14 seconds (arrival time of event+value of c2, i.e., 7+7=14 seconds). The event is then added to the time-based window. The event is to stay in the window for 7 seconds and is to be deleted from the window at the 14 second mark. At this time point the time-based range window comprises four events (4000,40,4,40.0), (5000,50,5,50.0), (6000,60,6,60.0), and newly added event (7000,70,7,70.0).
An event (8000,80,8,80.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that event (4000,40,4,40.0) has expired and is deleted (denoted by the “−”) from the time-based window. An expiration time for event (8000,80,8,80.0) is computed to be 16 seconds (timestamp of event+value of c2, i.e., 8+8=16 seconds). The event is then added to the time-based window. The event is to stay in the window for 8 seconds and is to be deleted from the window at the 16 second mark. At this time point the time-based range window comprises four events (5000,50,5,50.0), (6000,60,6,60.0), (7000,70,7,70.0), and newly added event (8000,80,8,80.0).
An event (9000,90,9,90.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that none have expired. An expiration time for event (9000,90,9,90.0) is computed to be 18 seconds (arrival time of event+value of c2, i.e., 9+9=18 seconds). The event is added to the time-based window. The event is to stay in the window for 9 seconds and is to be deleted from the window at the 18 second mark. At this time point the time-based range window comprises five events (5000,50,5,50.0), (6000,60,6,60.0), (7000,70,7,70.0), (8000,80,8,80.0), and newly added event (9000,90,9,90.0).
An event (10000,100,10,100.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that event (5000,50,5,50.0) has expired and is deleted (denoted by the “−”) from the time-based window. An expiration time for event (10000,100,10,100.0) is computed to be 20 seconds (timestamp of event+value of c2, i.e., 10+10=20 seconds). The event is added to the time-based window. The event is to stay in the window for 10 seconds and is to be deleted from the window at the 20 second mark. At this time point the time-based range window comprises five events (6000,60,6,60.0), (7000,70,7,70.0), (8000,80,8,80.0), (9000,90,9,90.0), and newly added event (10000,100,10,100.0).
An event (11000,110,11,110.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired and it is determined that none have expired. An expiration time for event (11000,110,11,110.0) is computed to be 22 seconds (timestamp of event+value of c2, i.e., 11+11=22 seconds). The event is added to the time-based window. The event is to stay in the window for 11 seconds and is to be deleted from the window at the 22 second mark. At this time point the time-based range window comprises six events (6000,60,6,60.0), (7000,70,7,70.0), (8000,80,8,80.0), (9000,90,9,90.0), (10000,100,10,100.0), and newly added event (11000,110,11,110.0).
An event (12000,120,12,12.0) is received next. The contents of the time-based window are checked to see if any events in the window have expired it is determined that event (6000,60,6,60.0) has expired and is deleted (denoted by the “−”) from the relationship output by the window. An expiration time for event (12000,120,12,120.0) is computed to be 24 seconds (arrival time of event+value of c2, i.e., 12+12=24 seconds). The event is then added to the time-based window. The event is to stay in the window for 12 seconds and is to be deleted from the window at the 24 second mark At this time point the time-based range window comprises six events (7000,70,7,70.0), (8000,80,8,80.0), (9000,90,9,90.0), (10000,100,10,100.0), (11000,110,11,110.0), and newly added event (12000,120,12,120.0).
As described above with respect to Table A, the processing that is performed upon receiving an input event comprises determining an expiration time for the input event, adding the input event to the time-based window, and checking the window to identify and delete any expired events. The duration of time that an event stays in the time-based window can be a function of an attribute of the input event. Since the value of that attribute can be different in different events, the duration of time that the event stays in the time-based window can differ from one event to another. Accordingly, the durations of time that events are eligible to remain in the time-based window can be different for different events.
In certain embodiments, the processing depicted in
At 204, a duration of time for which the event is to be kept in the time-based window is computed for the received event. As part of 204, the range parameter specified for the time-based window by the CQL code is determined and used to determine the duration. As previously described, in some embodiments, the continuous query may define the duration for a time-based window as a function of the values of one or more attributes of the received input event. In such a scenario, determining the duration in 204 may involve determining the values of one or more attributes of the event received in 202 and computing the duration for that event as a function of those values. Since the values of the one or more attributes used for computing the duration could be different for different events, this causes the duration to potentially vary for individual events.
For example, in certain embodiments, the duration may be set to the value of a particular attribute of the event. The value of that particular attribute may be determined in 204 and the window duration for the input event set to the determined value. In some other embodiments, the continuous query may define the duration for a window as an arithmetic expression based upon one or more attribute values. In such a scenario, in 204, the one or more attribute values for the received event may be determined and arithmetic expression then evaluated using the determined values to compute a duration for the received event.
At 206, an expiration time is computed for the received event based upon the duration determined in 204. In one embodiment,
At 208, the expiration time computed in 206 may be associated with the event received in 202. For example, the expiration time information may be stored such that EPS 102 can, given an event, easily determine the expiration time computed for the event.
At 210, the time-based window is checked to see if it contains any events (i.e., previously received events) that have expired. For any event identified as having expired, the event is deleted or removed from the time-based window in 210. In one embodiment, an event in the time-based window is considered to have expired if the expiration time computed for the event is equal to or earlier than the present time. As described above, the expiration time for an event is computed as (t+T). Accordingly, the event is considered to have expired if the current time (tP) is same as or later than (t+T). Any event determined to have expired is then deleted or removed from the time-based window in 210.
At 212, the event received in 202 is inserted or added to the time-based window. At 214, the processing then waits for the next event in the event stream. Upon receiving the next event, processing is repeated from 202 to 214.
As described above with respect to
In the embodiment depicted in
Time-based window operator 304 may be configured to manage a time-based window. This may involve inserting a newly received event into the time-based window, determining when events in the time-based window have expired, and deleting or removing the expired events from the time-based window. In one embodiment, time-based window operator 304 may be configured to perform the processing depicted in 210 and 212 and described above.
Various data structures may be used to implement a variable duration time-based window. In one embodiment, a priority queue is used, where the priority is dictated by the expiration time computed for the events in the window. Newly received events are added to the queue and expired events are deleted from the queue. The events in the queue may be sorted based upon their associated expiration times. In one embodiment, the events are sorted such that events having earlier expiration times are closer to the head of the queue and events having later expiration times are towards the tail of the queue. At any time instance, the priority queue may comprise zero or more events representing the zero or more events in the time-based window at that time instance.
At 402, a newly received event with an associated expiration time may be received. The expiration time for the event may have been calculated by duration and expiration time evaluator 302.
At 404, a determination is made if the queue is empty. An empty queue indicates that there are presently no events in the window. If it is determined in 404 that the queue is empty, then processing continues with 412 else processing continues with 406.
At 406, the event at the head of the priority queue is accessed. Since event elements in the priority queue are always sorted based upon the expiration times associated with the events, with events having earlier expiration times being closer to the head of the queue and events having later expiration times being towards the tail of the queue, the event at the head of the queue represents an event in the window with the earliest expiration time.
At 408, it is determined whether the event accessed in 406 has expired. In one embodiment, the event is considered expired if the expiration time associated with the accessed event is equal to or earlier than the current time. For example, if the current time is at the 10 second mark, the accessed event is considered expired if the expiration time associated with the accessed event is 10 seconds or less than 10 seconds. If it is determined in 408 that the accessed event has expired, then at 410, the accessed event is removed or deleted from the priority queue and processing then continues with 404. If it is determined in 408 that the accessed event has not expired, then processing continues with 412. In this manner, the processing in 404, 406, 408, and 410 is repeated until all expired events in the queue have been removed from the queue or until the queue is empty.
If it is determined in 404 that the queue is empty or in 406 that the accessed event has not expired, then processing continues with 412. At 412, the event received in 402 is added to the queue based upon the expiration time computed for the event. The event is inserted in a manner that maintains the sorted nature of the queue (i.e., sorted based upon the expiration times). Processing then continues with 414 wherein EPS 102 waits for the next event in the event stream. Upon an event, processing continues with 402.
Time-Based Partition Window
In certain embodiments, a “PARTITION BY” CQL clause enables an event stream to be logically partitioned into multiple substreams based upon the stream's attributes. A sliding window of range T is then independently computed on each substream.
For example, a time-based partition window may be defined for a stream S as follows:
In previous implementations, the range/duration parameter “T” was constant or fixed and was not variable. Certain embodiments of the present invention, allow the range/duration parameter T specifying the time duration that an event is eligible to remain in the row-time range window for a partition created by a PARTITION BY clause to be different for different events. As a result, for a query registered with EPS 102 for a particular input event stream, the duration of time that events remain in a window for a partition can be different for different events.
For example, consider the following CQL query having a variable duration partition window:
For example, consider the following:
In the following example, the partition time-based duration parameter is expressed as an arithmetic expression.
The following example shows the effects of a variable duration time-based range window applied to different partitions as events are received. For this example, it is assumed that an input event stream S has a schema with two attributes c1 and c2:
A continuous CQL query may be specified for stream S as follows:
Table B below shows an input stream of tuples and the contents of a tuple and row-time range window applied to multiple partitions at various times points as events are received via input event stream S.
In Table B shown above, the left column shows a stream of events received via stream S having schema (timestamp,c1,c2). The timestamp is shown in milliseconds (msecs), where 1 second=1000 msecs. In one embodiment, the timestamp associated with an event may represent the time when the event is received or when the event occurred. The right column of Table B shows, for each partition, the contents (i.e., the events) in the row-time range window for the partition at various time points. A “+” notation in front of an event is used to indicate that the event is added to the row-time range window for a partition. A “−” notation in front of an event is used to indicate that the event has been deleted from the row-time range window for the partition due to expiration of the event.
In one embodiment, upon receiving an event, a partition for the event is determined. An expiration time is calculated for the event. The expiration time computed for an event indicates the time when the event expires and is to be deleted from the row-time range window for the partition. The event is then added to the row-time range window for the appropriate partition. The row-time range window for each partition is also checked to determine if any events in the row-time range window need to be removed from the window either due to the expiration of the event or due to the ROWs condition.
For an event having an associated timestamp “t” and having a time range or duration “T”, the expiration time for the event is (t+T). For the query
As shown in Table B, an event (1000,a,2) is received. The row-time range windows (i.e., the relation sets output by the window for each partition) for the various partitions are checked to determine if any events need to be deleted from the row-time range windows due to expiration of the events. For purposes of the example depicted in Table B, it is assumed that the row-time range windows for the various partitions are empty before the arrival of the event (1000,a,2). It is determined based upon the event's c2 attribute value that the event is to stay in the row-time range window for a partition corresponding to attribute value “a” (“Pa”) for 2 seconds. The expiration time for event (1000,a,2) is computed to be the 3 second mark (timestamp of the event+value of c2, i.e., 1+2=3 seconds). The event (1000,a,2) is then added (denoted by the “+”) to the row-time range window for Pa. Event (1000,a,2) is eligible to stay in the row-time range window for partition Pa for 2 seconds. The event is to be deleted from the row-time range window at the 3 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for Pa is then checked to determine if any events need to be deleted from the row-time range window due to the “ROWS 2” condition. It is determined that no event needs to be deleted.
An event (1000,a,9) is received having the same associated timestamp information. It is determined based upon the event's c2 attribute value that the event is to stay in the row-time range window for Pa for 9 seconds. The expiration time for the event is computed to be the 10 second mark (timestamp of the event+value of c2, i.e., 1+9=10 seconds). The event (1000,a,9) is then added (denoted by the “+”) to the row-time range window for partition Pa. Event (1000,a,9) is eligible to stay in the row-time range window for partition Pa for 9 seconds. The event is to be deleted from the row-time range window at the 10 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for Pa is checked to determine if any event needs to be deleted from the row-time range window due to the insertion of event (1000,a,9) to satisfy the “ROWS 2” condition. It is determined that no events need to be deleted. At this point the row-time range window for partition Pa comprises two events (1000,a,2) and (1000,a,9).
An event (2000,a,1) is received next. The row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that no events are expired. It is determined based upon the event's c2 attribute value that the event is to stay in the row-time range window for Pa for 1 second. The expiration time for event (a,1) is computed to be the 3 second mark (timestamp of the event+value of c2, i.e., 2+1=3 seconds). The event (2000,a,1) is then added (denoted by the “+”) to the row-time range window for partition Pa. Event (2000,a,1) is eligible to stay in the row-time range window for partition Pa for 1 second. The event is to be deleted from the row-time range window at the 3 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for Pa is then checked to determine if any events need to be deleted from the row-time range window for Pa due to insertion of event (2000,a,1) to satisfy the “ROWS 2” condition. Due to the “ROWS 2” condition for the row-time range window for Pa, the addition of event (2000,a,1) causes event (1000,a,2) to be deleted (denoted by the “−”) from the row-time range window for partition Pa, leaving two events (1000,a,9) and (2000,a,1) in the row-time range window for partition Pa.
An event (3000,b,1) is received next. The row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that event (2000,a,1) in the row-time range window for partition Pa has expired and is deleted (denoted by the “−”) from the window. It is determined, based upon the value of the c2 attribute, that event (3000,b,1) is to stay in the row-time range window for a partition corresponding to attribute value “b” (“Pb”) for 1 second. The expiration time for event (3000,b,1) is computed to be the 4 second mark (timestamp of the event+value of c2, i.e., 3+1=4 seconds). The event (3000,b,1) is then added (denoted by the “+”) to the row-time range window for Pb. Event (3000,b,1) is eligible to stay in the window for partition Pb for 1 second. The event is to be deleted from the row-time range window at the 4 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for Pb is checked to determine if any event needs to be deleted from the row-time range window due to the insertion of event (3000,b,1) to satisfy the “ROWS 2” condition. It is determined that no events need to be deleted. At this point the row-time range window for partition Pa comprises event (1000,a,9) and the row-time range window for partition Pb comprises event (3000,b,1).
Three events (4000,a,2), (4000,a,3) and (4000,b,3) are received next with the same associated timestamp. The row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that event (3000,b,1) in the row-time range window for Pb has expired and is deleted (denoted by the “−”) from the window. It is determined, based upon the value of the c2 attribute, that event (4000,a,2) is to stay in the row-time range window for Pa for 2 seconds. The expiration time for event (4000,a,2) is computed to be the 6 second mark (timestamp of the event+value of c2, i.e., 4+2=6 seconds). The event (4000,a,2) is then added (denoted by the “+”) to the row-time range window for partition Pa. Event (a,2) is eligible to stay in the row-time range window for partition Pa for 2 seconds and is to be deleted from the window at the 6 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for Pa is checked to determine if any event needs to be deleted from the row-time range window due to the insertion of event (4000,a,2) to satisfy the “ROWS 2” condition. It is determined that no events need to be deleted.
For event (4000,a,3), it is determined, based upon the value of the c2 attribute, that event (4000,a,3) is to stay in the row-time range window for Pa for 3 seconds. The expiration time for event (4000,a,3) is computed to be the 7 second mark (timestamp of the event+value of c2, i.e., 4+3=7 seconds). The event (4000,a,3) is then added (denoted by the “+”) to the row-time range window for partition Pa. Event (4000,a,3) is eligible to stay in the row-time range window for partition Pa for 3 seconds and is to be deleted from the window at the 7 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for Pa is then checked to determine if any events need to be deleted from the row-time range window for Pa due to insertion of event (4000,a,3) to satisfy the “ROWS 2” condition. The addition of event (4000,a,3) causes event (1000,a,9) to be deleted (denoted by the “−”) from the row-time range window for partition Pa.
For event (4000,b,3), it is determined, based upon the value of the c2 attribute, that event (4000,b,3) is to stay in the row-time range window for partition Pb for 3 seconds. The expiration time for event (4000,b,3) is computed to be the 7 second mark (timestamp of the event+value of c2, i.e., 4+3=7 seconds). The event (4000,b,3) is then added (denoted by the “+”) to the row-time range window for partition Pb. Event (b,3) is eligible to stay in the row-time range window for partition Pb for 3 seconds and is to be deleted from the window at the 7 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for partition Pb is checked to determine if any event needs to be deleted from the row-time range window due to the insertion of event (4000,b,3) to satisfy the “ROWS 2” condition. It is determined that no events need to be deleted. At this point, the row-time range window for partition Pa comprises events (4000,a,2) and (4000,a,3), and the window for partition Pb comprises event (4000,b,3).
An event (5000,b,2) is received next. The row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that no events are expired. It is determined, based upon the value of the c2 attribute, that event (5000,b,2) is to stay in the row-time range window for partition Pb for 2 seconds. The expiration time for event (5000,b,2) is computed to be the 7 second mark (timestamp of the event+value of c2, i.e., 5+2=7 seconds). The event (5000,b,2) is then added (denoted by the “+”) to the row-time range window for partition Pb. Event (5000,b,2) is eligible to stay in the row-time range window for partition Pb for 2 seconds and is to be deleted from the window at the 7 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for partition Pb is checked to determine if any event needs to be deleted from the row-time range window due to the insertion of event (5000,b,2) to satisfy the “ROWS 2” condition. It is determined that no events need to be deleted. At this point, the row-time range window for partition Pa comprises events (4000,a,2) and (4000,a,3), and the row-time range window for partition Pb comprises events (4000,b,3) and (5000,b,2).
A heartbeat event is received next having an associated 6000 msec timestamp. In one embodiment, a heartbeat event is a special type of input event that is used to convey just the time progress information. A heartbeat event does not have any value for the other attributes. An event processing system may be configured to send heartbeat events automatically at periodic intervals, which can be configured by a user of the system. Heartbeat events are then automatically generated and sent at the periodic intervals if no other actual event is received within that period (i.e., the event stream is silent for that time period). Upon receiving the heartbeat event, windows-related processing is performed. Accordingly, upon receiving heartbeat event (6000,heartbeat_event>), the row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that event (4000,a,2) in the row-time range window for partition Pa has expired and is deleted (denoted by the “−”) from the window. At this point, the row-time range window for partition Pa comprises event (4000,a,3), and the row-time range window for partition Pb comprises events (4000,b,3) and (5000,b,2).
An event (7000,c,1) is received next. The row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that event (4000,a,3) in the row-time range window for partition Pa and events (4000,b,3) and (5000,b,2) in the row-time range window for partition Pb have expired and are deleted (denoted by the “−”) from the window. It is determined based upon the received event's c2 attribute value that event (7000,c,1) is to stay in the row-time range window for a partition corresponding to attribute value “c” (“Pc”) for 1 second. The expiration time for event (7000,c,1) is computed to be the 8 second mark (timestamp of the event+value of c2, i.e., 7+1=8 seconds). The event (7000,c,1) is then added (denoted by the “+”) to the row-time range window for partition Pc corresponding to attribute value “c”. Event (7000,c,1) is eligible to stay in the row-time range window for partition Pc for 1 second and is to be deleted from the window at the 8 second mark (or earlier due to the “ROWS 2” condition for the partition window). The row-time range window for partition Pc is checked to determine if any event needs to be deleted from the row-time range window due to the insertion of event (7000,c,1) to satisfy the “ROWS 2” condition. It is determined that no events need to be deleted. At this point, the row-time range windows for partitions Pa and Pb are empty and the row-time range window for partition Pc comprises event (7000,c,1).
It is to be noted that not all systems need to have a heartbeat event sending mechanism. In a system not sending out heartbeat events, windows-related processing is performed upon receiving a regular input event via the event stream. For example, for the event stream depicted in Table B, for a system that does not have a heartbeat event sending capability, the processing performed at the 6000 msecs mark and the 7000 msecs mark may be performed at the 7000 msec mark when a new event (7000,c,1) is received.
A heartbeat event (8000,<heartbeat_event>) is received next. The row-time range windows for the various partitions are checked to determine if any event needs to be deleted from the row-time range windows due to expiration of the event. It is determined that event (7000,c,1) in the row-time range window for partition Pc has expired and is deleted (denoted by the “−”) from the window. At this point, the row-time range windows for partitions Pa, Pb, and Pc are empty.
As described above with respect to Table B, the processing that is performed upon receiving an input event comprises determining an expiration time for the input event, determining a partition to which the event belongs, adding the input event to the row-time range window for that partition, and checking the row-time range windows for the various partitions to identify and delete any expired events or events that need to be removed from the partition window as a result of the ROWS conditions. The duration of time that an event stays in the row-time range window for a partition can be a function of an attribute of the input event, which can be different for different input events. Accordingly, the durations of time that events are eligible to remain in a row-time range window for a partition can be different for different events.
In certain embodiments, the processing depicted in
At 504, a duration of time for which the event is eligible to be kept in a row-time range window for a partition is computed for the received event. As part of 504, the range parameter specified for the row-time range window by the CQL code is determined and used to determine the duration. As previously described, in some embodiments, the continuous query may define the duration as a function of the values of one or more attributes of the received input event. In such a scenario, determining the duration in 504 may involve determining the values of one or more attributes of the event received in 502 and computing the duration for that event as a function of those values. Since the values of the one or more attributes used for computing the duration could be different for different events, this causes the duration to potentially vary for individual events.
For example, in certain embodiments, the duration may be set to the value of a particular attribute of the event. The value of that particular attribute may be determined in 504 and the row-time range window duration for the input event set to the determined value. In some other embodiments, the continuous query may define the duration for a row-time range window as an arithmetic expression based upon one or more attribute values. In such a scenario, in 504, the one or more attribute values for the received event may be determined and arithmetic expression then evaluated using the determined values to compute a duration for the received event.
At 506, an expiration time is computed for the received event based upon the duration determined in 504. In one embodiment,
At 508, the expiration time computed in 506 may be associated with the event received in 502. For example, the expiration time information may be stored such that EPS 102 can, given an event, easily determine the expiration time computed for the event.
At 510, for each existing partition, the row-time range window for that partition is checked to identify and delete any expired events. For any event identified as having expired, the event is deleted or removed from that partition row-time range window. In one embodiment, an event in a row-time range window is considered to have expired if the expiration time computed for the event is equal to or earlier than the present time. As described above, the expiration time for an event is computed as (t+T). Accordingly, the event is considered to have expired if the current time (tP) is same as or later than (t+T).
At 512, a partition is determined for the input event received in 502. The partition to which the event belongs may depend upon the value of an attribute of the event. Accordingly, in 512, the value of the attribute used for partitioning the input event stream is checked for the received input event and the partition to which the event belongs determined based upon that value.
At 514, the event received in 502 is inserted or added to the row-time range window of the partition determined in 512.
As described above, for an
At 518, processing then waits for the next event in the event stream. Upon receiving the next event, processing is repeated from 502.
The various modules depicted in
Various data structures may be used to implement row-time range windows for the various partitions. In one embodiment, a set of priority queues may be used, with each priority queue corresponding to a row-time range window for a particular partition. In a priority queue representing a row-time range window for a partition, the priority may be dictated by the expiration time computed for the events in the row-time range window. Newly received events belonging to a partition are added to the priority queue for that partition. For a partition, expired events and/or events that are removed from the partition row-time range window due to the “row N” condition are deleted from the corresponding priority queue.
Within a queue for a partition, the events in the queue may be sorted based upon their associated expiration times. In one embodiment, the events are sorted such that events having earlier expiration times are closer to the head of the queue and events having later expiration times are towards the tail of the queue. At any time instance, the priority queue for a partition may comprise zero or more events representing the zero or more events in the window at that time instance for the partition.
At 602, a newly received input event with an associated expiration time may be received. The expiration time for the event may have been calculated by duration and expiration time evaluator 302.
Processing according to 604, 606, 608, 610, 614, and 612 is performed for each existing partition. At 604, a priority queue corresponding to a row-time range window for an unprocessed partition is accessed. At 606, a determination is made if the queue is empty. An empty queue indicates that there are presently no events in that partition row-time range window. If it is determined in 606 that the queue is empty, then processing continues with 614 where processing for the next unprocessed partition is resumed starting with 604. If it is determined in 606 that the queue is not empty, then processing continues with 608.
At 608, the event at the head of the priority queue for the partition being processed is accessed. Since event elements in the priority queue for the partition are always sorted based upon the expiration times associated with the events, with events having earlier expiration times being closer to the head of the queue and events having later expiration times being towards the tail of the queue, the event at the head of the queue represents an event in that partition window with the earliest expiration time.
At 610, it is determined whether the event accessed in 608 has expired. In one embodiment, the event is considered expired if the expiration time associated with the accessed event is equal to or earlier than the current time. For example, if the current time is at the 10 second mark, the accessed event is considered expired if the expiration time associated with the accessed event is 10 seconds or less than 10 seconds. If it is determined in 610 that the accessed event has expired, then at 612, the accessed event is removed or deleted from the priority queue for the partition and processing then continues with 606. If it is determined in 610 that the accessed event has not expired, then processing continues with 614. In this manner, the processing in 604, 606, 608, 610, 612, and 614 is repeated until all expired events have been deleted from the row-time range windows for the various partitions. Processing then continues with 616.
At 616, a partition is determined for the event received in 602. The partition for the event may be determined based upon a value of an attribute of the input event.
At 618, a priority queue corresponding to the row-time range window for the partition determined in 616 is accessed. At 620, the event is inserted or added to the priority queue accessed in 618. In one embodiment, the event may be inserted based upon the expiration time computed for the event such that the queue elements remain sorted based upon the expiration times computed for the events in the queue.
In certain embodiments, a hashing function may be used to access the queue corresponding to the particular partition determined in 616. The value of the attribute(s) used for partitioning the input event stream may be provided as an input to the hashing function and the hashing function then returns a reference (e.g., a pointer) to the queue corresponding to the row-time range for that partition.
At 622, the queue accessed in 618 is processed to identify and delete any events from the queue in order to conform to the “rows N” condition. At 624, processing then waits for the next event in the event stream. Upon receiving the next event, processing is repeated from 602.
In the manner described above, the duration of time that an event is eligible to remain in a time-based window can vary from one event to another. Further, in certain embodiments, the duration for an event can be based upon and be a function of one or more attributes of the event itself. The duration of time that an event is eligible to remain in the time-based window (either a regular time-based window or a row-time range window for a partition) can vary from one event to another and is thus event specific.
There are several consequences of events remaining in a time-based window for variable time durations. One consequence is that for two events received at the same time (e.g., having the same associated timestamp), the duration of time that the events spend in a time-based window can be different. As a result, the expiration times for the two events can also be different. For example, a continuous query may be defined for an event stream, where the duration of the time-based window is a function of the value of attribute “attr” in the schema for the stream. Consider two events where a first event (e1) is received at time t1 and a second event (e2) is also received at time t1. Further, let's assume that value of attribute “attr” in e1 is a1 and the value of attribute “attr” in e2 is a2, where a2 is not the same as a1. Accordingly:
As another consequence of variable duration time-based windows, it is possible for an earlier received event to have an associated expiration time that is later than the expiration time associated with a later received event, or in other words, the later received event expires from the window before the earlier received event. For example, taking the above example, let's assume that the first event (e1) is received at time t1 and the second event (e2) is received at time t2, where t2 is later than t1. Further, let's assume that value of attribute “attr” in e1 is a1 and the value of attribute “attr” in e2 is a2. Accordingly:
Variable duration time-based windows enable a user to control the duration of time that an event spends in the window, where the duration can be different for different events. This is useful in various different applications. For example, consider an application that is configured to process a stream of events related to products-related information. It is possible that the shelf life for each product is different (e.g., shelf life for perishables is less than the shelf life for non-perishables). For an application that needs to vary the duration of the time-based window based upon the shelf life for a product, the schema for the stream may be specified such that the shelf life is added as an attribute to the schema. The time-based window for an event may then be based on the value specified by the shelf life attribute. Other examples of applications that can make use of variable duration time-based windows include without restriction: applications related to events for different tasks having different associated alarms timers, tasks having different completion dates, etc.
As discussed above, the window time duration for an event can be based upon one or more attributes of the event itself. In certain embodiments, the attributes upon which the time duration is based may be part of the input event stream schema itself. However, in some embodiments, such attributes may not be part of the received input stream. In one such embodiment, the one or more attributes to be used for determining the window time duration may be added to the event stream by deriving a new stream from the original stream where the one or more attributes upon which the duration calculation is based are part of the schema of the derived event stream.
Client computing devices 702, 704, 706, 708 may be general purpose personal computers (including, by way of example, personal computers and/or laptop computers running various versions of Microsoft Windows and/or Apple Macintosh operating systems), cell phones or PDAs (running software such as Microsoft Windows Mobile and being Internet, e-mail, SMS, Blackberry, or other communication protocol enabled), and/or workstation computers running any of a variety of commercially-available UNIX or UNIX-like operating systems (including without limitation the variety of GNU/Linux operating systems). Alternatively, client computing devices 702, 704, 706, and 708 may be any other electronic device, such as a thin-client computer, Internet-enabled gaming system, and/or personal messaging device, capable of communicating over a network (e.g., network 710 described below). Although exemplary system environment 700 is shown with four client computing devices, any number of client computing devices may be supported. Other devices such as devices with sensors, etc. may interact with system 712.
A network 710 may facilitate communications and exchange of data between clients 702, 704, 706, and 708 and event processing system 712. Network 710 may be any type of network familiar to those skilled in the art that can support data communications using any of a variety of commercially-available protocols, including without limitation TCP/IP, SNA, IPX, AppleTalk, and the like. Merely by way of example, network 710 can be a local area network (LAN) such as an Ethernet network, a Token-Ring network and/or the like; a wide-area network; a virtual network, including without limitation a virtual private network (VPN); the Internet; an intranet; an extranet; a public switched telephone network (PSTN); an infra-red network; a wireless network (e.g., a network operating under any of the IEEE 802.1X suite of protocols, the Bluetooth protocol known in the art, and/or any other wireless protocol); and/or any combination of these and/or other networks.
Event processing system 712 may comprise one or more computers and/or servers which may be general purpose computers, specialized server computers (including, by way of example, PC servers, UNIX servers, mid-range servers, mainframe computers, rack-mounted servers, etc.), server farms, server clusters, or any other appropriate arrangement and/or combination. In various embodiments, system 712 may be adapted to run one or more services or software applications described in the foregoing disclosure.
System 712 may run an operating system including any of those discussed above, as well as any commercially available server operating system. System 712 may also run any of a variety of additional server applications and/or mid-tier applications, including HTTP servers, FTP servers, CGI servers, Java servers, database servers, and the like. Exemplary database servers include without limitation those commercially available from Oracle, Microsoft, Sybase, IBM and the like.
System environment 700 may also include one or more databases 714 and 716. Databases 714 and 716 may reside in a variety of locations. By way of example, one or more of databases 714 and 716 may reside on a storage medium local to (and/or resident in) system 712. Alternatively, databases 714 and 716 may be remote from system 712, and in communication with system 712 via a network-based or dedicated connection. In one set of embodiments, databases 714 and 716 may reside in a storage-area network (SAN) familiar to those skilled in the art. Similarly, any necessary files for performing the functions attributed to system 712 may be stored locally on system 712 and/or remotely, as appropriate. In one set of embodiments, databases 714 and 716 may include relational databases, such as Oracle 11g, which are adapted to store, update, and retrieve data in response to SQL-formatted commands.
Bus subsystem 824 provides a mechanism for letting the various components and subsystems of computer system 800 communicate with each other as intended. Although bus subsystem 824 is shown schematically as a single bus, alternative embodiments of the bus subsystem may utilize multiple busses.
Input subsystem 804 may include one or more input devices such as a mouse, a keyboard, a pointing device, a touchpad, etc. In general, input subsystem 804 may include any device or mechanism for inputting information to computer system 800.
Output subsystem 806 may include one or more output devices for outputting information from computer system 800. Examples of output devices include without limitation a display device, a printer, a projection device, etc. In general, output subsystem 806 may include any device or mechanism for outputting information from computer system 800.
Processing unit(s) 802 can include one or more processors, one or more cores of processors, combinations thereof, and the like. In some embodiments, processing unit(s) 802 can include a general purpose primary processor as well as one or more special purpose co-processors such as graphics processors, digital signal processors, or the like.
In some embodiments, some or all processing units 802 can be implemented using customized circuits, such as application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs). In some embodiments, such integrated circuits execute instructions that are stored on the circuit itself. In other embodiments, processing unit(s) 802 can execute instructions stored in working memory 818 or on storage devices 808. In various embodiments, processing units 802 can execute a variety of programs or code instructions 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 system working memory 818, storage devices 808, and/or on computer-readable storage media 810. Through suitable programming, processing units 802 can provide various functionalities described above for performing event stream-related processing. In some embodiments, computer system 800 may also include a processing acceleration unit 816, which can include a digital signal processor (DSP), a special-purpose processor, and/or the like.
Storage device(s) 808 may include memory devices such as disk drives, optical storage devices, and solid-state storage devices such as a random access memory (RAM) and/or a read-only memory (ROM), which can be programmable, flash-updateable and/or the like. Software (programs, code modules, instructions), which when executed by processing unit(s) 802 to provide the functionality described above, may be stored on storage devices 808. Storage devices 808 may also provide a repository for storing data used in accordance with embodiments of the present invention.
Computer-readable storage media reader 812 can further be connected to a computer-readable storage medium 810, together (and, optionally, in combination with storage device(s) 808) comprehensively representing remote, local, fixed, and/or removable memory storage devices plus storage media for temporarily and/or more permanently containing computer-readable information.
Communications subsystem 814 may permit data to be exchanged with network 710 and/or any other computers described above with respect to system environment 700. Communication subsystem 814 serves as an interface for receiving data from and transmitting data to other systems from computer system 800. The communication may be provided using wired or wireless protocols. For example, communication subsystem 814 may enable computer 800 to connect to a client device via the Internet. Communication subsystem 814 may comprise a modem, a network card (wireless or wired), an infra-red communication device, a GPS receiver, etc.
Working memory subsystem 818 may include a number of memories including a main random access memory (RAM) for storage of instructions and data during program execution and a read only memory (ROM) in which fixed instructions are stored. Software elements such as an operating system 820 and/or other code 822, such as an application program (which may be a client application, Web browser, mid-tier application, RDBMS, etc.), may be stored in working memory 818. In an exemplary embodiment, working memory 818 may include executable code and associated data structures (such as caches) used for processing events and enabling variable duration windows processing as described above.
It should be appreciated that alternative embodiments of computer system 800 may have more or less components with numerous variations from that described above. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software (including portable software, such as applets), or both. Further, connection to other computing devices such as network input/output devices may be employed.
Although specific embodiments of the invention have been described, various modifications, alterations, alternative constructions, and equivalents are also encompassed within the scope of the invention. Embodiments of the present invention are not restricted to operation within certain specific data processing environments, but are free to operate within a plurality of data processing environments. Additionally, although embodiments of the present invention have been described using a particular series of transactions and steps, it should be apparent to those skilled in the art that the scope of the present invention is not limited to the described series of transactions and steps.
Further, while embodiments of the present invention have been described using a particular combination of hardware and software, it should be recognized that other combinations of hardware and software are also within the scope of the present invention. Embodiments of the present invention may be implemented only in hardware, or only in software, or using combinations thereof. The various processes described herein can be implemented on the same processor or different processors in any combination. Accordingly, where components or modules are described as being configured to perform certain operations, such configuration can be accomplished, e.g., by designing electronic circuits to perform the operation, by programming programmable electronic circuits (such as microprocessors) to perform the operation, or any combination thereof. Processes can communicate using a variety of techniques including but not limited to conventional techniques for interprocess communication, and different pairs of processes may use different techniques, or the same pair of processes may use different techniques at different times.
The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that additions, subtractions, deletions, and other modifications and changes may be made thereunto without departing from the broader spirit and scope as set forth in the claims. Thus, although specific invention embodiments have been described, these are not intended to be limiting. Various modifications and equivalents are within the scope of the following claims.
The present application is a non-provisional of and claims the benefit and priority under 35 U.S.C. 119(e) of U.S. Provisional Application No. 61/752,850 filed Jan. 15, 2013, entitled VARIABLE DURATION WINDOWS ON CONTINUOUS DATA STREAMS, the entire contents of which are incorporated herein by reference 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 | Sep 1998 | A |
5802523 | Jasuja et al. | Sep 1998 | A |
5822750 | Jou et al. | Oct 1998 | A |
5826077 | Blakeley et al. | Oct 1998 | A |
5850544 | Parvathaneny et al. | Dec 1998 | A |
5857182 | DeMichiel et al. | Jan 1999 | A |
5918225 | White et al. | Jun 1999 | A |
5920716 | Johnson et al. | Jul 1999 | A |
5937195 | Ju et al. | Aug 1999 | A |
5937401 | Hillegas et al. | Aug 1999 | A |
6006235 | Macdonald et al. | Dec 1999 | A |
6011916 | Moore et al. | Jan 2000 | A |
6041344 | Bodamer et al. | Mar 2000 | A |
6081801 | Cochrane et al. | Jun 2000 | A |
6092065 | Floratos et al. | Jul 2000 | A |
6108666 | Floratos et al. | Aug 2000 | A |
6112198 | Lohman et al. | Aug 2000 | A |
6128610 | Srinivasan et al. | Oct 2000 | A |
6158045 | You | Dec 2000 | A |
6212673 | House et al. | Apr 2001 | B1 |
6219660 | Haderle et al. | Apr 2001 | B1 |
6263332 | Nasr et al. | Jul 2001 | B1 |
6278994 | Fuh et al. | Aug 2001 | B1 |
6282537 | Madnick et al. | Aug 2001 | B1 |
6341281 | MacNicol et al. | Jan 2002 | B1 |
6353821 | Gray | 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 et al. | Jun 2005 | B2 |
6954791 | Darby | Oct 2005 | B2 |
6985904 | Kaluskar et al. | Jan 2006 | B1 |
6986019 | Bagashev et al. | Jan 2006 | B1 |
6996557 | Leung et al. | Feb 2006 | B1 |
7020696 | Perry et al. | Mar 2006 | B1 |
7047249 | Vincent | May 2006 | B1 |
7051034 | Ghosh et al. | May 2006 | B1 |
7062749 | Cyr et al. | Jun 2006 | B2 |
7080062 | Leung et al. | Jul 2006 | B1 |
7093023 | Lockwood et al. | Aug 2006 | B2 |
7139977 | Russell | Nov 2006 | B1 |
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 |
7263464 | Dugger | Aug 2007 | B1 |
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 et al. | Oct 2008 | B2 |
7451143 | Sharangpani et al. | Nov 2008 | B2 |
7475058 | Kakivaya et al. | Jan 2009 | B2 |
7483976 | Ross | Jan 2009 | B2 |
7516121 | Liu et al. | Apr 2009 | B2 |
7519577 | Brundage et al. | Apr 2009 | B2 |
7519962 | Aman | Apr 2009 | B2 |
7526804 | Shelest et al. | Apr 2009 | B2 |
7533087 | Liu et al. | May 2009 | B2 |
7546284 | Martinez et al. | Jun 2009 | B1 |
7552365 | Marsh et al. | Jun 2009 | B1 |
7567953 | Kadayam et al. | Jul 2009 | B2 |
7580946 | Mansour et al. | Aug 2009 | B2 |
7587383 | Koo et al. | Sep 2009 | B2 |
7603674 | Cyr et al. | Oct 2009 | B2 |
7613848 | Amini et al. | Nov 2009 | B2 |
7620851 | Leavy et al. | Nov 2009 | B1 |
7630982 | Boyce 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 | May 2010 | B2 |
7716210 | Ozcan et al. | May 2010 | B2 |
7739265 | Jain et al. | Jun 2010 | B2 |
7805445 | Boyer et al. | Sep 2010 | B2 |
7814111 | Levin | Oct 2010 | B2 |
7818313 | Tsimelzon | Oct 2010 | B1 |
7823066 | Kuramura | Oct 2010 | B1 |
7827146 | De Landstheer et al. | Nov 2010 | B1 |
7827190 | Pandya | Nov 2010 | B2 |
7844829 | Meenakshisundaram | Nov 2010 | B2 |
7870124 | Liu et al. | Jan 2011 | B2 |
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 | May 2011 | B2 |
7954109 | Durham | May 2011 | B1 |
7979420 | Jain et al. | Jul 2011 | B2 |
7984043 | Waas | Jul 2011 | B1 |
7987204 | Stokes | Jul 2011 | B2 |
7988817 | Son | Aug 2011 | B2 |
7991766 | Srinivasan et al. | Aug 2011 | B2 |
7996388 | Jain et al. | Aug 2011 | B2 |
8019747 | Srinivasan et al. | Sep 2011 | B2 |
8032544 | Jing et al. | Oct 2011 | B2 |
8046747 | Cyr et al. | Oct 2011 | B2 |
8073826 | Srinivasan et al. | Dec 2011 | B2 |
8099400 | Haub et al. | Jan 2012 | B2 |
8103655 | Srinivasan et al. | Jan 2012 | B2 |
8112378 | Kudo | Feb 2012 | B2 |
8122006 | De Castro et al. | Feb 2012 | B2 |
8134184 | Becker et al. | Mar 2012 | B2 |
8145686 | Raman et al. | Mar 2012 | B2 |
8145859 | Park et al. | Mar 2012 | B2 |
8155880 | Patel et al. | Apr 2012 | B2 |
8190738 | Ruehle | May 2012 | B2 |
8195648 | Zabback | Jun 2012 | B2 |
8204873 | Chavan | Jun 2012 | B2 |
8204875 | Srinivasan et al. | Jun 2012 | B2 |
8260803 | Hsu et al. | Sep 2012 | B2 |
8290776 | Moriwaki et al. | Oct 2012 | B2 |
8296316 | Jain et al. | Oct 2012 | B2 |
8307197 | Koch, III | Nov 2012 | B2 |
8307343 | Chaudhuri et al. | Nov 2012 | B2 |
8315990 | Barga et al. | Nov 2012 | B2 |
8316012 | Abouzied et al. | Nov 2012 | B2 |
8321450 | Thatte et al. | Nov 2012 | B2 |
8332502 | Neuhaus et al. | Dec 2012 | B1 |
8346511 | Schoning et al. | Jan 2013 | B2 |
8352517 | Park et al. | Jan 2013 | B2 |
8370812 | Feblowitz et al. | Feb 2013 | B2 |
8386466 | Park et al. | Feb 2013 | B2 |
8387076 | Thatte et al. | Feb 2013 | B2 |
8392402 | Mihaila et al. | Mar 2013 | B2 |
8396886 | Tsimelzon | Mar 2013 | B1 |
8447744 | De Castro Alves et al. | May 2013 | B2 |
8458175 | Stokes | Jun 2013 | B2 |
8498956 | Srinivasan et al. | Jul 2013 | B2 |
8521867 | Srinivasan et al. | Aug 2013 | B2 |
8527458 | Park et al. | Sep 2013 | B2 |
8543558 | Srinivasan et al. | Sep 2013 | B2 |
8572589 | Cataldo et al. | Oct 2013 | B2 |
8589436 | Srinivasan | Nov 2013 | B2 |
8595840 | Malibiran et al. | Nov 2013 | B1 |
8676841 | Srinivasan et al. | Mar 2014 | B2 |
8713038 | Cohen et al. | Apr 2014 | B2 |
8713049 | Jain et al. | Apr 2014 | B2 |
8719207 | Ratnam et al. | May 2014 | B2 |
8738572 | Bird et al. | May 2014 | B2 |
8745070 | Krishnamurthy | Jun 2014 | B2 |
8762369 | Macho et al. | Jun 2014 | B2 |
8775412 | Day et al. | Jul 2014 | B2 |
8880493 | Chen et al. | Nov 2014 | B2 |
9015102 | van Lunteren | Apr 2015 | B2 |
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 | Jul 2016 | B2 |
9418113 | Bishnoi et al. | Aug 2016 | B2 |
9430494 | Park et al. | Aug 2016 | B2 |
9535761 | Park et al. | Jan 2017 | B2 |
9563663 | Shukla et al. | Feb 2017 | B2 |
9703836 | Hsiao et al. | Jul 2017 | B2 |
9712645 | de Castro Alves et al. | Jul 2017 | B2 |
9715529 | Park et al. | Jul 2017 | B2 |
9756104 | Shukla et al. | Sep 2017 | B2 |
9804892 | Park et al. | Oct 2017 | B2 |
9805095 | Deshmukh et al. | Oct 2017 | B2 |
9852186 | Herwadkar et al. | Dec 2017 | B2 |
9886486 | De Castro Alves et al. | Feb 2018 | B2 |
9934279 | Kali et al. | Apr 2018 | B2 |
9946756 | Hsiao et al. | Apr 2018 | B2 |
9953059 | Deshmukh et al. | Apr 2018 | B2 |
9972103 | De Castro Alves et al. | May 2018 | B2 |
9990410 | Roytblat et al. | Jun 2018 | B2 |
20020023211 | Roth et al. | Feb 2002 | A1 |
20020032804 | Hunt | Mar 2002 | A1 |
20020038217 | Young | Mar 2002 | A1 |
20020038306 | Griffin et al. | Mar 2002 | A1 |
20020038313 | Klein et al. | Mar 2002 | A1 |
20020049788 | Lipkin | Apr 2002 | A1 |
20020056004 | Smith et al. | May 2002 | A1 |
20020073399 | Golden | Jun 2002 | A1 |
20020116362 | Li et al. | Aug 2002 | A1 |
20020116371 | Dodds et al. | Aug 2002 | A1 |
20020133484 | Chau et al. | Sep 2002 | A1 |
20020169788 | Lee et al. | Nov 2002 | A1 |
20030014408 | Robertson | Jan 2003 | A1 |
20030037048 | Kabra et al. | Feb 2003 | A1 |
20030046673 | Copeland et al. | Mar 2003 | A1 |
20030065655 | Syeda-mahmood | Apr 2003 | A1 |
20030065659 | Agarwal et al. | Apr 2003 | A1 |
20030120682 | Bestgen et al. | Jun 2003 | A1 |
20030135304 | Sroub et al. | Jul 2003 | A1 |
20030200198 | Chandrasekar et al. | Oct 2003 | A1 |
20030212664 | Breining et al. | Nov 2003 | A1 |
20030229652 | Bakalash et al. | Dec 2003 | A1 |
20030236766 | Fortuna | Dec 2003 | A1 |
20040010496 | Behrendt et al. | Jan 2004 | A1 |
20040019592 | Crabtree | Jan 2004 | A1 |
20040024773 | Stoffel et al. | Feb 2004 | A1 |
20040030421 | Haley | 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 | 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 |
20050071217 | Hoogs et al. | Mar 2005 | A1 |
20050096124 | Stronach | May 2005 | A1 |
20050097128 | Ryan et al. | May 2005 | A1 |
20050108368 | Mohan | May 2005 | A1 |
20050120016 | Midgley | Jun 2005 | A1 |
20050154740 | Day et al. | Jul 2005 | A1 |
20050174940 | Iny | Aug 2005 | A1 |
20050177579 | Blakeley et al. | Aug 2005 | A1 |
20050192921 | Chaudhuri et al. | Sep 2005 | A1 |
20050204340 | Ruminer et al. | Sep 2005 | A1 |
20050229158 | Thusoo et al. | Oct 2005 | A1 |
20050273352 | Moffat et al. | Dec 2005 | A1 |
20050273450 | McMillen et al. | Dec 2005 | A1 |
20050289125 | Liu et al. | Dec 2005 | A1 |
20060007308 | Ide et al. | Jan 2006 | A1 |
20060015482 | Beyer et al. | Jan 2006 | A1 |
20060031204 | Liu et al. | Feb 2006 | A1 |
20060047696 | Larson et al. | Mar 2006 | A1 |
20060064487 | Ross | Mar 2006 | A1 |
20060080646 | Aman | Apr 2006 | A1 |
20060085592 | Ganguly et al. | Apr 2006 | A1 |
20060089939 | Broda et al. | Apr 2006 | A1 |
20060100957 | Buttler et al. | May 2006 | A1 |
20060100969 | Wang et al. | May 2006 | A1 |
20060106786 | Day et al. | May 2006 | A1 |
20060106797 | Srinivasa et al. | May 2006 | A1 |
20060129554 | Suyama et al. | Jun 2006 | A1 |
20060155719 | Mihaeli et al. | Jul 2006 | A1 |
20060166704 | Benco et al. | Jul 2006 | A1 |
20060167704 | Nicholls et al. | Jul 2006 | A1 |
20060167856 | Angele et al. | Jul 2006 | A1 |
20060167869 | Jones | Jul 2006 | A1 |
20060212441 | Tang et al. | Sep 2006 | A1 |
20060224576 | Liu et al. | Oct 2006 | A1 |
20060230029 | Yan | Oct 2006 | A1 |
20060235840 | Manikutty et al. | Oct 2006 | A1 |
20060242180 | Graf et al. | Oct 2006 | A1 |
20060282429 | Hernandez-Sherrington et al. | Dec 2006 | A1 |
20060294095 | Berk et al. | Dec 2006 | A1 |
20070016467 | John et al. | Jan 2007 | A1 |
20070039049 | Kupferman et al. | Feb 2007 | A1 |
20070050340 | Von Kaenel et al. | Mar 2007 | A1 |
20070076314 | Rigney | Apr 2007 | A1 |
20070118600 | Arora | May 2007 | A1 |
20070136239 | Lee et al. | Jun 2007 | A1 |
20070136254 | Choi et al. | Jun 2007 | A1 |
20070156787 | MacGregor | Jul 2007 | A1 |
20070156964 | Sistla | Jul 2007 | A1 |
20070168154 | Ericson | Jul 2007 | A1 |
20070192301 | Posner | Aug 2007 | A1 |
20070198479 | Cai et al. | Aug 2007 | A1 |
20070022092 | Nishizawa et al. | Sep 2007 | A1 |
20070214171 | Behnen | Sep 2007 | A1 |
20070226188 | Johnson et al. | Sep 2007 | A1 |
20070226239 | Johnson et al. | Sep 2007 | A1 |
20070250487 | Reuther | Oct 2007 | A1 |
20070271280 | Chandasekaran | Nov 2007 | A1 |
20070294217 | Chen et al. | Dec 2007 | A1 |
20080005093 | Liu et al. | Jan 2008 | A1 |
20080010093 | LaPlante et al. | Jan 2008 | A1 |
20080010241 | Mcgoveran | Jan 2008 | A1 |
20080016095 | Bhatnagar et al. | Jan 2008 | A1 |
20080028095 | Lang et al. | Jan 2008 | A1 |
20080033914 | Cherniack et al. | Feb 2008 | A1 |
20080034427 | Cadambi et al. | Feb 2008 | A1 |
20080046401 | Lee et al. | Feb 2008 | A1 |
20080071904 | Schuba et al. | Mar 2008 | A1 |
20080077570 | Tang et al. | Mar 2008 | A1 |
20080077587 | Wyschogrod et al. | Mar 2008 | A1 |
20080077780 | Zingher | Mar 2008 | A1 |
20080082484 | Averbuch et al. | Apr 2008 | A1 |
20080082514 | Khorlin et al. | Apr 2008 | A1 |
20080086321 | Walton | Apr 2008 | A1 |
20080098359 | Ivanov et al. | Apr 2008 | A1 |
20080098370 | Fontoura et al. | Apr 2008 | A1 |
20080110397 | Son | May 2008 | A1 |
20080114787 | Kashiyama et al. | May 2008 | A1 |
20080120283 | Liu et al. | May 2008 | A1 |
20080120321 | Liu et al. | May 2008 | A1 |
20080162583 | Brown et al. | Jul 2008 | A1 |
20080195577 | Fan et al. | Aug 2008 | A1 |
20080235298 | Lin et al. | Sep 2008 | A1 |
20080243451 | Feblowitz et al. | Oct 2008 | A1 |
20080243675 | Parsons et al. | Oct 2008 | A1 |
20080250073 | Nori et al. | Oct 2008 | A1 |
20080255847 | Moriwaki et al. | Oct 2008 | A1 |
20080263039 | Van Lunteren | Oct 2008 | A1 |
20080270764 | McMillen et al. | Oct 2008 | A1 |
20080275891 | Park | Nov 2008 | A1 |
20080281782 | Agrawal | Nov 2008 | A1 |
20080301086 | Gupta | Dec 2008 | A1 |
20080301124 | Alves et al. | Dec 2008 | A1 |
20080301125 | Alves et al. | Dec 2008 | A1 |
20080301135 | Alves et al. | Dec 2008 | A1 |
20080301256 | Mcwilliams et al. | Dec 2008 | A1 |
20080313131 | Friedman et al. | Dec 2008 | A1 |
20090006320 | Ding et al. | Jan 2009 | A1 |
20090006346 | Kanthi et al. | Jan 2009 | A1 |
20090007098 | Chevrette et al. | Jan 2009 | A1 |
20090019045 | Amir et al. | Jan 2009 | A1 |
20090024622 | Chkodrov et al. | Jan 2009 | A1 |
20090043729 | Liu et al. | Feb 2009 | A1 |
20090070355 | Cadarette et al. | Mar 2009 | A1 |
20090070785 | Alvez et al. | Mar 2009 | A1 |
20090070786 | Alves et al. | Mar 2009 | A1 |
20090076899 | Gbodimowo | Mar 2009 | A1 |
20090088962 | Jones | Apr 2009 | A1 |
20090100029 | Jain et al. | Apr 2009 | A1 |
20090106189 | Jain et al. | Apr 2009 | A1 |
20090106190 | Srinivasan et al. | Apr 2009 | A1 |
20090106198 | Srinivasan et al. | Apr 2009 | A1 |
20090106214 | Jain et al. | Apr 2009 | A1 |
20090106215 | Jain | Apr 2009 | A1 |
20090106218 | Srinivasan | 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 | Apr 2009 | A1 |
20090112803 | Srinivasan et al. | Apr 2009 | A1 |
20090112809 | Wolff 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 | 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 | Jan 2010 | A1 |
20100022627 | Scherer et al. | Jan 2010 | A1 |
20100023498 | Dettinger et al. | Jan 2010 | A1 |
20100036803 | Vemuri et al. | Feb 2010 | A1 |
20100036831 | Vemuri | Feb 2010 | A1 |
20100049710 | Young, Jr. et al. | Feb 2010 | A1 |
20100057663 | Srinivasan et al. | Mar 2010 | A1 |
20100057727 | Srinivasan et al. | Mar 2010 | A1 |
20100057735 | Srinivasan et al. | Mar 2010 | A1 |
20100057736 | Srinivasan et al. | Mar 2010 | A1 |
20100057737 | Srinivasan et al. | Mar 2010 | A1 |
20100094838 | Kozak | Apr 2010 | A1 |
20100106710 | Nishizawa | 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 | Sep 2010 | A1 |
20100223305 | Park et al. | Sep 2010 | A1 |
20100223437 | Park et al. | Sep 2010 | A1 |
20100223606 | Park | 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 | Jan 2011 | A1 |
20110022618 | Thatte et al. | Jan 2011 | A1 |
20110023055 | Thatte et al. | Jan 2011 | A1 |
20110029484 | Park et al. | Feb 2011 | A1 |
20110029485 | Park et al. | Feb 2011 | A1 |
20110035253 | Mason et al. | Feb 2011 | A1 |
20110040746 | Handa et al. | Feb 2011 | A1 |
20110040827 | Katsunuma et al. | Feb 2011 | A1 |
20110055192 | Tang et al. | Mar 2011 | A1 |
20110055197 | Chavan | Mar 2011 | A1 |
20110084967 | De Pauw et al. | Apr 2011 | A1 |
20110093162 | Nielsen et al. | Apr 2011 | A1 |
20110093491 | Zabback | Apr 2011 | A1 |
20110105857 | Zhang et al. | May 2011 | A1 |
20110131588 | Allam et al. | Jun 2011 | A1 |
20110161321 | De Castro et al. | Jun 2011 | A1 |
20110161328 | Park et al. | Jun 2011 | A1 |
20110161352 | De Castro et al. | Jun 2011 | A1 |
20110161356 | De Castro et al. | Jun 2011 | A1 |
20110161397 | Bekiares | Jun 2011 | A1 |
20110173231 | Drissi et al. | Jul 2011 | A1 |
20110173235 | Aman et al. | Jul 2011 | A1 |
20110196839 | Smith et al. | Aug 2011 | A1 |
20110196891 | De Castro et al. | Aug 2011 | A1 |
20110213802 | Singh et al. | Sep 2011 | A1 |
20110246445 | Mishra | Oct 2011 | A1 |
20110270879 | Srinivasan et al. | Nov 2011 | A1 |
20110282812 | Chandramouli et al. | Nov 2011 | A1 |
20110295841 | Sityon et al. | Dec 2011 | A1 |
20110302164 | Krishnamurthy et al. | Dec 2011 | A1 |
20110313844 | Chandramouli et al. | Dec 2011 | A1 |
20110314019 | Jimenez Peris | 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 |
20120078951 | Hsu 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 | 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 | Nov 2012 | A1 |
20120290715 | Dinger et al. | Nov 2012 | A1 |
20120291049 | Park et al. | Nov 2012 | A1 |
20120323941 | Chkodrov | Dec 2012 | A1 |
20120324453 | Chandramouli et al. | Dec 2012 | A1 |
20130007539 | Ananthapadmanabh et al. | Jan 2013 | A1 |
20130014088 | Park et al. | Jan 2013 | A1 |
20130031567 | Nano | Jan 2013 | A1 |
20130046725 | Cammert et al. | Feb 2013 | A1 |
20130066855 | Gupta et al. | Mar 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 | Oct 2013 | A1 |
20130332240 | Patri et al. | Dec 2013 | A1 |
20140019194 | Anne et al. | Jan 2014 | A1 |
20140059109 | Jugel et al. | Feb 2014 | A1 |
20140082013 | Wolf et al. | Mar 2014 | A1 |
20140095425 | Sipple et al. | Apr 2014 | A1 |
20140095444 | Deshmukh et al. | Apr 2014 | A1 |
20140095445 | Deshmukh | 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 et al. | Apr 2014 | A1 |
20140095543 | Hsiao et al. | Apr 2014 | A1 |
20140136514 | Jain et al. | May 2014 | A1 |
20140156683 | de Castro Alves | Jun 2014 | A1 |
20140172506 | Parsell et al. | Jun 2014 | A1 |
20140172914 | Elnikety et al. | Jun 2014 | A1 |
20140201225 | Deshmukh et al. | Jul 2014 | A1 |
20140236983 | Alves et al. | Aug 2014 | A1 |
20140237289 | de Castro Alves et al. | Aug 2014 | A1 |
20140237487 | Prasanna et al. | Aug 2014 | A1 |
20140324530 | Thompson et al. | Oct 2014 | A1 |
20140358959 | Bishnoi et al. | Dec 2014 | A1 |
20140379712 | Lafuente Alvarez | Dec 2014 | A1 |
20150007320 | Liu et al. | Jan 2015 | A1 |
20150156241 | Shukla et al. | Jun 2015 | A1 |
20150161214 | Kali et al. | Jun 2015 | A1 |
20150227415 | Alves et al. | Aug 2015 | A1 |
20150363464 | Alves et al. | Dec 2015 | A1 |
20150381712 | De Castro Alves et al. | Dec 2015 | A1 |
20160034311 | Park et al. | Feb 2016 | A1 |
20160085809 | De Castro et al. | Mar 2016 | A1 |
20160085810 | De Castro et al. | Mar 2016 | A1 |
20160103882 | Deshmukh et al. | Apr 2016 | A1 |
20160127517 | Shcherbakov et al. | May 2016 | A1 |
20160140180 | Park et al. | May 2016 | A1 |
20160154855 | Hsiao et al. | Jun 2016 | A1 |
20160283555 | Alves et al. | Sep 2016 | A1 |
20170024912 | De Castro Alves et al. | Jan 2017 | A1 |
20170075726 | Park et al. | Mar 2017 | A1 |
20180046511 | Park et al. | Feb 2018 | A1 |
Number | Date | Country |
---|---|---|
101866353 | Oct 2010 | CN |
102135984 | Jul 2011 | CN |
102665207 | Sep 2012 | CN |
102892073 | Jan 2013 | CN |
104885077 | Sep 2015 | CN |
104937591 | Sep 2015 | CN |
105593854 | May 2016 | CN |
1 241 589 | Sep 2002 | EP |
2474922 | Jul 2012 | EP |
2946314 | Nov 2015 | EP |
2946527 | Nov 2015 | EP |
2959408 | Dec 2015 | EP |
2002-251233 | Sep 2002 | JP |
2006338432 | Dec 2006 | JP |
2007-328716 | Dec 2007 | JP |
2008-541225 | Nov 2008 | JP |
2009-134689 | Jun 2009 | JP |
2009171193 | Jul 2009 | JP |
2010-108073 | May 2010 | JP |
2011-039818 | Feb 2011 | JP |
2015536001 | Dec 2015 | JP |
2016500167 | Jan 2016 | JP |
0049533 | Aug 2000 | WO |
WO2001018712 | Mar 2001 | WO |
1059602 | Aug 2001 | WO |
0165418 | Sep 2001 | WO |
03030031 | Apr 2003 | WO |
WO2007122347 | Nov 2007 | WO |
WO2009119811 | Oct 2009 | WO |
2010050582 | May 2010 | WO |
2012037511 | Mar 2012 | WO |
2012050582 | Apr 2012 | WO |
2012154408 | Nov 2012 | WO |
2012158360 | Nov 2012 | WO |
2014000819 | Jan 2014 | WO |
2014193943 | Dec 2014 | WO |
2015191120 | Dec 2015 | WO |
2016048912 | Mar 2016 | WO |
Entry |
---|
Pattern Recognition With MATCH_RECOGNIZE, Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1) E12048-03, May 2009, pp. 15.1 to 15.20. |
U.S. Appl. No. 11/977,437, Notice of Allowance dated Jul. 10, 2013, 10 pages. |
U.S. Appl. No. 11/601,415, Non-Final Office Action dated Dec. 11, 2013, 58 pages. |
U.S. Appl. No. 12/396,464, Non Final Office Action dated Dec. 31, 2013, 16 pages. |
U.S. Appl. No. 12/548,187, Final Office Action dated Jun. 10, 2013, 18 pages. |
U.S. Appl. No. 12/548,222, Notice of Allowance dated Jul. 18, 2013, 12 pages. |
U.S. Appl. No. 12/548,281, Final Office Action dated Oct. 10, 2013, 21 pages. |
U.S. Appl. No. 12/548,290, Notice of Allowance dated Sep. 11, 2013, 6 pages. |
U.S. Appl. No. 12/949,081, Final Office Action dated Aug. 27, 2013, 13 pages. |
U.S. Appl. No. 13/089,556, Final Office Action dated Aug. 29, 2013, 10 pages. |
U.S. Appl. No. 13/089,556, Non-Final Office Action dated Jan. 9, 2014, 14 pages. |
U.S. Appl. No. 13/102,665, Final Office Action dated Jul. 9, 2013, 17 pages. |
U.S. Appl. No. 13/107,742, Final Office Action dated Jul. 3, 2013, 19 pages. |
U.S. Appl. No. 13/177,748, Non-Final Office Action dated Aug. 30, 2013, 24 pages. |
U.S. Appl. No. 13/193,377, Notice of Allowance dated Aug. 30, 2013, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 12/548,187 dated Feb. 6, 2014, 53 pages. |
Agrawal et al. “Efficient pattern matching over event streams,” Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp. 147-160 (Jun. 2008). |
Chandramouli et al., High-Performance Dynamic Pattern Matching over Disordered Streams, Proceedings of the VLDB Endowment, vol. 3 Issue 1-2, Sep. 2010, pp. 220-231. |
Chapple “Combining Query Results with the Union Command,” ask.com Computing Databases, downloaded from: http://databases.about.com/od/sql/a/union.htm (no date, printed on Oct. 14, 2013). |
Chui, WebSphere Application Server V6.1—Class loader problem determination, IBM.com, copyright 2007, 66 pages. |
Komazec et al., Towards Efficient Schema-Enhanced Pattern Matching over RDF Data Streams, Proceedings of the 1st International Workshop on Ordering and Reasoning (OrdRing 2011), Bonn, Germany, Oct. 2011. |
Ogrodnek, Custom UDFs and hive, Bizo development blog http://dev.bizo.com, Jun. 23, 2009, 2 pages. |
U.S. Appl. No. 12/548,281, Non-Final Office Action dated Feb. 13, 2014, 16 pages. |
U.S. Appl. No. 13/177,748, Final Office Action dated Mar. 20, 2014, 23 pages. |
PCT Patent Application No. PCT/US2014/010832, International Search Report dated Apr. 3, 2014, 9 pages. |
Cadonna et al. “Efficient event pattern matching with match windows,” Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (Aug. 2012), pp. 471-479. |
Nichols et al. “A faster closure algorithm for pattern matching in partial-order event data, IEEE International Conference on Parallel and Distributed Systems,” (Dec. 2007), pp. 1-9. |
Oracle Application Server, Enterprise Deployment Guide, 10g Release 3 (10.1.3.2.0), B32125-02, Oracle, Apr. 2007, 120 pages. |
Oracle Database, SQL Language Reference 11 g Release 1 (11.1), B28286-02, Oracle, Sep. 2007, 1496 pages. |
Esper Reference Documentation, Copyright 2007, Ver. 1.12.0, 2007, 158 pages. |
Stream Query Repository: Online Auctions, at URL: http://www-db.stanford.edu/stream/sgr/onauc.html#queryspecsend, Dec. 2, 2002, 2 pages. |
Esper Reference Documentation, Copyright 2008, ver. 2.0.0, 2008, 202 pages. |
Oracle Database Data Cartridge Developer's Guide, B28425-03, 11 g Release 1 (11.1), Oracle, Mar. 2008, 372 pages. |
Oracle Application Server, Administrator's Guide, 10g Release 3 (10.1.3.2.0), B32196-01, Oracle., Jan. 2007, 376 pages. |
Oracle Application Server 10g, Release 2 and 3, New Features Overview, An Oracle White Paper, Oracle., Oct. 2005, 48 pages. |
Oracle Database, SQL Reference, 10g Release 1 (10.1), Part No. B10759-01, Dec. 2003, pp. 7-1 to 7-17; 7-287 to 7-290; 14-61 to 14-74. |
Business Process Management (BPM), Datasheet [online]. IBM, [retrieved on Jan. 28, 2013]. Retrieved from the Internet: <URL: http://www-142.ibm.com/software/products/us/en/category/BPM-SOFTWARE>. |
Complex Event Processing in the Real World, An Oracle White Paper., Sep. 2007, 13 pages. |
Coral8 Complex Event Processing Technology Overview, Coral8, Inc., Make it Continuous, Copyright 2007 Coral8, Inc., 2007, pp. 1-8. |
“Creating WebLogic Domains Using the Configuration Wizard.”, BEA Products, Version. 10.0, Dec. 2007, 78. |
“Creating Weblogic Event Server Applications.”, BEA WebLogic Event Server, Version. 2.0, Jul. 2007, 90 pages. |
Dependency Injection, Wikipedia, printed on Apr. 29, 2011, at URL: D http:en.wikipedia.org/w/index.php?title=DependencLinjection&01did=260831402,, Dec. 30, 2008, pp. 1-7. |
Deploying Applications to WebLogic Server, BEA WebLogic Server, ver. D 10.0, Mar. 30, 2007, 164 pages. |
Developing Applications with Weblogic Server, BEA WebLogic Server, ver. D 10.0, Mar. 30, 2007, 254 pages. |
EPL Reference, BEA WebLogic Event Server, ver. 2.0, Jul. 2007, 82 pages. |
Esper Reference Documentation Version 3.1.0, EsperTech, retrieved from internet at URL: http://esper.codehaus.org/esper-3.1.0/doc/reference/en/pdf/esper_reference.pdf, 2009, 293 pages. |
Fast Track Deployment and Administrator Guide for BEA WebLogic Server, BEA WebLogic Server 10.0 Documentation, printed on May 10, 2010, at URL:http://download.oracle.com/docs/cd/E13222_01 /wls/docs1 OO/quickstart/quick_start. html, May 10, 2010, 1page. |
Getting Started with WebLogic Event Server, BEA WebLogic Event Serverver 2.0, Jul. 2007, 66 pages. |
High Availability Guide, Oracle Application Server, 10g Release 3 (10.1.3.2.0), B32201-01, Jan. 2007, 314 pages. |
Installing Weblogic Real Time, BEA WebLogic Real Time, Ver. 2.0, Jul. 2007, 64 pages. |
Introduction to BEA WebLogic Server and BEA WebLogic Express, BEA WebLogic Server, Ver. 10.0, Mar. 2007, 34 pages. |
Introduction to WebLogic Real Time, BEA WebLogic Real Time, ver. 2.0 Jul. 2007, 20 pages. |
Jboss Enterprise Application Platform 4.3 Getting Started Guide CP03, for Use with Jboss Enterprise Application Platform 4.3 Cumulative Patch 3, Jboss a division of Red Hat, Red Hat Documentation Group, Copyright 2008, Red Hat, Inc., Sep. 2007, 68 pages. |
Managing Server Startup and Shutdown, BEA WebLogic Server, ver. 10.0, Mar. 30, 2007, 134 pages. |
Matching Behavior, .NET Framework Developer's Guide, Microsoft Corporation, Retrieved on: Jul. 1, 2008, URL: http://msdn.microsoft.com/en-us/library/Oyzc2ybO(pri nter).aspx, 2008, pp. 1-2. |
New Project Proposal for Row Pattern Recognition—Amendment to SQL with Application to Streaming Data Queries, H2-2008-027, H2 Teleconference Meeting, Jan. 9, 2008, pp. 1-6. |
Oracle CEP Getting Started, Release 11 gR1 (11.1.1) E14476-01, May 2009, 172 pages. |
Oracle Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1) E12048-01, Apr. 2010, 540 pages. |
OSGI Service Platform Core Specification, The OSGI Alliance, OSGI Alliance, ver. 4.1, release 4, Apr. 2007, 288 pages. |
Release Notes, BEA WebLogic Event Server, Ver. 2.0, Jul. 2007, 8 pages. |
Spring Dynamic Modules for OSGi Service Platforms product documentation, SpringSource, D, Jan. 2008, 71 pages. |
Stream Base New and Noteworthy, Stream Base, Jan. 1, 2010, 878 pages. |
Stream: The Stanford Stream Data Manager, IEEE Data Engineering Bulletin., Mar. 2003, pp. 1-8. |
Stream: The Stanford Stream Data Manager, Retrieved from: URL: http://infolab.stanford.edu/stream/, Jan. 5, 2006, pp. 1-9. |
Understanding Domain Configuration, BEA WebLogic Server, Ver. 10.0, Mar. 30, 2007, 38 pages. |
WebLogic Event Server Administration and Configuration Guide, BEA WebLogic Event D Server, Version. 2.0, Jul. 2007, 108 pages. |
WebLogic Event Server Reference, BEA WebLogic Event Server, Version. 2.0, Jul. 2007, 52 pages. |
Weblogic Server Performance and Tuning, BEA WebLogic Server, Ver. 10.0, Mar. 30, 2007, 180 pages. |
WebSphere Application Server V6.1 Problem Determination: IBM Redpaper Collection, WebSphere Software, IBM/Redbooks, Dec. 2007, 634 pages. |
What is BPM?, Datasheet [online]. IBM, [retrieved on Jan. 28, 2013]. Retrieved from the Internet: <URL: http://www-01.ibm.com/software/info/bpm/whatis-bpm/>. |
U.S. Appl. No. 10/948,523, Final Office Action dated Jul. 6, 2007, 5 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, 2010, 15 pages. |
U.S. Appl. No. 10/948,523, Notice of Allowance dated Jul. 8, 2008, 30 pages. |
U.S. Appl. No. 10/948,523, Non-Final Office Action dated Jan. 22, 200731 pages. |
U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance dated Jul. 17, 2008, 17 pages. |
U.S. Appl. No. 10/948,523, Supplemental Notice of Allowance dated Aug. 25, 2008, 3 pages. |
U.S. Appl. No. 11/601,415, Final Office Action dated Jul. 2, 2012, 59 pages. |
U.S. Appl. No. 11/601,415, Final Office Action dated May 27, 2009, 27 pages. |
U.S. Appl. No. 11/601,415, Final Office Action dated Jun. 30, 2010, 45 pages. |
U.S. Appl. No. 11/601,415, Non-Final Office Action dated Sep. 17, 2008, 10 pages. |
U.S. Appl. No. 11/601,415, Non-Final Office Action dated Nov. 30, 2009, 32 pages. |
U.S. Appl. No. 11/601,415, Office Action dated Dec. 9, 2011. |
U.S. Appl. No. 11/873,407, Final Office Action dated Apr. 26, 2010, 11 pages. |
U.S. Appl. No. 11/873,407, Non-Final Office Action dated Nov. 13, 2009, 7 pages. |
U.S. Appl. No. 11/873,407, Notice of Allowance dated Nov. 10, 2010, 14 pages. |
U.S. Appl. No. 11/873,407, Notice of Allowance dated Mar. 7, 2011, 8 pages. |
U.S. Appl. No. 11/874,197, Final Office Action dated Aug. 12, 2011, 26 pages. |
U.S. Appl. No. 11/874,197, Final Office Action dated Jun. 29, 2010, 17 pages. |
U.S. Appl. No. 11/874,197, Non-Final Office Action dated Dec. 22, 2010, 22 pages. |
U.S. Appl. No. 11/874,197, Office Action dated Nov. 10, 2009, 14 pages. |
U.S. Appl. No. 11/874,202, Final Office Action dated Jun. 8, 2010, 200 pages. |
U.S. Appl. No. 11/874,202, Non-Final Office Action dated Dec. 3, 2009, 20 pages. |
U.S. Appl. No. 11/874,202, Notice of Allowance dated Mar. 31, 2011, 12 pages. |
U.S. Appl. No. 11/874,202, Notice of Allowance dated Dec. 22, 2010, 29 pages. |
U.S. Appl. No. 11/874,850, Notice of Allowance dated Jan. 27, 2010, 11 pages. |
U.S. Appl. No. 11/874,850, Notice of Allowance dated Nov. 24, 2009, 17 pages. |
U.S. Appl. No. 11/874,850, Notice of Allowance dated Dec. 11, 2009, 5 pages. |
U.S. Appl. No. 11/874,896, Final Office Action dated Jul. 23, 2010, 28 pages. |
U.S. Appl. No. 11/874,896, Non-Final Office Action dated Dec. 8, 2009, 19 pages. |
U.S. Appl. No. 11/874,896, Non-Final Office Action dated Nov. 22, 2010, 25 pages. |
U.S. Appl. No. 11/874,896, Notice of Allowance dated Jun. 23, 2011, 30 pages. |
U.S. Appl. No. 11/927,681, Non-Final Office Action dated Mar. 24, 2011, 17 pages. |
U.S. Appl. No. 11/927,681, Notice of Allowance dated Jul. 1, 2011, 8 pages. |
U.S. Appl. No. 11/927,683, Final Office Action dated Sep. 1, 2011, 18 pages. |
U.S. Appl. No. 11/927,683, Non-Final Office Action dated Mar. 24, 2011, 13 pages. |
U.S. Appl. No. 11/927,683, Notice of Allowance dated Nov. 9, 2011, 10 pages. |
U.S. Appl. No. 11/977,437, Final Office Action dated Apr. 8, 2010, 18 pages. |
U.S. Appl. No. 11/977,437, Non-Final Office Action dated Oct. 13, 2009, 9 pages. |
U.S. Appl. No. 11/977,437, Notice of Allowance dated Mar. 4, 2013, 9 pages. |
U.S. Appl. No. 11/977,437, Office Action dated Aug. 3, 2012, 17 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/193,377, Final Office Action dated Jan. 17, 2013, 24 pages. |
U.S. Appl. No. 12/395,871, Non-Final Office Action dated May 27, 2011, 7 pages. |
U.S. Appl. No. 12/395,871, Notice of Allowance dated Mar. 2012, 27 pages. |
U.S. Appl. No. 12/395,871, Office Action dated Oct. 9, 2011, 33 pages. |
U.S. Appl. No. 12/396,008, Non-Final Office Action dated Jun. 8, 2011, 10 pages. |
U.S. Appl. No. 12/396,008, Notice of Allowance dated Nov. 16, 2011, 5 pages. |
U.S. Appl. No. 12/396,464, Final Office Action dated Jan. 16, 2013, 17 pages. |
U.S. Appl. No. 12/396,464, Non-Final Office Action dated Sep. 7, 2012, 18 pages. |
U.S. Appl. No. 12/506,891, Notice of Allowance dated Jul. 25, 2012, 8 pages. |
U.S. Appl. No. 12/506,891, Office Action dated Dec. 14, 2011, 41 pages. |
U.S. Appl. No. 12/506,905, Notice of Allowance dated Dec. 14, 2012, 15 pages. |
U.S. Appl. No. 12/506,905, Office Action dated Aug. 9, 2012, 42 pages. |
U.S. Appl. No. 12/506,905, Office Action dated Mar. 26, 2012, 61 pages. |
U.S. Appl. No. 12/534,384, Notice of Allowance dated May 7, 2013, 12 pages. |
U.S. Appl. No. 12/534,384, Non-Final Office Action dated Feb. 28, 2012, 13 pages. |
U.S. Appl. No. 12/534,384, Final Office Action dated Feb. 12, 2013, 14 pages. |
U.S. Appl. No. 12/534,398, Final Office Action dated Jun. 5, 2012, 27 pages. |
U.S. Appl. No. 12/534,398, Notice of Allowance dated Nov. 27, 2012, 10 pages. |
U.S. Appl. No. 12/534,398, Non-Final Office Action dated Nov. 1, 2011, 15 pages. |
U.S. Appl. No. 12/548,187, Non Final Office Action dated Sep. 27, 2011, 19 pages. |
U.S. Appl. No. 12/548,187, Non-Final Office Action dated Apr. 9, 2013, 17 pages. |
U.S. Appl. No. 12/548,187, Final Office Action dated Jun. 20, 2012, 22 pages. |
U.S. Appl. No. 12/548,209, Notice of Allowance dated Oct. 24, 2012, 22 pages. |
U.S. Appl. No. 12/548,209, Office Action dated Apr. 16, 2012, 40 pages. |
U.S. Appl. No. 12/548,222, Non-Final Office Action dated Apr. 10, 2013, 16 pages. |
U.S. Appl. No. 12/548,222, Non-Final Office Action dated Oct. 19, 2011, 19 pages. |
U.S. Appl. No. 12/548,222, Office Action dated Jun. 20, 2012, 29 pages. |
U.S. Appl. No. 12/548,281, Non-Final Office Action dated Apr. 12, 2013, 16 pages. |
U.S. Appl. No. 12/548,281, Non-Final Office Action dated Oct. 3, 2011, 20 pages. |
U.S. Appl. No. 12/548,281, Office Action dated Jun. 20, 2012, 29 pages. |
U.S. Appl. No. 12/548,290, Final Office Action dated Jul. 30, 2012, 34 pages. |
U.S. Appl. No. 12/548,290, Non-Final Office Action dated Oct. 3, 2011, 17 pages. |
U.S. Appl. No. 12/548,290, Non-Final Office Action dated Apr. 15, 2013, 17 pages. |
U.S. Appl. No. 12/874,197, Notice of Allowance dated Jun. 22, 2012. |
U.S. Appl. No. 12/913,636, Final Office Action dated Jan. 8, 2013, 21 pages. |
U.S. Appl. No. 12/913,636, Non-Final Office Action dated Jun. 7, 2012, 16 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, 11 pages. |
U.S. Appl. No. 12/957,201, Office Action dated Dec. 19, 2012, 15 pages. |
U.S. Appl. No. 13/089,556, Non-Final Office Action dated Apr. 10, 2013, 10 pages. |
U.S. Appl. No. 13/089,556, Office Action dated Nov. 6, 2012, 13 pages. |
U.S. Appl. No. 13/102,665, Office Action dated Feb. 1, 2013, 14 pages. |
U.S. Appl. No. 13/107,742, Non-Final Office Action dated Feb. 14, 2013, 16 pages. |
U.S. Appl. No. 13/184,528, Notice of Allowance dated Mar. 1, 2012. |
U.S. Appl. No. 13/193,377, Office Action dated Jan. 17, 2013, 25 pages. |
U.S. Appl. No. 13/193,377, Office Action dated Aug. 23, 2012, 48 pages. |
U.S. Appl. No. 13/244,272, Final Office Action dated Mar. 28, 2013, 29 pages. |
U.S. Appl. No. 13/244,272, Non-Final Office Action dated Oct. 4, 2012, 30 pages. |
U.S. Appl. No. 13/396,464, Office Action dated Sep. 7, 2012. |
Abadi, et al., Aurora: A Data Stream Management System, International Conference on Management of Data, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003, 4 pages. |
Aho, et al., Efficient String Matching: An Aid to Bibliographic Search, Communications of the ACM, vol. 18, No. 6, Association for Computing Machinery, Inc., Jun. 1975, pp. 333-340. |
Arasu, et al., An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations, 9th International Workshop on Database programming languages, Sep. 2003, 11 pages. |
Arasu, et al., An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations, 9th International Workshop on Database programming languages, Sep. 2003, 12 pages. |
Arasu, et al., CQL: A language for Continuous Queries over Streams and Relations, Lecture Notes in Computer Science vol. 2921, 2004, pp. 1-19. |
Arasu, et al., STREAM: The Stanford Data Stream Management System, Department of Computer Science, Stanford University, 2004, p. 21. |
Arasu, et al., The CQL Continuous Query Language: Semantic Foundations and Query Execution, Stanford University, The VLDB Journal—The International Journal on Very Large Data Bases, vol. 15, No. 2, Springer-Verlag New York, Inc., Jun. 2006, pp. 1-32. |
Avnur, et al., Eddies: Continuously Adaptive Query Processing, In Proceedings of the 2000 ACM SIGMOD International Conference on Data, Dallas TX, May 2000, 12 pages. |
Avnur, et al., Eddies: Continuously Adaptive Query Processing, slide show, believed to be prior to Oct. 17, 2007, 4 pages. |
Babcock et al., Models and Issues in Data Streams, Proceedings of the 21st ACM SIGMOD-SIGACT-SIDART symposium on Principles of database systems, 2002, 30 pages. |
Babu, et al., Continuous Queries over Data Streams, SIGMOD Record, vol. 30, No. 3, Sep. 2001, pp. 109-120. |
Bai, et al., A Data Stream Language and System Designed for Power and Extensibility, Conference on Information and Knowledge Management, Proceedings of the 15th ACM D International Conference on Information and Knowledge Management, Arlington, Virginia, Copyright 2006, ACM Press., Conference on Information and Knowledge Management, Proceedings of the 15th ACM D International Conference on Information and Knowledge Management, Arlington, Virginia, Copyright 2006, ACM Press., Nov. 5-11, 2006, 10 pages. |
Bose, et al., A Query Algebra for Fragmented XML Stream Data, 9th International Conference on Data Base Programming Languages (DBPL), Sep. 2003, 11 pages. |
Buza, Extension of CQL over Dynamic Databases, Journal of Universal Computer Science, vol. 12, No. 9, Sep. 28, 2006, pp. 1165-1176. |
Carpenter, User Defined Functions, Retrieved from: URL: http://www.sqlteam.comitemprint.asp?ItemID=979, Oct. 12, 2000, 4 pages. |
Chan, et al., Efficient Filtering of XML documents with Xpath expressions, VLDB Journal D, 2002, pp. 354-379. |
Chandrasekaran, et al., TelegraphCQ: Continuous Dataflow Processing for an Uncertain World, Proceedings of CIDR, 2003, 12 pages. |
Chen, et al., NiagaraCQ: A Scalable Continuous Query System for Internet Databases, Proceedings of the 2000 SIGMOD International Conference on Management of Data., May 2000, 379-390 pages. |
Colyer, et al., Spring Dynamic Modules Reference Guide, Copyright, ver. 1.0.3, 2006-2008, 73 pages. |
Colyer, et al., Spring Dynamic Modules Reference Guide, Ver. 1.1.3, 2006-2008, 96 pages. |
Conway, An Introduction to Data Stream Query Processing, Truviso, Inc., URL:http://neilconway.org/talks/streamjntro.pdf, May 24, 2007, 71 pages. |
Demers, et al., Towards Expressive Publish/Subscribe Systems, Proceedings of the 10th International Conference on Extending Database Technology (EDBT 2006),Munich, Germany, Mar. 2006, pp. 1-18. |
Demichiel, et al., JSR 220: Enterprise JavaBeans™, EJB 3.0 Simplified API, EJB 3.0 Expert Group, Sun Microsystems, Ver. 3.0, May 2, 2006, 59 pages. |
Deshpande, et al., Adaptive Query Processing, Slide show believed to be prior to Oct. 17, 2007, 27 pages. |
Diao, et al., Query Processing for High-Volume XML Message Brokering, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 12 pages. |
Diao, Query Processing for Large-Scale XML Message Brokering, University of California Berkeley, 2005, 226 pages. |
Dindar, et al., Event Processing Support for Cross-Reality Environments, Pervasive Computing, IEEE CS, Jul.-Sep. 2009, Copyright 2009, IEEE, Jul.-Sep. 2009, pp. 2-9. |
Fernandez, et al., Build your own XQuery processor, slide show, at URL:http://www.galaxquery.org/slides/ebdt-summer-school2004 pdf, 2004, 116 pages. |
Fernandez, et al., Implementing XQuery 1.0: The Galax Experience, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 4 pages. |
Florescu, et al., The BEA/XQRL Streaming XQuery Processor, Proceedings of the 29th VLDB Conference, 2003, 12 pages. |
Gilani, Design and implementation of stream operators, query instantiator and stream buffer manager, Dec. 2003, 137 pages. |
Golab, et al., Issues in Data Stream Management, ACM SIGMOD Record, vol. 32, issue 2, ACM Press, Jun. 2003, pp. 5-14. |
Golab, et al., Sliding Window Query Processing Over Data Streams, University of Waterloo, D Waterloo, Ont. Canada, Aug. 2006, 182 pages. |
Gosling, et al., The Java Language Specification, Book, copyright , 3rd edition, FG , Sun Microsystems USA. D (due to size, reference will be uploaded in two parts), 1996-2005, 684 pages. |
Hao, et al., Achieving high performance web applications by service and database replications at edge servers, Performance Computing and communications conference(IPCCC) IEEE 28th International, IEEE, Piscataway, NJ, USA, XP031622711, ISBN: 978-1-4244-5737-3, 2009, pp. 153-160. |
Hopcroft, Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, Copyright 2001, 524 pages. |
Hulton, et al., Mining Time-Changing Data Stream, Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2001, 10 pages. |
Jin, et al., ARGUS: Efficient Scalable Continuous Query Optimization for Large-Volume Data Streams, 10th International Database Engineering and Applications Symposium (IDEAS'06), 2006, 7 pages. |
Kawaguchi, et al., Java Architecture for XML Binding (JAXB) 2.2, Sun Microsystems, Inc., Dec. 10, 1999, 384 pages. |
Knuth, et al., Fast Pattern Matching in Strings, Siam J Comput 6(2), Jun. 1977, 323-50 pages. |
Lakshmanan, et al., On efficient matching of streaming XML documents and queries, 2002, 18 pages. |
Lindholm, et al., Java Virtual Machine Specification, 2nd Edition, Prentice Hall, Apr. 1999, 484 pages. |
Liu, et al., Efficient XSLT Processing in Relational Database System, Proceeding of the 32nd. International Conference on Very Large Data Bases (VLDB), Sep. 2006, pp. 1106-1116. |
Luckham, What's the Difference Between ESP and CEP? Complex Event Processing, downloaded, at URL:http://complexevents.com/?p=103, Apr. 29, 2011, 5 pages. |
Madden, et al., Continuously Adaptive Continuous Queries (CACQ) over Streams, SIGMOD, Jun. 4-6, 2002, 12 pages. |
Martin, et al., Finding Application Errors and Security Flaws Using PQL, a Program Query Language, OOPSLA'05, Oct. 16, 2005, pp. 1-19. |
Motwani, et al., Query Processing Resource Management, and Approximation in a Data 0 Stream Management System, Proceedings of CIDR, Jan. 2003, 12 pages. |
Munagala, et al., Optimization of Continuous Queries with Shared Expensive Filters, Proceedings of the 26th ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, Oct. 17, 2007, 14 pages. |
Nah, et al., A Cluster-Based TMO-Structured Scalable Approach for Location Information Systems, Object-Oriented Real-Time Dependable Systems, 2003. WORDS 2003 Fall. Proceedings. Ninth IEEE International Workshop on Date of Conference: Oct. 1-3, 2003, pp. 225-233. |
Novick, Creating a User Defined Aggregate with SQL Server 2005, URL: http://novicksoftware.com/Articles/sql-2005-product-user-defined-aggregate.html, 2005, 6 pages. |
International Application No. PCT/US2011/052019, International Search Report and Written Opinion dated Nov. 17, 2011, 55 pages. |
International Application No. PCT/US2012/034970, International Search Report and Written Opinion dated Jul. 16, 2012, 13 pages. |
International Application No. PCT/US2012/036353, International Search Report and Written Opinion dated Sep. 12, 2012, 11 pages. |
Peng, et al., Xpath Queries on Streaming Data, 2003, pp. 1-12. |
Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981, 301 pages. |
PostgresSQL, Manuals: PostgresSQL 8.2: Create Aggregate, believed to be prior to Apr. 21, 2007, 4 pages. |
PostgresSQL, Documentation: Manuals: PostgresSQL 8.2: User-Defined Aggregates believed to be prior to Apr. 21, 2007, 4 pages. |
Sadri, et al., Expressing and Optimizing Sequence Queries in Database Systems, ACM Transactions on Database Systems, vol. 29, No. 2, ACM Press, Copyright, Jun. 2004, 282-318 pages. |
Sadtler, et al., WebSphere Application Server Installation Problem Determination, Copyright 2007, IBM Corp., 2007, 1-48 pages. |
Sansoterra, Empower SQL with Java User-Defined Functions, ITJungle.com, Oct. 9, 2003, 9 pages. |
Sharaf, et al., Efficient Scheduling of Heterogeneous Continuous Queries, VLDB, Sep. 12-15, 2006, 511-522 pages. |
Stolze, et al., User-defined Aggregate Functions in DB2 Universal Database, Retrievd from: <http://www.128. ibm.com/deve10perworks/d b2/1 ibrary/tachartic1e/0309stolze/0309stolze.html>, Sep. 11, 2003, 11 pages. |
Stump, et al., Proceedings, the 2006 Federated Logic Conference, IJCAR '06 Workshop, PLPV '06: Programming Languages meets Program Verification, 2006, 1-113 pages. |
Terry, et al., Continuous queries over append-only database, Proceedings of ACM SIGMOD, 1992, 321-330 pages. |
Ullman, et al., Introduction to JDBC, Stanford University, 2005, 7 pages. |
Vajjhala, et al., The Java Architecture for XML Binding (JAXB) 2.0, Sun Microsystem, D Inc., Final Release , Apr. 19, 2006, 384 pages. |
Vijayalakshmi, et al., Processing location dependent continuous queries in distributed mobile databases using mobile agents, IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007), Dec. 22, 2007, 1023-1030 pages. |
W3C, XML Path Language (XPATH), W3C Recommendation, Version. 1.0, Retrieved from: URL: http://www.w3.org/TR/xpath, Nov. 16, 1999, 37 pages. |
Wang, et al., Distributed continuous range query processing on moving objects, DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications, 2006, 655-665 pages. |
White, et al., WebLogic Event Server: A Lightweight, Modular Application Server for Event Processing, 2nd International Conference on Distributed Event-Based Systems, Rome, Italy, Copyright 2004., Jul. 2-4, 2008, 8 pages. |
Widom, et al., CQL: A Language for Continuous Queries over Streams and Relations, Oct. 17, 2007, 62 pages. |
Widom, et al., The Stanford Data Stream Management System, PowerPoint Presentation, Oct. 17, 2007, 110 pages. |
Wu, et al., Dynamic Data Management for Location Based Services in Mobile Environments, Database Engineering and Applications Symposium, Jul. 16, 2003, 172-181 pages. |
Zemke, XML Query, mailed on Mar. 14, 2004, 29 pages. |
SQL Tutorial-In, Tizag.com, http://web.archive.org/web/20090216215219/http://www.tizag.com/sgiTutorial/sqlin.php, Feb. 16, 2009, pp. 1-3. |
Notice of Allowance for U.S. Appl. No. 11/977,437 dated Jul. 10, 2013, 10 pages. |
Final Office Action for U.S. Appl. No. 12/548,281 dated Oct. 10, 2013, 21 pages. |
Notice of Allowance for U.S. Appl. No. 12/548,290 dated Sep. 11, 2013, 6 pages. |
Final Office Action for U.S. Appl. No. 13/089,556 dated Aug. 29, 2013, 10 pages. |
Final Office Action for U.S. Appl. No. 12/949,081 dated Aug. 27, 2013, 12 pages. |
Notice of Allowance for U.S. Appl. No. 13/193,377 dated Aug. 30, 2013, 18 pages. |
Non-Final Office Action for U.S. Appl. No. 13/177,748 dated Aug. 30, 2013, 23 pages. |
Bottom-up parsing, Wikipedia, downloaded from: http://en.wikipedia.org/wiki/Bottom-up_parsing, Sep. 8, 2014, pp. 1-2. |
Branch Predication, Wikipedia, downloaded from: http://en.wikipedia.org/wiki/Branch_predication, Sep. 8, 2014, pp. 1-4. |
Microsoft Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, ©, 2002, pp. 238-239 and 529. |
Notice of Allowance for U.S. Appl. No. 13/089,556 dated Oct. 6, 2014, 9 pages. |
U.S. Appl. No. 12/396,464, Notice of Allowance dated Sep. 3, 2014, 7 pages. |
U.S. Appl. No. 12/548,187, Advisory Action dated Sep. 26, 2014, 6 pages. |
U.S. Appl. No. 12/548,281, Final Office Action dated Aug. 13, 2014, 19 pages. |
U.S. Appl. No. 12/913,636, Non-Final Office Action dated Jul. 24, 2014, 22 pages. |
U.S. Appl. No. 12/957,201, Non-Final Office Action dated Jul. 30, 2014, 12 pages. |
U.S. Appl. No. 13/764,560, Non Final Office Action dated Sep. 12, 2014, 23 pages. |
U.S. Appl. No. 13/770,969, Non Final Office Action dated Aug. 7, 2014, 9 pages. |
U.S. Appl. No. 14/302,031, Non-Final Office Action dated Aug. 27, 2014, 19 pages. |
Abadi et al., Aurora: a new model and architecture for data stream management, the VLDB Journal the International Journal on very large data bases, vol. 12, No. 2, Aug. 1, 2003, pp. 120-139. |
Balkesen et al., Scalable Data Partitioning Techniques for Parallel Sliding Window Processing over Data Streams, 8th International Workshop on Data Management for Sensor Networks, Aug. 29, 2011, pp. 1-6. |
Chandrasekaran et al., PSoup: a system for streaming queries over streaming data, The VLDB Journal, The International Journal on very large data bases, vol. 12, No. 2, Aug. 1, 2003, pp. 140-156. |
Dewson, Beginning SQL Server 2008 for Developers: From Novice to Professional, A Press, Berkeley, CA, 2008, pp. 337-349 and 418-438. |
Harish et al., Identifying robust plans through plan diagram reduction, PVLDB '08, Auckland, New Zealand, Aug. 23-28, 2008, pp. 1124-1140. |
Krämer, Continuous Queries Over Data Streams—Semantics and Implementation, Fachbereich Mathematik and Informatik der Philipps-Universitat, Marburg, Germany, Retrieved from the Internet: URL:http://archiv.ub.uni-marburg.de/dissjz007/0671/pdfjdjk.pdf, Jan. 1, 2007; 313 pages. |
International Application No. PCT/US2013/062047, International Search Report and Written Opinion dated Jul. 16, 2014, 12 pages. |
International Application No. PCT/US2013/062050, International Search Report & Written Opinion dated Jul. 2, 2014, 13 pages. |
International Application No. PCT/US2013/062052, International Search Report & Written Opinion dated Jul. 3, 2014, 12 pages. |
International Application No. PCT/US2013/073086, International Search Report and Written Opinion dated Mar. 14, 2014. |
International Application No. PCT/US2014/017061, International Search Report and Written Opinion dated Sep. 9, 2014, 12 pages. |
Rao et al., Compiled Query Execution Engine using JVM, ICDE '06, Atlanta, GA, Apr. 3-7, 2006, 12 pages. |
Medhabi et al., Optimizing complex sequence pattern extraction using caching, data engineering workshops (ICDEW)˜ 2011 IEEE 27th international conference on IEEE, Apr. 11, 2011, pp. 243-248. |
Shah et al., Flux: an adaptive partitioning operator for continuous query systems, Proceedings of the 19th International Conference on Data Engineering, Mar. 5-8, 2003, pp. 25-36. |
Stillger et al., LEO—DB2's LEarning Optimizer, Proc. of the VLDB, Roma, Italy, Sep. 2001, pp. 19-28. |
“Supply Chain Event Management: Real-Time Supply Chain Event Management,” product information Manhattan Associates (copyright 2009-2012) one page. |
Fantozzi “A Strategic Approach to Supply Chain Event Management,” student submission for Masters Degree, Massachusetts Institute of Technology (Jun. 2003) 36 pages. |
Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1.4.0) E12048-04,(Jan. 2011), pp. title pages, iii-xxxviii, 1-1 to 4-26, 6-1 to 6-12, 18-1 to 20-26, Index-1 to Index-14. |
Oracle™ Complex Event Processing CQL Language Reference, 11g Release 1 (11.1.1) E12048-03, (Apr. 2010) pp. 18-1 to 18.9.5. |
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. |
Pradhan “Implementing and Configuring SAP® Event Management” Galileo Press, pp. 17-21 (copyright 2010). |
Wilson “SAP Event Management, an Overview,” Q Data USA, Inc.( copyright 2009) 16 pages. |
U.S. Appl. No. 12/949,081, Non-Final Office Action dated Jan. 28, 2015, 20 pages. |
U.S. Appl. No. 12/957,201, Notice of Allowance dated Jan. 21, 2015, 5 pages. |
U.S. Appl. No. 13/107,742, Final Office Action dated Jan. 21, 2015, 23 pages. |
U.S. Appl. No. 13/177,748, Non-Final Office Action dated Feb. 3, 2015, 22 pages. |
U.S. Appl. No. 13/770,961, Non-Final Office Action dated Feb. 4, 2015, 22 pages. |
U.S. Appl. No. 13/770,969, Notice of Allowance dated Jan. 22, 2015, 5 pages. |
U.S. Appl. No. 13/829,958, Non-Final Office Action dated Dec. 11, 2014, 15 pages. |
U.S. Appl. No. 13/906,162, Non-Final Office Action dated Dec. 29, 2014, 10 pages. |
International Application No. PCT/US2014/010832, Written Opinion dated Dec. 15, 2014, 5 pages. |
International Application No. PCT/US2014/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. |
Cranor et al. “Gigascope: a stream database for network applications,” Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 647-651 (Jun. 2003). |
Oracle® Complex Event Processing EPL Language Reference 11g Release 1 (11.1.1.4.0), E14304-02, Jan. 2011, 80 pages. |
De Castro Alves, A General Extension System for Event Processing Languages, DEBS '11, New York, NY, USA, Jul. 11-15, 2011, pp. 1-9. |
Takenaka et al., A scalable complex event processing framework for combination of SQL-based continuous queries and C/C++ functions, FPL 2012, Oslo, Norway, Aug. 29-31, 2012, pp. 237-242. |
Tomàs et al., RoSeS: A Continuous Content-Based Query Engine for RSS Feeds, DEXA 2011, Toulouse, France, Sep. 2, 2011, pp. 203-218. |
Non-Final Office Action for U.S. Appl. No. 13/830,378 dated Feb. 25, 2015, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 13/830,129 dated Feb. 27, 2015, 19 pages. |
International Application No. PCT/US2014/068641, International Search Report and Written Opinion dated Feb. 26, 2015, 11 pages. |
European Patent Application No. 12783063.6, Extended Search Report dated Mar. 24, 2015, 6 pages. |
Non-Final Office Action for U.S. Appl. No. 12/913,636 dated Apr. 1, 2015, 22 pages. |
Final Office Action for U.S. Appl. No. 13/827,631 dated Apr. 3, 2015, 11 pages. |
Notice of Allowance for U.S. Appl. No. 13/839,288 dated Apr. 3, 2015, 12 pages. |
Notice of Allowance for U.S. Appl. No. 14/077,230 dated Apr. 16, 2015, 16 pages. |
Final Office Action for U.S. Appl. No. 13/764,560 dated Apr. 15, 2015, 19 pages. |
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. |
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. |
Non-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. |
Japan Patent Office office actions JPO patent application JP2013-529376 (dated Aug. 18, 2015). |
Final Office Action for U.S. Appl. No. 13/177,748 dated Aug. 21, 2015, 24 pages. |
Non-Final Office Action for U.S. Appl. No. 14/036,500 dated Aug. 14, 2015, 26 pages. |
Notice of Allowance for U.S. Appl. No. 13/830,129 dated Sep. 22, 2015, 9 pages. |
Final Office Action for U.S. Appl. No. 13/770,961 dated Aug. 31, 2015, 28 pages. |
Non-Final Office Action for U.S. Appl. No. 13/764,560 dated Oct. 6, 2015, 18 pages. |
Non-Final Office Action for U.S. Appl. No. 14/621,098 dated Oct. 15, 2015, 21 pages. |
Notice of Allowance for U.S. Appl. No. 14/692,674 dated Oct. 15, 2015, 10 pages. |
Notice of Allowance for U.S. Appl. No. 14/037,171 dated Oct. 15, 2015, 14 pages. |
“Oracle Complex Event Processing Exalogic Performance Study” an Oracle White Paper, Sep. 2011, 16 pages. |
“Data stream management system”, Wikipedia, downloaded from en.wikipedia.org/wiki/Data_stream_management_system on Sep. 23, 2015, pp. 1-5. |
Josifovsky, Vanja, et al., “Querying XML Streams”, The VLDB Journal, vol. 14, © 2005, pp. 197-210. |
Purvee, Edwin Ralph, “Optimizing SPARQLeR Using Short Circuit Evaluation of Filter Clauses”, Master of Science Thesis, Univ. of Georgia, Athens, GA, © 2009, 66 pages. |
Weidong, Yang, et al., “LeoXSS: An Efficient XML Stream System for Processing Complex XPaths”, CIT 2006, Seoul, Korea, © 2006, 6 pages. |
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. |
Tho et al. “Zero-latency data warehousing for heterogeneous data sources and continuous data streams,” 5th International Conference on Information Integrationand Web-based Applications Services (Sep. 2003) 12 pages. |
“SQL Subqueries”—Dec. 3, 2011, 2 pages. |
“Caching Data with SqiDataSource Control”—Jul. 4, 2011, 3 pages. |
“SCD—Slowing Changing Dimensions in a Data Warehouse”—Aug. 7, 2011, one page. |
Notice of Allowance for U.S. Appl. No. 13/102,665 dated Nov. 24, 2014, 9 pages. |
Non-Final Office Action for U.S. Appl. No. 13/827,631 dated Nov. 13, 2014, 10 pages. |
Non-Final Office Action for U.S. Appl. No. 13/827,987 dated Nov. 6, 2014, 9 pages. |
Non-Final Office Action for U.S. Appl. No. 11/601,415 dated Oct. 6, 2014, 18 pages. |
Non-Final Office Action for U.S. Appl. No. 14/077,230 dated Dec. 4, 2014, 30 pages. |
Non-Final Office Action for U.S. Appl. No. 13/828,640 dated Dec. 2, 2014, 11 pages. |
Non-Final Office Action for U.S. Appl. No. 13/830,428 dated Dec. 5, 2014, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 13/830,502 dated Nov. 20, 2014, 25 pages. |
Non-Final Office Action for U.S. Appl. No. 13/839,288 dated Dec. 4, 2014, 30 pages. |
Non-Final Office Action for U.S. Appl. No. 14/079,538 dated Oct. 22, 2015, 34 pages. |
Non-Final Office Action for U.S. Appl. No. 13/906,162 dated Oct. 28, 2015, 11 pages. |
Notice of Allowance for U.S. Appl. No. 14/302,031 dated Nov. 3, 2015, 18 pages. |
Final Office Action for U.S. Appl. No. 12/949,081 dated Nov. 17, 2015, 19 pages. |
China Patent Office office actions for patent application CN201180053021.4 (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. |
Final Office Action for U.S. Appl. No. 13/828,640 dated Jun. 17, 2015, 11 pages. |
Non-Final Office Action for U.S. Appl. No. 11/601,415 dated Nov. 13, 2015, 18 pages. |
International Search Report and Written Opinion dated Dec. 15, 2014 for PCT/US2014/010920, 10 pages. |
Final Office Action for U.S. Appl. No. 13/830,759 dated Feb. 18, 2016, 18 pages. |
Notice of Allowance for U.S. Appl. No. 13/770,961 dated Apr. 4, 2016, 8 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. |
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. |
China Patent Office office actions for patent application CN201280022008.7 (dated Dec. 3, 2015). |
European Application No. 12783063.6, Office Action dated Nov. 11, 2015, 8 pages. |
Notice of Allowance for U.S. Appl. No. 12/548,187, dated Feb. 2, 2016, 15 pages. |
Notice of Allowance for U.S. Appl. No. 14/037,072 dated Feb. 16, 2016, 17 pages. |
Final Office Action for U.S. Appl. No. 13/830,735 dated Dec. 21, 2015, 20 pages. |
Notice of Allowance for U.S. Appl. No. 13/827,987 dated Jan. 4, 2016, 16 pages. |
Notice of Allowance for U.S. Appl. No. 13/177,748 dated Jan. 6, 2016, 9 pages. |
Notice of Allowance for U.S. Appl. No. 13/828,640 dated Jan. 6, 2016, 16 pages. |
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—llg 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). |
Japan Patent Office office actions JPO patent application JP2014-509315 (dated Mar. 15, 2016). |
Yosuke 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. |
Shuhei 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. |
Hiroyuki Kitagawa et al., Sensing Network, Information Processing, Information Processing Society of Japan, Sep. 15, 2010, vol. 51, No. 9, pp. 1119-1126. |
Sadana “Interactive Scatterplot for Tablets,” The 12th International Working Conference on Advanced Visual Interfaces, available from https://vimeo.com/97798460 (May 2014). |
U.S. Appl. No. 13/830,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. 14/036,500, Non-Final Office Action dated Feb. 9, 2017, 34 pages. |
U.S. Appl. No. 14/079,538, Non-Final Office Action dated Mar. 31, 2017, 24 pages. |
U.S. Appl. No. 15/360,650, Non-Final Office Action dated Mar. 9, 2017, 34 pages. |
U.S. Appl. No. 13/830,735, Non-Final Office Action dated Apr. 4, 2017, 16 pages. |
U.S. Appl. No. 15/177,147, Non-Final Office Action dated Apr. 7, 2017, 12 pages. |
U.S. Appl. No. 14/866,512, Non-Final Office Action dated Apr. 10, 2017, 24 pages. |
U.S. Appl. No. 14/610,971, Notice of Allowance dated Apr. 12, 2017, 11 pages. |
China Patent Application No. CN201480030482.3, Office Action dated Feb. 4, 2017, 5 pages. |
U.S. Appl. No. 13/829,958 Non-Final Office Action, dated Dec. 27, 2016, 20 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. 14/559,550 Non-Final Office Action, dated Jan. 27, 2017, 16 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/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. 14/036,500, Notice of Allowance dated Jun. 30, 2017, 14 pages. |
U.S. Appl. No. 14/036,659, Non-Final Office Action dated Jun. 2, 2017, 28 pages. |
U.S. Appl. No. 14/559,550, Final Office Action dated Jul. 12, 2017, 21 pages. |
U.S. Appl. No. 14/621,098, Notice of Allowance dated May 3, 2017, 9 pages. |
U.S. Appl. No. 14/755,088, Non-Final Office Action dated Jun. 14, 2017, 13 pages. |
U.S. Appl. No. 15/003,646, Notice of Allowance dated May 19, 2017, 16 pages. |
U.S. Appl. No. 15/015,933, Notice of Allowance dated May 17, 2017, 16 pages. |
U.S. Appl. No. 15/360,650, Notice of Allowance dated Jul. 24, 2017, 13 pages. |
Akama et al., Design and Evaluation of a Data Management System for WORM Data Processing, Journal of Information Processing, Information Processing Society of Japan, vol. 49, No. 2, Feb. 15, 2008, pp. 749-764. |
Chinese Application No. 201380056012.X, Office Action dated Jun. 1, 2017, 22 pages (10 pages for the original document and 12 pages for the English translation). |
Japanese Application No. 2015-534676, Office Action dated Jun. 27, 2017, 9 pages. |
U.S. Appl. No. 13/827,631, Final Office Action dated Aug. 30, 2017, 18 pages. |
U.S. Appl. No. 13/830,428, Final Office Action dated Oct. 5, 2017, 33 pages. |
U.S. Appl. No. 13/830,735, Final Office Action dated Sep. 29, 2017, 16 pages. |
U.S. Appl. No. 13/830,759, Notice of Allowance dated Aug. 23, 2017, 14 pages. |
U.S. Appl. No. 14/037,153, Non-Final Office Action dated Aug. 2017, 45 pages. |
U.S. Appl. No. 14/755,088, Notice of Allowance dated Oct. 11, 2017, 5 pages. |
U.S. Appl. No. 14/861,687, Non-Final Office Action dated Oct. 11, 2017, 10 pages. |
U.S. Appl. No. 14/866,512, Final Office Action dated Sep. 13, 2017, 25 pages. |
U.S. Appl. No. 15/177,147, Non-Final Office Action dated Nov. 3, 2017, 6 pages. |
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). |
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. |
European Patent Application EP14825489.9, Office Action dated Jul. 28, 2017, 7 pages. |
U.S. Appl. No. 13/829,958, Notice of Allowance dated Jun. 11, 2018, 13 pages. |
U.S. Appl. No. 14/079,538, Non Final Office Action, dated Jun. 20, 2018, 22 pages. |
U.S. Appl. No. 13/839,288, filed Mar. 15, 2013, Unpublished, Deshmukh et al. |
“Strings in C,” Swarthmore College, retrieved from internet: http://web.cs.swarthmore.edu/˜newhall/unixhelp/C_strings.html (Jun. 12, 2007) 3 pages. |
“Call User Defined Functions from Pig,” Amazon Elastic MapReduce Developer Guide (Mar. 2009) 2 pages. |
U.S. Appl. No. 11/874,197, Notice of Allowance dated Jun. 22, 2012, 20 pages. |
U.S. Appl. No. 12/396,464, Final Office Action dated May 16, 2014, 16 pages. |
U.S. Appl. No. 12/548,187, Final Office Action dated Jun. 4, 2014, 64 pages. |
U.S. Appl. No. 13/089,556, Final Office Action dated Jun. 13, 2014, 14 pages. |
U.S. Appl. No. 13/107,742, Non-Final Office Action dated Jun. 19, 2014, 20 pages. |
U.S. Appl. No. 13/244,272, Notice of Allowance dated Aug. 12, 2013, 12 pages. |
International Application No. PCT/US2011/052019, International Preliminary Report on Patentability dated Mar. 28, 2013, 6 pages. |
International Application No. PCT/US2012/034970, International Preliminary Report on Patentability dated Nov. 21, 2013, 7 pages. |
International Application No. PCT/US2012/036353, International Preliminary Report on Patentability dated Nov. 28, 2013, 6 pages. |
European Application No. 11761766.2, Office Action dated Sep. 5, 2018, 7 pages. |
European Application No. 13776643.2, Office Action dated Sep. 6, 2018, 7 pages. |
U.S. Appl. No. 13/829,958, Non-Final Office Action dated Jan. 8, 2018, 22 pages. |
U.S. Appl. No. 13/830,502, Final Office Action dated Nov. 8, 2017, 27 pages. |
U.S. Appl. No. 13/830,735, Notice of Allowance dated Jan. 26, 2018, 9 pages. |
U.S. Appl. No. 14/036,659, Notice of Allowance dated Nov. 30, 2017, 13 pages. |
U.S. Appl. No. 14/079,538, Final Office Action dated Nov. 16, 2017, 26 pages. |
U.S. Appl. No. 14/559,550, Notice of Allowance dated Dec. 5, 2017, 6 pages. |
U.S. Appl. No. 14/973,377, Non-Final Office Action dated Nov. 30, 2017, 17 pages. |
U.S. Appl. No. 14/866,512, Notice of Allowance dated Feb. 15, 2018, 5 pages. |
Chinese Application No. 201480004736.4, Office Action dated Nov. 29, 2017, 13 pages (7 pages of English translation and 6 pages of Original document). |
Japanese Application No. 2015-534676, Office Action dated Jan. 23, 2018, 9 pages. |
Japanese Application No. 2015-552781, Office Action dated Nov. 21, 2017, 3 pages. |
Japanese Application No. 2015-558217, Office Action dated Jan. 9, 2018, 3 pages. |
Japanese Application No. 2015-552765, Office Action dated Dec. 5, 2017, 2 pages. |
Japanese Application No. JP2015-552781, Office Action dated Aug. 7, 2018, 4 pages. |
U.S. Appl. No. 13/827,631, Notice of Allowance dated Mar. 13, 2018, 10 pages. |
U.S. Appl. No. 13/830,378, Final Office Action dated May 1, 2018, 30 pages. |
U.S. Appl. No. 13/830,428, Notice of Allowance dated Apr. 2, 2018, 9 pages. |
U.S. Appl. No. 13/830,502, Notice of Allowance dated Apr. 2, 2018, 8 pages. |
U.S. Appl. No. 14/037,153, Final Office Action dated May 3, 2018, 16 pages. |
U.S. Appl. No. 14/973,377, Notice of Allowance dated May 2, 2018, 8 pages. |
U.S. Appl. No. 15/177,147, Notice of Allowance dated Mar. 22, 2018, 7 pages. |
U.S. Appl. No. 15/795,121, Non-Final Office Action dated Apr. 6, 2018, 21 pages. |
U.S. Appl. No. 14/861,687, Notice of Allowance dated Jun. 6, 2018, 10 pages. |
Chinese Application No. 201380063379.4, Office Action dated Feb. 2, 2018, 13 pages (6 pages of the original document and 7 pages for the English translation). |
Chinese Application No. 201480004731.1, Office Action dated Apr. 4, 2018, 13 pages (6 pages of the original document and 7 pages for the English translation). |
Chinese Application No. 201480009223.2, Office Action dated Apr. 18, 2018, 18 pages (10 pages of the original document and 8 pages for the English translation). |
European Application No. 13776641.6, Office Action dated Apr. 3, 2018, 5 pages. |
European Application No. EP13776643.2, Office Action dated May 3, 2018, 4 pages. |
European Application No. EP13776642.4, Office Action dated May 3, 2018, 5 pages. |
Japanese Application No. JP2015-558217, Office Action dated May 29, 2018, 4 pages. |
Japanese Application No. 2015-534678, Office Action dated Apr. 24, 2018, 4 pages (3 pages of the original document and 1 page for the English translation). |
Japanese Application No. JP2016-516778, Office Action dated May 22, 2018, 8 pages. |
International Application No. PCT/RU2015/000468, International Preliminary Report on Patentability dated Feb. 8, 2018, 10 pages. |
International Application No. PCT/US2014/010832, International Preliminary Report on Patentability dated Apr. 24, 2015, 27 pages. |
U.S. Appl. No. 13/830,378, Non-Final Office Action dated Sep. 7, 2018, 27 pages. |
Chinese Application No. 201380056017.2, Office Action dated Nov. 23, 2018, 3 pages. |
Japanese Application No. 2015-552765, Office Action dated Nov. 6, 2018, 6 pages (3 pages for the original document and 3 pages for the English translation). |
Japanese Application No. 2016-516778, Office Action dated Oct. 23, 2018, 9 pages (5 pages for the original document and 4 pages for the English translation). |
Chinese Application No. CN201380056017.2, Office Action dated Nov. 23, 2013, 3 pages. |
Chinese Application No. CN201380056099.0, Office Action dated Dec. 5, 2018, 14 pages. |
Chinese Application No. CN201480004731.1, Office Action dated Dec. 28, 2018, 3 pages. |
Chinese Application No. CN201480009223.2, Office Action dated Nov. 23, 2018, 8 pages. |
Japanese Application No. JP2015-552765, Office Action dated Nov. 6, 2018, 6 pages. |
Japanese Application No. JP2016-521684, Office Action dated Jan. 22, 2019, 4 pages. |
U.S. Appl. No. 15/967,272, Non-Final Office Action dated Dec. 27, 2018, 18 pages. |
Number | Date | Country | |
---|---|---|---|
20140201355 A1 | Jul 2014 | US |
Number | Date | Country | |
---|---|---|---|
61752850 | Jan 2013 | US |