2005 IEEE International Conference on E-Technology, E-Commerce and E-Service 2005
DOI: 10.1109/eee.2005.106
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…To overcome that problem, approaches to behaviour similarity were introduced that restricted the analysis to local relations between traces' events [53]. Noticeable examples include the ngram similarity [68], comparing systems by the shared allowed n-long sub-sequences in systems' respective traces. Despite the efficiency of the solution, the issue is that even if n-grams coincide, not necessarily do the traces as well.…”
Section: Behavioural Equivalencementioning
confidence: 99%
“…To overcome that problem, approaches to behaviour similarity were introduced that restricted the analysis to local relations between traces' events [53]. Noticeable examples include the ngram similarity [68], comparing systems by the shared allowed n-long sub-sequences in systems' respective traces. Despite the efficiency of the solution, the issue is that even if n-grams coincide, not necessarily do the traces as well.…”
Section: Behavioural Equivalencementioning
confidence: 99%
“…To overcome that problem, approaches to behaviour similarity were introduced that restricted the analysis to local relations between traces' events [67]. Noticeable examples include the n-gram similarity [68], comparing systems by the shared allowed n-long sub-sequences in systems' respective traces. Despite the efficiency of the solution, the treat to validity is that even if n-grams coincides, not necessarily do the traces as well.…”
Section: Behavioural Equivalencementioning
confidence: 99%
“…It is more expressive than service interface-based description. Various behavioral models including extended finite-state automata, process algebraic notations, graph formalism and logic formalisms have been studied [29][30][31][32][33][34][35]. Web services are developed by different teams, and are described in different conceptual frameworks without prior agreement.…”
Section: Related Workmentioning
confidence: 99%