MANAGING CONTINUOUS QUERIES WITH ARCHIVED RELATIONS

• US 20140095535A1
• Filed: 03/14/2013
• Published: 04/03/2014
• 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
• Granted Patent: US 10,102,250 B2
• Time in Patent Office: Days
• US Class Current: 707/769
• 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 query that identifies at least a data stream;

initialize the query with at least a portion of historical data; and

evaluate the query based at least in part on the data stream and the portion of the historical data.

2. The system of claim 1, wherein the query comprises a continuous query configured to process incoming real-time data of the data stream or an archived relation of the data stream.

3. The system of claim 2, wherein the real-time data includes at least business event data.

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

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

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

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

8. The system of claim 1, wherein the historical data comprises business event data from the data stream at a time before initializing the query.

9. The system of claim 1, wherein evaluating the query includes at least forming a query graph with nodes representing operators of the query.

10. The system of claim 9, wherein the one or more processors are further configured to execute the plurality of instructions to at least traverse the query graph in a topological order.

11. The system of claim 10, wherein the one or more processors are further configured to execute the plurality of instructions to at least initialize the query with at least the historical data at a lowest stateful operator identified in the query graph.

12. 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 receive a continuous query configured to process a data stream, the continuous query including at least one of an identifier of the data stream or an identifier of historical data;

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

instructions that cause the one or more processors to initialize the continuous query with at least a portion of historical data; and

instructions that cause the one or more processors to evaluate the continuous query with respect to the data stream and based at least in part on the historical data.

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

14. The computer-readable memory of claim 13, wherein the data definition language annotation identifies at least one of a location of the historical data, a source of the data stream, a 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.

15. The computer-implemented method of claim 12, wherein the query graph includes at least nodes representing operators of the continuous query.

16. The computer-implemented method of claim 12, wherein the continuous query is initialized with the at least a portion of the historical data at a stateful operator of the query graph while traversing the query graph in a topographical order.

17. A computer-implemented method, comprising:

receiving a continuous query configured to process a stream of business event data, the continuous query including an identifier of the stream and an identifier of historical data associated with the stream;

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

traversing the query graph to identify a lowest stateful operator;

initializing the continuous query with at least a portion of historical data at the identified lowest stateful operator; and

evaluating the continuous query with respect to the stream and based at least in part on the historical data.

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

18. The computer-implemented method of 17, wherein the historical data includes business event data from a previous point in time of the stream.

19. The computer-implemented method of 17, further comprising determining an optimal amount of the historical data with which to initialize the continuous query based at least in part on the operator of the continuous query.