A Grammar-Based Index for Matching Business Processes


Share/Save/Bookmark

Mahleko, Bendick and Wombacher, Andreas and Fankhauser, Peter (2005) A Grammar-Based Index for Matching Business Processes. In: IEEE International Conference on Web Services, ICWS 2005, 11-15 July 2005, Orlando, FL, USA.

[img]
Preview
PDF
249Kb
Abstract:Complex services are composed of simple services which typically need to be processed in a particular order. Two complex services only match if they agree on both, their simple services and their processing order. This matching semantics can be formalized by means of modelling complex services as finite state automata (FSAs), and analysing the intersection of the FSAs. However, computing the intersection of FSAs is computationally expensive, and thus does not scale for large service repositories. This paper presents an approach for indexing and matching complex services using an abstraction that transforms the underlying FSA via its grammar into a form that can be indexed using available index mechanisms. Evaluation of this approach shows a performance gain of several orders of magnitude as compared to sequential matching.
Item Type:Conference or Workshop Item
Copyright:© 2005 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64180
Official URL:http://dx.doi.org/10.1109/ICWS.2005.6
Conference URL:http://conferences.computer.org/icws/2005/
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 226868