KIPS Transactions on Software and Data Engineering (정보처리학회논문지:소프트웨어 및 데이터공학)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Semantic-based Automatic Open API Composition Algorithm for Easier-to-use Mashups

Easier-to-use 매쉬업을 위한 시맨틱 기반 자동 Open API 조합 알고리즘

  • 이용주 (경북대학교 컴퓨터정보학부)
  • Received : 2013.01.07
  • Accepted : 2013.02.19
  • Published : 2013.05.30
Download PDF
⟨ Previous Next ⟩

Abstract

Mashup is a web application that combines several different sources to create new services using Open APIs(Application Program Interfaces). Although the mashup has become very popular over the last few years, there are several challenging issues when combining a large number of APIs into the mashup, especially when composite APIs are manually integrated by mashup developers. This paper proposes a novel algorithm for automatic Open API composition. The proposed algorithm consists of constructing an operation connecting graph and searching composition candidates. We construct an operation connecting graph which is based on the semantic similarity between the inputs and the outputs of Open APIs. We generate directed acyclic graphs (DAGs) that can produce the output satisfying the desired goal. In order to produce the DAGs efficiently, we rapidly filter out APIs that are not useful for the composition. The algorithm is evaluated using a collection of REST and SOAP APIs extracted from ProgrammableWeb.com.

매쉬업은 공개된 Open API를 이용하여 두 가지 이상의 서로 다른 자원을 섞어서 완전히 새로운 서비스를 만드는 웹 애플리케이션이다. 지난 몇 년간 매쉬업에 대한 관심도가 매우 높아 졌지만 수많은 API들을 매쉬업 속으로 결합할 때 여러 가지 이슈들이 존재한다. 특히, 조합 가능한 API들이 매쉬업 개발자에 의해 수동으로 통합될 때 이는 더욱 심각해진다. 본 논문에서는 Open API 자동 조합을 위한 하나의 새로운 알고리즘을 제안한다. 제안된 알고리즘은 오퍼레이션 연결 그래프 구축 및 조합 후보군 탐색으로 구성되어 있다. 우리는 Open API 입출력 사이의 시맨틱 유사도를 기반으로 오퍼레이션 연결 그래프를 구축하고, 원하는 목표를 만족하는 출력을 산출할 수 있는 사이클 없는 방향성 그래프(DAG)를 생성한다. 또한, DAG들을 효율적으로 생성하기 위해 조합에 도움이 되지 않은 API들은 사전에 신속히 필터링되는 전략을 수립한다. 본 논문에서 제안된 알고리즘은 ProgrammableWeb.com 사이트로부터 REST와 SOAP API 집합을 다운로드 받아 실험 분석을 수행하였다.

Keywords

References

  1. V. Hoyer and M. Fischer, "Market overview of enterprise mashup tools," in Proceedings of the 6th International Conference on Services Oriented Computing, 2008, pp.708-721.
  2. H. Elmeleegy, A. Ivan, R. Akkiraju, and R. Goodwin, "MashupAdvisor: A recommendation tool for mashup development," in Proceedings of the IEEE International Conference on Web Services, 2008, pp.337-344.
  3. OWL Services Coalition, "OWL-S: Semantic markup for web services," OWL-S White Paper, 2004.
  4. T. Vitvar, M. Zaremba, M. Moran, M. Zaremba, and D. Fensel, "SESA: Emerging technology for service-centric environment," IEEE Software, Vol.24, No.6, pp.56-67, 2007.
  5. P. Sheth, K. Gomadam, and J. Lathem, "SA-REST: Semantically interoperable and easier-to-use services and mashups," IEEE Internet Computing, Vol.11, No.6, pp.91-94, 2007. https://doi.org/10.1109/MIC.2007.133
  6. A. Hess and N. Kushmerick, "Learning to attach metadata to web services," in Proceedings of the 2nd International Semantic Web Conference, 2003, pp.258-273.
  7. X. Dong, A. Halevy, J. Madhavan, E. Nemes, and J. Zhang, "Similarity search for web services," in Proceedings of the 30th International Conference on Very Large Data Bases, 2004, pp.372-383.
  8. M. Sabou, C. Wroe, C. Goble, and H. Stuckenschmidt, "Learning domain ontologies for semantic web service descriptions," Journal of Web Semantics, Vol.3, No.4, pp.340-465, 2005. https://doi.org/10.1016/j.websem.2005.09.008
  9. M. Paolucci, T. Kawamura, T. R. Payne, and K. Sycara, "Semantic matching of web services capabilities," in Proceedings of the First International Semantic Web Conference on the Semantic Web, 2002, pp.333-347.
  10. K. Kona, A. Bansal, M. Blake, and G. Gupta, "Generalized semantics-based service composition," in Proceedings of the IEEE International Conference on Web Services, 2008, pp.219-227.
  11. P. Rodriguez-Mier, M. Mucientes, and M. Lama, "Automatic web service composition with a heuristic-based search algorithm," in Proceedings of the International Semantic Web Conference, 2011, pp.81-88.
  12. M. Shiaa, J. Fladmark, and B. Thiell, "An incremental graph-based approach to automatic service composition," in Proceedings of the International Semantic Web Conference, 2008, pp.397-404.
  13. Y. J. Lee and J. H. Kim, "Semantically enabled data mashups using ontology learning method for Web API," in Proceedings of the 2012 Computing, Communications and Applications Conference, 2012, pp.304-309.
  14. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proceedings of the 1993 ACM SIGMOD International Conference Management of Data, 1993, pp.207-216.
  15. R. Agrawal and R. Srikant, "Fast algorithm for mining associations rules," in Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp.487-499.
  16. L. Kaufman and P. J. Rousseeuw, Finding Group in Data: An Introduction to Cluster Analysis, New York, John Wiley & Sons, 1990.
  17. S. Mokarizadeh, P. Küngas, and M. Matskin, "Ontology learning for cost-effective large-scale semantic annotation of web service interfaces," in Proceedings of the 17th International Conference on Knowledge Engineering and Management by the Masses, 2010, pp.401-410.
  18. G. Salton and C. Buckley, "Term weighting approaches in automatic text retrieval," Information Processing and Management, Vol.24, No.4, pp.513-523, 1988. https://doi.org/10.1016/0306-4573(88)90021-0
  19. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms (Second Edition), MIT Press, 2001.

Cited by

  1. 10.9717/kmms.2014.17.4.535 vol.1, 2015, https://doi.org/10.9717/kmms.2014.17.4.535