CN102096658A - Tree complex event processing process-based operator internal processing system - Google Patents
Tree complex event processing process-based operator internal processing system Download PDFInfo
- Publication number
- CN102096658A CN102096658A CN2011100412915A CN201110041291A CN102096658A CN 102096658 A CN102096658 A CN 102096658A CN 2011100412915 A CN2011100412915 A CN 2011100412915A CN 201110041291 A CN201110041291 A CN 201110041291A CN 102096658 A CN102096658 A CN 102096658A
- Authority
- CN
- China
- Prior art keywords
- event
- type
- sjl
- stream
- time
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a tree complex event processing process-based operator internal processing system. The operator internal processing system comprises an output stream customization module, an event matching judgment module and an event composite module, wherein the output stream customization module processes through a Hash function after summating according to an operator semantic input event stream and an operator semantic identifier character string, and obtains and outputs a customization-event stream type SJL10; the event matching judgment module sequentially performs type constraint, time constraint and predicate constraint on a customization-event stream type MD10 to obtain and output a matching event stream type SJL20; and the event composite module respectively extracts the current start time, the current end time and all predicates of the received matching event stream type SJL20, and obtains and outputs a composite event stream SJL30. The throughput of a tree model-based complex event processing engine after optimizing is 3 to 6 times that of an open source engine Esper realized based on non-deterministic finite automaton (NFA); and the performance is stable under different event volumes or event sequence complexities.
Description
Technical field
The present invention relates to a kind of description of operator in complicated event is handled, particularly, is a kind of describing method at operator internal processes in the complicated event processing procedure of tree structure.
Background technology
Complicated event is handled (Complex Event Processing, CEP) be a kind of emerging event processing, it regards system data as various types of incidents, by the incidence relation between the analysis incident, set up different event relation sequences, and utilize technology such as filtration, association, polymerization, finally produce complicated event by simple event.Its target is to use the flow of event at all levels from software systems to obtain information, understands the influence of these information to tension management target and business procedure, and makes real-time response.
The key problem of complicated event treatment technology is the method for mode matching of flow of event, and correlative study comprises: NFA, Petri net, coupling tree and digraph model etc.
NFA is configured to automat with a complicated event expression formula, and incident arrives the state transition will trigger automat, and automat enters receptive phase and shows and detect a complicated event example that satisfies condition.
The Petri net is a kind of system model that is suitable for describing asynchronous concurrent phenomenon, it constructs its corresponding Petri net example according to the complicated event expression formula, with Petri net input node is elementary event, the complicated event of output node for detecting, by the input token, calculate the transition function, if set up then produce transition and mark node herein, when last node is labeled out, illustrate to produce the complicated event example that satisfies condition.
The basic thought of coupling tree is to construct corresponding identification tree by the complicated event expression formula, and wherein elementary event is the leaf node of tree, and complicated event at all levels is the intermediate node of tree, if arrive root node, just thinks to have detected a complicated event.
Handle by complicated event expression formula structure directed acyclic graph based on the complicated event of digraph, node is described incident, and the limit is the incident composition rule, and node is quoted incident and carried out mark.Outside the flash trimming, node also has some rules, as: parameter condition restriction etc.After all nodes all were labeled, corresponding complicated event example was also detected.
The method for mode matching that existing complicated event is handled respectively has relative merits, NFA is simple, easy to understand and realization, but just recall matching status when having only the end-state of arrival, simultaneously because the restriction of himself structure, negate to have deficiency aspect operator (operator is the symbol of a kind of computing to function of expression) and the concurrent event expressing; The Petri net is powerful, but expresses and the execution more complicated, is difficult to support complicated judgement; Digraph and coupling tree have reduced part intermediate result, but how to make full use of intermediate node, look for optimum building mode and abundant semanteme is still waited to study.
Summary of the invention
Be the high efficiency that is implemented in tree structure complicated event identifying and good extensibility, the present invention proposes a kind of general construction and describing method of tree-like identification operator.This building method based on the concept definition of incident and flow of event between the incident and the compound operation between the flow of event, by the coupling decision function, compound computing function and stream mode computing function have been realized the every function of the basic operator of dendrimer complex event handling.By method of the present invention, in the realization and expansion process of dendrimer complex event handling, realized the de of the incidence relation of all kinds of about interfasciculars, carry out no longer needing to consider in the building process incidence relation of higher level's operator at each operator, so the method can pervasively be used for the general construction and the describing method of tree-like identification operator.
Of the present invention a kind of based on operator inter-process system in the dendrimer complex event handler procedure, this operator inter-process system includes output stream customized module (10), event matches determination module (20) and incident composite module (30);
Described output stream customized module (10) is handled by Boolean expression according to semantic incoming event stream of operator and the semantic indications character string summation of this operator back, obtains customization-flow of event type SJL
10Output;
Customization-flow of event type the MD of described event matches determination module (20) to receiving
10Carry out the judgement of type constraint, time-constrain and predicate constraint in turn, obtain match event stream SJL
20Output;
The match event stream SJL of described incident composite module (30) to receiving
20Carry out current zero-time, current concluding time, all predicate extraction processing respectively, obtain compound event stream SJL
30Output.Compound event stream SJL
30In include the shortest time-match event stream SJL
301, maximum duration-match event stream SJL
302And predicate-match event stream SJL
303
The present invention is based on the advantage of the operator inter-process system in the dendrimer complex event handling unit:
1. adopt the general construction operator inter-process system of tree-like identification operator, better have can with the property and extensibility.
2. building method of the present invention based on the concept definition of incident and flow of event between the incident and the compound operation between the flow of event, by the coupling decision function, compound computing function and stream mode computing function have been realized the every function of the basic operator of dendrimer complex event handling.
3. building method of the present invention in the realization and expansion process of dendrimer complex event handling, has been realized the de of the incidence relation of all kinds of about interfasciculars, carries out no longer needing to consider in the building process incidence relation of higher level's operator at each operator.
4. the present invention's complicated event processing engine throughput after optimization of being based on tree-model is based on 3～6 times of the engine Esper that increases income that NFA realizes, and the performance performance is stable under different event amount or sequence of events complexity.
Description of drawings
Fig. 1 is the operator data flow structural drawing that the present invention is based in the dendrimer complex event handling unit.
Embodiment
Be the high efficiency that is implemented in tree structure complicated event identifying and good extensibility, the present invention proposes a kind of general construction and describing method of tree-like identification operator.This building method based on the concept definition of incident and flow of event between the incident and the compound operation between the flow of event, by the coupling decision function, compound computing function and stream mode computing function have been realized the every function of the basic operator of dendrimer complex event handling.By method of the present invention, in the realization and expansion process of dendrimer complex event handling, realized the de of the incidence relation of all kinds of about interfasciculars, carry out no longer needing to consider in the building process incidence relation of higher level's operator at each operator, so the method can pervasively be used for the general construction and the describing method of tree-like identification operator.
A kind of construction method of the present invention based on dendrimer complex event handling unit, its structure to processing unit is divided into three phases:
Phase one is the preparatory stage, and latter two stage is the operation phase.
Phase one is the output stream customized module, and this output stream customized module is used for that operator semanteme to the output of initialized network system carries out the type of flow of event, the state of flow of event defines.
The type of outgoing event stream is obtained by incoming event stream and this operator type hash of this operator semanteme, and the attribute of outgoing event stream is then had nothing in common with each other according to the algorithms of different of operator semantic type.
Subordinate phase is the event matches decision stage, be with the incident (described incident comprises event type attribute, incident start time attribute, incident concluding time attribute and incident predicate attribute) of the operator semanteme of each input and the outgoing event stream mode of phase one acquisition, bring the operator semanteme into and be endowed time series constraint condition expression formula and predicate constraint condition expression formula, thereby the event group that satisfies whole expression formulas is delivered to the phase III packaged.
Phase III is the compound calculation stages of incident, after receiving the packing incident that satisfies all constraint condition expression formulas, illustrates that these group data can be combined into new events in this operator semanteme.The zero-time of new events is by choosing the zero-time minimum value in the packing incident, the concluding time of new events, maximum value obtained in the End Event by choosing in the packing incident, and the predicate community set of new events then is the conjunction of the predicate community set of the incident in the packing incident.The type of new events then equates with the type of phase one output stream definition.
In the present invention, incident is meant any one data, is designated as e=＜startTime, endTime, attrs 〉; Wherein, the zero-time of startTime presentation of events; The concluding time of endTime presentation of events; The attribute of attrs presentation of events.
Described incident can be the packet of propagating on the network, a class, an xml file; Described incident can be regarded the description of an incident as, and its entrained data are the attribute of incident.
In the present invention, flow of event is meant that incident of the same type is a flow of event according to the tactic set of time order and function, is designated as E=＜type, states, values 〉;
Wherein, the state of states presentation of events stream;
The type of type presentation of events stream can be a character string, satisfy for
And if only if E
1.type ≠ E
2During type, claim E
1, E
2Be that two different flows of event (are E
1Also can be called first flow of event, E
2Also can be called second flow of event);
Values is a set, characterizes the event sets E.values={e among the flow of event E
1, e
2, e
3..., e
m, e
mRepresent any one incident in this flow of event, i.e. incident e among the flow of event E
mAll satisfy e
m∈ E.
In the present invention, the operator semanteme is meant for random event stream E
1, E
2, E
3..., E
nNewly-generated flow of event E
NewAnd mapping relations S=＜Q, F, Z 〉; Wherein, mapping relations S=＜Q, F, Z〉be the function of functions of flow of event, or be called an operator, and Q represents the coupling decision function in the operator, and F represents the compound computing function of the incident in the operator, and Z represents the flow of event state computation function in the operator.
In the present invention, new events stream E
NewBy flow of event E
1, E
2, E
3..., E
nBe composited.E
nBe called any one flow of event.
In the present invention, temporal constraint TimeQuery is used to describe querying condition requirement incident e=＜startTime, endTime, attrs〉the conditional expression TimeQuery (e that should satisfy in time
1.startTime, e
1.endTime, e
2.startTime, e
2.endTime ..., e
m.startTime, e
m.endTime) (abbreviate temporal constraint condition TimeQuery as).
When satisfying this temporal constraint condition TimeQuery, claim this group incident to satisfy the demand of querying condition on sequential.
e
1.startTime, e
1.endTime represent first incident e
1Zero-time startTime and concluding time endTime.
e
2.startTime, e
2.endTime represent second incident e
2Zero-time startTime and concluding time endTime.
e
m.startTime, e
m.endTime represent m incident e
mThe zero-time startTime of (being also referred to as any one incident) and concluding time endTime.
In the present invention, predicate constraint is used to describe querying condition requirement incident e=＜startTime, endTime, attrs〉the conditional expression WhereQuery=(e that on himself attribute, should satisfy
1.attrs, e
2.attrs ..., e
m.attrs) (abbreviate predicate constraint condition WhereQuery as).
When satisfying this predicate constraint condition WhereQuery, claim this group incident to satisfy the demand of querying condition on sequential.
In the present invention, then be a Boolean expression that is formed by connecting by and and or for each predicate constraint condition WhereQuery, the form in event handling is:
WhereQuery::＝WE{and?WE}
*
WE::＝W?or?W
W::＝BoolExpression(e
1.attrs，e
2.attrs，…，e
m.attrs)
W is a Boolean expression BoolExpression relevant with event attribute, the attribute of attrs presentation of events, WE is a constraint condition (abbreviating or retrain WE as) that connects through or, and the predicate constraint has indicated the constraint condition that output sequence should satisfy, wherein all incident e that relate to
mAffiliated flow of event E
nSet be called the flow of event that the constraint of this predicate relates to, be labeled as ER
WhereQuery, the flow of event that each WE relates to then is ER
WE
Referring to shown in Figure 1, in the present invention, a kind ofly include output stream customized module 10, event matches determination module 20 and incident composite module 30 based on operator inter-process system in the dendrimer complex event handling unit; Wherein output stream customized module 10 includes output stream type customization units 101 and predicate condition allocation units 102; Event matches determination module 20 includes data type coupling identifying unit 201, time-constrain coupling identifying unit 202, predicate constraint coupling identifying unit 203; Incident composite module 30 includes zero-time computing unit 301, concluding time computing unit 302, predicate property calculation unit 303.
Output stream customized module 10 is handled by Boolean expression according to semantic incoming event stream of operator and the semantic indications character string summation of this operator back, obtains customization-flow of event type SJL
10Output;
The customization that 20 pairs of event matches determination modules receive-flow of event type MD
10Carry out the judgement of type constraint, time-constrain and predicate constraint in turn, obtain match event stream SJL
20Output;
The match event stream SJL that 30 pairs of incident composite modules receive
20Carry out current zero-time, current concluding time, all predicate extraction processing respectively, obtain compound event stream SJL
30Output, i.e. complicated event.
To the function that each unit is realized be described in detail below:
(1) output stream type customization units 101
Output stream type customization units 101 is on the one hand to the semantic S (E of each operator that receives
1, E
2..., E
n) (E
1, E
2..., E
nExpression is input to the flow of event of this operator, also is data stream) carry out the indications mark, promptly indications is expressed as S.type, and the semantic incoming event stream of this operator is designated as E
1, E
2..., E
n, then the type of flow of event is designated as E.Type=Hash{StringAdd (E
1.Type, E
2.Type ..., E
n.Type, S.type}; On the other hand according to the predicate constraint condition WhereQuery of predicate condition allocation units 102 output to flow of event type E.Type=Hash{StringAdd (E
1.Type, E
2.Type ..., E
n.Type, S.type} handles, and obtains being assigned to the semantic S (E of the operator that is received
1, E
2..., E
n) on customization-flow of event type SJL
10
StringAdd represents the character string addition function.
E
1.Type the type of representing first flow of event.
E
2.Type the type of representing second flow of event.
E
n.Type the type of representing n flow of event.
In the present invention, customization-flow of event type SJL
10In include at least or retrain WE.
(2) predicate condition allocation units 102
Predicate condition allocation units 102 are given output stream type customization units 101 according to Boolean expression outer predicate constraint condition WhereQuery.
In the present invention, then be a Boolean expression that is formed by connecting by and and or for each predicate constraint condition WhereQuery, the form in event processing is:
WhereQuery::＝WE{and?WE}
*
WE::＝W?or?W
W::＝BoolExpression(e
1.attrs，e
2.attrs，…，e
m.attrs)
W is a Boolean expression BoolExpression relevant with event attribute, the attribute of attrs presentation of events, WE is a constraint condition (abbreviating or retrain WE as) that connects through or, and the predicate constraint has indicated the constraint condition that output sequence should satisfy, wherein all incident e that relate to
mAffiliated flow of event E
nSet be called the flow of event that the constraint of this predicate relates to, be labeled as ER
WhereQuery, the flow of event that each WE relates to then is ER
WE
(3) data type coupling identifying unit 201
Customization-flow of event type SJL that 201 pairs of identifying units of data type coupling receive
10Carry out data type and judge E.Type=E
1.Type or E
n.Type=E
2.Type; Judge E.Type=E if satisfy this data type
1.Type or E
n.Type=E
2.Type then obtain type-customization-flow of event SJL
201, the type-customization then-flow of event SJL
201Entry time constraint coupling identifying unit 202 is handled; If do not satisfy and then abandon described customization-flow of event type SJL
10, just abandon the semantic S (E of operator
1, E
2..., E
n).
(4) time-constrain coupling identifying unit 202
At different operator semantemes (i.e. customization-flow of event type SJL
10), the mode on the time-constrain coupling is judged is different fully.To entering into the type-customization-flow of event SJL of this time-constrain coupling identifying unit 202
201Be with SJL
201In the time attribute of incident, i.e. zero-time startTime, concluding time endTime is loaded on temporal constraint condition TimeQuery (e
1.startTime, e
1.endTime, e
2.startTime, e
2.endTime ..., e
m.startTime, e
m.endTime) in, then obtain time-customization-flow of event SJL if satisfy
202, then should time-customization-flow of event SJL
202To enter predicate constraint coupling identifying unit 203 handles; If do not satisfy and then abandon type-customization-flow of event SJL
201, just abandon customization-flow of event type SJL
10
(5) predicate constraint coupling identifying unit 203
To entering into the time-customization-flow of event SJL of this predicate constraint coupling identifying unit 203
202, be with SJL
202In event attribute attrs be loaded on WhereQuery=(e
1.attrs, e
2.attrs ..., e
m.attrs) in, then obtain predicate-customization-flow of event SJL if satisfy
203(be match event stream SJL
20), this match event flows SJL then
20To enter incident composite module 30 handles; If do not satisfy and then abandon time-customization-flow of event SJL
202, just abandon customization-flow of event type SJL
10
(6) the zero-time computing unit 301
The match event stream SJL that 301 pairs of zero-time computing units receive
20Carry out the zero-time reckling and extract, obtain the shortest time-match event stream SJL
301
In the present invention, the match event stream SJL after zero-time computing unit 301 is handled
20The middle minimum zero-time that obtains will be as described match event stream SJL
20Current zero-time.
(7) concluding time computing unit 302
The match event stream SJL that 302 pairs of concluding time computing units receive
20Carry out concluding time the maximum and extract, obtain maximum duration-match event stream SJL
302
In the present invention, the match event stream SJL after concluding time computing unit 302 is handled
20The middle maximum concluding time that obtains will be as described match event stream SJL
20The current concluding time.
(8) predicate property calculation unit 303
The match event stream SJL that 303 pairs of predicate property calculation unit receive
20Carry out whole predicate e of comprising in the operator semanteme
New.attrs={e
1.attrs}+{e
2.attrs}+ ..., { e
m.attrs} extract, obtain predicate-match event stream SJL
303, promptly compound event flows SJL
30
In the present invention, compound event stream SJL
30In include the shortest time-match event stream SJL
301, maximum duration-match event stream SJL
302And predicate-match event stream SJL
303
(9) performance evaluation
The present invention is realizing the flow of event engine based on Java language, adopts PM-Tree to carry out complicated event and detects, and size of code 26640 row (LOC), wherein, identification tree partial code 6182 row (LOC); Other code 20458 row (LOC) comprising: syntax parsing, event adapter realization etc.
The experimental machine device is IBM blade server HS21,8 nuclear Intel (R) Xeon (R) CPU E5405 @2.00GHz CPU, 8G internal memory, 132GB SCSI hard disk, operating system CentOS5.2, kernel are 2.6.18-164.11.1.el5xen #1 SMP, and the JDK version is 1.6.0_01-b06.
Demonstration influences the principal element of flow of event engine performance by experiment, and optimizes its operational efficiency.It is as shown in table 1 at first to arrange several predicate constraints:
| The predicate constraint name | WE 1 | WE 2 | WE 3 | WE 4 | WE 5 | WE 6 |
| The dependent event type | A，B | A，B | A，B | B，C | C，D | B，D |
| Pass through probability | 1/2 | 1/4 | 1/8 | 1/2 | 1/4 | 1/12 |
Be optimized referring to structure shown in Figure 1, when an operator semanteme has a plurality of constraint condition, should judge earlier by the low constraint condition of probability.A, B, C, D are the event type of input, and its attribute all evenly distributes at-100～100, for WhereQuery=WE
1And WE
2And WE
3, under the condition of 10000A * 10000B group data, will produce 10
8The bar matched data, the system that records elapsed time under the situation that different constraint condition is placed is as shown in table 2:
| Label | Judge sequencing | 10 8Bar matched data elapsed time (ms) |
| 1 | WE 3、WE 2、WE 1 | 96595 |
| 2 | WE 3、WE 1、WE 2 | 97750 |
| 3 | WE 2、WE 3、WE 1 | 98823 |
| 4 | WE 2、WE 1、WE 3 | 101256 |
| 5 | WE 1、WE 3、WE 2 | 107823 |
| 6 | WE 1、WE 2、WE 3 | 111057 |
Obviously as seen contrast table 1 and table 2 judge after more and more leaning on by the low constraint condition of probability that system is consuming time to rise gradually, and at WE
1, WE
2, WE
3Order the time reach maximum, and optimize conclusion and conform to.Particularly, WE
1By probability is 1/2, WE
2By probability is 1/4, WE
3By probability is 1/8.
Under the same test condition, the complicated event processing engine throughput after optimization that is based on tree-model by the present invention is based on 3～6 times of the engine Esper that increases income that NFA realizes, and the performance performance is stable under different event amount or sequence of events complexity.
Claims (8)
1. one kind based on operator inter-process system in the dendrimer complex event handler procedure, and it is characterized in that: this operator inter-process system includes output stream customized module (10), event matches determination module (20) and incident composite module (30);
Described output stream customized module (10) is handled by Boolean expression according to semantic incoming event stream of operator and the semantic indications character string summation of this operator back, obtains customization-flow of event type SJL
10Output;
Customization-flow of event type the MD of described event matches determination module (20) to receiving
10Carry out the judgement of type constraint, time-constrain and predicate constraint in turn, obtain match event stream SJL
20Output;
The match event stream SJL of described incident composite module (30) to receiving
20Carry out current zero-time, current concluding time, all predicate extraction processing respectively, obtain compound event stream SJL
30Output.
2. according to claim 1 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: described output stream customized module (10) includes output stream type customization units (101) and predicate condition allocation units (102);
Predicate condition allocation units (102) are given output stream type customization units (101) according to Boolean expression outer predicate constraint condition WhereQuery;
Output stream type customization units (101) is on the one hand to the semantic S (E of each operator that receives
1, E
2..., E
n) carry out the indications mark, promptly indications is expressed as S.type, and the semantic incoming event stream of this operator is designated as E
1, E
2..., E
n, then the type of flow of event is designated as E.Type=Hash{StringAdd (E
1.Type, E
2.Type ..., E
n.Type, S.type}; On the other hand according to the predicate constraint condition WhereQuery of predicate condition allocation units (102) output to flow of event type E.Type=Hash{StringAdd (E
1.Type, E
2.Type ..., E
n.Type, S.type} handles, and obtains being assigned to the semantic S (E of the operator that is received
1, E
2..., E
n) on customization-flow of event type SJL
10
3. according to claim 2 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: for each predicate constraint condition WhereQuery then is a Boolean expression that is formed by connecting by and and or, and the form in event processing is:
WhereQuery::＝WE{and?WE}
*
WE::＝W?or?W
W::＝BoolExpression(e
1.attrs，e
2.attrs，…，e
m.attrs)
W is a Boolean expression relevant with event attribute;
WE is a constraint condition that connects through or.
4. according to claim 1 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: described event matches determination module (20) includes data type coupling identifying unit (201), time-constrain coupling identifying unit (202), predicate constraint coupling identifying unit (203);
Customization-flow of event type the SJL of data type coupling identifying unit (201) to receiving
10Carry out data type and judge E.Type=E
1.Type or E
n.Type=E
2.Type; Judge E.Type=E if satisfy this data type
1.Type or E
n.Type=E
2.Type then obtain type-customization-flow of event SJL
201, the type-customization then-flow of event SJL
201Entry time constraint coupling identifying unit (202) is handled; If do not satisfy and then abandon described customization-flow of event type SJL
10
To entering into the type-customization-flow of event SJL of this time-constrain coupling identifying unit (202)
201Be with SJL
201In the time attribute of incident, i.e. zero-time startTime, concluding time endTime is loaded on temporal constraint condition TimeQuery (e
1.startTime, e
1.endTime, e
2.startTime, e
2.endTime ..., e
m.startTime, e
m.endTime) in, then obtain time-customization-flow of event SJL if satisfy
202, then should time-customization-flow of event SJL
202To enter predicate constraint coupling identifying unit (203) handles; If do not satisfy and then abandon type-customization-flow of event SJL
201
To entering into the time-customization-flow of event SJL of this predicate constraint coupling identifying unit (203)
202, be with SJL
202In event attribute attrs be loaded on WhereQuery=(e
1.attrs, e
2.attrs ..., e
m.attrs) in, obtain, then this match event stream SJL if satisfy then
20To enter incident composite module (30) handles; If do not satisfy and then abandon time-customization-flow of event SJL
202, just abandon customization-flow of event type SJL
10
5. according to claim 1 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: described incident composite module (30) includes zero-time computing unit (301), concluding time computing unit (302), predicate property calculation unit (303);
The match event stream SJL of zero-time computing unit (301) to receiving
20Carry out the zero-time reckling and extract, obtain the shortest time-match event stream SJL
301
The match event stream SJL of concluding time computing unit (302) to receiving
20Carry out concluding time the maximum and extract, obtain maximum duration-match event stream SJL
302
The match event stream SJL of predicate property calculation unit (303) to receiving
20Carry out whole predicate e of comprising in the operator semanteme
New.attrs={e
1.attrs}+{e
2.attrs}+ ..., { e
m.attrs} extract, obtain predicate-match event stream SJL
303
6. according to claim 5 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: the match event stream SJL after zero-time computing unit (301) is handled
20The middle minimum zero-time that obtains will be as described match event stream SJL
20Current zero-time.
7. according to claim 5 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: the match event stream SJL after concluding time computing unit (302) is handled
20The middle maximum concluding time that obtains will be as described match event stream SJL
20The current concluding time.
8. according to claim 1 or 5 based on operator inter-process system in the dendrimer complex event handler procedure, it is characterized in that: compound event stream SJL
30In include the shortest time-match event stream SJL
301, maximum duration-match event stream SJL
302And predicate-match event stream SJL
303
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100412915A CN102096658A (en) | 2011-02-21 | 2011-02-21 | Tree complex event processing process-based operator internal processing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100412915A CN102096658A (en) | 2011-02-21 | 2011-02-21 | Tree complex event processing process-based operator internal processing system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102096658A true CN102096658A (en) | 2011-06-15 |
Family
ID=44129756
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100412915A Pending CN102096658A (en) | 2011-02-21 | 2011-02-21 | Tree complex event processing process-based operator internal processing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102096658A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102929968A (en) * | 2012-10-12 | 2013-02-13 | 易程科技股份有限公司 | Method and device for configuring event processing engine |
| CN103745130A (en) * | 2014-01-27 | 2014-04-23 | 东北大学 | Predicting method for multi-attribute event under environment of wireless sensor |
| CN104933298A (en) * | 2015-06-01 | 2015-09-23 | 广东工业大学 | Multi-tuple complex event combination method oriented to cyber-physical system |
| CN106960271A (en) * | 2016-02-29 | 2017-07-18 | 艾威梯科技(北京)有限公司 | One kind cooperates and method of quality control and system |
| 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 |
| CN112364290A (en) * | 2020-11-18 | 2021-02-12 | 中睿信数字技术有限公司 | Method and system for constructing visual calculation model based on stream-oriented calculation |
| CN112613317A (en) * | 2020-12-30 | 2021-04-06 | 中国农业银行股份有限公司 | Text data cleaning method and device |
| CN112712125A (en) * | 2020-12-31 | 2021-04-27 | 山石网科通信技术股份有限公司 | Event stream pattern matching method and device, storage medium and processor |
-
2011
- 2011-02-21 CN CN2011100412915A patent/CN102096658A/en active Pending
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102929968B (en) * | 2012-10-12 | 2015-09-16 | 易程科技股份有限公司 | The method and apparatus of configuration event processing engine |
| CN102929968A (en) * | 2012-10-12 | 2013-02-13 | 易程科技股份有限公司 | Method and device for configuring event processing engine |
| CN103745130A (en) * | 2014-01-27 | 2014-04-23 | 东北大学 | Predicting method for multi-attribute event under environment of wireless sensor |
| CN103745130B (en) * | 2014-01-27 | 2016-11-23 | 东北大学 | The Forecasting Methodology of many attribute events under wireless senser environment |
| CN104933298A (en) * | 2015-06-01 | 2015-09-23 | 广东工业大学 | Multi-tuple complex event combination method oriented to cyber-physical system |
| CN109886610A (en) * | 2016-02-29 | 2019-06-14 | 飞救医疗科技（北京）有限公司 | It is a kind of to cooperate and method of quality control and system |
| CN106960271A (en) * | 2016-02-29 | 2017-07-18 | 艾威梯科技(北京)有限公司 | One kind cooperates and method of quality control and system |
| 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 |
| CN112364290A (en) * | 2020-11-18 | 2021-02-12 | 中睿信数字技术有限公司 | Method and system for constructing visual calculation model based on stream-oriented calculation |
| CN112613317A (en) * | 2020-12-30 | 2021-04-06 | 中国农业银行股份有限公司 | Text data cleaning method and device |
| CN112613317B (en) * | 2020-12-30 | 2023-12-08 | 中国农业银行股份有限公司 | Text data cleaning method and device |
| CN112712125A (en) * | 2020-12-31 | 2021-04-27 | 山石网科通信技术股份有限公司 | Event stream pattern matching method and device, storage medium and processor |
| CN112712125B (en) * | 2020-12-31 | 2022-09-06 | 山石网科通信技术股份有限公司 | Event stream pattern matching method and device, storage medium and processor |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102096658A (en) | Tree complex event processing process-based operator internal processing system | |
| Ferreira et al. | Approaching process mining with sequence clustering: Experiments and findings | |
| Becker et al. | A comparative survey of business process similarity measures | |
| US9558299B2 (en) | Submatch extraction | |
| Schultz-Møller et al. | Distributed complex event processing with query rewriting | |
| CN110134584A (en) | A kind of generation method, device, storage medium and the server of interface testing use-case | |
| CN110019876B (en) | Data query method, electronic device and storage medium | |
| CN106062751A (en) | Managing data profiling operations related to data type | |
| CN103593721B (en) | Business process monitoring method based on Complex event processing | |
| CN109871208A (en) | Software systems generation method, device, computer readable storage medium and server | |
| Wang et al. | Ant colony optimization for feature selection in software product lines | |
| US7472130B2 (en) | Select indexing in merged inverse query evaluations | |
| CN111930366A (en) | Rule engine implementation method and system based on JIT real-time compilation | |
| CN110210506A (en) | Characteristic processing method, apparatus and computer equipment based on big data | |
| Komuravelli et al. | Learning probabilistic systems from tree samples | |
| WO2012088761A1 (en) | Data analysis-based security information exchange monitoring system and method | |
| US9665538B2 (en) | Solving satisfiability problems through search | |
| CN102629352B (en) | Towards compound event method for mode matching and the system of real-time perception environment | |
| Roudjane et al. | Predictive analytics for event stream processing | |
| CN101771675B (en) | Method and device for implementing feature matching of data packet | |
| CN110188432A (en) | Verification method, electronic equipment and the computer readable storage medium of system architecture | |
| Mao et al. | Complex Event Processing on uncertain data streams in product manufacturing process | |
| Calvanese et al. | A practical automata-based technique for reasoning in expressive description logics | |
| Getir et al. | State Elimination as Model Transformation Problem. | |
| Wang et al. | High-performance complex event processing for large-scale RFID applications |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110615 |