{"title":"基于图的web加速服务组合元模型","authors":"A. Bhattacharya, S. Choudhury","doi":"10.1109/ICIT.2014.6894918","DOIUrl":null,"url":null,"abstract":"Service composition is one of the key issues in web engineering to satisfy users query on the fly. The efficient composition technique demands low execution time. Moreover, the approach should include the fast delivery of an alternative plan in case of failure in run-time. Most of the existing techniques are unable to deliver any result in case of partial matching with the requirement of the user. In this paper, we have proposed a meta-model in terms of a Graph to work on the above said issues. The Graph that contains information required for composition is prepared offline and is used for generating query specific composition plan. The methodology for finding out the specific composition plan, for partial matching also, is illustrated with an example. The solution is expected to behave in an efficient way in terms of providing dynamic service composition techniques.","PeriodicalId":240337,"journal":{"name":"2014 IEEE International Conference on Industrial Technology (ICIT)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Graph based meta-model for speed-up service composition on web\",\"authors\":\"A. Bhattacharya, S. Choudhury\",\"doi\":\"10.1109/ICIT.2014.6894918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service composition is one of the key issues in web engineering to satisfy users query on the fly. The efficient composition technique demands low execution time. Moreover, the approach should include the fast delivery of an alternative plan in case of failure in run-time. Most of the existing techniques are unable to deliver any result in case of partial matching with the requirement of the user. In this paper, we have proposed a meta-model in terms of a Graph to work on the above said issues. The Graph that contains information required for composition is prepared offline and is used for generating query specific composition plan. The methodology for finding out the specific composition plan, for partial matching also, is illustrated with an example. The solution is expected to behave in an efficient way in terms of providing dynamic service composition techniques.\",\"PeriodicalId\":240337,\"journal\":{\"name\":\"2014 IEEE International Conference on Industrial Technology (ICIT)\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Industrial Technology (ICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2014.6894918\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Industrial Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2014.6894918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Graph based meta-model for speed-up service composition on web
Service composition is one of the key issues in web engineering to satisfy users query on the fly. The efficient composition technique demands low execution time. Moreover, the approach should include the fast delivery of an alternative plan in case of failure in run-time. Most of the existing techniques are unable to deliver any result in case of partial matching with the requirement of the user. In this paper, we have proposed a meta-model in terms of a Graph to work on the above said issues. The Graph that contains information required for composition is prepared offline and is used for generating query specific composition plan. The methodology for finding out the specific composition plan, for partial matching also, is illustrated with an example. The solution is expected to behave in an efficient way in terms of providing dynamic service composition techniques.