Process-annotated service discovery facilitated by an n-gram-based index

被引:6
作者
Mahleko, B [1 ]
Wombacher, A [1 ]
Fankhauser, P [1 ]
机构
[1] Fraunhofer Inst Appl Solid State Phys, IPSI, D-64293 Darmstadt, Germany
来源
2005 IEEE INTERNATIONAL CONFERENCE ON E-TECHNOLOGY, E-COMMERCE AND E-SERVICE, PROCEEDINGS | 2005年
关键词
D O I
10.1109/EEE.2005.106
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Service discovery in web service infrastructure must consider abstract processes to guarantee successful business interactions with the matched services. Unfortunately, matchmaking process annotations requires a significant processing effort, thus, finding relevant service providers in a large collection is time consuming and requires more efficient access methods than sequential scanning. The paper presents an approach supporting more efficient querying of abstract processes by introducing an abstraction to reduce the computational complexity of the comparison operation. Experimental studies on a collection of over 800 abstract business processes derived from the RosettaNet PIP specification show that our approach outperforms naive sequential scanning by up to an order of magnitude.
引用
收藏
页码:2 / 8
页数:7
相关论文
共 20 条
[1]  
BAEZAYATES R, 1992, P 12 IFIP WORLD COMP, P465
[2]  
BERBERSLEE T, 2001, SCI AM, V284, P34
[3]   RE-tree: an efficient index structure for regular expressions [J].
Chan, CY ;
Garofalakis, M ;
Rastogi, R .
VLDB JOURNAL, 2003, 12 (02) :102-119
[4]  
Esparza J., 1995, J INFORM PROCESSING, V30, P143
[5]  
GOLDMAN R, 1997, P 23 VLDB C ATH GREE
[6]   A uniform indexing scheme for object-oriented databases [J].
Gudes, E .
INFORMATION SYSTEMS, 1997, 22 (04) :199-221
[7]  
Helmer S, 2003, VLDB J, V12, P244, DOI 10.1007/S00778-003-0106-0
[8]  
Hopcroft J.E., 2001, INTRO AUTOMATA THEOR
[9]   ACCESS SUPPORT RELATIONS - AN INDEXING METHOD FOR OBJECT BASES [J].
KEMPER, A ;
MOERKOTTE, G .
INFORMATION SYSTEMS, 1992, 17 (02) :117-145
[10]   FAST STRING-MATCHING USING AN N-GRAM ALGORITHM [J].
KIM, JY ;
SHAWETAYLOR, J .
SOFTWARE-PRACTICE & EXPERIENCE, 1994, 24 (01) :79-88