Managing continuous queries with archived relations

• US 10,102,250 B2
• Filed: 03/14/2013
• Issued: 10/16/2018
• Est. Priority Date: 09/28/2012
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Deshmukh, Unmesh Anil, Srinivasan, Anand, Park, Hoyong, Shukla, Vikram, Bishnoi, Sandeep
• Primary Examiner(s): Perveen, Rehana
• Assistant Examiner(s): Skhoun, Hicham
• Application Number:
  US13/829,958
• Publication Number:
  US 20140095535A1
• Time in Patent Office: 2,042 Days
• Field of Search: 707769
• CPC Class Codes: B29D 2030/0682 Inner liners tubeless tyres with impervious liner or coating on the tyre B60C5/14
• CPC Class Codes: B29D 30/0681 Parts of pneumatic tyres; accessories, auxiliary operations
• CPC Class Codes: B32B 27/08 of synthetic resin
• CPC Class Codes: B32B 27/34 comprising polyamides
• CPC Class Codes: B60C 1/0008 Compositions of the inner liner
• CPC Class Codes: B60C 5/14 with impervious liner or coating on the inner wall of the tyre
• CPC Class Codes: G06F 16/242 Query formulation
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/2453 Query optimisation
• CPC Class Codes: G06F 16/24535 of sub-queries or views
• CPC Class Codes: G06F 16/24539 using cached or materialised query results
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/24553 of query operations
• CPC Class Codes: G06F 16/2456 Join operations
• CPC Class Codes: G06F 16/24568 Data stream processing; Continuous queries
• CPC Class Codes: G06F 16/2474 Sequence data queries, e.g. querying versioned data
• CPC Class Codes: G06F 16/2477 Temporal data queries
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/25 Integrating or interfacing systems involving database management systems
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/9024 : Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/951 : Indexing; Web crawling techniques

Abstract

Techniques for managing continuous queries with archived relations are provided. In some examples, a query that includes at least a data stream may be identified. Additionally, the query may be initialized with at least a portion of historical data. Further, in some instances, the query may be evaluated based at least in part on the data stream and the portion of the historical data.

Claims

1. A system, comprising:

a memory storing a plurality of instructions; and

one or more processors configured to access the memory, wherein the one or more processors are further configured to execute the plurality of instructions to at least;

identify a window for referencing at least a portion of a data stream, the data stream comprising one or more notifications of changes to at least a first data object;

provide a user interface to a user for configuring a configurable window size of the window;

receive, at the user interface, a value for the configurable window size of the window;

configure the configurable window size based at least in part on the value;

identify a continuous query that is to be based at least in part on an archived relation, the archived relation comprising at least a portion of historical data and incoming events of the data stream that are within the window that corresponds to the configurable window size, the historical data from a previous time associated with the data stream, the archived relation configured as a time-bounded window on the data stream that corresponds to the configurable window size, and the archived relation being not empty upon creation;

generate a query operator graph based at least in part on operators of the continuous query;

sort the query operator graph topologically, the topological sort performed such that the operators are ordered from a source operator to an output operator;

traverse the query operator graph in a topological order based at least in part on the topological sort of the query operator graph;

determine which operator of the query operator graph is a lowest stateful operator in the query operator graph based at least in part on the topological traversal;

execute an archiver query based at least in part on the sorted query operator graph to initialize the continuous query, the execution of the archiver query comprising;

receiving historical data, via a structured query language query, corresponding to the lowest stateful operator of the sorted query operator graph, the historical data comprising a backing store of the first data object; and

initializing the continuous query with the historical data corresponding to the lowest stateful operator of the sorted query operator graph and based at least in part on the configurable window size;

evaluate the archived relation using the continuous query by processing incoming events of the data stream and the at least a portion of the historical data associated with stateful operators of the query operator graph; and

listen to a messenger service for a notification of a subsequent change in the first data object compared with the initialized query and/or the portion of historical data.

2. The system of claim 1, wherein the incoming events comprise at least business event data.

3. The system of claim 1, wherein the data stream comprises a relation configured with the window for referencing a portion of the data stream within the window.

4. The system of claim 3, wherein the window is configured to move along the data stream with time.

5. The system of claim 1, wherein the historical data is not included in the data stream at a time after initializing the continuous query.

6. The system of claim 1, wherein the continuous query further identifies the historical data.

13. The system of claim 1, wherein the messenger service is a Java Messaging System (JMS).

14. The system of claim 1, wherein the notification is generated in response to an API call for inserting and/or deleting data from the archived relation.

15. The system of claim 1:

wherein initializing the continuous query with the historical data further comprises running the query against the data object backing store to establish an initial state of the first data object; and

wherein the notification of the subsequent change includes a notification of a change to the first data object compared with the established initial state.

16. The system of claim 15, wherein the one or more processors are further configured to:

establish a change notification listener before initializing the query; and

process the change notification after the archiver query is executed.

17. The system of claim 15, wherein the one or more processors are further configured to utilize a transaction identifier (TID) or a context identifier (CID) for managing change events.

18. The system of claim 15, wherein the one or more processors are further configured to:

supply information to a Persistence Service; and

determine, based on the supplied information, whether to include a change notification in an initial query result.

19. The system of claim 1, wherein the one or more processors are further configured to:

listen to multiple input streams received from one or more event sources;

select events from the multiple input streams; and

output the selected events via one or more output event streams to one or more event sinks.

7. A computer-readable memory storing a plurality of instructions executable by one or more processors, the plurality of instructions comprising:

instructions that cause the one or more processors to identify a window for referencing at least a portion of a data stream, the data stream comprising one or more notifications of changes to at least a first data object;

instructions that cause the one or more processors to provide a user interface to a user for configuring a configurable window size of the window;

instructions that cause the one or more processors to receive, at the user interface, a value for the configurable window size of the window;

instructions that cause the one or more processors to configure the configurable window size based at least in part on the value;

instructions that cause the one or more processors to receive a continuous query that is to be based at least in part on an archived relation, the archived relation comprising at least one of an identifier of the data stream that are within the window that corresponds to the configurable window size or an identifier of historical data, the historical data from a previous time associated with the data stream, the archived relation configured as a time-bounded window on the data stream that corresponds to the configurable window size, and the archived relation being not empty upon creation;

instructions that cause the one or more processors to generate a query graph based at least in part on operators of the continuous query;

instructions that cause the one or more processors to sort the query graph topologically, the topological sort performed such that the operators are ordered from a source operator to an output operator;

instructions that cause the one or more processors to traverse the query operator graph in a topological order based at least in part on the topological sort of the query operator graph;

instructions that cause the one or more processors to determine which operator of the query operator graph is a lowest stateful operator in the query operator graph based at least in part on the topological traversal;

instructions that cause the one or more processors to execute an archiver query based at least in part on the sorted query graph to initialize the continuous query, the execution of the archiver query comprising;

receiving historical data, via a structured query language query, corresponding to the lowest stateful operator of the sorted query graph, the historical data comprising a backing store of the first data object; and

initializing the continuous query with the historical data corresponding to the lowest stateful operator of the sorted query graph and based at least in part on the configurable window size;

instructions that cause the one or more processors to evaluate the archived relation using the continuous query by processing incoming events of the data stream and based at least in part on the portion of the historical data associated with stateful operators of the query graph; and

instructions that cause the one or more processors to listen to a messenger service for a notification of a subsequent change in the first data object compared with the initialized query and/or the portion of historical data.

8. The computer-readable memory of claim 7, wherein at least one of the data stream or the historical data are identified by a data definition language annotation of the continuous query.

9. The computer-readable memory of claim 8, wherein the data definition language annotation identifies at least one of a location of the historical data, a source of the data stream, the first data object associated with the data stream, operation information associated with processing the continuous query, one or more relevant columns of a database corresponding to the historical data, a data object corresponding to output of the continuous query, or a location for providing the output of the continuous query.

10. A computer-implemented method, comprising:

identifying a window for referencing at least a portion of a data stream, the data stream comprising one or more notifications of changes to at least a first data object;

providing a user interface to a user for configuring a configurable window size of the window;

receiving, at the user interface, a value for the configurable window size of the window;

configuring the configurable window size based at least in part on the value;

receiving a continuous query that is to be based at least in part on an archived relation, the archived relation comprising at least a portion of historical data and incoming events of the data stream that are within the window that corresponds to the configurable window size, the historical data from a previous time associated with the data stream, the archived relation configured as a time-bounded window on the data stream that corresponds to the configurable window size, and the archived relation being not empty upon creation;

generating a query graph based at least in part on operators of the continuous query, the query graph including at least a node representing an operator of the continuous query;

sorting the query graph topologically, the topological sort performed such that the operators are ordered from a source operator to an output operator;

traversing the query operator graph in a topological order based at least in part on the topological sort of the query graph;

determining which operator of the query operator graph is a lowest stateful operator in the query operator graph based at least in part on the topological traversal;

executing an archiver query based at least in part on the sorted query graph to initialize the continuous query, the execution of the archiver query comprising;

receiving historical data, via a structured query language query, corresponding to the lowest stateful operator of the sorted query graph, the historical data comprising a backing store of the first data object; and

initializing the continuous query with the historical data corresponding to the lowest stateful operator of the sorted query graph and based at least in part on the configurable window size;

evaluating the archived relation using the continuous query by processing incoming events of the data stream and based at least in part on the portion of the historical data associated with stateful operators of the query operator graph;

listening to a messenger service for a notification of a subsequent change in the first data object compared with the initialized query and/or the portion of historical data; and

providing results of the evaluated archived relation for presentation in a user interface of a user device.

12. The computer-implemented method of claim 10, wherein the stateful operator is identified based at least in part on evaluating at least one node of the query graph.

11. The computer-implemented method of 10, further comprising determining an optimal amount of the historical data with which to initialize the state of the stateful operators based at least in part on a first stateful operator of the sorted query operator graph.