The present application incorporates by reference for all purposes the entire contents of the following related application: U.S. patent application Ser. No. 12/534,384, entitled “LOGGING FRAMEWORK FOR A DATA STREAM PROCESSING SERVER,” filed Aug. 3, 2009.
The present disclosure relates in general to data logging, and in particular to the logging of data pertaining to the operation of a data stream processing server.
Traditional database management systems (DBMSs) execute queries in a “request-response” fashion over finite, stored data sets. For example, a traditional DBMS can receive a request to execute a query from a client, execute the query against a stored database, and return a result set to the client.
In recent years, data stream management systems (DSMSs) have been developed that can execute queries in a continuous manner over potentially unbounded, real-time data streams. For example, a typical DSMS can receive one or more data streams, register a query against the data streams, and continuously execute the query as new data appears in the streams. Since this type of query (referred to herein as a “continuous query”) is long-running, the DSMS can provide a continuous stream of updated results to a client. DSMSs are particularly suited for applications that require real-time or near real-time processing of streaming data, such as financial ticker analysis, physical probe/sensor monitoring, network traffic management, and the like.
Many DSMSs include a server application (referred to herein as a “data stream processing server”) that is configured to perform the core tasks of receiving data streams and performing various operations (e.g., executing continuous queries) on the streams. It would be desirable to have a framework for logging data pertaining to the operation of such a data stream processing server to facilitate performance tuning, debugging, and other functions.
Embodiments of the present invention provide techniques for logging data pertaining to the operation of a data stream processing server. In one set of embodiments, logging configuration information can be received specifying a functional area of a data stream processing server to be logged. Based on the logging configuration information, logging can be dynamically enabled for objects associated with the functional area that are instantiated by the data stream processing server, and logging can be dynamically disabled for objects associated with the functional area that are discarded (or no longer used) by the data stream processing server. By dynamically enabling and disabling logging for specific objects in this manner, data regarding the operation of the data stream processing server can be logged without significantly affecting the server's runtime performance. In another set of embodiments, a tool can be provided for visualizing the data logged by the data stream processing server.
According to one embodiment of the present invention, a method for facilitating logging in a data stream processing server is provided. The method comprises receiving, at a computer system, logging configuration information specifying a functional area of a data stream processing server to be logged, and identifying, by the computer system, an object associated with the functional area that has been instantiated by the data stream processing server. The method further comprises enabling, by the computer system, logging for the object, and determining, by the computer system, if the object is no longer used by the data stream processing server. If the object is no longer used, logging is disabled by the computer system for the object.
In one embodiment, enabling logging for the object comprises storing the logging configuration information for the object and generating one or more log records for the object based on the logging configuration information stored for the object.
In one embodiment, disabling logging for the object comprises deleting the logging configuration information stored for the object.
In one embodiment, the logging configuration information includes a first parameter identifying an event upon which to generate a log record and a second parameter identifying a level of detail for the log record. In this embodiment, generating one or more log records for the object comprises, upon occurrence of a predefined event related to the object, retrieving the logging configuration information stored for the object and determining if the predefined event corresponds to the event identified by first parameter. If the predefined event corresponds to the event identified by the first parameter, a log record is generated for the object, where the generated log record has the level of detail identified by the second parameter.
In one embodiment, the functional area to be logged corresponds to a type of query plan object. In this embodiment, identifying an object associated with the functional area comprises traversing a query plan generated for a continuous query, where the query plan includes a plurality of query plan objects, and identifying a query plan object in the plurality of query plan objects having the type. Further, determining if the object is no longer used comprises determining if the continuous query is dropped.
In one embodiment, the plurality of query plan objects include an operator object and one or more data structure objects associated with the operator object. In a further embodiment, if logging is enabled for the operator object, logging is automatically enabled for the one or more data structure objects associated with the operator object.
In one embodiment, the method above further comprises identifying another object associated with the functional area, where the another object was instantiated by the data stream processing server subsequently to receiving the logging configuration information, and enabling logging for the another object.
In one embodiment, the logging configuration information is received from a user and is expressed as a Continuous Query Language (CQL) statement. In another embodiment, the logging configuration information is received via an invocation of a Java Management Extensions (JMX) Applications Programming Interface (API).
According to another embodiment of the present invention, a machine-readable storage medium having stored thereon program code executable by a computer system is provided. The program code includes code that causes the computer system to receive logging configuration information specifying a functional area of a data stream processing server to be logged, and code that causes the computer system to identify an object associated with the functional area that has been instantiated by the data stream processing server. The program code further comprises code that causes the computer system to enable logging for the object, code that causes the computer system to determine if the object is no longer used by the data stream processing server, and code that causes the computer system to, if the object is no longer used, disable logging for the object.
According to another embodiment of the present invention, a logging system is provided. The logging system comprises a processing component configured to receive logging configuration information specifying a functional area of a data stream processing server to be logged and to identify an object associated with the functional area that has been instantiated by the data stream processing server. The processing component is further configured to enable logging for the object and to determine if the object is no longer used by the data stream processing server. If the object is no longer used, the processing component is configured to disable logging for the object.
According to another embodiment of the present invention, a method for visualizing log records is provided. The method comprises receiving, at a computer system, a file comprising log records generated by a data stream processing server, where the log records include information pertaining to a query plan and a sequence of one or more events executed by the data stream processing server in accordance with the query plan. The method further comprises generating, by the computer system, a graphical representation of the query plan based on the log records, and displaying, by the computer system, the graphical representation.
In one embodiment, the graphical representation of the query plan comprises one or more nodes, where each node represents an query plan object in the query plan. Examples of query plan objects include operators, queues, stores, indexes, synopses, etc.
In one embodiment, the method above further comprises, in response to a user input, displaying data information for a node.
In one embodiment, the method above further comprises, in response to a first user input, visually portraying execution of the one or more events in sequence by animating the graphical representation, where visually portraying execution of the one or more events in sequence comprises visually portraying execution of the one or more events in real-time based on timestamps associated with the one or more events. In a further embodiment, the method above further comprises, in response to a second user input, pausing the animation.
In one embodiment, the method above further comprises, if the log records indicate that an error occurred during execution of an event in the one or more events, displaying a representation of the error in the graphical representation.
In one embodiment, the method above further comprises providing the one or more events as one or more data streams to another data stream processing server and receiving a continuous query to be executed against the one or more data streams. The continuous query can then be executed by the another data stream processing server while the graphical representation is being animated.
In one embodiment, the method above further comprises, if a result for the continuous query is received from the another data stream processing server, pausing the animation. In another embodiment, the method above further comprises, if a result for the continuous query is received from the another data stream processing server, displaying an alert.
According to another embodiment of the present invention, a machine-readable storage medium having stored thereon program code executable by a computer system is provided. The program code includes code that causes the computer system to receive a file comprising log records generated by a data stream processing server, where the log records include information pertaining to a query plan and a sequence of events executed by the data stream processing server in accordance with the query plan. The program code further comprises code that causes the computer system to generate a graphical representation of the query plan based on the log records and code that causes the computer system to display the graphical representation.
According to another embodiment of the present invention, a log visualization system is provided. The log visualization system comprises a storage component configured to store a file comprising log records generated by a data stream processing server, where the log records include information pertaining to a query plan and a sequence of events executed by the data stream processing server in accordance with the query plan. The log visualization system further comprises a processing component in communication with the storage component, where the processing component is configured to generate a graphical representation of the query plan based on the log records and display the graphical representation.
A further understanding of the nature and advantages of the embodiments disclosed herein can be realized by reference to the remaining portions of the specification and the attached drawings.
In the following description, for the purposes of explanation, numerous details are set forth in order to provide an understanding of various embodiments of the present invention. It will be apparent, however, to one skilled in the art that certain embodiments can be practiced without some of these details.
Embodiments of the present invention provide techniques for logging data pertaining to the operation of a data stream processing server. In one set of embodiments, logging configuration information can be received specifying a functional area of a data stream processing server to be logged. Based on the logging configuration information, logging can be dynamically enabled for objects associated with the functional area that are instantiated by the data stream processing server, and logging can be dynamically disabled for objects associated with the functional area that are discarded (or no longer used) by the data stream processing server. By dynamically enabling and disabling logging for specific objects in this manner, data regarding the operation of the data stream processing server can be logged without significantly affecting the server's runtime performance.
In certain embodiments, the functional area specified in the logging configuration information can correspond to a type of query plan object, where a query plan object is a component of a query plan, and where a query plan is a data structure used by the data stream processing server to execute a continuous query. Examples of query plan object types include “operator,” “queue,” “store,” “synopsis,” “index,” and the like. In these embodiments, logging can be dynamically enabled or disabled for query plan objects having the specified type based on query plan changes in the data stream processing server. For instance, in one set of embodiments, logging can be dynamically enabled for query plan objects having the specified type that are instantiated upon generation of a new query plan. In another set of embodiments, logging can be dynamically disabled for query plan objects having the specified type that are discarded upon the deletion of an existing query plan.
In one set of embodiments, a tool can be provided for visualizing log records that are generated for query plan objects according to the techniques noted above. For example, the tool can receive log records containing data regarding one or more events executed by the query plan objects in accordance with a query plan. The tool can then generate a visual representation of the query plan and animate, in real-time, the visual representation to illustrate the execution of the events. Such a tool can be useful for administrators, developers, and other users in understanding and analyzing the log records.
In one set of embodiments, server 102 can log data pertaining to its runtime operation. For example, in particular embodiments, server 102 can log data pertaining to query plan objects that are used by the server to execute continuous queries. This logged information can then be used by, e.g., an administrator or other user of server 102 to debug errors or analyze performance problems that may haven arisen during query execution. This logging capability is described in greater detail below.
In various embodiments, query manager 112 can receive continuous queries from, e g., a client application or a user and generate query plans for executing the queries. As described above, a continuous query is a query that can be run in a continuous or persistent fashion against one or more data streams. A query plan is a data structure comprising one or more objects (referred to herein as “query plan objects”) that can be used by server 102 to execute a continuous query. In some embodiments, query manager 112 can generate a separate query plan for each received query. In other embodiments, query manager 112 can maintain a single, global query plan for multiple queries.
By way of example,
In one set of embodiments, each query plan object can have a particular type that indicates its functional role within the plan. For example, query plan objects 202-212 are “operator” objects that are configured to carry out specific operations, or steps, in the overall execution of the continuous query. Query plan 200 can also include various other types of query plan objects such as “store” objects 214-218, “queue” objects 220-228, and “synopsis” objects 230-238. Generally speaking, store, queue, and synopsis objects are data structure objects that can be associated with one or more operator objects and can be used to maintain an operator object's state and/or manage data flow into (or out of) an operator object. For instance, in the embodiment of
Once a query plan (such as plan 200) has been generated for a continuous query, query manager 112 (or another component of server 102) can execute the continuous query using the query plan. For example, with respect to query plan 200, query manager 112 can invoke the various query plan objects 202-238 according to the hierarchical ordering of plan 200 and thereby execute the associated query.
Returning to
For example, at runtime of server 102, the various software objects used by the server (e.g., log targets 118) can invoke log manager 114 upon the occurrence of certain predefined events. In response, log manager 114 can determine, based on the logging configuration information stored in log configuration database 120, whether logging has been enabled for those log targets. If log manager 114 determines that logging has been enabled for a particular log target 118, log manager 114 can instruct the log target to generate a log record and store the record in log record database 122.
In some embodiments, the functional area specified in the logging configuration information received by log manager 114 can correspond to a type of query plan object, such as “operator,” “queue” “store,” “synopsis,” and so on. In these embodiments, log manager 114 can interoperate with plan monitor 116 to identify query plan objects that have been instantiated by query manager 112 (via, e.g., the generation of query plans). Specifically, log manager can send the logging configuration information to plan monitor 116, which is configured to traverse the query plans generated by query manager 112 and identify query plan objects having the specified type. Plan monitor can then return IDs for the identified query plan objects to log manager 114, which can store the IDs with the logging configuration information in log configuration database 120. In this manner, logging can be enabled for these specific query plan objects.
At runtime of server 102, the query plan objects used by the server (e.g., for executing continuous queries) can invoke log manager 114 upon the occurrence of certain predefined events. In response, log manager 114 can determine, based on the logging configuration information stored in log configuration database 102, whether logging has been enabled for those query plan objects. If logging has been enabled for a particular query plan object, logging manager 114 can instruct the query plan object to generate a log record and store the record in log record database 122.
In one set of embodiments, plan monitor 116 can, upon receipt of the logging configuration information from log manager 114, keep track of “change management information” in change management database 124. As used herein, “change management information” refers to changes that should be made to the information stored in log configuration database 120 in the event that new query plan objects are instantiated (e.g., via the generation of new query plans) or existing query plan objects are discarded or rendered obsolete (e.g., via the deletion of existing query plans) by query manager 112.
For example, assume the logging configuration information specifies that logging should be enabled for all operator-type query plan objects, and assume that there are currently two operator objects (having IDs O1 and O2) instantiated in the server. In this case, the change management information can specify that the logging configuration information should be added to log configuration database 120 for any new operator objects subsequently instantiated by query manager 112. Further, the change management information can specify that the logging configuration information stored in log configuration database 120 for operator objects O1 and O2 should be deleted if either of these objects are discarded or rendered obsolete by query manager 112.
Once the change management information described above has been stored in change management database 124, plan monitor 116 can be automatically updated of any query plan changes by query manager 112. For example, query manager 112 can notify plan monitor 116 when a new query plan is generated, or when an existing query plan is discarded. Plan monitor 116 can then determine, based on the change management information stored in change management database 124, if any changes need to be applied to log configuration database 120. If changes need to be made (e.g., logging configuration information needs to be added or deleted for a specific query plan object), plan monitor 116 can instruct log manager 114 to apply those changes. In this manner, logging can be dynamically enabled and disabled for query plan objects in response to query plan changes.
It should be appreciated that
At blocks 302 and 304, query manager 112 can receive a continuous query and generate a query plan for the query. As described above, a query plan is a data structure comprising one or more objects (query plan objects) that can be used (by, e.g., server 102) to execute a continuous query. In certain embodiments, the processing of steps 302 and 304 can be repeated continuously as new queries are received.
Concurrently with blocks 302 and 304, log manager 114 can receive logging configuration information specifying a type of query plan object to be logged (block 306). In one set of embodiments, the logging configuration information can be received from a user of server 102 via, e.g., a user interface. In these embodiments, the logging configuration information can be expressed as a Continuous Query Language (CQL) statement. In other embodiments, the logging configuration information can be received from a client application or some other automated process via, e.g., an invocation of an Application Programming Interface (API) such as a Java Management Extensions (JMX) API.
In one set of embodiments, the logging configuration information received at block 306 can include at least three parameters: <AREA>, <EVENT>, and <LEVEL>, The <AREA> parameter can specify an identifier (ID) of a particular functional area of server 102 to be logged. For example, in the context of query plan objects, the <AREA> parameter can specify an ID of particular query plan object type to be logged, such as “operator,” “store,” “queue, “synopsis,” and the like. In some embodiments, the <AREA> parameter can also specify an ID of a “subtype,” where the subtype represents another level of granularity within the specified area. For example, if the specified area is “operator,” the <AREA> parameter can also include a subtype of “binjoin,” “timewindow,” or other subtypes of operator objects.
The <EVENT> parameter can specify an ID of an event, or operation, upon which logging should occur. In other words, the <EVENT> parameter can indicate when a log record should be generated for the specified area. In one set of embodiments, the permissible ID values for the <EVENT> parameter can vary based on the area specified via the <AREA> parameter. For example, if the specified area is “operator” (denoting the “operator” query plan object type), the permissible ID values for <EVENT> may be limited to those events that are typically carried out by operator objects, such as “begin execution” and “end execution.” As another example, if the specified area is “queue” (denoting the “queue” query plan object type), the permissible ID values for <EVENT> may be limited to those events that are typically carried out by queue objects, such as “enqueue” and “dequeue.”
The <LEVEL> parameter can specify an ID indicating the desired level of detail, or verbosity, of the generated log record. Like the <EVENT> parameter, the permissible ID values for the <LEVEL> parameter can vary based on the area specified via the <AREA> parameter. Further, the meaning of a particular level ID may be different based on the specified area. For example, a level ID of “1” may denote a certain level of detail for the “queue” object type and a different level of detail for the “operator” object type.
In some embodiments, if the area specified via the <AREA> corresponds to the operator object type, certain ID values for the <LEVEL> parameter can cause the generated log record to include information about data structure objects (e.g., stores, queues, synopses, etc.) associated with the operator object. In this manner, logging can be enabled for a plurality of related query plan objects via a single configuration command.
The following is a table of ID values for the <AREA>, <EVENT>, and <LEVEL> parameters that can be recognized by log manager 114 according to an embodiment of the present invention:
Once the logging configuration information is received per block 306, log manager 114 can determine, based on the <AREA> parameter in the received information, the functional area to be logged. For the purposes of process 300, it is assumed that the functional area corresponds to a type of query plan object, such as operator, queue, or the like. Log manager 114 can then send the logging configuration information to plan monitor 116 (block 308).
At block 310, plan monitor 116 can receive the logging configuration information and determine the query plan object type specified therein. Plan monitor can then traverse the query plans generated by query manager 112 and identify query plan objects in the query plans that have the specified type (blocks 314, 316). For example, if the logging configuration information specifies the “operator” object type, plan monitor 116 can identify all of the operator objects that have been instantiated by query manager 112 and are included one or more query plans.
Once plan monitor 116 has identified query plan objects per block 314, plan monitor 116 can return a list of IDs for the identified query plan objects to log manager 114 (blocks 316, 318). Log manager 114 can then store the object IDs along with the logging configuration information received at block 306 in a data store, such as log configuration database 120 of
In one set of embodiments, plan monitor can also store change management information in change management database 124 at block 322. As described above, this change management information can represent changes that should be made to the logging configuration information stored in log configuration database 120 (per block 320) in the event that new query plan objects are instantiated (e.g., via the generation of new query plans) or existing query plan objects are discarded or rendered obsolete (e.g., via the deletion of existing query plans) by query manager 112. Accordingly, this change management information can be used to dynamically enable or disable logging for query plan objects as query plan changes occur.
For instance, in one set of embodiments, plan monitor 116 can be automatically notified by query manager 112 when, e.g., a new query plan is generated, or when an existing query plan is discarded. Plan monitor 116 can then determine, based on the information stored in change management database 124, if any changes need to be made to the logging configuration information stored in log configuration database 120 to enable or disable logging for a particular query plan object. If a change need to be made (e.g., logging configuration information needs to be added or deleted for a specific object), plan monitor 116 can instruct log manager 114 to apply the change. This process is described in greater detail with respect to
It will be appreciated that process 300 is illustrative and that variations and modifications are possible. Steps described as sequential may be executed in parallel, order of steps may be varied, and steps may be modified, combined, added, or omitted. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.
In some embodiments, the logging configuration information stored at block 320 of process 300 can be stored in a particular type of data structure, such as a multi-dimensional array. An example of such a multi-dimensional array 400 is illustrated in
Each value in array 402 can be a pointer to a second array 404 that is indexed by object ID. Each object ID index can correspond to a particular object instance (associated with the selected area) that can be logged by server 102.
Each value in array 404 can be a pointer to a third array 406 that is indexed by event ID. Each event ID index can correspond to a particular event that can be logged for the selected area and object.
Finally, each value in array 406 can be a pointer to a fourth array 408 that is indexed by level ID. Each level ID index can correspond to a particular level of detail for generating a log record for the selected area, object, and event. In one set of embodiments, the values in array 408 can be a binary values indicating whether logging is enabled or disabled for that particular combination of [area, object, event, level]. In alternative embodiments, the values in array 408 can be booleans, strings, or any other type of value that can indicate whether logging is enabled or disabled.
At block 502, log target 118 can invoke log manager 114 upon occurrence of a predetermined event and provide log manager 114 with information pertaining to the event and itself. In various embodiments, log target 118 can be preconfigured with code for invoking log manager 114 in this manner.
In some embodiments, the “predetermined event” that triggers invocation of log manager 114 can be different based on the object type of log target 118. For example, if log target 118 is an operator object, log target 118 can be preconfigured to invoke log manager 114 upon, e.g., the occurrence of “begin execution” and “end execution” events. As another example, if log target 118 is a queue object, log target 118 can be preconfigured to invoke log manager 114 upon, e.g., the occurrence of “enqueue” and “dequeue” events.
At block 504, log manager 114 can determine, from the information received from log target 118, the area ID and object ID for log target 118, as well as the event ID for the event that occurred at block 502. The area ID, object ID, and event ID can then be compared with the logging configuration information stored in log configuration database 120 to determine whether logging has been enabled for that particular combination of [area ID, object ID, event ID] (block 506). For example, if the logging configuration information is stored in the form of multi-dimensional array 400 of
If logging is not enabled for any levels corresponding to the [area ID, object ID, event ID] determined at block 504, process 500 can end (blocks 506, 508). On the other hand, if logging is enabled for one or more levels, log manager 114 can send the IDs for those levels to log target 118 (block 510). In response, log target 118 can generate a log record based on the specified levels and store the log record in log record database 122 (block 512).
It will be appreciated that process 500 is illustrative and not intended to limit embodiments of the present invention. Steps described as sequential may be executed in parallel, order of steps may be varied, and steps may be modified, combined, added, or omitted. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.
Although not shown in
It will be appreciated that log record 600 is illustrative and not intended to limit embodiments of the present invention. For example, although log record 600 is shown as being expressed according to a particular structure and using particular naming conventions, log record 600 can also be expressed in many different ways. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.
As described above, in certain embodiments logging can be dynamically enabled or disabled for query plan objects based on query plan changes in server 102.
At block 702, query manager 112 can detect a change that affects one or more query plans used by server 102. For example, query manager 112 can detect when a new query plan has been generated in response to a request to add a new continuous query. Alternatively, query manager 112 can detect when an existing query plan is discarded or obsoleted in response to a request to drop an existing continuous query. Upon detecting a query plan change, query manager 112 can send information regarding the change to plan monitor 116. For example, this query plan change information can include IDs of new query plan objects that have been instantiated (if, e.g., a query has been added), or IDs of query plan objects that have been discarded (if, e.g., an existing query has been dropped).
At block 704, plan monitor 116 can receive the query plan change information from query manager 112. Plan monitor 116 can then determine, based on the change management information stored in change management database 124, if any changes need to be made to the logging configuration information stored in log configuration database 120 (block 706).
For example, assume the change management information specifies that the logging configuration information stored in log configuration database 120 for two objects, O1 and O2, should be deleted if either of these objects are discarded or rendered obsolete by query manager 112. Further, assume that the query plan change information received at block 704 indicates that objects O1 and O2 have, in fact, been discarded. In this case, plan monitor can create a change list specifying deletion of the logging configuration information for these specific objects. In other situations, plan monitor can determine that logging configuration information should be added for certain objects to log configuration database 120, and can create a change list specifying the addition of such information accordingly.
If a change need to be made (e.g., logging configuration information needs to be added or deleted for a specific query plan object), plan monitor 116 can send a change list to log manager 114 (blocks 708, 710). Log manager 114 can then apply the changes to log configuration database 120 (block 712). Alternatively, plan monitor 116 can directly apply the changes to log configuration database 120. By modifying the stored logging configuration information in this manner, logging can be dynamically enabled or disabled for query plan objects as query plan changes occur.
It will be appreciated that process 700 is illustrative and not intended to limit embodiments of the present invention. Steps described as sequential may be executed in parallel, order of steps may be varied, and steps may be modified, combined, added, or omitted. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.
In some situations, the logging techniques described above can create a voluminous amount of log data pertaining to the operation of server 102 that can be difficult to interpret and/or analyze. Accordingly, embodiments of the present invention can provide techniques for visualizing log records created by server 102. In certain embodiments, these visualization techniques allow an end user to graphical view a query plan that has been executed by server 102 and see the progression of operations/events that are performed by query plan objects within the query plan.
At block 802, a file can be received comprising log records generated by a data stream processing server, where the log records contain information pertaining to a query plan and a sequence of events executed by the server in accordance with the query plan. For example, the file can contain log records generated according to process 500 of
At block 804, a graphical representation of the query plan can be generated based on the log records and can be displayed to an end user. In one set of embodiments, the graphical representation can resemble a tree comprising a plurality of nodes, where each node corresponds to an object (e.g., operator, queue, store, etc.) in the query plan (such as the representation of plan 200 depicted in
At block 806, the graphical representation of the query plan can be animated, thereby depicting the occurrence of logged events over the course of the query's execution. For example, if the log records received at block 802 include an enqueue event and a subsequent dequeue event for a particular queue object, the occurrence of these events can be depicted and animated accordingly. In some embodiments, this animation can occur in real-time based on timestamps associated with the events in the log records. Thus, a user can understand and analyze, in a visual manner, the flow of events and data during query execution.
In certain embodiments, the animation described at block 806 can be initiated, stopped, paused, rewound, and/or fast-forwarded according to inputs received from a user. Further, if the animation is paused, the user can inspect data related each query plan object in the query plan. For example, in one embodiment the user can select a particular query plan object and view information about its state, its associated data structures, etc. at that point in the query execution.
In further embodiments, various alerts and or messages can be displayed to the user during the animation. For example, if the log records contain information about an error (such as the stack trace depicted in log record 600 of
It will be appreciated that process 800 is illustrative and not intended to limit embodiments of the present invention. Steps described as sequential may be executed in parallel, order of steps may be varied, and steps may be modified, combined, added, or omitted. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.
In certain embodiments, the visualization application shown in
At block 1002, one or more events in the log file received at block 802 of process 800 can be provided to a data stream processing server. In one set of embodiments, the data stream processing server can be embedded into the visualization application performing the steps of process 1000. Alternatively, the data stream processing server can be running in a different address space or on a different machine.
At blocks 1004 and 1006, a continuous query can be to be executed against the data streams can be received, and the query can be provided to the data stream processing server for processing. Merely by way of example, once such query may relate to checking the growth of particular queue object. Another type of query may relate to correlating the size of an index to a size of a queue. Yet another type of query may relate to correlating the contents of an index to the contents of a queue. In one set of embodiments, the server can execute this query while the graphical representation of the query plan described in the log records is being animated (per block 806 of process 800).
At block 1008, a result set for the continuous query can be received from the data stream processing server. The result set can then be used to perform a specific action. For example, if the result set contains data satisfying a particular condition, the animation of the query plan can be halted, or an alert can be displayed. In this manner, the continuous query can act as a complex breakpoint condition (e.g., break playback if this condition satisfied). A user can then inspect the contents of various query plan objects to try and determine the cause of any problems that may have occurred during query execution.
It will be appreciated that process 1000 is illustrative and not intended to limit embodiments of the present invention. Steps described as sequential may be executed in parallel, order of steps may be varied, and steps may be modified, combined, added, or omitted. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.
Client computing devices 1102, 1104, 1106, 1108 may be general purpose personal computers (including, for 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, and/or other communication protocol enabled), and/or workstation computers running any of a variety of commercially-available UNIX or UNIX-like operating systems (including without limitation the variety of GNU/Linux operating systems). Alternatively, client computing devices 1102, 1104, 1106, 1108 may be any other electronic device capable of communicating over a network (e.g., network 1112 described below) with server computer 1110.
Server computer 1110 may be a general purpose computer, specialized server computer (including, e.g., a LINUX server, UNIX server, mid-range server, mainframe computer, rack-mounted server, etc.), server farm, server cluster, or any other appropriate arrangement and/or combination. Server computer 1110 may run an operating system including any of those discussed above, as well as any commercially available server operating system. Server computer 1110 may also run any of a variety of server applications and/or mid-tier applications, including web servers, Java virtual machines, application servers, database servers, and the like. As indicated above, in one set of embodiments, server computer 1110 is adapted to run one or more server and/or middle-tier components such as data stream processing server 102 of DSMS 100.
As shown, client computing devices 1102, 1104, 1106, 1108 and server computer 1110 are communicatively coupled via network 1112. Network 1112 may be any type of network 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 1112 may be a local area network (LAN), such as an Ethernet network, a Token-Ring network and/or the like; a wide-area network; a virtual network, including without limitation a virtual private network (VPN); the Internet; an intranet; an extranet; a public switched telephone network (PSTN); an infra-red network; a wireless network (e.g., a network operating under any of the IEEE 802.11 suite of protocols, the Bluetooth protocol known in the art, and/or any other wireless protocol); and/or any combination of these and/or other networks.
System environment 1100 may also include one or more databases 1114. In one set of embodiments, database 1114 can include any other database or data storage component discussed in the foregoing disclosure, such as log configuration database 102, log record database 122, and change management database 124 of
Computer system 1200 may additionally include a computer-readable storage media reader 1212, a communications subsystem 1214 (e.g., a modem, a network card (wireless or wired), an infra-red communication device, etc.), and working memory 1218, which may include RAM and ROM devices as described above. In some embodiments, computer system 1200 may also include a processing acceleration unit 1216, which can include a digital signal processor (DSP), a special-purpose processor, and/or the like.
Computer-readable storage media reader 1212 can further be connected to a computer-readable storage medium 1210, together (and, optionally, in combination with storage device(s) 1208) comprehensively representing remote, local, fixed, and/or removable storage devices plus storage media for temporarily and/or more permanently containing computer-readable information. Communications system 1214 may permit data to be exchanged with network 1112 of
Computer system 1200 may also comprise software elements, shown as being currently located within working memory 1218, including an operating system 1220 and/or other code 1222, such as an application program (which may be a client application, Web browser, mid-tier application, RDBMS, etc.). It should be appreciated that alternative embodiments of computer system 1200 may have numerous variations from that described above. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software (including portable software, such as applets), or both. Further, connection to other computing devices such as network input/output devices may be employed.
In one set of embodiments, the techniques described herein may be implemented as program code executable by a computer system (such as a computer system 1200) and may be stored on machine-readable storage media. Machine-readable storage media may can include any appropriate media known or used in the art, including storage media and communication media, such as (but not limited to) volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage and/or transmission of information such as machine-readable instructions, data structures, program modules, or other data, including RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store or transmit the desired information and which can be accessed by a computer.
Although specific embodiments of the present invention have been described, various modifications, alterations, alternative constructions, and equivalents are within the scope of the invention. For example, 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 specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. The scope of the invention should be determined not with reference to the above description, but instead should be determined with reference to the pending claims along with their full scope or equivalents.
Number | Name | Date | Kind |
---|---|---|---|
4996687 | Hess et al. | Feb 1991 | A |
5051947 | Messenger et al. | Sep 1991 | A |
5495600 | Terry et al. | Feb 1996 | A |
5706494 | Cochrane et al. | Jan 1998 | A |
5802262 | Van De Vanter | Sep 1998 | A |
5802523 | Jasuja et al. | Sep 1998 | A |
5822750 | Jou et al. | Oct 1998 | A |
5826077 | Blakeley et al. | Oct 1998 | A |
5850544 | Parvathaneny et al. | Dec 1998 | A |
5857182 | DeMichiel et al. | Jan 1999 | A |
5937401 | Hillegas | Aug 1999 | A |
6006235 | Macdonald et al. | Dec 1999 | 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 |
6128610 | Srinivasan et al. | Oct 2000 | A |
6263332 | Nasr et al. | Jul 2001 | B1 |
6278994 | Fuh et al. | Aug 2001 | B1 |
6282537 | Madnick et al. | Aug 2001 | 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 |
6418448 | Sarkar | Jul 2002 | B1 |
6438540 | Nasr et al. | Aug 2002 | B2 |
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 |
6708186 | Claborn et al. | Mar 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 |
6856981 | Wyschogrod et al. | Feb 2005 | B2 |
6985904 | Kaluskar et al. | Jan 2006 | B1 |
7020696 | Perry et al. | Mar 2006 | B1 |
7093023 | Lockwood et al. | Aug 2006 | B2 |
7145938 | Takeuchi et al. | Dec 2006 | B2 |
7146352 | Brundage et al. | Dec 2006 | B2 |
7224185 | Campbell et al. | May 2007 | B2 |
7225188 | Gai et al. | May 2007 | B1 |
7236972 | Lewak et al. | Jun 2007 | B2 |
7305391 | Wyschogrod et al. | Dec 2007 | B2 |
7308561 | Cornet et al. | Dec 2007 | B2 |
7310638 | Blair | Dec 2007 | B1 |
7376656 | Blakeley et al. | May 2008 | B2 |
7383253 | Tsimelzon et al. | Jun 2008 | B1 |
7403959 | Nishizawa et al. | Jul 2008 | B2 |
7430549 | Zane et al. | Sep 2008 | B2 |
7451143 | Sharangpani et al. | Nov 2008 | B2 |
7483976 | Ross | Jan 2009 | B2 |
7516121 | Liu et al. | Apr 2009 | B2 |
7519577 | Brundage et al. | Apr 2009 | B2 |
7552365 | Marsh et al. | Jun 2009 | B1 |
7567953 | Kadayam et al. | Jul 2009 | B2 |
7580946 | Mansour et al. | Aug 2009 | B2 |
7613848 | Amini et al. | Nov 2009 | B2 |
7620851 | Leavy et al. | Nov 2009 | B1 |
7630982 | Boyce | Dec 2009 | B2 |
7634501 | Yabloko | Dec 2009 | B2 |
7636703 | Taylor | Dec 2009 | B2 |
7673065 | Srinivasan et al. | Mar 2010 | B2 |
7676461 | Chikodrov et al. | Mar 2010 | B2 |
7689622 | Liu et al. | Mar 2010 | B2 |
7702629 | Cytron et al. | Apr 2010 | B2 |
7702639 | Stanley et al. | Apr 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 |
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 |
7912853 | Agrawal | Mar 2011 | B2 |
7917299 | Buhler et al. | Mar 2011 | B2 |
7930322 | MacLennan | Apr 2011 | B2 |
7953728 | Hu et al. | May 2011 | B2 |
7979420 | Jain et al. | Jul 2011 | B2 |
7991766 | Srinivasan et al. | Aug 2011 | B2 |
7996388 | Jain et al. | Aug 2011 | B2 |
8019747 | Srinivasan et al. | Sep 2011 | B2 |
8032544 | Jing et al. | Oct 2011 | B2 |
8099400 | Haub et al. | Jan 2012 | B2 |
8134184 | Becker et al. | Mar 2012 | B2 |
20020023211 | Roth et al. | Feb 2002 | A1 |
20020049788 | Lipkin et al. | Apr 2002 | A1 |
20020116371 | Dodds et al. | Aug 2002 | A1 |
20020133484 | Chau et al. | Sep 2002 | A1 |
20020169788 | Lee et al. | Nov 2002 | 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 |
20030135304 | Sroub et al. | Jul 2003 | A1 |
20030200198 | Chandrasekar et al. | Oct 2003 | A1 |
20030229652 | Bakalash et al. | Dec 2003 | A1 |
20030236766 | Fortuna et al. | Dec 2003 | A1 |
20040010496 | Behrendt et al. | Jan 2004 | A1 |
20040024773 | Stoffel et al. | Feb 2004 | A1 |
20040064466 | Manikutty et al. | Apr 2004 | A1 |
20040073534 | Robson | Apr 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 |
20040220912 | Manikutty et al. | Nov 2004 | A1 |
20040220927 | Murthy et al. | Nov 2004 | A1 |
20040267760 | Brundage et al. | Dec 2004 | A1 |
20050010896 | Meliksetian et al. | Jan 2005 | A1 |
20050055338 | Warner et al. | Mar 2005 | A1 |
20050065949 | Warner et al. | Mar 2005 | A1 |
20050096124 | Stronach | May 2005 | A1 |
20050097128 | Ryan et al. | May 2005 | A1 |
20050154740 | day et al. | Jul 2005 | A1 |
20050174940 | Iny | Aug 2005 | A1 |
20050177579 | Blakeley et al. | Aug 2005 | A1 |
20050204340 | Ruminer et al. | Sep 2005 | A1 |
20050229158 | Thusoo et al. | Oct 2005 | A1 |
20050273450 | McMillen et al. | Dec 2005 | A1 |
20060015482 | Beyer et al. | Jan 2006 | A1 |
20060031204 | Liu et al. | Feb 2006 | A1 |
20060085592 | Ganguly et al. | Apr 2006 | A1 |
20060100969 | Wang et al. | May 2006 | A1 |
20060106786 | Day et al. | May 2006 | A1 |
20060106797 | Srinivasa et al. | May 2006 | A1 |
20060155719 | Mihaeli et al. | Jul 2006 | A1 |
20060212441 | Tang et al. | Sep 2006 | A1 |
20060224576 | Liu et al. | Oct 2006 | A1 |
20060230029 | Yan | Oct 2006 | A1 |
20060235840 | Manikutty et al. | Oct 2006 | A1 |
20060242180 | Graf et al. | Oct 2006 | A1 |
20060294095 | Berk et al. | Dec 2006 | A1 |
20070016467 | John et al. | Jan 2007 | A1 |
20070022092 | Nishizawa et al. | Jan 2007 | A1 |
20070039049 | Kupferman et al. | Feb 2007 | A1 |
20070118600 | Arora | May 2007 | A1 |
20070136239 | Lee et al. | Jun 2007 | A1 |
20070136254 | Choi et al. | Jun 2007 | A1 |
20070226239 | Johnson et al. | Sep 2007 | A1 |
20070271280 | Chandasekaran | Nov 2007 | A1 |
20070294217 | Chen et al. | Dec 2007 | A1 |
20080005093 | Liu et al. | Jan 2008 | A1 |
20080010241 | McGoveran | Jan 2008 | A1 |
20080028095 | Lang et al. | Jan 2008 | A1 |
20080034427 | Cadambi et al. | Feb 2008 | A1 |
20080046401 | Lee et al. | Feb 2008 | A1 |
20080077570 | Tang et al. | Mar 2008 | A1 |
20080077587 | Wyschogrod et al. | Mar 2008 | A1 |
20080082484 | Averbuch et al. | Apr 2008 | A1 |
20080082514 | Khorlin et al. | Apr 2008 | A1 |
20080086321 | Walton | Apr 2008 | A1 |
20080114787 | Kashiyama et al. | May 2008 | A1 |
20080120283 | Liu et al. | May 2008 | A1 |
20080195577 | Fan et al. | Aug 2008 | A1 |
20080235298 | Lin et al. | Sep 2008 | A1 |
20080281782 | Agrawal | Nov 2008 | A1 |
20080301124 | Alves et al. | Dec 2008 | A1 |
20080301125 | Alves et al. | Dec 2008 | A1 |
20080301135 | Alves et al. | Dec 2008 | A1 |
20080301256 | McWilliams et al. | Dec 2008 | A1 |
20090006320 | Ding et al. | Jan 2009 | A1 |
20090006346 | C N et al. | Jan 2009 | A1 |
20090007098 | Chevrette et al. | Jan 2009 | A1 |
20090019045 | Amir et al. | Jan 2009 | A1 |
20090043729 | Liu et al. | Feb 2009 | A1 |
20090070785 | Alvez et al. | Mar 2009 | A1 |
20090070786 | Alves et al. | Mar 2009 | A1 |
20090076899 | Gbodimowo | Mar 2009 | A1 |
20090100029 | Jain et al. | Apr 2009 | A1 |
20090106189 | Jain et al. | Apr 2009 | A1 |
20090106190 | Srinivasan et al. | Apr 2009 | A1 |
20090106198 | Srinivasan et al. | Apr 2009 | A1 |
20090106214 | Jain et al. | Apr 2009 | A1 |
20090106215 | Jain et al. | Apr 2009 | A1 |
20090106218 | Srinivasan et al. | Apr 2009 | A1 |
20090106321 | Das et al. | Apr 2009 | A1 |
20090106440 | Srinivasan et al. | Apr 2009 | A1 |
20090112802 | Srinivasan et al. | Apr 2009 | A1 |
20090112803 | Srinivasan et al. | Apr 2009 | A1 |
20090112853 | Nishizawa et al. | Apr 2009 | A1 |
20090125550 | Barga et al. | May 2009 | A1 |
20090144696 | Andersen | Jun 2009 | A1 |
20090187584 | Johnson et al. | Jul 2009 | A1 |
20090216747 | Li et al. | Aug 2009 | A1 |
20090216860 | Li et al. | Aug 2009 | A1 |
20090228434 | Krishnamurthy et al. | Sep 2009 | A1 |
20090245236 | Scott et al. | Oct 2009 | A1 |
20090248749 | Gu et al. | Oct 2009 | A1 |
20090265324 | Mordvinov et al. | Oct 2009 | A1 |
20090300181 | Marques | Dec 2009 | A1 |
20090327102 | Maniar et al. | Dec 2009 | A1 |
20100017379 | Naibo et al. | Jan 2010 | A1 |
20100017380 | Naibo et al. | Jan 2010 | A1 |
20100023498 | Dettinger et al. | Jan 2010 | A1 |
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 |
20100161589 | Nica et al. | Jun 2010 | A1 |
20100223305 | Park et al. | Sep 2010 | A1 |
20100223437 | Park et al. | Sep 2010 | A1 |
20100223606 | Park et al. | Sep 2010 | A1 |
20100318652 | Samba | Dec 2010 | 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 |
20110055192 | Tang et al. | Mar 2011 | A1 |
20110093162 | Nielsen et al. | Apr 2011 | A1 |
20110161321 | De Castro Alves et al. | Jun 2011 | A1 |
20110161328 | Park et al. | Jun 2011 | A1 |
20110161352 | De Castro Alves et al. | Jun 2011 | A1 |
20110161356 | De Castro Alves et al. | Jun 2011 | A1 |
20110173231 | Drissi et al. | Jul 2011 | A1 |
20110173235 | Aman et al. | Jul 2011 | A1 |
20110196891 | De Castro Alves et al. | Aug 2011 | A1 |
20110270879 | Srinivasan et al. | Nov 2011 | A1 |
20120041934 | Srinivasan et al. | Feb 2012 | A1 |
Number | Date | Country |
---|---|---|
1241589 | Sep 2002 | EP |
WO 0049533 | Aug 2000 | WO |
WO 0159602 | Aug 2001 | WO |
WO 0165418 | Sep 2001 | WO |
WO 03030031 | Apr 2003 | WO |
Entry |
---|
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, ACM Press, 2003, 4 pages. |
Aho, et al., “Efficient String Matching: An Aid to Bibliographic Search,” Communications of the ACM, Jun. 1975, vol. 18, No. 6, pp. 333-340, Copyright 1975, Association for Computing Machinery, Inc. |
Arasu, “CQL: A language for Continuous Queries over Streams and Relations,” Lecture Notes in Computer Science, 2004, vol. 2921/2004, pp. 1-19. |
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, Jun. 2006, vol. 15, issue 2, pp. 1-32, Springer-Verlag New York, Inc. |
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., “STREAM: The Stanford Data Stream Management System,” Department of Computer Science, Stanford University, 2004, p. 21. |
Avnur, et al., “Eddies: Continuously Adaptive Query Processing,” In Proceedings of the 2000 ACM SIGMOD International Conference on Data, Dallas TX, May 2000, 12 pages. |
Avnur, et al., “Eddies: Continuously Adaptive Query Processing,” slide show, believed to be prior to Oct. 17, 2007, 4 pages. |
Babu, et al., “Continuous Queries over Data Streams,” SIGMOD Record, Sep. 2001, vol. 30, No. 3, 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 International Conference on Information and Knowledge Management, Arlington, Virginia, Nov. 5-11, 2006, 10 pages, Copyright 2006, ACM Press. |
Bose, et al., “A Query Algebra for Fragmented XML Stream Data”, 9th International Conference on Data Base Programming Languages (DBPL), Sep. 6-8, 2003, Potsdam, Germany, at URL: http://lambda,uta.edu/dbp103.pdf, 11 pages. |
Buza, “Extension of CQL over Dynamic Databases,” Journal of Universal Computer Science, 2006, vol. 12, No. 9, pp. 1165-1176. |
Carpenter, “User Defined Functions,” Oct. 12, 2000, at URL: http://www.sqlteam.com/itemprint.asp?ItemID=979, 4 pages. |
Chan, et al., “Efficient Filtering of XML documents with Xpath expressions,” VLDB Journal, 2002, pp. 354-379. |
Chandrasekaran, et al., “TelegraphCQ: Continuous Dataflow Processing for an Uncertain World,” Proceedings of CIDR 2003, 12 pages. |
Chen, et al., “NiagaraCQ: A Scalable Continuous Query System for Internet Databases,” Proceedings of the 2000 SIGMOD International Conference on Management of Data, May 2000, pp. 379-390. |
Colyer, et al., “Spring Dynamic Modules Reference Guide,” Copyright 2006-2008, ver. 1.0.3, 73 pages. |
Colyer, et al., “Spring Dynamic Modules Reference Guide,” Copyright 2006-2008, ver. 1.1.3, 96 pages. |
“Complex Event Processing in the Real World,” an Oracle White Paper, Sep. 2007, 13 pages. |
Conway, “An Introduction to Data Stream Query Processing,” Truviso, Inc., May 24, 2007, at URL: http://neilconway.org/talks/stream—intro.pdf, 71 pages. |
“Coral8 Complex Event Processing Technology Overview,” Coral8, Inc., Make it Continuous, pp. 1-8, Copyright 2007, Coral8, Inc. |
“Creating WebLogic Domains Using the Configuration Wizard,” BEA Products, Dec. 2007, ver. 10.0, 78 pages. |
“Creating Weblogic Event Server Applications,” BEA WebLogic Event Server, Jul. 2007, ver. 2.0, 90 pages. |
Demers, et al., “Towards Expressive Publish/Subscribe Systems,” Proceedings of the 10th International Conference on Extending Database Technology (EDBT 2006), Munich, Germany, Mar. 2006, pp. 1-18. |
DeMichiel, et al., “JSR 220: Enterprise JavaBeans™, EJB 3.0 Simplified API,” EJB 3.0 Expert Group, Sun Microsystems, May 2, 2006, ver. 3.0, 59 pages. |
“Dependency Injection,” Wikipedia, Dec. 30, 2008, printed on Apr. 29, 2011, at URL: http:en.wikipedia.org/w/index.php?title=Dependency—injection&oldid=260831402, pp. 1-7. |
“Deploying Applications to WebLogic Server,” BEA WebLogic Server, Mar. 30, 2007, ver. 10.0, 164 pages. |
Deshpande, et al., “Adaptive Query Processing,” slide show believed to be prior to Oct. 17, 2007, 27 pages. |
“Developing Applications with Weblogic Server,” BEA WebLogic Server, Mar. 30, 2007, ver. 10.0, 254 pages. |
Diao, “Query Processing for Large-Scale XML Message Brokering,” 2005, University of California Berkeley, 226 pages. |
Diao, et al. “Query Processing for High-Volume XML Message Brokering”, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 12 pages. |
Dindar, et al., “Event Processing Support for Cross-Reality Environments,” Pervasive Computing, IEEE CS, Jul.-Sep. 2009, pp. 2-9, Copyright 2009, IEEE. |
“EPL Reference,” BEA WebLogic Event Server, Jul. 2007, ver. 2.0, 82 pages. |
Esper Reference Documentation, Copyright 2007, ver. 1.12.0, 158 pages. |
Esper Reference Documentation, Copyright 2008, ver. 2.0.0, 202 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/w1s/docs100/quickstart/quick—start.html, 1 page. |
Fernandez, et al., “Build your own XQuery processor”, slide show, at URL: http://www.galaxquery.org/slides/edbt-summer-school2004.pdf, 2004, 116 pages. |
Fernandez, et al., Implementing XQuery 1.0: The Galax Experience:, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 4 pages. |
Florescu, et al., “The BEA/XQRL Streaming XQuery Processor,” Proceedings of the 29th VLDB Conference, 2003, Berlin, Germany, 12 pages. |
“Getting Started with WebLogic Event Server,” BEA WebLogic Event Server, Jul. 2007, ver. 2.0, 66 pages. |
Gilani, “Design and implementation of stream operators, query instantiator and stream buffer manager,” Dec. 2003, 137 pages. |
Golab, “Sliding Window Query Processing Over Data Streams,” University of Waterloo, Waterloo, Ont. Canada, Aug. 2006, 182 pages. |
Golab, et al., “Issues in Data Stream Management,” ACM SIGMOD Record, vol. 32, issue 2, Jun. 2003, ACM Press, pp. 5-14. |
Gosling, et al., “The Java Language Specification,” Book, copyright 1996-2005, 3rd edition, 684 pages, Sun Microsystems USA. (due to size, reference will be uploaded in two parts). |
Hopcroft, “Introduction to Automata Theory, Languages, and Computation,” Second Edition, Addison-Wesley, Copyright 2001, 524 pages. (due to size, reference will be uploaded in two parts). |
“Installing Weblogic Real Time,” BEA WebLogic Real Time, Jul. 2007, ver. 2.0, 64 pages. |
“Introduction to BEA WebLogic Server and BEA WebLogic Express,” BEA WebLogic Server, Mar. 2007, ver. 10.0, 34 pages. |
“Introduction to WebLogic Real Time,” BEA WebLogic Real Time, Jul. 2007, ver. 2.0, 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, Publication date Sep. 2007, Copyright 2008, 68 pages, Red Hat, Inc. |
Jin, et al. “ARGUS: Efficient Scalable Continuous Query Optimization for Large-Volume Data Streams” 1Oth International Database Engineering and Applications Symposium (IDEAS'06), 2006, 7 pages. |
Kawaguchi, “Java Architecture for XML Binding—(JAXB) 2.0,” Sun Microsystems, Inc., Apr. 19, 2006, 384 pages. |
Knuth, et al., “Fast Pattern Matching in Strings,” Siam J. Comput., vol. 6, No. 2, Jun. 1977, pp. 323-350. |
Lakshmanan, et al., “On efficient matching of streaming XML documents and queries,” 2002, 18 pages. |
Lindholm, et al., “Java Virtual Machine Specification, 2nd Edition”, Prentice Hall, Apr. 1999, 484 pages. (due to size, reference will be uploaded in two parts). |
Liu, et al., “Efficient XSLT Processing in Relational Database System,” Proceeding of the 32nd. International Conference on Very Large Data Bases (VLDB), Sep. 2006, 1106-1116, 11 pages. |
Luckham, “What's the Difference Between ESP and CEP?” Complex Event Processing, downloaded Apr. 29, 2011, at URL: http://complexevents.com/?p=103, 5 pages. |
Madden, et al., “Continuously Adaptive Continuous Queries (CACQ) over Streams,” SIGMOD 2002, Jun. 4-6, 2002, 12 pages. |
“Managing Server Startup and Shutdown,” BEA WebLogic Server, Mar. 30, 2007, ver. 10.0, 134 pages. |
“Matching Behavior,” .NET Framework Developer's Guide, Copyright 2008 Microsoft Corporation, downloaded Jul. 1, 2008 from URL: http://msdn.microsoft.com/en-us/library/0yzc2yb0(printer).aspx, pp. 1-2. |
Motwani, et al., “Models and Issues in Data Streams,” Proceedings of the 21st ACM SIGMOD-SIGACT-SIDART symposium on Principles f database systems, 2002, 30 pages. |
Motwani, et al., “Query Processing Resource Management, and Approximation in a Data Stream Management System,” Proceedings of CIDR 2003, 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, believed to be prior to Oct. 17, 2007, p. 14. |
“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. |
Novick, “Creating a User Defined Aggregate with SQL Server 2005,” at URL: http://novicksoftware.com/Articles/sql-2005-product-user-defined-aggregate.html, 2005, 6 pages. |
Oracle Database, SQL Language Reference, 11g Release 1 (11.1), B28286-02, Sep. 2007, 1496 pages, Oracle. |
Oracle Application Server 10g, Release 2 and 3, New Features Overview, An Oracle White Paper, Oct. 2005, 48 pages, Oracle. |
Oracle Application Server, Administrator's Guide, 10g Release 3 (10.1.3.2.0), B32196-01, Jan. 2007, 376 pages, Oracle. |
Oracle Application Server, Enterprise Deployment Guide, 10g Release 3 (10.1.3.2.0), B32125-02, Apr. 2007, 120 pages, Oracle. |
Oracle Application Server, High Availability Guide, 10g Release 3 (10.1.3.2.0), B32201-01, Jan. 2007, 314 pages, Oracle. |
“Oracle CEP Getting Started,” Release 11gR1 (11.1.1) E14476-01, May 2009, 172 pages. |
Oracle Database Data Cartridge Developers Guide, B28425-03, 11g Release 1 (11.1), Oracle, Mar. 2008, 372 pages, Oracle. |
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. (due to size, reference will be uploaded in three parts). |
“OSGI Service Platform Core Specification, The OSGI Alliance,” Apr. 2007, ver. 4.1, release 4, 288 pages, OSGI Alliance. |
Peng, et al., “Xpath Queries on Streaming Data,” 2003, pp. 1-12, ACM Press. |
Peterson, “Petri Net Theory and the Modeling of Systems”, Prentice Hall, 1981, 301 pages. |
PostgresSQL: Documentation: 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. |
“Release Notes,” BEA WebLogic Event Server, Jul. 2007, ver. 2.0, 8 pages. |
Sadri, et al., “Expressing and Optimizing Sequence Queries in Database Systems,” ACM Transactions on Database Systems, Jun. 2004, vol. 29, No. 2, pp. 282-318, ACM Press, Copyright 2004. |
Sadtler, et al., “WebSphere Application Server Installation Problem Determination,” Copyright 2007, pp. 1-48, IBM Corp. |
Sharaf, et al., Efficient Scheduling of Heterogeneous Continuous Queries, VLDB '06, Sep. 12-15, 2006, pp. 511-522. |
Spring Dynamic Modules for OSGi Service Platforms product documentation, SpringSource, Jan. 2008, 71 pages. |
“Stanford Stream Data Manager,” at URL: http://infolab.stanford.edu/stream/, last modified Jan. 5, 2006, pp. 1-9. |
Stolze, “User-defined Aggregate Functions in DB2 Universal Database,” at URL: http://www.128.ibm.com/developerworks/db2/library/tacharticle/0309stolze/0309stolze.html, Sep. 11, 2003, 11 pages. |
Stream Query Repository: Online Auctions (CQL Queries), at URL: http://www-db.stanford.edu/strem/sqr/cql/onauc.html, Dec. 2, 2002, 4 pages. |
Stream Query Repository: Online Auctions, at URL: http://www-db.stanford.edu/stream/sqr/onauc.html#queryspecsend, Dec. 2, 2002, 2 pages. |
“Stream: The Stanford Stream Data Manager,” IEEE Data Engineering Bulletin, Mar. 2003, pp. 1-8. |
Streambase 5.1 product documentation, Streambase Systems, copyright 2004-2010, 878 pages. |
Terry, et al., “Continuous queries over append-only database,” Proceedings of 1992 ACM SIGMOD, pp. 321-330. |
“Understanding Domain Configuration,” BEA WebLogic Server, Mar. 30, 2007, ver. 10.0, 38 pages. |
Vajjhala, et al, “The Java™ Architecture for XML Binding (JAXB) 2.0,” Sun Microsystem, Inc., Final Release Apr. 19, 2006, 384 pages. |
W3C, “XML Path Language (Xpath),” W3C Recommendation, Nov. 16, 1999, ver. 1.0, at URL: http://www.w3.org/TR/xpath, 37 pages. |
“WebLogic Event Server Administration and Configuration Guide,” BEA WebLogic Event Server, Jul. 2007, ver. 2.0, 108 pages. |
“WebLogic Event Server Reference,” BEA WebLogic Event Server, Jul. 2007, ver. 2.0, 52 pages. |
“Weblogic Server Performance and Tuning,” BEA WebLogic Server, Mar. 30, 2007, ver. 10.0, 180 pages. |
“WebSphere Application Server V6.1 Problem Determination: IBM Redpaper Collection,” WebSphere Software, IBM/Redbooks, Dec. 2007, 634 pages. |
White, et al., “WebLogic Event Server: A Lightweight, Modular Application Server for Event Processing,” 2nd International Conference on Distributed Event-Based Systems, Jul. 2-4, 2008, Rome, Italy, 8 pages, ACM Press, Copyright 2004. |
Widom, et al., “CQL: A Language for Continuous Queries over Streams and Relations,” believed to be prior to Oct. 17, 2007, 62 pages. |
Widom, et al., “The Stanford Data Stream Management System,” PowerPoint Presentation, believed to be prior to Oct. 17, 2007, 110 pages. |
Zemke, “XML Query,” Mar. 14, 2004, 29 pages. |
De Castro Alves; et al, “Extensible Indexing Framework Using Data Cartridges,” U.S. Appl. No. 12/913,636, filed Oct. 27, 2010. |
Park, et al., “Spatial Data Cartridge for Event Processing Systems,” U.S. Appl. No. 12/949,081, filed Nov. 18, 2010. |
De Castro Alves; et al, “Extensibility Platform Using Data Cartridges,” U.S. Appl. No. 12/957,194, filed Nov. 30, 2010. |
De Castro Alves; et al, “Class Loading Using Java Data Cartridges,” U.S. Appl. No. 13/089,556, filed Apr. 19, 2011. |
De Castro Alves; et al, “Extensible Language Framework Using Data Cartridges,” U.S. Appl. No. 12/957,201, filed Nov. 30, 2010. |
Non-Final Office Action for U.S. Appl. No. 12/396,008, mailed on Jun. 8, 2011, 10 pages. |
Non-Final Office Action for U.S. Appl. No. 12/395,871, mailed on May 27, 2011, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 11/874,202, mailed on Dec. 3, 2009, 20 pages. |
Final Office Action for U.S. Appl. No. 11/874,202, mailed on Jun. 8, 2010, 200 pages. |
Notice of Allowance for U.S. Appl. No. 11/874,202, mailed on Dec. 22, 2010, 29 pages. |
Notice of Allowance for U.S. Appl. No. 11/874,202, mailed on Mar. 31, 2011, 12 pages. |
Notice of Allowance for U.S. Appl. No. 11/874,850, mailed on Nov. 24, 2009, 17 pages. |
Supplemental Notice of Allowance for U.S. Appl. No. 11/874,850, mailed on Dec. 11, 2009, 5 pages. |
Supplemental Notice of Allowance for U.S. Appl. No. 11/874,850, mailed on Jan. 27, 2010, 11 pages. |
Non-Final Office Action for U.S. Appl. No. 11/874,896, mailed on Dec. 8, 2009, 19 pages. |
Final Office Action for U.S. Appl. No. 11/874,896, mailed on Jul. 23, 2010, 28 pages. |
Non-Final Office Action for U.S. Appl. No. 11/874, 896, mailed on Nov. 22, 2010, 25 pages. |
Non-Final Office Action for U.S. Appl. No. 11/977,439, mailed on Apr. 13, 2010, 7 pages. |
Notice of Allowance for U.S. Appl. No. 11/977,439, mailed on Aug. 18, 2010, 11 pages. |
Supplemental Notice of Allowance for U.S. Appl. No. 11/977,439, mailed on Sep. 28, 2010, 6 pages. |
Notice of Allowance for U.S. Appl. No. 11/977,439, mailed on Nov. 24, 2010, 8 pages. |
Notice of Allowance for U.S. Appl. No. 11/977,439, mailed on Mar. 16, 2011, 10 pages. |
Non-Final Office Action for U.S. Appl. No. 11/977,437, mailed on Oct. 13, 2009, 9 pages. |
Final Office Action for U.S. Appl. No. 11/977,437, mailed on Apr. 8, 2010, 18 pages. |
Notice of Allowance for U.S. Appl. No. 11/977,440, mailed on Oct. 7, 2009, 6 pages. |
Office Action for U.S. Appl. No. 11/874,197, mailed on Nov. 10, 2009, 14 pages. |
Final Office Action for U.S. Appl. No. 11/874,197, mailed on Jun. 29, 2010, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 11/874,197, mailed on Dec. 22, 2010, 22 pages. |
Non-Final Office Action for U.S. Appl. No. 11/873,407, mailed on Nov. 13, 2009, 7 pages. |
Final Office Action for U.S. Appl. No. 11/873,407, mailed on Apr. 26, 2010, 11 pages. |
Notice of Allowance for U.S. Appl. No. 11/873,407, mailed on Nov. 10, 2010, 14 pages. |
Notice of Allowance for U.S. Appl. No. 11/873,407, mailed on Mar. 7, 2011, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 11/601,415, mailed on Sep. 17, 2008, 10 pages. |
Final Office Action for U.S. Appl. No. 11/601,415, mailed on May 27, 2009, 26 pages. |
Advisory Action for U.S. Appl. No. 11/601,415, mailed on Aug. 18, 2009, 3 pages. |
Non-Final Office Action for U.S. Appl. No. 11/601,415, mailed on Nov. 30, 2009, 32 pages. |
Final Office Action for U.S. Appl. No. 11/601,415, mailed on Jun. 30, 2010, 45 pages. |
Non-Final Office Action for U.S. Appl. No. 11/927,681, mailed on Mar. 24, 2011, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 11/927,683, mailed on Mar. 24, 2011, 13 pages. |
Non-Final Office Action for U.S. Appl. No. 10/948,523, mailed on Jan. 22, 2007, 31 pages. |
Final Office Action for U.S. Appl. No. 10/948,523, mailed on Jul. 6, 2007, 37 pages. |
Non-Final Office Action for U.S. Appl. No. 10/948, 523, mailed Dec. 11, 2007, 47 pages. |
Notice of Allowance for U.S. Appl. No. 10/948,523, mailed on Jul. 8, 2008, 30 pages. |
Supplemental Notice of Allowance for U.S. Appl. No. 10/948,523, mailed Jul. 17, 2008, 4 pages. |
Notice of Allowance for U.S. Appl. No. 10/948,523, mailed on Dec. 1, 2010, 17 pages. |
“Stream Base New and Noteworthy,” StreamBase, dated Jan. 12, 2010, 878 pages. |
Non-Final Office Action for U.S. Appl. No. 12/548,187, mailed on Sep. 27, 2011, 19 pages. |
Final Office Action for U.S. Appl. No. 12/395,871, mailed on Oct. 19, 2011, 33 pages. |
Non-Final Office Action for U.S. Appl. No. 12/548,222, mailed on Oct. 19, 2011, 27 pages. |
Non-Final Office Action for U.S. Appl. No. 12/548,281, mailed on Oct. 3, 2011, 37 pages. |
Non-Final Office Action for U.S. Appl. No. 12/548,290, mailed on Oct. 3, 2011, 34 pages. |
Notice of Allowance for U.S. Appl. No. 11/874,896, mailed on Jun. 23, 2011, 30 pages. |
Final Office Action for U.S. Appl. No. 11/874,197, mailed on Aug. 12, 2011, 26 pages. |
Notice of Allowance for U.S. Appl. No. 11/927,681, mailed on Jul. 1, 2011, 8 pages. |
Final Office Action for U.S. Appl. No. 11/927,683, mailed on Sep. 1, 2011, 18 pages. |
Hao et al. “Achieving high performance web applications by service and database replications at edge servers,” proceedings of IPCCC 2009, IEEE 28th International Performance Computing and Communications Conference, pp. 153-160 (Dec. 2009). |
International Search Report dated for PCT/US2011/052019 (Nov. 17, 2011). |
Office Action for U.S. Appl. No. 12/396,008 (Nov. 16, 2011). |
Office Action for U.S. Appl. No. 12/506,891 (Dec. 14, 2011). |
Office Action for U.S. Appl. No. 11/601,415 (Dec. 9, 2011). |
“Oracle Complex Event Processing CQL Language Reference,” 11g Release 1 (11.1.1) E12048-01, Apr. 2010, 540 pages. |
Martin et al “Finding application errors and security flaws using PQL: a program query language,” Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications 40:1-19 (Oct. 2005). |
Office Action for U.S. Appl. No. 12/534,384 (Feb. 28, 2012). |
Office Action for U.S. Appl. No. 12/506,905 (Mar. 26, 2012). |
Office Action for U.S. Appl. No. 12/548,209 (Apr. 16, 2012). |
Notice of Allowance for U.S. Appl. No. 13/184,528 (Mar. 1, 2012). |
Office Action for U.S. Appl. No. 12/548,187 (Jun. 20, 2012). |
Notice of Allowance for U.S. Appl. No. 12/395,871 (May 4, 2012). |
Office Action for U.S. Appl. No. 12/548,222 (Jun. 20, 2012). |
Office Action for U.S. Appl. No. 12/548,281 (Jun. 20, 2012). |
Office Action for U.S. Appl. No. 12/913,636 (Jun. 7, 2012). |
Notice of Allowance for U.S. Appl. No. 12/874,197 (Jun. 22, 2012). |
Final Office Action for U.S. Appl. No. 12/548,290 dated Jul. 30, 2012. |
Office Action for U.S. Appl. No. 13/193,377 dated Aug. 23, 2012. |
Office Action for U.S. Appl. No. 11/977,437 dated Aug. 3, 2012. |
Final Office Action for U.S. Appl. No. 11/601,415 dated Jul. 2, 2012. |
Notice of Allowance for U.S. Appl. No. 12/506,891 dated Jul. 25, 2012. |
Final Office Action for U.S. Appl. No. 12/506,905 dated Aug. 9, 2012. |
Esper Reference Documentation, Copyright 2009, ver. 3.1.0, 293 pages. |
International Search Report dated Jul. 16, 2012 for PCT/US2012/034970. |
International Search Report dated Sep. 12, 2012 for PCT/US2012/036353. |
Office Action for U.S. Appl. No. 13/396,464 dated Sep. 7, 2012. |
Office Action for U.S. Appl. No. 13/244,272 dated Oct. 14, 2012. |
Notice of Allowance for U.S. Appl. No. 12/548,209 dated Oct. 24, 2012. |
Nah et al. “A Cluster-Based THO-Structured Scalable Approach for Location Information Systems,” The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS' 03), pp. 225-233 (Jan. 1, 2003). |
Hulton et al. “Mining Time-Changing Data Streams,” Proceedings of the Seventh ACM SIGKDD, pp. 10 (Aug. 2001). |
Stump et al. (ed.) Proceedings of IJCAR '06 Workshop “PLPV '06: Programming Languages meets Program Verification,” pp. 1-113 (Aug. 21, 2006). |
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), pp. 1023-1030 (Dec. 22, 2007). |
Wang et al. “Distributed Continuous Range Query Processing on Moving Objects,” Proceedings of the 17th international Conference on Database and Expert Systems Applications (DEXA'06), Berlin, DE, pp. 655-665 (Jan. 1, 2006). |
Wu et al.“Dynamic Data Management for Location Based Services in Mobile Environments,” IEEE Proceedings of the Seventh International Database Engineering and Applications Symposium 2003 Piscataway. NJ. USA., pp. 172-181 (Jul. 16, 2003). |
Sansoterra “Empower SOL with Java User-Defined Functions,” IT Jungle.com (Oct. 9, 2003). |
Ullman et al., “Introduction to JDBC,” Stanford University (2005). |
Non-Final Office Action for U.S. Appl. No. 12/957,194 dated Dec. 7, 2012. |
Non-Final Office Action for U.S. Appl. No. 13/089,556 dated Nov. 6, 2012. |
Notice of Allowance for U.S. Appl. No. 12/506,905 dated Dec. 14, 2012. |
Non-Final Office Action for U.S. Appl. No. 12/957,201 dated Dec. 19, 2012. |
Number | Date | Country | |
---|---|---|---|
20110029485 A1 | Feb 2011 | US |