Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Specification matching of software components
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Web service composition with case-based reasoning
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
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 composition transaction management
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
A Flexible Payment Scheme and Its Role-Based Access Control
IEEE Transactions on Knowledge and Data Engineering
Ensuring required failure atomicity of composite Web services
WWW '05 Proceedings of the 14th 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
The SMART Retrieval System—Experiments in Automatic Document Processing
The SMART Retrieval System—Experiments in Automatic Document Processing
Syntactic Rule Based Approach toWeb Service Composition
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Web services discovery based on schema matching
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
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
Approximate top-k structural similarity search over XML documents
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Achieving secure and flexible M-services through tickets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Behavioral analysis of web services for supporting mediated service interoperations
Proceedings of the 10th international conference on Electronic commerce
A framework for web service discovery: service's reuse, quality, evolution and user's data handling
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
Efficient IR-Style Search over Web Services
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Flexible and semantics-based support for web services transaction protocols
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Hi-index | 0.00 |
With the rapid development of e-commerce over Internet, web services have attracted much attention in recent years. Nowadays, enterprises are able to outsource their internal business processes as services and make them accessible via the Web. Then they can dynamically combine individual services to provide new value-added services. A main problem that remains is how to discover desired web services. In this paper, we propose WSXplorer, a novel scheme for identifying potentially relevant web services given a textual description of services. In particular, we propose a new schema matching algorithm for supporting web-service operations matching. The matching algorithm catches not only structures, but even better semantic information of schemas. Based on service operations matching, the concept of attribute closure is introduced to identify associations between web-service operations. We also propose a ranking strategy to satisfy a user's top-k requirements. Experimental evaluation shows that our approach can achieve high precision and recall ratio.