TY - GEN
T1 - Querying and splicing of XML workflows
AU - Christophides, Vassilis
AU - Hull, Richard
AU - Kumar, Akhil
PY - 2001
Y1 - 2001
N2 - In both industry and the research community it is now common to represent workflow schemas and enactments using XML. As a matter of fact, more and more enterprise application integration platforms (e.g., Excelon, Bea, iPlanet, etc.) are using XML to represent workflows within or across enterprise boundaries. In this paper we explore the ability of modern XML query languages (specifically, the W3C XML Algebra underlying the forthcoming XQuery) to query and manipulate workflow schemas and enactments represented as XML data. The paper focuses on a simple, yet expressive, model called Workflow Query Model (WQM) offering four primary constructs: sequence, choice, parallel, and loop. Then three classes of queries are considered against WQM workflows: simple (e.g., to check the status of enactments), traversal (e.g., to check the relationship between tasks, or check the expected running time of a schema), and schema construction (e.g., to create new schemas from a library of workflow components). This querying functionality is quite useful for specifying, enacting and supervising e-services in various e-commerce application contexts and it can be easily specified using the W3C XML Query Algebra.
AB - In both industry and the research community it is now common to represent workflow schemas and enactments using XML. As a matter of fact, more and more enterprise application integration platforms (e.g., Excelon, Bea, iPlanet, etc.) are using XML to represent workflows within or across enterprise boundaries. In this paper we explore the ability of modern XML query languages (specifically, the W3C XML Algebra underlying the forthcoming XQuery) to query and manipulate workflow schemas and enactments represented as XML data. The paper focuses on a simple, yet expressive, model called Workflow Query Model (WQM) offering four primary constructs: sequence, choice, parallel, and loop. Then three classes of queries are considered against WQM workflows: simple (e.g., to check the status of enactments), traversal (e.g., to check the relationship between tasks, or check the expected running time of a schema), and schema construction (e.g., to create new schemas from a library of workflow components). This querying functionality is quite useful for specifying, enacting and supervising e-services in various e-commerce application contexts and it can be easily specified using the W3C XML Query Algebra.
UR - http://www.scopus.com/inward/record.url?scp=23044529247&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=23044529247&partnerID=8YFLogxK
U2 - 10.1007/3-540-44751-2_29
DO - 10.1007/3-540-44751-2_29
M3 - Conference contribution
AN - SCOPUS:23044529247
SN - 3540425241
SN - 9783540425243
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 386
EP - 403
BT - Cooperative Information Systems - 9th International Conference, CoopIS 2001, Proceedings
A2 - Batini, Carlo
A2 - Mecella, Massimo
A2 - Giunchiglia, Fausto
A2 - Giorgini, Paolo
PB - Springer Verlag
T2 - 9th International Conference on the Topic of Cooperative Information Systems, CoopIS 2001
Y2 - 5 September 2001 through 7 September 2001
ER -