A grammar-based index for matching business processes

Proceedings - 2005 IEEE International Conference on Web Services, ICWS 2005

Volumn 2005, Issue , 2005, Pages 21-32

  Mahleko, Bendick ^a   Wombacher, Andreas ^b   Fankhauser, Peter ^a  

^a FRAUNHOFER IPSI   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INDEXING (OF INFORMATION); INDUSTRIAL MANAGEMENT;

BUSINESS PROCESSES; FINITE STATE AUTOMATA (FSA); INDEX MECHANISMS;

INFORMATION SERVICES;

EID: 33749064395     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2005.6     Document Type: Conference Paper

References (14)

1. C. Chan, M. Garofakkis, and R. Rastogi. Re-tree: an efficient index structure for regular expressions. The VLDB Journal, 12(2): 102-119, 2003.
2. S. Ginsburg. Algebraic and automata-theoretic properties of formal languages. North-Holland/American elsevier, 1975.
3. R. Giugno and D. Shasha. Graphgrep: A fast and universal method for querying graphs. In 16th International Conference in Pattern recognition (ICPR), Quebec, Canada, August 2002. IEEE Computer Society.
4. R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997.
5. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, California, 1993.
6. S. Helmer and G. Moerkotte. A performance study of four index structures for set-valued attributes of low cardinality. The VLDB Journal, 12(3):244-261, 2003.
7. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2001.
8. T. Milo and D. Suciu. Index structures for path expressions. Lecture Notes in Computer Science, 1540:277-295, 1999.
9. RosettaNet. http://www.rosettanet.org. last visited: 15 November 2004.
10. A. ShaiklAli, O. F. Rana, R. Al-Ali, and D. W. Walker. Uddie: An extended registry for web services. In Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT-w03). IEEE Computer Society, 2003.
11. H. WEINBLATT. A new search algorithm for finding the simple cycles of a finite directed graph. Journal of the Association for Computing Machinery, 19(1), 1972.
12. A. Wombacher, P. Fankhauser, B. Mahleko, and E. Neuhold. Matchmaking for business processes based on choreographies. International Journal of Web Services, 1(4): 14-32, 2004.
13. A. Wombacher, P. Fankhauser, and E. Neuhold. Transforming bpel into annotated deterministic finite state automata for service discovery. In IEEE International Conference on Web Services (ICWS 2004), Los Alamitos, California, 2004. IEEE Computer society.
14. A. Wombacher, B. Mahleko, and E. Neuhold. Ipsi-pf: A business process matchmaking engine. In Proceedings of the CEC 2004, San Diego, California, USA, 2004.