CN108304517A - Efficient nested querying method based on Complex event processing system - Google Patents
Efficient nested querying method based on Complex event processing system Download PDFInfo
- Publication number
- CN108304517A CN108304517A CN201810065166.XA CN201810065166A CN108304517A CN 108304517 A CN108304517 A CN 108304517A CN 201810065166 A CN201810065166 A CN 201810065166A CN 108304517 A CN108304517 A CN 108304517A
- Authority
- CN
- China
- Prior art keywords
- event
- nested
- expense
- inquiry
- relationship
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
- G06F16/2433—Query languages
- G06F16/2438—Embedded query languages
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of efficient nested querying method based on Complex event processing system, including hierarchical relationship establishment stage, processing scheme establishment stage, processing stages；A kind of subexpression for being based on three-tier architecture model, listing that in each nested event schema query expression and it is included is proposed, and chooses one or more；Find out all possible executive plan for calculating each nested event schema inquiry according to the successively progressive relationship of hierarchical relationship according to the query result of the expression formula or subexpression that are selected；It estimates the communication overhead between the operation expense and operation and operation of each progressive step in each executive plan, chooses the executive plan of expense summation minimum as optimal execution plan, realize the efficient process of multiple nested event schema inquiries.
Description
Technical field
The invention belongs to technical field of data processing, and in particular to a kind of efficient nested based on Complex event processing system
Querying method.
Background technology
Complex event processing techniques rise in last decade, which is mainly used for handling and analyzing in a manner of event
A large amount of data and behaviors for coming from information system especially distributed system.Sensu lato event refer to a particular system or
An event instance being had occurred and that in field, as in form ordering system one processed order can be expressed as an order
Processed event or an order submit event；And event in the narrow sense refers in particular to the program entity for calculating, such as user circle
Pressing for some button in face can trigger a corresponding key-press event to cause specific interface behavior, or come from radio frequency and connect
Receive the event that device is sent to data collection center.Signified event refers mainly to the available of modeling business flow behavior in the present invention
In the customized event of calculation processing.Complex event processing is helped by analyzing and monitoring the instant event persistently generated in real time
Professional understands the practical operation situation of system, quickly identifies specific system action pattern and takes corresponding measure, more
Event is efficiently used to enhance system operatio, performance and safety.Complex event processing can be used for the treatment of many information
System problem, such as the automation of operation flow, scheduling and control program, network monitoring, performance estimation and intrusion detection etc., at present
Some existing general event handling platforms, such as Esper, Rulecore, Cagra.
Document High-Performance Composite Event Monitoring System Supporting
The case where Large Numbers of Queries and Sources (DEBS 2011) are absorbed in processing list and inquire, multiple affair,
It has done certain work in problem to be solved by this invention, but the method that the document is proposed is only limited to handle some letters
Single event schema, such as ordered mode (SEQ), conjunction pattern (AND) and no pattern (！) etc., definition is not done superfluous herein
It states.
Often due to the complexity of monitoring demand, many monitoring and inquiries be presented as the mixing of simple event pattern with it is nested,
The nested event schema inquiry that namely present invention is said, such inquiry include the described above ordered mode to event
(SEQ), conjunction pattern (AND) and no pattern (！) query pattern and these query patterns between it is mutually nested, and
There is also being that multiple nested event schemas inquire concurrent complex situations, querying method in the prior art brings pole to system
Big live load, but for monitoring requirement, inquiry needs to complete in a given time limit, that is, this is looked into
The life cycle of inquiry；Therefore, it is optimized for nested event query method to improve search efficiency for Complex event processing
It is extremely urgent for system.
Invention content
The present invention is based on Complex event processing system propose it is a kind of based on three-tier architecture model based on complicated event at
The efficient nested querying method of reason system, to realize the efficient process of multiple nested event schema inquiries.
The efficient nested querying method based on Complex event processing system in the present invention, including the following contents：
Efficient nested querying method based on Complex event processing system, it is characterised in that：Including the following contents：
1) hierarchical relationship establishment stage, including：
Event inquired as needed itself establishes the concept hierarchy model between each event；
According to the concept hierarchy between each nested event schema inquiry of the concept hierarchy model foundation between each event
Relationship；
The pattern level between each nested event schema inquiry is established according to the query expression of each nested event schema inquiry
Structural relation；
The hierarchy of 00operation between each nested event schema inquiry is established according to the query expression of each nested event schema inquiry
Structural relation；
2) processing scheme establishment stage, including：
The subexpression that in each nested event schema query expression and it is included is listed, and chooses one of those
Or it is multiple；The expression formula or subexpression being selected are located at the most bottom in the concept hierarchy relationship in the event inquired
Layer, and be respectively positioned in pattern hierarchical relationship and hierarchy of 00operation structural relation top；
One is found out according to the query result for the expression formula or subexpression being selected according to concept hierarchy relationship, pattern
Hierarchical relationship and the successively progressive relationship of hierarchy of 00operation structural relation calculate holding for each nested event schema inquiry
Row plan；
3) processing stage, according to each nested event schema inquiry of the executive plan synchronization process.
The advantageous effect of this method is, by the hierarchical relationship of three dimensions to multiple concurrent nested query expression formulas
It is divided, first carries out the query expression that can be reused or subexpression, make its query result each concurrent
It is reused between inquiry, the intermediate result generated therebetween can also further repeat to make according to the hierarchical relationship of three dimensions
With, to progressive, effectively avoid useless repetitive operation, reduce multiple nested queries it is concurrent when workload.
Further, in the processing scheme establishment stage, looking into according to the expression formula or subexpression being selected is found out
Result is ask according to concept hierarchy relationship, pattern hierarchical relationship and the successively progressive relationship of hierarchy of 00operation structural relation
Calculate all possible executive plan of each nested event schema inquiry；
It estimates the communication overhead between the operation expense and operation and operation of each progressive step in each executive plan, selects
The executive plan of pin summation minimum is taken away as optimal execution plan；
In the processing stage, according to each nested event schema inquiry of the executive plan synchronization process.
When concurrent for multiple nested queries, all reuse possibilities are listed in advance, then basis is estimated wherein
Operation expense and the sum total of communication overhead executed to select a kind of minimum possibility of expense synthesis, further reduced more
Workload when a nested query is concurrent.
Further, the operation expense is equal to the data input expense of each progressive step plus data output expense.
It is more accurate for the prediction of expense.
Further, R is usedEIndicate the quantity of event E in the unit interval, PEIndicate single class predicate (single- of all event E
Class predicats) selectance, TWpIndicate the time window length of inquiry, NEIndicate time constant TWpInterior event E's
Quantity, i.e. RE×TWp×PE,
Then the data input expense of the progressive step and the prediction of data output expense are as follows：
Operation is SEQ (Ei, Ej) when then, data input expense
Data export expense
Operation is AND (Ei, Ej) when then, data input expense
Data export expense
Operation be SEQ (！Ei, Ej) when then, data input expense
Data export expense
Operation be AND (！Ei, Ej) when then, data input expense
Data export expense
WhereinThen indicate event EiAnd EjBetween implicit time predicate (Implicit time predicate) choosing
Degree of selecting, wherein EiTime of origin earlier than Ej；
Then indicate event EiAnd EjBetween multiclass predicate (multi-class predicats) selectance, wherein Ei
Time of origin earlier than Ej。
Further, the communication overhead is multiplied by the network of the data flow equal to the input rate of the data flow of each progressive step
Delay time.
So that more accurate for the prediction of expense.
Further, λ (s are enabledC) indicate data flow SCInput rate, TWpIndicate the time window length of inquiry, NEWhen expression
Between constant TWpThe quantity of interior event E,Indicate then operation OhOperation expense, then λ (sC) prediction it is as follows：
Further, further include being ranked up from less to more according to the quantity of positive event included in each expression formula.
Further, further according to the concept hierarchy between these expression formulas between the equal inquiry of the quantity of positive event
Relationship is ranked up from lower layer to upper layer.
Further, between the equal inquiry of quantity according between these expression formulas hierarchy of 00operation structural relation from lower layer
It is ranked up to upper layer.
Be conducive to quickly carry out the generation of feasible executive plan, save the workload in preconsolidation stress stage.
Further, the communication between the operation expense and operation and operation of each progressive step in each executive plan is estimated
After expense, optimal execution plan is obtained using dijkstra's algorithm.
Dijkstra's algorithm is realized also very convenient using extensive.
Description of the drawings
Fig. 1 is the schematic diagram of the optimal execution plan in the embodiment of the present invention.
Fig. 2 is the schematic diagram of the concept hierarchy model in the embodiment of the present invention.
Specific implementation mode
Below by the further details of explanation of specific implementation mode：
By the efficient nested querying method based on Complex event processing system with being applied at complicated event in the present embodiment
In reason system, this method includes：
1) hierarchical relationship establishment stage, including：
Event inquired as needed itself establishes the concept hierarchy model between each event；
According to the concept hierarchy between each nested event schema inquiry of the concept hierarchy model foundation between each event
Relationship；
The pattern level between each nested event schema inquiry is established according to the query expression of each nested event schema inquiry
Structural relation；
The hierarchy of 00operation between each nested event schema inquiry is established according to the query expression of each nested event schema inquiry
Structural relation；
2) processing scheme establishment stage, including：
The subexpression that in each nested event schema query expression and it is included is listed, and chooses one of those
Or it is multiple；The expression formula or subexpression being selected are located at the most bottom in the concept hierarchy relationship in the event inquired
Layer, and be respectively positioned in pattern hierarchical relationship and hierarchy of 00operation structural relation top；
It is ranked up from less to more according to the quantity of positive event included in each expression formula；
Further according to the concept hierarchy relationship between these expression formulas between the equal inquiry of the quantity of positive event, from
Lower layer is ranked up to upper layer；
Between the equal inquiry of quantity according between these expression formulas hierarchy of 00operation structural relation from lower layer to upper layer
It is ranked up；
The query result according to the expression formula or subexpression being selected is found out according to concept hierarchy relationship, mode layer
Secondary structural relation and the successively progressive relationship of hierarchy of 00operation structural relation calculate all of each nested event schema inquiry
Possible executive plan；
Estimate the communication overhead between the operation expense and operation and operation of each progressive step in each executive plan, profit
Dijkstra's algorithm is used to choose the executive plan of expense summation minimum as optimal execution plan；
3) processing stage, according to each nested event schema inquiry of the optimal path synchronization process.
The data input expense that the operation expense is equal to each progressive step exports expense plus data, and the communication is opened
Pin is multiplied by the network-induced delay of the data flow equal to the input rate of the data flow of each progressive step so that for the pre- of expense
It is more accurate to survey.
By taking the Complex event processing system of processing " medical diagnosis and processing " as an example, conceptually according to the event that is queried
The concept hierarchy model that the difference of granularity of division is established is as shown in Fig. 2, undermost event is the thing of middle layer respectively
The subordinate concept of part, and the event of middle layer is then the subordinate concept of medical diagnosis and processing.It is most upper in concept hierarchy in figure
The event " medical diagnosis and processing " of layer, time level event that he includes is " diagnosis ", " record ", " therapy ", " resource needs
Ask ", " preoperative preparation ", " signature ", " operation complete ", " consumption " and " patient condition "；
Wherein, this level event that event " diagnosis " is included is " history talk ", " physical examination ", " examines in laboratory
Look into " and " antidiastole "；
This level event that event " record " is included is " operation record " and " progress record "；
This level event that event " therapy " is included is " surgical operation " and " prescription "；
This level event that event " resource requirement " is included is " material " and " personnel "；
This level event that event " preoperative preparation " is included is " physical examination " and " preoperative evaluation "；
This level event that event " signature " is included is " agreeing to operation " and " automatic discharge "；
This level event that event " operation is completed " is included is " postoperative evaluation " and " postoperative care "；
This level event that event " patient condition " is included is " waiting " and " discharge "；
This level event that event " record " is included is " operation record " and " progress record ".
Such as it needs into the following inquiry of row expression：
q15=SEQ (AND (laboratory examination, surgical operation), resource requirement, preoperative evaluation, patient condition),
q16=SEQ (AND (laboratory examination, surgical operation), resource requirement, preoperative evaluation wait for)；
Q in formula16It is q15Upper layer when being classified according to concept hierarchy relationship；q15In event " waiting "
It is q16In " patient condition " subordinate concept event, so inquiry q16Result in contain inquiry q15As a result, therefore q16's
It as a result can be by being multiplexed q15Result obtain, i.e., in q15Result in inquire " patient condition " be " waiting " as a result, keeping away
More useless recalculate is exempted from.
In another example needing into the following inquiry of row expression：
q10=AND (SEQ (postoperative care, progress record), automatic to leave hospital, consumption),
q14=SEQ (AND (！Antidiastole, surgical operation), AND (SEQ (postoperative care, progress record), it is automatic to leave hospital,
Consumption))；
Inquiry q in formula10It is then q14Upper layer in pattern hierarchical relationship, q14Expression formula be nested with q10's
Expression formula, therefore q14Result can pass through be multiplexed q10Result obtain, i.e., in q10Result in, inquire those have AND (！
Antidiastole, surgical operation) in before, there is a situation where to avoid q is recalculated10；It is worth noting that, occur herein "！Mirror
Not Zhen Duan ", indicate the no pattern query of " antidiastole ", i.e. the event other than " operation record " is referred to as in the present invention
Contain negative sense event in expression formula, other opposite events are then referred to as positive event；According to pattern hierarchical relationship, levels it
Between be nest relation, so positive event number contained in the expression formula of upper layer will be more than lower layer's expression formula.
In another example needing into the following inquiry of row expression：
q6=AND (SEQ (postoperative evaluation, postoperative care), progress record are automatic to leave hospital),
q7=SEQ (postoperative evaluation, postoperative care, progress record are automatic to leave hospital),
q8=SEQ (！Operation record, postoperative evaluation, postoperative care, progress record is automatic to leave hospital, consumption)；
Q in formula7It is q8Upper layer in hierarchy of 00operation structural relation, q6It is then q7Upper layer；Because of q7Inquiry is " postoperative to comment
Estimate ", " postoperative care ", " progress record " and " automatic discharge " four events occur successively, and q8Inquiry be then "！Operation note
Record " (the no pattern query of " operation record ", the event other than " operation record "), " postoperative evaluation ", " postoperative care ",
" progress record ", " automatic discharge " and " consumption " occurs successively, so q7Query result in contain q8Query result；
Similarly, q6Query result then contain q7Query result (AND is and modulus formula that it is unlimited order occur, natural
Contain the case where SEQ sequences take), therefore q7And q6As a result it can be multiplexed to when handling the inquiry of its lower layer, i.e., from q6Knot
Being filtered in fruit should not be by q7The part covered and obtain q7, and from q7Result in filter out and meet q8Condition ("！Operation note
Record ") partly to obtain q8, avoid more useless recalculate.
Then, following multiple nested queries that need to be handled are established by hierarchical relationship model according to the above rule.
q9=SEQ (postoperative care, progress record is automatic to leave hospital, consumption),
q10=AND (SEQ (postoperative care, progress record), automatic to leave hospital, consumption),
q11=SEQ (postoperative care, progress record is automatic to leave hospital,！Discharge, consumption),
q12=AND (SEQ (postoperative care, progress record is automatic to leave hospital, consumption), wait for),
q13=SEQ (AND (laboratory examination, surgical operation), resource requirement, preoperative evaluation),
q14=SEQ (AND (！Antidiastole, surgical operation), AND (SEQ (postoperative care, progress record), it is automatic to leave hospital,
Consumption))；
q15=SEQ (AND (laboratory examination, surgical operation), resource requirement, preoperative evaluation, patient condition),
q16=SEQ (AND (laboratory examination, surgical operation), resource requirement, preoperative evaluation wait for)；
In the present embodiment, first to q9To q16According to the quantity of positive event included in each expression formula from less to more into
Row sequence；Further according to the concept hierarchy relationship between these expression formulas between the equal inquiry of positive event number, under
Layer is ranked up to upper layer；Between the equal inquiry of quantity further according between these expression formulas hierarchy of 00operation structural relation under
Layer is ranked up to upper layer；The result finally to sort is as follows：
q10、q9、q11、q12、q13、q15、q16、q14。
Then, it chooses subexpression SEQ (postoperative care, progress record) and AND (laboratory examination, surgical operation) is
Point is found and most preferably carries into execution a plan；
Use REIndicate the quantity of event E in the unit interval, PEIndicate single class predicate (single-class of all event E
Predicats selectance), TWpIndicate the time window length of inquiry, then NEIndicate time constant TWpThe quantity of interior event E,
That is RE×TWp×PE。
Table 1 illustrates the prediction formula of the data input expense and data output expense of each operator in progressive step.
WhereinThen indicate event EiAnd EjBetween implicit time predicate (Implicit time predicate) choosing
Degree of selecting, wherein EiTime of origin earlier than Ej；
Then indicate event EiAnd EjBetween multiclass predicate (multi-class predicats) selectance, wherein Ei
Time of origin earlier than Ej；
The prediction formula of the operation expense of 1 operator of table
So some operation OhOperation expense can then be expressed as its input expenseWith output expenseIt
With that is,：
On the other hand, λ (s are enabledC) indicate data flow SCInput rate, L (sC) indicate its network-induced delay, the present embodiment
Defined in data flow SCCommunication overheadIt is as follows：
Then, the overhead of a certain multiplexed path can be estimated as follows：
Based on this, after having estimated the computing overhead and communication overhead arrived involved in each possible multiplexed path,
Optimal execution plan to the end is obtained using the dijkstra's algorithm for finding shortest path in the prior art.Dijkstra's algorithm is
It is proposed in nineteen fifty-nine by Dutch computer scientist Dick Si Tela, therefore is called Dijkstra algorithm.It is to be pushed up from one
For point to the shortest path first on remaining each vertex, solution is shortest route problem in digraph.Dijkstra's algorithm is mainly special
Point is extended layer by layer outward centered on starting point, until expanding to terminal, is suitable for the application scenarios of the present embodiment.
Finally, the Optimum Implementation Plan that is successively handled is as shown in Figure 1, O in figurehFor marking the fortune being used at this
It calculates, arrow is directed toward subexpression or event involved by the operation；Expression formula SEQ (postoperative care, progress note as starting point
Record) and AND (laboratory examination, surgical operation) needed for operation O has been respectively labeled as in figure1And O7, the mark on arrow
Note indicates the operation has used which kind of hierarchical relationship between expression formula, to be multiplexed to obtain as a result, multiplex mode
It has been introduced above, this will not be repeated here；
Final optimal execution plan is as shown in Figure 1：
As can be known from Fig. 1, the executive plan is with O1It is successively progressive for starting point；
O2It is multiplexed O by the pattern hierarchical relationship between expression formula1As a result, O3It is closed by the pattern level between expression formula
System has been multiplexed O2As a result, to obtain q9Result；
Operation O4It is multiplexed O by the hierarchy of 00operation relationship between expression formula2Result to obtain q10Result；
Operation O5It is multiplexed O by the hierarchy of 00operation relationship between expression formula4Result obtain q11Result；
Operation O6It is multiplexed O by the pattern hierarchical relationship between expression formula4Result obtained q12Result；
Operation O8It is multiplexed O by the pattern hierarchical relationship between expression formula7Result, operation O9Pass through the mould between expression formula
Formula hierarchical relationship has been multiplexed O8Result obtained q13Result；
Operation O13It is multiplexed O by the pattern hierarchical relationship between expression formula12And O3Result obtained q14Result；
Operation O10It is multiplexed O by the pattern hierarchical relationship between expression formula7Result obtained q15Result；
Concept hierarchy relationship between expression formula is multiplexed O10And O11As a result, can then obtain q16Result.
Multiple concurrent nested query expression formulas are divided by the hierarchical relationship of three dimensions, first carrying out can be by
The query expression of reuse or subexpression make its query result be reused between each concurrent inquiry, therebetween
The intermediate result of generation can also further be reused according to the hierarchical relationship of three dimensions, to progressive；Therefore,
When concurrent for multiple nested queries, all reuse possibilities are listed in advance, then opened wherein according to the operation estimated
The sum total of pin and communication overhead executes to select a kind of minimum possibility of expense synthesis, effectively avoids useless repetition
Operation, reduce multiple nested queries it is concurrent when workload.
Above-described is only the embodiment of the present invention, and the common sense such as well known concrete structure and characteristic are not made herein in scheme
Excessive description, technical field that the present invention belongs to is all before one skilled in the art know the applying date or priority date
Ordinary technical knowledge can know the prior art all in the field, and with using routine experiment hand before the date
The ability of section, one skilled in the art can improve in conjunction with self-ability and implement under the enlightenment that the application provides
This programme, some typical known features or known method should not implement the application as one skilled in the art
Obstacle.It should be pointed out that for those skilled in the art, without departing from the structure of the invention, can also make
Go out several modifications and improvements, these should also be considered as protection scope of the present invention, these all do not interfere with the effect that the present invention is implemented
Fruit and patent practicability.The scope of protection required by this application should be based on the content of the claims, the tool in specification
The records such as body embodiment can be used for explaining the content of claim.
Claims (10)
1. the efficient nested querying method based on Complex event processing system, it is characterised in that：Including the following contents：
1) hierarchical relationship establishment stage, including：
Event inquired as needed itself establishes the concept hierarchy model between each event；
According to the concept hierarchy relationship between each nested event schema inquiry of the concept hierarchy model foundation between each event；
The pattern hierarchical structure between each nested event schema inquiry is established according to the query expression of each nested event schema inquiry
Relationship；
The hierarchy of 00operation structure between each nested event schema inquiry is established according to the query expression of each nested event schema inquiry
Relationship；
2) processing scheme establishment stage, including：
List the subexpression that in each nested event schema query expression and it is included, and choose one of those or it is more
It is a；The expression formula or subexpression being selected are located at the bottom in the concept hierarchy relationship in the event inquired,
And it is respectively positioned in pattern hierarchical relationship and hierarchy of 00operation structural relation top；
One is found out according to the query result for the expression formula or subexpression being selected according to concept hierarchy relationship, pattern level
Structural relation and the successively progressive relationship of hierarchy of 00operation structural relation calculate the execution meter of each nested event schema inquiry
It draws；
3) processing stage, according to each nested event schema inquiry of the executive plan synchronization process.
2. the efficient nested querying method according to claim 1 based on Complex event processing system, it is characterised in that：
In the processing scheme establishment stage, the query result according to the expression formula or subexpression being selected is found out according to concept hierarchy
Structural relation, pattern hierarchical relationship and the successively progressive relationship of hierarchy of 00operation structural relation calculate each nested event
The all possible executive plan of pattern query；
Estimate that the communication overhead between the operation expense and operation and operation of each progressive step in each executive plan, selection are opened
The executive plan of summation minimum is sold as optimal execution plan；
In the processing stage, according to each nested event schema inquiry of the executive plan synchronization process.
3. the efficient nested querying method according to claim 2 based on Complex event processing system, it is characterised in that：Institute
It states operation expense and is equal to the data input expense of each progressive step plus data output expense.
4. the efficient nested querying method according to claim 3 based on Complex event processing system, it is characterised in that：With
REIndicate the quantity of event E in the unit interval, PEIndicate the selectance of single class predicate of all event E, TWpIndicate inquiry when
Between length of window, NEIndicate time constant TWpThe quantity of interior event E, i.e. RE×TWp×PE,
Then the data input expense of the progressive step and the prediction of data output expense are as follows：
Operation is SEQ (Ei, Ej) when then, data input expense
Data export expense
Operation is AND (Ei, Ej) when then, data input expense
Data export expense
Operation be SEQ (！Ei, Ej) when then, data input expense
Data export expense
Operation be AND (！Ei, Ej) when then, data input expense
Data export expense
WhereinThen indicate event EiAnd EjBetween implicit time predicate selectance, wherein EiTime of origin earlier than Ej；
Then indicate event EiAnd EjBetween multiclass predicate selectance, wherein EiTime of origin earlier than Ej。
5. the efficient nested querying method according to claim 2 based on Complex event processing system, it is characterised in that：Institute
State the network-induced delay that communication overhead is multiplied by the data flow equal to the input rate of the data flow of each progressive step.
6. the efficient nested querying method according to claim 5 based on Complex event processing system, it is characterised in that：It enables
λ(sC) indicate data flow SCInput rate, TWpIndicate the time window length of inquiry, NEIndicate time constant TWpInterior event E's
Quantity,Indicate then operation OhOperation expense, then λ (sC) prediction it is as follows：
7. the efficient nested querying method according to claim 1 based on Complex event processing system, it is characterised in that：Also
Include being ranked up from less to more according to the quantity of positive event included in each expression formula.
8. the efficient nested querying method according to claim 7 based on Complex event processing system, it is characterised in that：Just
Further according to the concept hierarchy relationship between these expression formulas between the inquiry equal to the quantity of event, from lower layer to upper layer
It is ranked up.
9. the efficient nested querying method according to claim 8 based on Complex event processing system, it is characterised in that：Number
Measure between equal inquiry according between these expression formulas hierarchy of 00operation structural relation is ranked up from lower layer to upper layer.
10. the efficient nested querying method according to claim 1 based on Complex event processing system, it is characterised in that：
After estimating the communication overhead between the operation expense and operation and operation of each progressive step in each executive plan, utilize
Dijkstra's algorithm obtains optimal execution plan.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810065166.XA CN108304517A (en) | 2018-01-23 | 2018-01-23 | Efficient nested querying method based on Complex event processing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810065166.XA CN108304517A (en) | 2018-01-23 | 2018-01-23 | Efficient nested querying method based on Complex event processing system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108304517A true CN108304517A (en) | 2018-07-20 |
Family
ID=62866026
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810065166.XA Pending CN108304517A (en) | 2018-01-23 | 2018-01-23 | Efficient nested querying method based on Complex event processing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108304517A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109885588A (en) * | 2019-01-23 | 2019-06-14 | 齐鲁工业大学 | A kind of complex events detecting methods and system |
| CN110083626A (en) * | 2019-03-29 | 2019-08-02 | 北京奇安信科技有限公司 | Streaming events sequences match method and device |
| CN111984861A (en) * | 2020-07-30 | 2020-11-24 | 浙江邦盛科技有限公司 | Complex event processing method and system for time sequence data |
| CN112818003A (en) * | 2021-01-14 | 2021-05-18 | 内蒙古蒙商消费金融股份有限公司 | Execution risk estimation method and device for query task |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101334727A (en) * | 2008-07-17 | 2008-12-31 | 上海交通大学 | Service based synergic engine system |
| CN101739451A (en) * | 2009-12-03 | 2010-06-16 | 南京航空航天大学 | Joint query adaptive processing method for grid database |
| CN102289347A (en) * | 2010-06-15 | 2011-12-21 | 微软公司 | Indicating parallel operations with user-visible events |
| CN103189866A (en) * | 2010-09-17 | 2013-07-03 | 甲骨文国际公司 | Support for a parameterized query/view in complex event processing |
| CN103593721A (en) * | 2012-08-13 | 2014-02-19 | 中国商用飞机有限责任公司 | A method for monitoring a business flow based on complex event processing technology |
| CN103678589A (en) * | 2013-12-12 | 2014-03-26 | 用友软件股份有限公司 | Database kernel query optimization method based on equivalence class |
| US20140379690A1 (en) * | 2013-06-20 | 2014-12-25 | Oracle International Corporation | Transforming a query by eliminating a subquery |
| CN106446134A (en) * | 2016-09-20 | 2017-02-22 | 浙江大学 | Local multi-query optimization method based on predicate statutes and cost estimation |
| CN106599164A (en) * | 2010-09-17 | 2017-04-26 | 甲骨文国际公司 | Support for a parameterized query/view in complex event processing |
| US20170116064A1 (en) * | 2010-05-13 | 2017-04-27 | Microsoft Technology Licensing, Llc | Analysis stack for an event flow |
-
2018
- 2018-01-23 CN CN201810065166.XA patent/CN108304517A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101334727A (en) * | 2008-07-17 | 2008-12-31 | 上海交通大学 | Service based synergic engine system |
| CN101739451A (en) * | 2009-12-03 | 2010-06-16 | 南京航空航天大学 | Joint query adaptive processing method for grid database |
| US20170116064A1 (en) * | 2010-05-13 | 2017-04-27 | Microsoft Technology Licensing, Llc | Analysis stack for an event flow |
| CN102289347A (en) * | 2010-06-15 | 2011-12-21 | 微软公司 | Indicating parallel operations with user-visible events |
| CN103189866A (en) * | 2010-09-17 | 2013-07-03 | 甲骨文国际公司 | Support for a parameterized query/view in complex event processing |
| CN106599164A (en) * | 2010-09-17 | 2017-04-26 | 甲骨文国际公司 | Support for a parameterized query/view in complex event processing |
| CN103593721A (en) * | 2012-08-13 | 2014-02-19 | 中国商用飞机有限责任公司 | A method for monitoring a business flow based on complex event processing technology |
| US20140379690A1 (en) * | 2013-06-20 | 2014-12-25 | Oracle International Corporation | Transforming a query by eliminating a subquery |
| CN103678589A (en) * | 2013-12-12 | 2014-03-26 | 用友软件股份有限公司 | Database kernel query optimization method based on equivalence class |
| CN106446134A (en) * | 2016-09-20 | 2017-02-22 | 浙江大学 | Local multi-query optimization method based on predicate statutes and cost estimation |
Non-Patent Citations (2)
| Title |
|---|
| FUYUAN XIAO.ETC: "Efficient processing of multiple nested event pattern queries over multi-dimensional event streams based on a triaxial hierarchical model", 《ARTIFICIALINTELLIGENCEINMEDICINE》 * |
| 刘红蕾等: "面向时间不确定事件流的嵌套查询处理技术", 《计算机学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109885588A (en) * | 2019-01-23 | 2019-06-14 | 齐鲁工业大学 | A kind of complex events detecting methods and system |
| CN110083626A (en) * | 2019-03-29 | 2019-08-02 | 北京奇安信科技有限公司 | Streaming events sequences match method and device |
| CN111984861A (en) * | 2020-07-30 | 2020-11-24 | 浙江邦盛科技有限公司 | Complex event processing method and system for time sequence data |
| CN111984861B (en) * | 2020-07-30 | 2022-10-11 | 浙江邦盛科技股份有限公司 | Complex event processing method and system for time sequence data |
| CN112818003A (en) * | 2021-01-14 | 2021-05-18 | 内蒙古蒙商消费金融股份有限公司 | Execution risk estimation method and device for query task |
| CN112818003B (en) * | 2021-01-14 | 2023-03-31 | 内蒙古蒙商消费金融股份有限公司 | Execution risk estimation method and device for query task |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108304517A (en) | Efficient nested querying method based on Complex event processing system | |
| CN102364447B (en) | Operation scheduling method for optimizing communication energy consumption among multiple tasks | |
| CN108052394A (en) | The method and computer equipment of resource allocation based on SQL statement run time | |
| CN109978474A (en) | A kind of Work-flow control method and Work-flow control device | |
| CN104166903B (en) | Mission planning method and system based on process division | |
| JP2012510687A5 (en) | ||
| CN101320329A (en) | Preemptive manpower resource collocation method and system based on task priority | |
| CN104834754A (en) | SPARQL semantic data query optimization method based on connection cost | |
| CN103699696A (en) | Data online gathering method in cloud computing environment | |
| CN110858506A (en) | Automatic scheduling method, device, equipment and computer storage medium | |
| Lin et al. | Artificial bee colony algorithms for the order scheduling with release dates | |
| CN108460052A (en) | A kind of method, apparatus and Database Systems automatically creating index | |
| CN102129457A (en) | Method for inquiring large-scale semantic data paths | |
| US20070094214A1 (en) | Parallelization of bayesian network structure learning | |
| JP2015106219A (en) | Distributed data virtualization system, query processing method and query processing program | |
| Li et al. | A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots | |
| Meisen et al. | Adaptive information integration: Bridging the semantic gap between numerical simulations | |
| CN113065734A (en) | Index system-based decision tree construction method, system, equipment and storage medium | |
| CN106779150A (en) | A kind of view physical chemistry method of extensive knowledge mapping pahtfinder hard inquiry | |
| US20150347507A1 (en) | Hierarchical query plans in an elastic parallel database management system | |
| CN113222431B (en) | Design resource replacement method for operation planning stage | |
| CN109344463A (en) | The two stages dispatching method of electronic product stress cloud emulation platform | |
| CN108804378A (en) | A kind of And Methods of Computer Date Processing and system | |
| Tarun et al. | An optimized cost-based data allocation model for heterogeneous distributed computing systems. | |
| CN102646057A (en) | Compound event responding method and system facing to real-time sensing environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180720 |