Efficient IR-Style Search over Web Services

Authors:
Yanan Hao;Jinli Cao;Yanchun Zhang
Affiliations:
School of Engineering and Science, Victoria University, Melbourne, Australia VIC 8001;Department of Computer Science and Computer Engineering, La Trobe University, Bundoora, Australia VIC 3086;School of Engineering and Science, Victoria University, Melbourne, Australia VIC 8001
Venue:
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Year:
2009

Citing 16
Cited 0

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
A vector space model for automatic indexing

Communications of the ACM
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

Autonomous Agents and Multi-Agent Systems
DBXplorer: A System for Keyword-Based Search over Relational Databases

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Flexible Interface Matching for Web-Service Discovery

WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Automatic web news extraction using tree edit distance

Proceedings of the 13th international conference on World Wide Web
Web Service Discovery Based on Behavior Signatures

SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 01
Syntactic Rule Based Approach toWeb Service Composition

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Schema summarization

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Discover: keyword search in relational databases

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient IR-style keyword search over relational databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Similarity search for web services

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Investigating web services on the world wide web

Proceedings of the 17th international conference on World Wide Web
Chord4S: A P2P-based Decentralised Service Discovery Approach

SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
WSXplorer: searching for desired web services

CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In service-based systems, one of the most important problems is how to discover desired web services. In this paper, we propose a novel IR-Style mechanism for discovering and ranking web services automatically. In particular, we introduce the notion of preference degree for web services and then we define service relevance and service importance as two desired properties for measuring the preference degree. Furthermore, various algorithms are given for computing the relevance and importance of services, respectively. Experimental results show the proposed IR-style search strategy is efficient and practical.