In this paper, we present the design and the architecture of the CloudDB AutoAdmin system which aims to fill the existing gaps between the provided cloud database services and the requirements of the consumer applications. In particular, it focuses on facilitating the job of the cloud database consumers in implementing database applications as distributed, scalable, and elastic services with a minimum effort on the side of the application developer and a limited footprint in the application code.
{"title":"CloudDB AutoAdmin: Towards a Truly Elastic Cloud-Based Data Store","authors":"S. Sakr, Liang Zhao, H. Wada, Anna Liu","doi":"10.1109/ICWS.2011.19","DOIUrl":"https://doi.org/10.1109/ICWS.2011.19","url":null,"abstract":"In this paper, we present the design and the architecture of the CloudDB AutoAdmin system which aims to fill the existing gaps between the provided cloud database services and the requirements of the consumer applications. In particular, it focuses on facilitating the job of the cloud database consumers in implementing database applications as distributed, scalable, and elastic services with a minimum effort on the side of the application developer and a limited footprint in the application code.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133068156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nowadays web users have clearly expressed their wishes to receive and interact with personalized services directly. However, existing approaches, largely syntactic content-based, fail to provide robust, accurate and useful personalized services to its users. Towards such an issue, the semantic web provides technologies to annotate and match services' descriptions with users' features, interests and preferences, thus allowing for more efficient access to services and more generally information. The aim of our work, part of service personalization, is on automated instantiation of services which is crucial for advanced usability i.e., how to prepare and present services ready to be executed while limiting useless interactions with users? To this end, we exploit Description Logics reasoning through semantic matching to (i) identify useful parts of a user profile that satisfy services requirements (i.e., input parameters) and (ii) compute the description required by a service to be executed but not provided by the user profile. Our approach, part of the EC-funded project SOA4All, was evaluated on its applicability in real world scenarios with end-users.
{"title":"Personalizing Access to Semantic Web Services","authors":"F. Lécué","doi":"10.1109/ICWS.2011.9","DOIUrl":"https://doi.org/10.1109/ICWS.2011.9","url":null,"abstract":"Nowadays web users have clearly expressed their wishes to receive and interact with personalized services directly. However, existing approaches, largely syntactic content-based, fail to provide robust, accurate and useful personalized services to its users. Towards such an issue, the semantic web provides technologies to annotate and match services' descriptions with users' features, interests and preferences, thus allowing for more efficient access to services and more generally information. The aim of our work, part of service personalization, is on automated instantiation of services which is crucial for advanced usability i.e., how to prepare and present services ready to be executed while limiting useless interactions with users? To this end, we exploit Description Logics reasoning through semantic matching to (i) identify useful parts of a user profile that satisfy services requirements (i.e., input parameters) and (ii) compute the description required by a service to be executed but not provided by the user profile. Our approach, part of the EC-funded project SOA4All, was evaluated on its applicability in real world scenarios with end-users.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116303052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abderrahmane Maaradji, Hakim Hacid, Ryan Skraba, Adnan Lateef, Johann Daigremont, N. Crespi
In this paper, we describe our work in progress on Web services recommendation for services composition in a Mashup environment, by proposing a new approach to assist end-users based social interactions capture and analysis. This approach uses an implicit social graph inferred from the common composition interests of users. We describe the transformation of users-services interactions into a social graph and a possible means to leverage that graph to derive service recommendation. As this work is in progress, this proposal was implemented within a platform called SoCo where preliminary experiments show interesting results.
{"title":"Social-Based Web Services Discovery and Composition for Step-by-Step Mashup Completion","authors":"Abderrahmane Maaradji, Hakim Hacid, Ryan Skraba, Adnan Lateef, Johann Daigremont, N. Crespi","doi":"10.1109/ICWS.2011.122","DOIUrl":"https://doi.org/10.1109/ICWS.2011.122","url":null,"abstract":"In this paper, we describe our work in progress on Web services recommendation for services composition in a Mashup environment, by proposing a new approach to assist end-users based social interactions capture and analysis. This approach uses an implicit social graph inferred from the common composition interests of users. We describe the transformation of users-services interactions into a social graph and a possible means to leverage that graph to derive service recommendation. As this work is in progress, this proposal was implemented within a platform called SoCo where preliminary experiments show interesting results.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123792347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Local State Transfer (LoST) is a simple, declarative approach for enacting communication protocols. LoST is perfectly distributed and relies only upon the local knowledge of each business partner. It involves a novel treatment of the information bases of protocols, especially in terms of how their parameters are specified. As a result, LoST can capture subtle patterns of interaction that more complex approaches cannot handle well. Further, LoST lends itself to implementations that are robust against unordered and lossy message transmission.
{"title":"LoST: Local State Transfer -- An Architectural Style for the Distributed Enactment of Business Protocols","authors":"Munindar P. Singh","doi":"10.1109/ICWS.2011.48","DOIUrl":"https://doi.org/10.1109/ICWS.2011.48","url":null,"abstract":"Local State Transfer (LoST) is a simple, declarative approach for enacting communication protocols. LoST is perfectly distributed and relies only upon the local knowledge of each business partner. It involves a novel treatment of the information bases of protocols, especially in terms of how their parameters are specified. As a result, LoST can capture subtle patterns of interaction that more complex approaches cannot handle well. Further, LoST lends itself to implementations that are robust against unordered and lossy message transmission.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125349633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we investigate the combination of configuration and query rewriting for semantic Web service composition. Given a user query and a set of service descriptions, we rely on query rewriting to find services that implement the functionalities expressed in the user query (discovery stage). Then, we use configuration to capture dependencies between services, and to generate a set of composed Web services described as a directed acyclic graph, while maintaining validity with respect to business rules (orchestration stage).Finally, we propose a semantic ranking algorithm to rank results according to user preferences (classification stage).The techniques used in our approach take into account the semantics of concepts utilized to describe the elements (services, business rules, query and user preferences) involved in the composition process. We provide a formal approach and its implementation, together with experiments on Web services from different application domains.
{"title":"Combining Configuration and Query Rewriting for Web Service Composition","authors":"Amin Mesmoudi, M. Mrissa, Mohand-Said Hacid","doi":"10.1109/ICWS.2011.26","DOIUrl":"https://doi.org/10.1109/ICWS.2011.26","url":null,"abstract":"In this paper, we investigate the combination of configuration and query rewriting for semantic Web service composition. Given a user query and a set of service descriptions, we rely on query rewriting to find services that implement the functionalities expressed in the user query (discovery stage). Then, we use configuration to capture dependencies between services, and to generate a set of composed Web services described as a directed acyclic graph, while maintaining validity with respect to business rules (orchestration stage).Finally, we propose a semantic ranking algorithm to rank results according to user preferences (classification stage).The techniques used in our approach take into account the semantics of concepts utilized to describe the elements (services, business rules, query and user preferences) involved in the composition process. We provide a formal approach and its implementation, together with experiments on Web services from different application domains.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115398718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web services evolve frequently to meet new business demands and opportunities. However, service changes may affect service compositions that are currently consuming the services. Hence, audit testing (a form of regression testing in charge of checking for compatibility issues) is needed. As service compositions are often in continuous operation and the external services have limited (expensive) access when invoked for testing, audit testing has severe time and resources constraints, which make test prioritization a crucial technique (only the highest priority test cases will be executed).This paper presents a novel approach to the prioritization of audit test cases using information retrieval. This approach matches a service change description with the code portions exercised by the relevant test cases. So, test cases are prioritized based on their relevance to the service change. We evaluate the proposed approach on a system that composes services from eBay and Google.
{"title":"Test Case Prioritization for Audit Testing of Evolving Web Services Using Information Retrieval Techniques","authors":"Duy Cu Nguyen, A. Marchetto, P. Tonella","doi":"10.1109/ICWS.2011.75","DOIUrl":"https://doi.org/10.1109/ICWS.2011.75","url":null,"abstract":"Web services evolve frequently to meet new business demands and opportunities. However, service changes may affect service compositions that are currently consuming the services. Hence, audit testing (a form of regression testing in charge of checking for compatibility issues) is needed. As service compositions are often in continuous operation and the external services have limited (expensive) access when invoked for testing, audit testing has severe time and resources constraints, which make test prioritization a crucial technique (only the highest priority test cases will be executed).This paper presents a novel approach to the prioritization of audit test cases using information retrieval. This approach matches a service change description with the code portions exercised by the relevant test cases. So, test cases are prioritized based on their relevance to the service change. We evaluate the proposed approach on a system that composes services from eBay and Google.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117069065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Automated matching of service descriptions is the key to service discovery and composition. In this paper, we propose an approach for web services discovery and composition. The approach relies on (1) SAWSDL, a simple and generic annotation language, (2) an XML representation of a web service that carries both syntactic (e.g., WSDL) and semantic (e.g., SAWSDL) information, and (3) the reuse of available schema matchers. The approach departs from exiting ones because it does not advocate a specific matchmaking algorithm, and it promotes the combination of different schema matchers, allowing multiple discovery and composition strategies.
{"title":"Web Services Discovery and Composition: A Schema Matching Approach","authors":"S. Sellami, Omar Boucelma","doi":"10.1109/ICWS.2011.105","DOIUrl":"https://doi.org/10.1109/ICWS.2011.105","url":null,"abstract":"Automated matching of service descriptions is the key to service discovery and composition. In this paper, we propose an approach for web services discovery and composition. The approach relies on (1) SAWSDL, a simple and generic annotation language, (2) an XML representation of a web service that carries both syntactic (e.g., WSDL) and semantic (e.g., SAWSDL) information, and (3) the reuse of available schema matchers. The approach departs from exiting ones because it does not advocate a specific matchmaking algorithm, and it promotes the combination of different schema matchers, allowing multiple discovery and composition strategies.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125947340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Quality of Web Service (QoWS) support for Mobility-aware Web services (MWS) is critical for mobile users since it relies on the available resources on mobile devices consuming these services. In this paper, we propose a selection model for MWS based on QoWS and device resources requirements. The main purpose of the model is to support the client in selecting MWS based on desired QoWS as well as on its device resources availability. We propose a verification scheme to verify the conformity of claimed MWS QoWS and required device resources compared to the published one. The verification is used to support selection of MWS. The implementation of our model is discussed and the importance of our verification scheme is highlighted.
{"title":"Mobility-Aware Selection of Mobile Web Services","authors":"M. Serhani, A. Benharref","doi":"10.1109/ICWS.2011.94","DOIUrl":"https://doi.org/10.1109/ICWS.2011.94","url":null,"abstract":"Quality of Web Service (QoWS) support for Mobility-aware Web services (MWS) is critical for mobile users since it relies on the available resources on mobile devices consuming these services. In this paper, we propose a selection model for MWS based on QoWS and device resources requirements. The main purpose of the model is to support the client in selecting MWS based on desired QoWS as well as on its device resources availability. We propose a verification scheme to verify the conformity of claimed MWS QoWS and required device resources compared to the published one. The verification is used to support selection of MWS. The implementation of our model is discussed and the importance of our verification scheme is highlighted.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127708785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new trend involves Web services such as Twitter beginning to publish streaming Web APIs that enable partners and end users to retrieve streaming data. By combining such push-based Web services and existing pull-based Web services, it is now possible for us to understand the current status or trends of the world in a more real-time way, such as real-time tracking of infectious disease, real-time crime prediction, or real-time marketing, and so various innovative business services are possible. For a system architecture to implement such services, the services are normally built from the scratch, and the performance and scalability depend upon the engineers' skills. In this paper we propose a real-time Web monitoring system called gStreamWebh on top of a stream computing system called System S developed by IBM Research. The Stream Web system allows developers to easily describe their analytical algorithms for a variety of kinds of Web streaming data without worrying about the performance and scalability, and provides real-time and scalable Web monitoring for massive amounts of data. As an experimental proof-of-concept application, we built an application that monitors a list of keywords in the Twitter streaming data, and that displays any messages including the specified keywords onto a map of the physical location (from Google) where the message was posted. Our system can handle nearly 30 thousand Twitter messages per second on a system with 8 computing nodes. This prototype application confirms that we can build real-time Web monitoring systems while satisfying the needs for high software productivity and for system scalability.
{"title":"StreamWeb: Real-Time Web Monitoring with Stream Computing","authors":"T. Suzumura, Tomoaki Oiki","doi":"10.1109/ICWS.2011.16","DOIUrl":"https://doi.org/10.1109/ICWS.2011.16","url":null,"abstract":"A new trend involves Web services such as Twitter beginning to publish streaming Web APIs that enable partners and end users to retrieve streaming data. By combining such push-based Web services and existing pull-based Web services, it is now possible for us to understand the current status or trends of the world in a more real-time way, such as real-time tracking of infectious disease, real-time crime prediction, or real-time marketing, and so various innovative business services are possible. For a system architecture to implement such services, the services are normally built from the scratch, and the performance and scalability depend upon the engineers' skills. In this paper we propose a real-time Web monitoring system called gStreamWebh on top of a stream computing system called System S developed by IBM Research. The Stream Web system allows developers to easily describe their analytical algorithms for a variety of kinds of Web streaming data without worrying about the performance and scalability, and provides real-time and scalable Web monitoring for massive amounts of data. As an experimental proof-of-concept application, we built an application that monitors a list of keywords in the Twitter streaming data, and that displays any messages including the specified keywords onto a map of the physical location (from Google) where the message was posted. Our system can handle nearly 30 thousand Twitter messages per second on a system with 8 computing nodes. This prototype application confirms that we can build real-time Web monitoring systems while satisfying the needs for high software productivity and for system scalability.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123777173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Huifeng Sun, Zibin Zheng, Junliang Chen, Michael R. Lyu
Since there are many Web services on the Internet, personalized Web service selection and recommendation is very important. In this paper, we present a new similarity measure for Web service similarity computation and propose a normal recovery collaborative filtering (NRCF) method for personalized Web service recommendation.
{"title":"NRCF: A Novel Collaborative Filtering Method for Service Recommendation","authors":"Huifeng Sun, Zibin Zheng, Junliang Chen, Michael R. Lyu","doi":"10.1109/ICWS.2011.86","DOIUrl":"https://doi.org/10.1109/ICWS.2011.86","url":null,"abstract":"Since there are many Web services on the Internet, personalized Web service selection and recommendation is very important. In this paper, we present a new similarity measure for Web service similarity computation and propose a normal recovery collaborative filtering (NRCF) method for personalized Web service recommendation.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121466856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：