CN102270140A - Time-constrained Web service flow mining method - Google Patents

Time-constrained Web service flow mining method Download PDF

Info

Publication number
CN102270140A
CN102270140A CN2011102356642A CN201110235664A CN102270140A CN 102270140 A CN102270140 A CN 102270140A CN 2011102356642 A CN2011102356642 A CN 2011102356642A CN 201110235664 A CN201110235664 A CN 201110235664A CN 102270140 A CN102270140 A CN 102270140A
Authority
CN
China
Prior art keywords
web service
service flow
time
flow chart
chart description
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.)
Granted
Application number
CN2011102356642A
Other languages
Chinese (zh)
Other versions
CN102270140B (en
Inventor
马应龙
阎光伟
张金龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
North China Electric Power University
Original Assignee
North China Electric Power University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by North China Electric Power University filed Critical North China Electric Power University
Priority to CN 201110235664 priority Critical patent/CN102270140B/en
Publication of CN102270140A publication Critical patent/CN102270140A/en
Application granted granted Critical
Publication of CN102270140B publication Critical patent/CN102270140B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a time-constrained Web service flow mining method in the technical field of Web service flow mining. The method comprises the steps of first establishing graphic descriptions of time-constrained Web service flows for all the candidate Web service flows and requested Web service flows in a Web flow library; subsequently, calculating task compatibility values between the candidate Web service flows and the requested Web service flows; afterwards, respectively establishing a standardized matrix for the graphic description of one of the requested Web service flows and the graphic description of each candidate Web service flow which is compatible in task with the requested Web service flow, and calculating a difference value between the graphic description of the requested Web service flow and the graphic description of each candidate Web service flow which is compatible in task with the requested Web service flow; and finally, selecting the graphic description of the candidate Web service flow which has the minimum difference value with the graphic description of the requested Web service flow, and reusing the Web service flow corresponding to the graphic description in the Web flow library. The time-constrained Web service flow mining method can ensure that the mined service flow can meet the demand of a basic task requested by clients and the desired time-constrained demand of users.

Description

A kind of Web service digging flow method that is subjected to time-constrain
Technical field
The invention belongs to Web service digging flow technical field, relate in particular to a kind of Web service digging flow method that is subjected to time-constrain.
Background technology
Along with the continuous development of service-oriented architecture (Service Oriented Architecture is called for short SOA) and technology, Web service (Web Service) is being played the part of more and more important role in fields such as ecommerce, enterprise's application integration.Web service is the outside available distributed application program member by web access.By the combination technique of Web service, enterprise can be existing simple relatively Web service, by the synthetic Web service flow process of certain operation flow logical groups.Current enterprise is complicated and changeable in order to adapt to, the intense market competition demand, on the one hand, enterprise is when carrying out concrete Web service flow process, the invincible position could be stood on to satisfy desired service quality of corporate client and time-constrain requirement by enterprises all departments collaborative work as far as possible effectively in intense market competition.Therefore, enterprise often all is subjected to time-constrain at the various Web service flow processs that the different business demand is provided.Particularly like this for e-commerce venture.On the other hand, enterprise application system must be able to be realized operation flow as far as possible fast, neatly according to business demand, to save cost of serving, to increase the benefit.Therefore, enterprise need adopt the digging flow technology to find out the Web service flow process that can satisfy current up-to-date user's request from the existing Web service flow process that is subjected to time-constrain.By realizing the repeated use of Web service flow process, thereby save cost of serving as much as possible, realize the increment of Web service flow process.
The descriptive language that is used to describe the Web service flow process has BPEL4WS, WSFL, XLANG, WSCI, WSCL, BPML etc., and they have the grammer of XML language, and are close each other on descriptive power.In the past few years develop and designed many support Web service flow process system for modeling and method both at home and abroad.Wherein representative system comprises the eFlow system of HP development in laboratory and the SERV system of University of New South Wales's exploitation.The former supports patterned flow process modeling and dynamic Services Combination, latter's user mode figure modeling service procedure logic.Yet, main service procedure modeling, checking, emulation and the execution of paying close attention to based on workflow technology of current Web service flow process research and application, rather than the excavation of service procedure.The current tool and method that is used for digging flow, as ProM digging flow framework and DAGAMA flow process discovering tool, mainly can satisfy the client in order to ensure the service procedure of being excavated requires the basic task demand, but can not guarantee that the service procedure of being excavated can satisfy the demand of the desired efficient service of user, promptly satisfies the time-constrain demand of user expectation.For enterprises such as ecommerce with service quality and efficient basis for survival, the major issue that this needs to be resolved hurrily beyond doubt.
Summary of the invention
Can not satisfy user's deficiencies such as requirement at the present digging flow technology of mentioning in the above-mentioned background technology, the present invention proposes a kind of Web service digging flow method that is subjected to time-constrain.
Technical scheme of the present invention is that a kind of Web service digging flow method that is subjected to time-constrain is characterized in that this method may further comprise the steps:
Step 1: the figure that sets up the Web service flow process that is subjected to time-constrain for all Web service flow processs in the Web flow process storehouse and request Web service flow process describes;
Step 2: the task compatibility value of computation requests Web service flow chart description and each candidate's Web service flow chart description, when compatibility value during greater than assign thresholds, then both tasks are compatible;
Step 3: on the basis of step 2, be respectively the request Web service flow chart description and with it each compatible candidate's Web service flow chart description of task set up the standardization matrix;
Step 4: based on the standardization matrix, computation requests Web service flow chart description and the diversity factor value between compatible each the candidate's Web service flow chart description of task with it;
Step 5: based on the diversity factor value, select the candidate's Web service flow chart description with request Web service flow chart description diversity factor value minimum, and this figure is described in the Web flow process storehouse pairing Web service flow process reuses.
The figure of described Web service flow process describes and can determine that node is the Web service name in the service procedure by the set of node and the set on limit, and the limit is the directed edge of two band time-constrain marks between the node.
The computing formula of described task compatibility value is:
taskcomp ( R , Q i ) = | V R ∩ V Q i | | V R ∪ V Q i |
Wherein:
R is request Web service flow chart description;
Q iBe i candidate's Web service flow chart description;
Taskcomp (R, Q i) be R and Q iThe task compatibility value;
V RBe the node set that is comprised among the R;
Be Q iIn the node set that comprised.
The computing formula of the standardization matrix of described request Web service flow chart description is:
Figure BDA0000083895220000033
Wherein:
(i is j) for asking the standardization entry of a matrix element of Web service flow chart description for M;
v iBe R and Q iI the node that the Web service name union of sets that is comprised is concentrated;
v jBe R and Q iJ the node that the Web service name union of sets that is comprised is concentrated.
The computing formula of the standardization matrix of described candidate's Web service flow chart description is:
Wherein:
(i j) is the standardization entry of a matrix element of candidate's Web service flow chart description to M ';
v iBe R and Q rI the node that the Web service name union of sets that is comprised is concentrated;
v jBe R and Q rJ the node that the Web service name union of sets that is comprised is concentrated;
[a, b] represents limit (v i, v j) time corresponding constraint mark in R;
[a ', b '] expression limit (v i, v j) at Q rMiddle time corresponding constraint mark;
[a, b] ∩ [a ', b '] expression [a, b] and [a ', b '] overlapping in time that part of time-constrain are marked
Note is as [2,5] ∩ [3,7]=[3,5];
Value interval time of Dur ([a, b]) express time mark [a, b], i.e. Dur ([a, b])=b-a;
[if a, b] ∩ [a ', b '] there is not overlapping part in time, so
Dur([a，b]∩[a′，b′])＝0。
The computing formula of described diversity factor value is:
d r＝DiagonalSum((M-M′)×(M-M′) T)
Wherein:
d rBe the diversity factor value;
M-M ' for matrix M and matrix M ' the corresponding element value carry out the matrix of gained behind the additive operation;
(M-M ') TThe transposed matrix of representing matrix M-M '.
The present invention can guarantee that not only the service procedure of being excavated can satisfy the client and require the basic task demand, and can guarantee that the service procedure of being excavated can satisfy the desired time-constrain demand of user.
Description of drawings
Fig. 1 is the synoptic diagram that is subjected to the Web service digging flow algorithm of time-constrain;
Fig. 2 describes for the figure of request Web service flow process and 2 candidate's Web service flow processs;
Fig. 3 calculates for the matrix diversity factor of request Web service flow process and the 1st candidate's Web service flow process;
Fig. 4 calculates for the matrix diversity factor of request Web service flow process and the 2nd candidate's Web service flow process.
Embodiment
Below in conjunction with accompanying drawing, preferred embodiment is elaborated.Should be emphasized that following explanation only is exemplary, rather than in order to limit the scope of the invention and to use.
The objective of the invention is to deficiency at existing Web service digging flow technology, a kind of Web service digging flow method that is subjected to time-constrain is proposed, guarantee that the service procedure of being excavated can satisfy desired basic task demand of client and the desired time-constrain demand of client, thereby promote the effective collaborative work between each professional relevant departments of enterprises, under the situation of finishing customer demand in high quality, save the enterprises service operation cost, improve the business economic benefit.
Technical scheme of the present invention is a kind of Web service digging flow method that is subjected to time-constrain.This method is by converting the Web service flow process to the figure description form, and then the standardization flow process matrix that converts correspondence to carries out diversity factor calculating, further, choose the Web service flow process repeated use that most probable is met customer need by the diversity factor value between the Web service flow process.
A kind of Web service digging flow method that is subjected to time-constrain that the present invention proposes mainly may further comprise the steps:
1. the figure that sets up the Web service flow process that is subjected to time-constrain for all the Web service flow processs in the Web flow process storehouse and request Web service flow process describes.
The figure of a Web service flow process describes and can determine by its node set and limit set, wherein, the node that figure describes is the Web service name in the service procedure, the limit that figure describes is two directed edges between the node, be used for representing that the activation between these two pairing Web services of node concerns, shape on the directed edge represents as the time-constrain mark of [a, b] that the top Web service need be finished in b the chronomere at a could further activate terminal Web service, a≤b.Node set that figure describes and limit set can be stored by two database tables respectively.
Specifically comprise following substep:
1.1 directly use figure describes and represents to ask the Web service flow process.Request Web service flow process is a desirable Web service flow process of being formulated at given customer demand (comprising basic task demand and time-constrain demand).
1.2 for all candidate's Web service flow processs of describing by process description language in the Web service flow process storehouse, adopt current XML parser tool commonly used from this Web service flow process is described, to extract all Web service names and Service Activation relation, again according to performed system log (SYSLOG) daily record before this Web service flow process, extract the time-constrain relation between the Service Activation, describe thereby set up and store its figure for each candidate's Web service flow process.Use Q 0, Q 1... Q M-1The figure that represents all candidates' Web service flow process describes.
2. computation requests Web service flow chart description R and each candidate's Web service flow chart description Q 0, Q 1... Q M-1The task compatibility value.
Specifically comprise following substep:
2.1 setting counter i initial value is 0.
2.2 the computing formula of task compatibility value taskcomp is:
taskcomp ( R , Q i ) = | V R ∩ V Q i | | V R ∪ V Q i |
Wherein:
R is a request Web service flow chart description;
Q iBe i candidate's Web service flow chart description (0≤i≤m-1);
Taskcomp (R, Q i) be R and Q iThe task compatibility value;
V RWith
Figure BDA0000083895220000072
Represent R and Q respectively iIn the node set that comprised.
Setting task compatibility threshold value is 0.6.The task compatibility mainly is in order to check the ratio of two same services names that service procedure comprised.If R and Q iThe taskcomp value more than or equal to this threshold value, illustrate that they are that task is compatible; Otherwise task is incompatible.
If 2.3 R and Q iBe that task is compatible, so with Q iThe formation of the compatible Web service flow chart description of adding task.
If 2.4 this moment i＜m-1, make i=i+1 so, change then and go to carry out son 2.2, from Web service flow process storehouse, select next candidate's Web service flow process Q iCarry out the task compatibility relatively with R.Otherwise if i 〉=m-1, the compatibility that then stops flow chart description being calculated.
3. be respectively the request Web service flow chart description and with it each compatible candidate's Web service flow chart description of task set up the standardization matrix.
Service procedure figure in the Web service flow chart description formation compatible with request Web service flow chart description R task describes and is designated as Q 0, Q 1... Q K-1, 0≤k≤m.
R and Q r(the standardization matrix of 0≤r≤k-1) represents with M and M ' that respectively they all are n * n matrixes.Wherein,
Figure BDA0000083895220000081
Be R and Q rThe standardization matrix in the row and column element from R and Q rThe union of set of node.N element should and concentrating is designated as v 0, v 1... v N-1
Specifically comprise following substep:
3.1 the figure based on the Web service flow process describes, and sets up the standardization matrix of request Web service flow chart description R.
The standardization matrix of request Web service flow chart description R is designated as M, each element M wherein (i, value j) is calculated in the following manner:
Figure BDA0000083895220000082
Wherein:
v iAnd v jExpression R and Q rThe Web service name union of sets collection that is comprised (promptly
Figure BDA0000083895220000083
) in i node and j node, and i and the j 0≤i that satisfies condition, j≤n-1, and
Figure BDA0000083895220000084
It is the radix of union.
3.2 the figure based on the Web service flow process describes, for each candidate's Web service flow chart description is set up the standardization matrix.
Candidate's Web service flow process Q rThe standardization matrix that figure describes is designated as M ', each element M wherein ' (i, value j) is calculated in the following manner:
Figure BDA0000083895220000091
Wherein:
v iAnd v jRepresent R and Q respectively rI node and j node that the Web service name union of sets that is comprised is concentrated, and i and the j 0≤i that satisfies condition, j≤n-1;
[a, b] represents limit (v i, v j) time corresponding constraint mark in R;
[a ', b '] expression limit (v i, v j) at Q rMiddle time corresponding constraint mark;
[a, b] ∩ [a ', b '] expression [a, b] and [a ', b '] overlapping in time that part of time-constrain mark are as [2,5] ∩ [3,7]=[3,5];
Value interval time of Dur ([a, b]) express time mark [a, b], i.e. Dur ([a, b])=b-a.
[if a, b] ∩ [a ', b '] there is not overlapping part in time, so
Dur([a，b]∩[a′，b′])＝0。
4. based on the standardization matrix, computation requests Web service flow chart description and the diversity factor value between compatible each the candidate's Web service flow chart description of task with it.
4.1 setting counter r disposal is 0.
4.2 calculate R and Q rBetween diversity factor value d r, diversity factor value d rValue can be calculated by following formula:
d r＝DiagonalSum((M-M′)×(M-M′) T)
Wherein:
M-M ' representing matrix M and matrix M ' the corresponding element value carry out the matrix of gained behind the additive operation; Its matrix multiple, the result still is a matrix;
(M-M ') TThe transposed matrix of representing matrix M-M ';
DiagonalSum be used for compute matrix the diagonal entry value add and, this adds and is exactly R and Q rBetween the diversity factor value, i.e. d r
If 4.3 r＜k-1, r＜r+1 so, and change 4.2, from Web service flow process storehouse, select next candidate's flow process Q rCarry out calculating of task compatibility and diversity factor calculating with R.
5. based on the diversity factor value, select and candidate's Web service flow chart description of asking Web service flow chart description diversity factor value minimum, and the pairing Web service flow process in Web flow process storehouse that this figure describes is reused.
Candidate's Web service flow chart description that all are compatible with the R task and the diversity factor value of R are designated as d 0, d 1... d K-1The candidate Web service flow process the most similar to R is designated as Q x, wherein subscript x passes through d xDetermine that formula is as follows:
d x＝min{d 0，d 1，…d k-1}
That is to say, in all diversity factor values minimum that be worth pairing candidate's Web service flow process will to the most similar, the reusable service procedure of request service.
The characteristics of the Web service digging flow method that is subjected to time-constrain proposed by the invention are exactly, describe by the figure that the Web service flow process is changed into they, and then the diversity factor between the flow matrix of the flow matrix by comparison of request Web service flow process and candidate's Web service flow process, finally excavate and ask candidate's Web service flow process of Web service flow process difference minimum to carry out the flow process repeated use.It is cognitive substantially that method proposed by the invention meets the more little mankind of the big more then diversity factor of similarity.Operation such as the extraction of the procedure information that this method is involved, correlation matrix computing can realize that by the SDK (Software Development Kit) of more current main flows also have lower computation complexity, the complexity under the worst case is O (m*n 3), wherein, m is the sum of candidate's Web service flow process in the flow process storehouse, n is the sum of Web service in the flow process storehouse.The application of this method can reach our the set goal, can guarantee that not only the service procedure of being excavated can satisfy the client and require the basic task demand, and can guarantee that the service procedure of being excavated can satisfy the desired time-constrain demand of user.
Present embodiment comprises two big aspects:
1. the generation that described by the figure of the Web service flow process of time-constrain
Reusable Web service flow process normally is kept in the service procedure storehouse by Web service flow process description document.With the BPEL service description language (sdl) is example, and a Web service flow file is stored with the XML formatted file, has wherein comprised the mutual activation relation between all Web service names related in this flow process and the Web service.Therefore, the figure that can generate this service procedure by the Web service flow file that BPEL of XML resolver resolves describes describes.At present available XML resolver is a lot, as the XML Parser for Java of XML4J, the Oracle of IBM etc.
Concrete steps are as follows:
1.1 resolve each the Web service flow file in the Web flow process storehouse in order successively, describe according to the structured activities of service procedure descriptive language, extract all Web service names and Web service activation relation from the Web service flow process.Structured activities is described by＜case〉label specifies the Web service activity name, by＜sequence 〉,＜switch,＜flow,＜loop etc. label point out conditional relationships such as order, OR-split, AND-split and circulation between the different service activitys.1.1 specifically can be divided into following substep:
1.1.1 by＜case〉label extracts all Web services (activity) name from structured activities is described.The Service name of all extractions is kept in one 1 dimension group, and each element is exactly a Service name in the array.
1.1.2 from structured activities is described, extract activation relations all between the service activity by above-mentioned conditional relationship label.Relation between all service activitys is kept in one 4 dimension group.Activation relation between two service activitys of preceding two representation in components of each column vector of this 4 dimension group.
1.2, extract the time-constrain relation between the Service Activation according to performed system log (SYSLOG) daily record before this Web service flow process.Start time, concluding time that the Web service in the flow process is carried out have been preserved in the system log (SYSLOG) daily record.Concern the time-constrain [a, b] on limit for a Service Activation, the concluding time that a equals the top service on limit deducts the start time, and start time of service that b equals the end on limit deducts the start time of top service.Further, a and b value are stored in respectively in latter two component of the column vector of corresponding activation relation in the 4 dimension groups.
1.3, can determine that the figure of a Web service flow process describes by the 1 dimension group and the 4 dimension groups of preservation Service Activation relation of preserving the Web service name with time-constrain.Fig. 2 a is the request Web service flow chart description of the embodiment of the invention, is designated as R.Fig. 2 b and Fig. 2 c are that the figure of 2 candidate's Web service flow processs describes, and are designated as Q respectively 0And Q 1Their can be determined by one 1 dimension group and 4 dimension groups respectively.For example, the storage mode of R is as follows:
The Web service name 1 dimension group RNode[of R]={ A2, A3, A4, A5, A6, A7, A9, A10}, the activation of R concerns 4 dimension group RRel[] [4]={ { A2, A3,2,3}, { A2, A4,2,5}, { A3, A5,4,6}, { A3, A6,3,4}, { A5, A9,3,4}, { A6, A9,2,3}, { A4, A7,3,4}, { A7, A10,4,6}, { A9, A10,2,7}}.Also can correspondingly set up associated storage array Q0Node, Q0Rel, Q1Node and the Q1Rel etc. of Q0 and Q1.
Wherein:
Q0Node[]＝{A1，A2，A3，A4，A5，A7，A8，A9，A10，A11}；
Q0Rel[][4]＝{{A1，A2，3，5}，{A2，A3，2，4}，{A2，A4，3，5}，{A3，A5，4，6}，{A4，A7，3，5}，{A4，A8，6，9}，{A5，A9，3，5}，{A1，A2，3，5}，{A7，A11，4，5}，{A8，A11，2，3}，{A9，A10，3，6}，{A11，A10，2，3}}；
Q1Node[]＝{A1，A2，A3，A4，A6，A7，A8，A9，A10}；
Q1Rel[][4]＝{{A1，A2，2，3}，{A2，A3，2，4}，{A2，A4，2，4}，{A2，A8，4，6}，{A3，A6，3，5}，{A4，A7，3，4}，{A6，A9，2，3}，{A9，A10，2，6}，{A8，A10，5，7}，{A7，A10，6，8}}。
2. the figure based on the Web service flow process describes, and excavates the candidate Web service flow process the most similar to asking Web service flow process R from the service procedure storehouse.Present embodiment will use Q 0And Q 1Figure as candidate's Web service flow process describes, from Q 0And Q 1In find out the Web service flow process the most similar to R.This aspect specifically is divided into following several steps:
2.1 calculate the task compatibility value taskcomp of R and all candidate's Web service flow processs.Comprise following a few sub-steps:
2.1.1 with Q 0And Q 1Add the formation of Web flow chart description, at this moment m=2.A counter i is set, and initial value is 0;
2.1.2 calculate taskcomp (R, Q i) value;
If 2.1.3 R and Q iCompatibility value be not less than 0.6, so with Q iThe formation of the compatible Web service flow chart description of adding task;
2.1.4 if i＜m-1 makes i=i+1 so, return 2.1.2 then; Otherwise carry out 2.2;
In the present embodiment, by above-mentioned substep, R and Q 0Compatibility value be:
taskcomp(R，Q 0)＝7/11＝0.636≥0.6
R and Q 1Compatibility value be:
taskcomp(R，Q 1)＝7/10＝0.7≥0.6
Therefore, Q 0And Q 1All join the formation of the compatible Web service flow chart description of task.
2.2 calculate the diversity factor value of R and all candidates' the compatible Web service flow chart description of task.This step comprises following a few sub-steps:
2.2.1 handle conveniently for counting, name the flow chart description in candidate's Web service flow process formation compatible: Q in order with the R task 0, Q 1... Q K-1, and set counter r, initial value is 0.In the compatible service procedure formation of task in the present embodiment, k=2, and comprise Q simultaneously 0And Q 1
2.2.2 set up Q rThe standardization matrix M ';
2.2.3 at Q rSet up the standardization matrix M of R;
2.2.4 calculate d rValue, and with d rAdd the formation of diversity factor value;
If 2.2.5 r＜k-1, counter r adds 1 so, return the diversity factor calculating that 2.2.2 continues the compatible Web service flow process of next task then.Otherwise, enter 2.3 so;
In the present embodiment, the definition according to the standardization matrix of above-mentioned generation service procedure has provided R and Q 0Carry out the standardization matrix that diversity factor is calculated, see Fig. 3 a and Fig. 3 b respectively.R and Q have also been provided 1Carry out the standardization matrix that diversity factor is calculated, see Fig. 4 a and Fig. 4 b respectively.
Calculating R and each compatible Web service flow process Q of task with it rThe process of diversity factor value in, also can produce two complementary matrixes.One be matrix M and matrix M ' corresponding element subtract matrix after the computing, be designated as matrix M for simplicity ".Another companion matrix is the matrix that the transposed matrix of M " with M " carries out gained behind the matrix multiple, is designated as M ' for simplicity ".In the present embodiment, Q 0Pairing two companion matrix M " and M ' " see Fig. 3 c and Fig. 3 d, Q respectively 1Pairing two companion matrix M " and M ' " see Fig. 4 c and Fig. 4 d respectively.
Calculate d 0The diversity factor value be exactly with Q 0M ' " value of the element in the matrix on the diagonal line (being the element of grey mark in the matrix) add and, obtain d 0=8.27.Similarly, d 1Value be respectively with Q 1M ' " value of the element in the matrix on the diagonal line add and, obtain d 1=5.4;
2.3 from diversity factor value formation d 0, d 1... d K-1, a diversity factor value d of selection differences degree value minimum xSo, Q xThen be the task compatible Web service flow chart description the most similar to R.The concrete substep of minimum difference degree value of selecting is as follows:
2.3.1 set counter q, initial value is 1; Set variable x, it initially equals 0;
If 2.3.3 d q＜d x, so the value of q is composed to x;
2.3.4 if q＜k-1 makes q=q+1 so, return 2.3.3; Otherwise, finish.
In this example, the formation of diversity factor value only comprises two diversity factor values, i.e. d 0, d 1By carrying out after 2.3 d xIn integer variable x in what preserve is the numbering of the service procedure of the diversity factor value minimum in the formation of diversity factor value.In the present embodiment, d 1The value minimum, so the value of x is 1.Therefore, in Web service flow process storehouse, the Web service flow chart description Q compatible with task 1Corresponding candidate's Web service flow process is the most similar to request Web service flow process.Therefore, in all diversity factor value minimum that be worth pairing candidate's Web service flow process will to the most similar, the reusable service procedure of request service.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claim.

Claims (6)

1. Web service digging flow method that is subjected to time-constrain is characterized in that this method may further comprise the steps:
Step 1: the figure that sets up the Web service flow process that is subjected to time-constrain for all Web service flow processs in the Web flow process storehouse and request Web service flow process describes;
Step 2: the task compatibility value of computation requests Web service flow chart description and each candidate's Web service flow chart description, when compatibility value during greater than assign thresholds, then both tasks are compatible;
Step 3: on the basis of step 2, be respectively the request Web service flow chart description and with it each compatible candidate's Web service flow chart description of task set up the standardization matrix;
Step 4: based on the standardization matrix, computation requests Web service flow chart description and the diversity factor value between compatible each the candidate's Web service flow chart description of task with it;
Step 5: based on the diversity factor value, select the candidate's Web service flow chart description with request Web service flow chart description diversity factor value minimum, and this figure is described in the Web flow process storehouse pairing Web service flow process reuses.
2. a kind of Web service digging flow method that is subjected to time-constrain according to claim 1, the figure that it is characterized in that described Web service flow process describes and can determine by the set of node and the set on limit, node is the Web service name in the service procedure, and the limit is the directed edge of two band time-constrain marks between the node.
3. a kind of Web service digging flow method that is subjected to time-constrain according to claim 1 is characterized in that the computing formula of described task compatibility value is:
taskcomp ( R , Q i ) = | V R ∩ V Q i | | V R ∪ V Q i |
Wherein:
R is request Web service flow chart description;
Q iBe i candidate's Web service flow chart description;
Taskcomp (R, Q i) be R and Q iThe task compatibility value;
V RBe the node set that is comprised among the R;
Figure FDA0000083895210000021
Be Q iIn the node set that comprised.
4. a kind of Web service digging flow method that is subjected to time-constrain according to claim 1 is characterized in that the computing formula of the standardization matrix of described request Web service flow chart description is:
Wherein:
(i is j) for asking the standardization entry of a matrix element of Web service flow chart description for M;
v iBe R and Q iI the node that the Web service name union of sets that is comprised is concentrated;
v jBe R and Q iJ the node that the Web service name union of sets that is comprised is concentrated.
5. a kind of Web service digging flow method that is subjected to time-constrain according to claim 7 is characterized in that the computing formula of the standardization matrix of described candidate's Web service flow chart description is:
Figure FDA0000083895210000023
Wherein:
(i j) is the standardization entry of a matrix element of candidate's Web service flow chart description to M ';
v iBe R and Q rI the node that the Web service name union of sets that is comprised is concentrated;
v jBe R and Q rJ the node that the Web service name union of sets that is comprised is concentrated;
[a, b] represents limit (v i, v j) time corresponding constraint mark in R;
[a ', b '] expression limit (v i, v j) at Q rMiddle time corresponding constraint mark;
[a, b] ∩ [a ', b '] expression [a, b] and [a ', b '] overlapping in time that part of time-constrain mark are as [2,5] ∩ [3,7]=[3,5];
Value interval time of Dur ([a, b]) express time mark [a, b], i.e. Dur ([a, b])=b-a;
If [a, b] ∩ [a ', b '] does not have overlapping part in time, Dur ([a, b] ∩ [a ', b '])=0 so.
6. a kind of Web service digging flow method that is subjected to time-constrain according to claim 8 is characterized in that the computing formula of described diversity factor value is:
d r＝DiagonalSum((M-M′)×(M-M′) T)
Wherein:
d rBe the diversity factor value;
M-M ' for matrix M and matrix M ' the corresponding element value carry out the matrix of gained behind the additive operation;
(M-M ') TThe transposed matrix of representing matrix M-M '.
CN 201110235664 2011-08-17 2011-08-17 Time-constrained Web service flow mining method Expired - Fee Related CN102270140B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110235664 CN102270140B (en) 2011-08-17 2011-08-17 Time-constrained Web service flow mining method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110235664 CN102270140B (en) 2011-08-17 2011-08-17 Time-constrained Web service flow mining method

Publications (2)

Publication Number Publication Date
CN102270140A true CN102270140A (en) 2011-12-07
CN102270140B CN102270140B (en) 2013-10-30

Family

ID=45052451

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110235664 Expired - Fee Related CN102270140B (en) 2011-08-17 2011-08-17 Time-constrained Web service flow mining method

Country Status (1)

Country Link
CN (1) CN102270140B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61105641A (en) * 1984-10-29 1986-05-23 Fujitsu Ltd Continuous automatic generation method of softwares to be offered to users
US20090328046A1 (en) * 2008-06-27 2009-12-31 Sun Microsystems, Inc. Method for stage-based cost analysis for task scheduling
CN101820428A (en) * 2010-04-22 2010-09-01 北京航空航天大学 Composite service optimizing method and device based on protocol composition mechanism

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61105641A (en) * 1984-10-29 1986-05-23 Fujitsu Ltd Continuous automatic generation method of softwares to be offered to users
US20090328046A1 (en) * 2008-06-27 2009-12-31 Sun Microsystems, Inc. Method for stage-based cost analysis for task scheduling
CN101820428A (en) * 2010-04-22 2010-09-01 北京航空航天大学 Composite service optimizing method and device based on protocol composition mechanism

Also Published As

Publication number Publication date
CN102270140B (en) 2013-10-30

Similar Documents

Publication Publication Date Title
Liu et al. Managing network resource and organizational capabilities to create competitive advantage for SMEs in a volatile environment
CN102184107B (en) Method and system for combining user interface services
Vasilieva et al. Design thinking and process transformation: Synergy of these approaches
Cui et al. A dynamic web service composition method based on viterbi algorithm
CN102270140B (en) Time-constrained Web service flow mining method
Khoshnevis et al. Model driven approach to service oriented enterprise architecture
Sbai et al. Generating services supporting variability from configurable process models.
Grandhi et al. The value of business intelligence tools: Aligning business intelligence governance with corporate governance
Zhang et al. Notice of Retraction: Drivers and Implications of Service Science
Lansley The impact of BRE's commercialization on the research community
Ni et al. Togaf for agile soa modelling
Lee et al. Classification of Performance Types for Knowledge Intensive Service Supporting SMEs Using Clustering Techniques: Focused on the Case of K Research Institute
Sbai et al. On managing evolution of configurable services based on configurable processes
CN104299066A (en) Method for mining organization structure information based on enterprise process management system
Oh et al. A development of the customer based on-premise ERP implementation process framework
Mert et al. A SUCCESS-SOLUTION FOR SMART COMPANIES: BUSINESS INTELLIGENCE ANALYTICS
Park et al. Process Performance Measurement Model Based on Event for an efficient Decision-Making
Lladós‐masllorens et al. Upskilling and distributional changes in the electronics global value chain
Lasi Decision Support within Knowledge-Based Engineering–a Business Intelligence-Based Concept
Meng et al. Mining frequent composite service patterns
Fan et al. Flexible flow design method for equipment requirement demonstration
Aksjonenko et al. Literature Review on Management Consulting Collaboration with Companies While Crafting Strategy
Al-Malaise Implementation of Apriori Algorithm to Analyze Organization Data: Building Decision Support System
刘瑜 et al. A component-based geo-workflow framework: a discussion on methodological issues
Fritz et al. Citizen science data in peer-reviewed publications: The Geo-Wiki experience

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131030

Termination date: 20140817

EXPY Termination of patent right or utility model