Efficient Semantic Web service discovery in centralized and P2P environments

Skoutas, D; Sacharidis, D; Kantere, V; Sellis, T

dc.contributor.author	Skoutas, D	en
dc.contributor.author	Sacharidis, D	en
dc.contributor.author	Kantere, V	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:45:15Z
dc.date.available	2014-03-01T02:45:15Z
dc.date.issued	2008	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32229
dc.subject	Experimental Evaluation	en
dc.subject	Indexation	en
dc.subject	Overlay Network	en
dc.subject	P2P	en
dc.subject	Ranking Function	en
dc.subject	Search Algorithm	en
dc.subject	Search Engine	en
dc.subject	Search Space	en
dc.subject	Semantic Web	en
dc.subject	Semantic Web Service	en
dc.subject	Service Oriented Architecture	en
dc.subject	Synthetic Data	en
dc.subject.other	Information services	en
dc.subject.other	Learning algorithms	en
dc.subject.other	Ontology	en
dc.subject.other	Search engines	en
dc.subject.other	Semantic Web	en
dc.subject.other	Semantics	en
dc.subject.other	Web services	en
dc.subject.other	World Wide Web	en
dc.subject.other	Centralized architectures	en
dc.subject.other	Constant times	en
dc.subject.other	Experimental evaluations	en
dc.subject.other	Fast selections	en
dc.subject.other	Number of services	en
dc.subject.other	P2P environments	en
dc.subject.other	Query concepts	en
dc.subject.other	Query times	en
dc.subject.other	Ranking functions	en
dc.subject.other	Response times	en
dc.subject.other	Search Algorithms	en
dc.subject.other	Search spaces	en
dc.subject.other	Semantic web service discoveries	en
dc.subject.other	Service descriptions	en
dc.subject.other	Service-oriented architectures	en
dc.subject.other	Structured p2p	en
dc.subject.other	Synthetic datums	en
dc.subject.other	Information theory	en
dc.title	Efficient Semantic Web service discovery in centralized and P2P environments	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-88564-1-37	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-88564-1-37	en
heal.publicationDate	2008	en
heal.abstract	Efficient and scalable discovery mechanisms are critical for enabling service-oriented architectures on the Semantic Web. The majority of currently existing approaches focuses on centralized architectures, and deals with efficiency typically by pre-computing and storing the results of the semantic matcher for all possible query concepts. Such approaches, however, fail to scale with respect to the number of service advertisements and the size of the ontologies involved. On the other hand, this paper presents an efficient and scalable index-based method for Semantic Web service discovery that allows for fast selection of services at query time and is suitable for both centralized and P2P environments. We employ a novel encoding of the service descriptions, allowing the match between a request and an advertisement to be evaluated in constant time, and we index these representations to prune the search space, reducing the number of comparisons required. Given a desired ranking function, the search algorithm can retrieve the top-k matches progressively, i.e., better matches are computed and returned first, thereby further reducing the search engine's response time. We also show how this search can be performed efficiently in a suitable structured P2P overlay network. The benefits of the proposed method are demonstrated through experimental evaluation on both real and synthetic data. © 2008 Springer Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-88564-1-37	en
dc.identifier.volume	5318 LNCS	en
dc.identifier.spage	583	en
dc.identifier.epage	598	en